Searcharxiv⌕ Search

arXiv subjects

Boyu Liu

Publications and source records attributed to Boyu Liu.

At least 19 recordsLinked to original sources
arXiv2026

Towards Verifiable Agentic Data Science: Solving Irregular TSQA Via Tool-Grounded Reasoning

Time series data in real-world deployments is overwhelmingly irregular. Observations are asynchronous, missing values are informative rather than random, and sampling frequencies vary across sensors and operational windows. However, existing Time Series Question Answering (TSQA) benchmarks mostly assume regularly sampled inputs, leaving a fundamental gap in understanding how large language models (LLMs) and AI agents perform under irregular conditions. To bridge this gap, we introduce IRTS-ToolBench, a benchmark of 1,700 questions spanning 10 task types across 13 domains. IRTS-ToolBench is designed to be used independently by any researcher working on LLM-based irregular time series analysis, providing standardized inputs and a reproducible evaluation protocol. Code can be found in https://github.com/SanhornC/IRTS-ToolBench.

cs.AI↗
arXiv2026

FAIR-Calib: Frontier-Aware Instability-Reweighted Calibration for Post-Training Quantization of Diffusion Large Language Models

Diffusion Large Language Models (dLLMs) refine tokens iteratively but commit them irreversibly, leading to a "stability lag" where early decisions remain fragile even after being written. We reveal that Post-Training Quantization (PTQ) error easily flips these borderline decisions at the write frontier, which are then permanently locked in and amplified. To address this, we propose Frontier-Aware Instability-Reweighted Calibration (FAIR-Calib), a two-stage PTQ framework for dLLMs. Stage I probes a full-precision teacher to estimate a position prior that combines frontier hits and masked-stage reliability. Stage II performs off-policy, layer-wise calibration by minimizing a reweighted hidden-state MSE, effectively prioritizing the protection of fragile frontier states without requiring expensive end-to-end diffusion rollouts. We further theoretically justify our weighted objective as a surrogate for output KL divergence. Empirically, FAIR-Calib consistently outperforms state-of-the-art baselines on LLaDA and Dream (W4A4), significantly reducing frontier decision flips and suppressing post-commit mismatches across diverse benchmarks.

cs.LG↗
arXiv2026

VMU-Diff: A Coarse-to-fine Multi-source Data Fusion Framework for Precipitation Nowcasting

Precipitation nowcasting is a vital spatio-temporal prediction task for meteorological applications but faces challenges due to the chaotic property of precipitation systems. Existing methods predominantly rely on single-source radar data to build either deterministic or probabilistic models for extrapolation. However, the single deterministic model suffers from blurring due to MSE convergence. The single probabilistic model, typically represented by diffusion models, can generate fine details but suffers from spurious artifacts that compromise accuracy and computational inefficiency. To address these challenges, this paper proposes a novel coarse-to-fine Vision Mamba Unet and residual Diffusion (VMU-Diff) based precipitation nowcasting framework. It realizes precipitation nowcasting through a two-stage process, i.e., a deterministic model-based coarse stage to predict global motion trends and a probabilistic model-based fine stage to generate fine prediction details. In the coarse prediction stage, rather than single-source radar data, both radar and multi-band satellite data are taken as input. A spatial-temporal attention block and several Vision mamba state-space blocks realize multi-source data fusion, and predict the future echo global dynamics. The fine-grained stage is realized by a spatio-temporal refine generator based on residual conditional diffusion models. It first obtains spatio-temporal residual features based on coarse prediction and ground truth, and further reconstructs the residual via conditional Mamba state-space module. Experiments on Jiangsu SWAN datasets demonstrate the improvements of our method over state-of-the-art methods, particularly in short-term forecasts.

cs.CV↗
arXiv2026

MambaRain: Multi-Scale Mamba-Attention Framework for 0-3 Hour Precipitation Nowcasting

Accurate precipitation nowcasting over extended horizons (0-3 hours) is essential for disaster mitigation and operational decision-making, yet remains a critical challenge in the field. Existing deterministic approaches are predominantly constrained to shorter prediction windows (0-2 hours), exhibiting severe performance degradation beyond 90 minutes owing to their inherent difficulty in capturing long-range spatiotemporal dependencies from radar-derived observations. To address these fundamental limitations, we propose MambaRain, a novel multi-scale encoder-decoder architecture that synergistically integrates Mamba's linear-complexity long-range temporal modeling with self-attention mechanisms for explicit spatial correlation capture. The core innovation lies in a hybrid design paradigm wherein Mamba blocks leverage selective state space mechanisms to model global temporal dynamics across extended sequences with computational efficiency, while self-attention modules explicitly characterize spatial correlations within precipitation fields - a capability inherently absent in Mamba's sequential processing paradigm. This complementary synergy enables comprehensive spatiotemporal representation learning, effectively extending the viable forecasting horizon to 2-3 hours with substantial accuracy improvements. Furthermore, we introduce a spectral loss formulation to mitigate blurring artifacts characteristic of chaotic precipitation systems, thereby preserving fine-scale motion details critical for nowcasting accuracy. Experimental validation demonstrates that MambaRain substantially outperforms existing deterministic methodologies in 0-3 hour nowcasting tasks, with particularly pronounced performance gains in the challenging 2-3 hour prediction range.

cs.CV↗
arXiv2026

SURGE: Surrogate Gradient Adaptation in Binary Neural Networks

The training of Binary Neural Networks (BNNs) is fundamentally based on gradient approximation for non-differentiable binarization operations (e.g., sign function). However, prevailing methods including the Straight-Through Estimator (STE) and its improved variants, rely on hand-crafted designs that suffer from gradient mismatch problem and information loss induced by fixed-range gradient clipping. To address this, we propose SURrogate GradiEnt Adaptation (SURGE), a novel learnable gradient compensation framework with theoretical grounding. SURGE mitigates gradient mismatch through auxiliary backpropagation. Specifically, we design a Dual-Path Gradient Compensator (DPGC) that constructs a parallel full-precision auxiliary branch for each binarized layer, decoupling gradient flow via output decomposition during backpropagation. DPGC enables bias-reduced gradient estimation by leveraging the full-precision branch to estimate components beyond STE's first-order approximation. To further enhance training stability, we introduce an Adaptive Gradient Scaler (AGS) based on an optimal scale factor to dynamically balance inter-branch gradient contributions via norm-based scaling. Experiments on image classification, object detection, and language understanding tasks demonstrate that SURGE performs best over state-of-the-art methods.

cs.LG↗
arXiv2026

Private Private Information in Second-Price Auction

Classic results show that even an arbitrarily small correlation across bidders' information can enable full surplus extraction in auctions and related mechanism design settings. Motivated by this fragility, we study the information independence in a second-price auction when the seller commits to a private private information structure, meaning bidders' signals are independent ex ante, while bidders share a symmetric and arbitrarily correlated prior distribution over their valuations. We first show that the seller optimal efficient outcome with full surplus extraction can always be implemented by a private private information structure that admits a Bayes Nash equilibrium. However, this equilibrium may not be stable. We then further construct a private private information structure that achieves revenue arbitrarily close to maximum welfare while admitting a strict equilibrium. At the same time, we establish an impossibility result: under private private information, in general, bidder surplus cannot achieve maximal welfare exactly, and we characterize necessary and sufficient conditions on the prior distribution under which bidder surplus can be made arbitrarily close to maximal welfare. We finally explore which other efficient outcomes are achievable under private private information.

econ.TH↗
arXiv2026

Motion Manipulation via Unsupervised Keypoint Positioning in Face Animation

Face animation deals with controlling and generating facial features with a wide range of applications. The methods based on unsupervised keypoint positioning can produce realistic and detailed virtual portraits. However, they cannot achieve controllable face generation since the existing keypoint decomposition pipelines fail to fully decouple identity semantics and intertwined motion information (e.g., rotation, translation, and expression). To address these issues, we present a new method, Motion Manipulation via unsupervised keypoint positioning in Face Animation (MMFA). We first introduce self-supervised representation learning to encode and decode expressions in the latent feature space and decouple them from other motion information. Secondly, we propose a new way to compute keypoints aiming to achieve arbitrary motion control. Moreover, we design a variational autoencoder to map expression features to a continuous Gaussian distribution, allowing us for the first time to interpolate facial expressions in an unsupervised framework. We have conducted extensive experiments on publicly available datasets to validate the effectiveness of MMFA, which show that MMFA offers pronounced advantages over prior arts in creating realistic animation and manipulating face motion.

cs.CV↗
arXiv2026

TSAQA: Time Series Analysis Question And Answering Benchmark

Time series data are integral to critical applications across domains such as finance, healthcare, transportation, and environmental science. While recent work has begun to explore multi-task time series question answering (QA), current benchmarks remain limited to forecasting and anomaly detection tasks. We introduce TSAQA, a novel unified benchmark designed to broaden task coverage and evaluate diverse temporal analysis capabilities. TSAQA integrates six diverse tasks under a single framework ranging from conventional analysis, including anomaly detection and classification, to advanced analysis, such as characterization, comparison, data transformation, and temporal relationship analysis. Spanning 210k samples across 13 domains, the dataset employs diverse formats, including true-or-false (TF), multiple-choice (MC), and a novel puzzling (PZ), to comprehensively assess time series analysis. Zero-shot evaluation demonstrates that these tasks are challenging for current Large Language Models (LLMs): the best-performing commercial LLM, Gemini-2.5-Flash, achieves an average score of only 65.08. Although instruction tuning boosts open-source performance: the best-performing open-source model, LLaMA-3.1-8B, shows significant room for improvement, highlighting the complexity of temporal analysis for LLMs.

cs.AI↗
arXiv2025

Psyzkaller: Learning from Historical and On-the-Fly Execution Data for Smarter Seed Generation in OS kernel Fuzzing

OS Kernel fuzzers such as Syzkaller often struggle to generate syscall sequences that respect intrinsic Syscall Dependency Relations (SDRs), resulting in seeds that either violate kernel constraints or fail to reach deep execution paths. We propose leveraging an N-gram model to learn SDRs from both kernel execution history and ongoing fuzzing results. This enables the fuzzer to capture dependencies in similar kernel versions while adapting to target-specific behaviors, thereby improving the validity of generated seeds. Additionally, we introduce a bidirectional Random Walk strategy to enhance the diversity of generated seeds. We implement this approach in a prototype, Psyzkaller, on top of Syzkaller. Experiments show that, trained with the large-scale DongTing dataset and continuously updated with ongoing fuzzing results, Psyzkaller improves Syzkaller's code coverage by 4.6%-7.0%, triggers 110.4%-187.2% more crashes, and discovers eight previously unknown kernel vulnerabilities. Furthermore, Psyzkaller outperforms state-of-the-art fuzzers such as ACTOR and SyzDescribe in both coverage and crashes.

cs.CR↗
arXiv2025

Multiferroic VHfO$_4$ with Strain-Tunable Magnetism

The coexistence of ferroelectricity and magnetism in a single-phase oxide is rare because the electronic requirements for these two orders are often incompatible. Here, using first-principles calculations and parallel-tempering Monte Carlo simulations, we propose stoichiometric VHfO$_4$ as a hafnia-derived multiferroic that overcomes this constraint through ordered cation design rather than dilute magnetic doping. We found that VHfO$_4$ could stabilize in a polar \(Pca2_1\)-like structure with layered V/Hf ordering, remains dynamically stable, and preserves switchable ferroelectricity with a large spontaneous polarization. The ordered V sublattice introduces competing exchange interactions that favor an antiferromagnetic ground state at zero strain. Epitaxial strain further drives transitions into additional phases, including a noncollinear spiral-like state and a predominantly in-plane antiferromagnetic state. We also find that out-of-plane lattice distortions along the polar axis strongly modify the exchange interactions and magnetic phase stability, indicating a strain-mediated pathway for electric-field control of magnetism. These results establish VHfO$_4$ as a promising platform for exploring multiferroicity and magnetoelectric coupling in hafnia-based oxides.

cond-mat.mtrl-sci↗
arXiv2024

Strength of Kitaev Interaction in Na$_3$Co$_2$SbO$_6$ and Na$_3$Ni$_2$BiO$_6$

Kitaev spin liquid is proposed to be promisingly realized in low spin-orbit coupling $3d$ systems, represented by Na$_3$Co$_2$SbO$_6$ and Na$_3$Ni$_2$BiO$_6$. However, the existence of Kitaev interaction is still debatable among experiments, and obtaining the strength of Kitaev interaction from first-principles calculations is also challenging. Here, we report the state-dependent anisotropy of Kitaev interaction, based on which a convenient method is developed to rapidly determine the strength of Kitaev interaction. Applying such method and density functional theory calculations, it is found that Na$_3$Co$_2$SbO$_6$ with $3d^7$ configuration exhibits considerable ferromagnetic Kitaev interaction. Moreover, by further applying the symmetry-adapted cluster expansion method, a realistic spin model is determined for Na$_3$Ni$_2$BiO$_6$ with $3d^8$ configuration. Such model indicates negligible small Kitaev interaction, but it predicts many properties, such as ground states and field effects, which are well consistent with measurements. Furthermore, we demonstrate that the heavy elements, Sb or Bi, located at the hollow sites of honeycomb lattice, do not contribute to emergence of Kitaev interaction through proximity, contradictory to common belief. The presently developed anisotropy method will be beneficial not only for computations but also for measurements.

cond-mat.str-el↗
arXiv2024

Neural Field Classifiers via Target Encoding and Classification Loss

Neural field methods have seen great progress in various long-standing tasks in computer vision and computer graphics, including novel view synthesis and geometry reconstruction. As existing neural field methods try to predict some coordinate-based continuous target values, such as RGB for Neural Radiance Field (NeRF), all of these methods are regression models and are optimized by some regression loss. However, are regression models really better than classification models for neural field methods? In this work, we try to visit this very fundamental but overlooked question for neural fields from a machine learning perspective. We successfully propose a novel Neural Field Classifier (NFC) framework which formulates existing neural field methods as classification tasks rather than regression tasks. The proposed NFC can easily transform arbitrary Neural Field Regressor (NFR) into its classification variant via employing a novel Target Encoding module and optimizing a classification loss. By encoding a continuous regression target into a high-dimensional discrete encoding, we naturally formulate a multi-label classification task. Extensive experiments demonstrate the impressive effectiveness of NFC at the nearly free extra computational costs. Moreover, NFC also shows robustness to sparse inputs, corrupted images, and dynamic scenes.

cs.CV↗
arXiv2023

Chiral magnetism in lithium-decorated monolayer CrTe$_{2}$: Interplay between Dzyaloshinskii-Moriya interaction and higher-order interactions

Chiral magnetic states in two-dimensional (2D) layered noncentrosymmetric magnets, which are promising advanced spintronic materials, are usually attributed to Dzyaloshinskii-Moriya interactions (DMI). However, the role of underlying higher-order spin couplings in determining the properties of chiral spin textures has much less reported. In this work, taking the lithium-decorated monolayer CrTe$_{2}$ (monolayer LiCrTe$_{2}$) as an example, we develop a first-principles-based comprehensive spin model constructed by using the symmetry-adapted cluster expansion method. Based on this spin model, we identify the ground state of monolayer LiCrTe$_{2}$ as a chiral spin spiral state, which can further assemble macroscopic chiral labyrinth domains (LD) under zero-field conditions as well as evolve into skyrmions under a finite magnetic field. Moreover, higher-order biquadratic and three-site interactions are identified to be responsible for modulating both the size and the field stability of the spin spiral state. Our study sheds light on complex magnetic couplings in 2D magnets.

cond-mat.mtrl-sci↗
arXiv2023

MFMAN-YOLO: A Method for Detecting Pole-like Obstacles in Complex Environment

In real-world traffic, there are various uncertainties and complexities in road and weather conditions. To solve the problem that the feature information of pole-like obstacles in complex environments is easily lost, resulting in low detection accuracy and low real-time performance, a multi-scale hybrid attention mechanism detection algorithm is proposed in this paper. First, the optimal transport function Monge-Kantorovich (MK) is incorporated not only to solve the problem of overlapping multiple prediction frames with optimal matching but also the MK function can be regularized to prevent model over-fitting; then, the features at different scales are up-sampled separately according to the optimized efficient multi-scale feature pyramid. Finally, the extraction of multi-scale feature space channel information is enhanced in complex environments based on the hybrid attention mechanism, which suppresses the irrelevant complex environment background information and focuses the feature information of pole-like obstacles. Meanwhile, this paper conducts real road test experiments in a variety of complex environments. The experimental results show that the detection precision, recall, and average precision of the method are 94.7%, 93.1%, and 97.4%, respectively, and the detection frame rate is 400 f/s. This research method can detect pole-like obstacles in a complex road environment in real time and accurately, which further promotes innovation and progress in the field of automatic driving.

cs.CV↗
arXiv2023

Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration

Submodular function maximization is a critical building block for diverse tasks, such as document summarization, sensor placement, and image segmentation. Yet its practical utility is often limit by the $O(knd^2)$ computational bottleneck. In this paper, we propose an integrated framework that addresses efficiency and privacy simultaneously. First, we introduce a novel matrix-based computation paradigm that accelerates function evaluations. Second, we develop approximate data structures that further streamline the optimization process, achieving a theoretical complexity of $O(\epsilon^{-2}(nd+kn+kd^2)\log(k/\delta))$. Third, we integrate ($\epsilon, \delta$)-DP guaranties to address the privacy concerns inherent in sensitive optimization tasks.

cs.LG↗
arXiv2023

Face Animation with an Attribute-Guided Diffusion Model

Face animation has achieved much progress in computer vision. However, prevailing GAN-based methods suffer from unnatural distortions and artifacts due to sophisticated motion deformation. In this paper, we propose a Face Animation framework with an attribute-guided Diffusion Model (FADM), which is the first work to exploit the superior modeling capacity of diffusion models for photo-realistic talking-head generation. To mitigate the uncontrollable synthesis effect of the diffusion model, we design an Attribute-Guided Conditioning Network (AGCN) to adaptively combine the coarse animation features and 3D face reconstruction results, which can incorporate appearance and motion conditions into the diffusion process. These specific designs help FADM rectify unnatural artifacts and distortions, and also enrich high-fidelity facial details through iterative diffusion refinements with accurate animation attributes. FADM can flexibly and effectively improve existing animation videos. Extensive experiments on widely used talking-head benchmarks validate the effectiveness of FADM over prior arts.

cs.CV↗
arXiv2023

Cybersecurity Challenges of Power Transformers

The rise of cyber threats on critical infrastructure and its potential for devastating consequences, has significantly increased. The dependency of new power grid technology on information, data analytic and communication systems make the entire electricity network vulnerable to cyber threats. Power transformers play a critical role within the power grid and are now commonly enhanced through factory add-ons or intelligent monitoring systems added later to improve the condition monitoring of critical and long lead time assets such as transformers. However, the increased connectivity of those power transformers opens the door to more cyber attacks. Therefore, the need to detect and prevent cyber threats is becoming critical. The first step towards that would be a deeper understanding of the potential cyber-attacks landscape against power transformers. Much of the existing literature pays attention to smart equipment within electricity distribution networks, and most methods proposed are based on model-based detection algorithms. Moreover, only a few of these works address the security vulnerabilities of power elements, especially transformers within the transmission network. To the best of our knowledge, there is no study in the literature that systematically investigate the cybersecurity challenges against the newly emerged smart transformers. This paper addresses this shortcoming by exploring the vulnerabilities and the attack vectors of power transformers within electricity networks, the possible attack scenarios and the risks associated with these attacks.

cs.CR↗
arXiv2022

Realistic Spin Model for Multiferroic NiI$_2$

A realistic first-principle-based spin Hamiltonian is constructed for the type-II multiferroic NiI$_2$, using a symmetry-adapted cluster expansion method. Besides single ion anisotropy and isotropic Heisenberg terms, this model further includes the Kitaev interaction and a biquadratic term, and can well reproduce striking features of the experimental helical ground state, that are, {\it e.g.}, a proper screw state, canting of rotation plane, propagation direction and period. Using this model to build a phase diagram, it is demonstrated that, (i) the in-plane propagation direction of $\langle1\bar10\rangle$ is determined by the Kitaev interaction, instead of the long-believed exchange frustrations; and (ii) the canting of rotation plane is also dominantly determined by Kitaev interaction, rather than interlayer couplings. Furthermore, additional Monte Carlo simulations reveal three equivalent domains and different topological defects. Since the ferroelectricity is induced by spins in type-II multiferroics, our work also implies that Kitaev interaction is closely related to the multiferroicity of NiI$_2$.

cond-mat.str-el↗