SearcharxivSearch

arXiv subjects

Haodong Liu

Publications and source records attributed to Haodong Liu.

17 recordsLinked to original sources

DUD: Decoupled Update Dynamics for Reliable Uncertainty Quantification in Large Language Models

Accurate Uncertainty Quantification (UQ) is critical for reliable deployment of Large Language Models (LLMs), yet traditional probability-based metrics often fail to capture the model's true epistemic state. While recent mechanistic approaches leverage hidden state dynamics, they typically aggregate residual stream updates, conflating the distinct roles of parametric memory (Feed-Forward Networks) and contextual processing (Attention). We argue that this aggregation obscures fine-grained mechanistic conflicts, such as memory-context misalignment, that are fundamental indicators of uncertainty. To address this, we introduce \textbf{D}ecoupled \textbf{U}pdate \textbf{D}ynamics \textbf{(DUD)}, a framework that explicitly decouples FFN and Attention contributions via noise-induced causal interventions. By quantifying the independent restoration capabilities of each module, we construct a dual-stream dynamic profile that captures the model's internal fragility. Extensive experiments demonstrate that DUD significantly outperforms state-of-the-art baselines in both uncertainty estimation and calibration, while exhibiting superior cross-dataset generalization, validating decoupled dynamics as a robust proxy for model faithfulness.

cs.CL

Strong-field ionization of atoms with bright squeezed vacuum light

Strong-field ionization is the cornerstone of attosecond physics, which has been extensively studied under coherent-state driving. Recently, the interface between attosecond physics and quantum optics has emerged as a new frontier. Yet, owing to experimental limitations, the role of the quantum nature of light in atomic strong-field ionization has remained unexplored. Here, we demonstrate strong-field ionization of xenon atoms driven by bright squeezed vacuum (BSV) with average pulse energy up to 10 \textmu J. We show that, as a nonclassical state with zero mean field and strong intensity fluctuations, BSV selectively enhances the spider-like holographic structures in the photoelectron momentum distributions. Using a quantum-light-corrected quantum-trajectory Monte Carlo (q-QTMC) model, we attribute this effect to the intrinsic coherence of trajectory pairs emitted within the same subcycle field fluctuation. These dynamically correlated paths exhibit enhanced phase stability and remain robust against dephasing, whereas asynchronous paths are filtered out by field noise. Our results reveal a quantum-fluctuation-induced mechanism for coherence protection in strong-field processes, positioning BSV as an effective coherence filter and establishing a new regime of quantum-enabled noise-resilient ultrafast dynamics.

physics.atom-ph

Attosecond quantum spectroscopy with entangled photon pairs

Bright squeezed light from parametric down-conversion in the infrared (IR) frequency range has triggered the emergence of attosecond quantum optics -- a new research field at the interface of quantum optics, strong-field physics, and attosecond technology. Two challenges arise at this interface: transferring quantum features of the IR light sources to the ultraviolet (UV) and extreme ultraviolet (XUV) frequency range via strong-field nonlinearities, and exploiting quantum optical properties of the nonlinear optical response as a new probe in ultrafast dynamics. Here, we address both by driving high-harmonic generation (HHG) in solids with entangled photon pairs either in degenerate or non-degenerate frequency modes. In the degenerate mode, single-shot measurements of harmonics up to the 10th order reveal strong photon bunching whose $g^{(2)}$ first grows and then decreases with the harmonic order. We show that this behavior tracks different microscopic mechanisms responsible for harmonic emission, demonstrating the potential of attosecond quantum optical spectroscopy. In the non-degenerate case, the harmonics retain quantum-induced correlations, verified by wavelength-resolved second-order cross-correlation maps. Our findings demonstrate transfer of quantum photon correlations into the XUV domain and open a pathway toward quantum-enhanced attosecond spectroscopy and control of ultrafast dynamics in solids.

physics.optics

AIDABench: AI Data Analytics Benchmark

As AI-driven document understanding and processing tools become increasingly prevalent in real-world applications, the need for rigorous evaluation standards has grown increasingly urgent. Existing benchmarks and evaluations often focus on isolated capabilities or simplified scenarios, failing to capture the end-to-end task effectiveness required in practical settings. To address this gap, we introduce AIDABench, a comprehensive benchmark for evaluating AI systems on complex data analytics tasks in an end-to-end manner. AIDABench encompasses 600+ diverse document analysis tasks across three core capability dimensions: question answering, data visualization, and file generation. These tasks are grounded in realistic scenarios involving heterogeneous data types, including spreadsheets, databases, financial reports, and operational records, and reflect analytical demands across diverse industries and job functions. Notably, the tasks in AIDABench are sufficiently challenging that even human experts require 1-2 hours per question when assisted by AI tools, underscoring the benchmark's difficulty and real-world complexity. We evaluate 11 state-of-the-art models on AIDABench, spanning both proprietary (e.g., Claude Sonnet 4.5, Gemini 3 Pro Preview) and open-source (e.g., Qwen3-Max-2026-01-23-Thinking) families. Our results reveal that complex, real-world data analytics tasks remain a significant challenge for current AI systems, with the best-performing model achieving only 59.43% pass-at-1. We provide a detailed analysis of failure modes across each capability dimension and identify key challenges for future research. AIDABench offers a principled reference for enterprise procurement, tool selection, and model optimization, and is publicly available at https://github.com/MichaelYang-lyx/AIDABench.

cs.AI

Exploring Semantic-constrained Adversarial Example with Instruction Uncertainty Reduction

Recently, semantically constrained adversarial examples (SemanticAE), which are directly generated from natural language instructions, have become a promising avenue for future research due to their flexible attacking forms. To generate SemanticAEs, current methods fall short of satisfactory attacking ability as the key underlying factors of semantic uncertainty in human instructions, such as referring diversity, descriptive incompleteness, and boundary ambiguity, have not been fully investigated. To tackle the issues, this paper develops a multi-dimensional instruction uncertainty reduction (InSUR) framework to generate more satisfactory SemanticAE, i.e., transferable, adaptive, and effective. Specifically, in the dimension of the sampling method, we propose the residual-driven attacking direction stabilization to alleviate the unstable adversarial optimization caused by the diversity of language references. By coarsely predicting the language-guided sampling process, the optimization process will be stabilized by the designed ResAdv-DDIM sampler, therefore releasing the transferable and robust adversarial capability of multi-step diffusion models. In task modeling, we propose the context-encoded attacking scenario constraint to supplement the missing knowledge from incomplete human instructions. Guidance masking and renderer integration are proposed to regulate the constraints of 2D/3D SemanticAE, activating stronger scenario-adapted attacks. Moreover, in the dimension of generator evaluation, we propose the semantic-abstracted attacking evaluation enhancement by clarifying the evaluation boundary, facilitating the development of more effective SemanticAE generators. Extensive experiments demonstrate the superiority of the transfer attack performance of InSUR. Moreover, we realize the reference-free generation of semantically constrained 3D adversarial examples for the first time.

cs.AI

From Reasoning LLMs to BERT: A Two-Stage Distillation Framework for Search Relevance

Query-service relevance prediction in e-commerce search systems faces strict latency requirements that prevent the direct application of Large Language Models (LLMs). To bridge this gap, we propose a two-stage reasoning distillation framework to transfer reasoning capabilities from a powerful teacher LLM to a lightweight, deployment-friendly student model. In the first stage, we address the limitations of general-purpose LLMs by constructing a domain-adapted teacher model. This is achieved through a three-step process: domain-adaptive pre-training to inject platform knowledge, supervised fine-tuning to elicit reasoning skills, and preference optimization with a multi-dimensional reward model to ensure the generation of reliable and preference-aligned reasoning paths. This teacher can then automatically annotate massive query-service pairs from search logs with both relevance labels and reasoning chains. In the second stage, to address the challenges of architectural heterogeneity in standard distillation, we introduce Contrastive Reasoning Self-Distillation (CRSD). By modeling the behavior of the same student model under ``standard'' and ``reasoning-augmented'' inputs as a teacher-student relationship, CRSD enables the lightweight model to internalize the teacher's complex decision-making mechanisms without needing the explicit reasoning path at inference. Offline evaluations and online A/B testing in the Meituan search advertising system demonstrate that our framework achieves significant improvements across multiple metrics, validating its effectiveness and practical value.

cs.IR

MoPE: Mixture of Prefix Experts for Zero-Shot Dialogue State Tracking

Zero-shot dialogue state tracking (DST) transfers knowledge to unseen domains, reducing the cost of annotating new datasets. Previous zero-shot DST models mainly suffer from domain transferring and partial prediction problems. To address these challenges, we propose Mixture of Prefix Experts (MoPE) to establish connections between similar slots in different domains, which strengthens the model transfer performance in unseen domains. Empirical results demonstrate that MoPE-DST achieves the joint goal accuracy of 57.13% on MultiWOZ2.1 and 55.40% on SGD.

cs.CL

DiffusionDialog: A Diffusion Model for Diverse Dialog Generation with Latent Space

In real-life conversations, the content is diverse, and there exists the one-to-many problem that requires diverse generation. Previous studies attempted to introduce discrete or Gaussian-based continuous latent variables to address the one-to-many problem, but the diversity is limited. Recently, diffusion models have made breakthroughs in computer vision, and some attempts have been made in natural language processing. In this paper, we propose DiffusionDialog, a novel approach to enhance the diversity of dialogue generation with the help of diffusion model. In our approach, we introduce continuous latent variables into the diffusion model. The problem of using latent variables in the dialog task is how to build both an effective prior of the latent space and an inferring process to obtain the proper latent given the context. By combining the encoder and latent-based diffusion model, we encode the response's latent representation in a continuous space as the prior, instead of fixed Gaussian distribution or simply discrete ones. We then infer the latent by denoising step by step with the diffusion model. The experimental results show that our model greatly enhances the diversity of dialog responses while maintaining coherence. Furthermore, in further analysis, we find that our diffusion model achieves high inference efficiency, which is the main challenge of applying diffusion models in natural language processing.

cs.CL

RGBD1K: A Large-scale Dataset and Benchmark for RGB-D Object Tracking

RGB-D object tracking has attracted considerable attention recently, achieving promising performance thanks to the symbiosis between visual and depth channels. However, given a limited amount of annotated RGB-D tracking data, most state-of-the-art RGB-D trackers are simple extensions of high-performance RGB-only trackers, without fully exploiting the underlying potential of the depth channel in the offline training stage. To address the dataset deficiency issue, a new RGB-D dataset named RGBD1K is released in this paper. The RGBD1K contains 1,050 sequences with about 2.5M frames in total. To demonstrate the benefits of training on a larger RGB-D data set in general, and RGBD1K in particular, we develop a transformer-based RGB-D tracker, named SPT, as a baseline for future visual object tracking studies using the new dataset. The results, of extensive experiments using the SPT tracker emonstrate the potential of the RGBD1K dataset to improve the performance of RGB-D tracking, inspiring future developments of effective tracker designs. The dataset and codes will be available on the project homepage: https://github.com/xuefeng-zhu5/RGBD1K.

cs.CV

NeuSE: A Neural Snapshot Ensemble Method for Collaborative Filtering

In collaborative filtering (CF) algorithms, the optimal models are usually learned by globally minimizing the empirical risks averaged over all the observed data. However, the global models are often obtained via a performance tradeoff among users/items, i.e., not all users/items are perfectly fitted by the global models due to the hard non-convex optimization problems in CF algorithms. Ensemble learning can address this issue by learning multiple diverse models but usually suffer from efficiency issue on large datasets or complex algorithms. In this paper, we keep the intermediate models obtained during global model learning as the snapshot models, and then adaptively combine the snapshot models for individual user-item pairs using a memory network-based method. Empirical studies on three real-world datasets show that the proposed method can extensively and significantly improve the accuracy (up to 15.9% relatively) when applied to a variety of existing collaborative filtering methods.

cs.LG

A Degree Condition for Graphs Having All $(a,b)$-Parity Factors

Let $a$ and $b$ be positive integers such that $a\leq b$ and $a\equiv b\pmod 2$. We say that $G$ has all $(a, b)$-parity factors if $G$ has an $h$-factor for every function $h: V(G) \rightarrow \{a,a+2,\ldots,b-2,b\}$ with $b|V(G)|$ even and $h(v)\equiv b\pmod 2$ for all $v\in V(G)$. In this paper, we prove that every graph $G$ with $n\geq 3(b+1)(a+b)$ vertices has all $(a,b)$-parity factors if $δ(G)\geq (b^2-b)/a$, and for any two nonadjacent vertices $u,v \in V(G)$, $\max\{d_G(u),d_G(v)\}\geq \frac{bn}{a+b}$. Moreover, we show that this result is best possible in some sense.

math.CO

Solvability of one kind of forward-backward stochastic difference equations

In this paper, we study the solvability problem for one kind of fully coupled forward-backward stochastic difference equations (FBSΔEs). With the help of the necessary and sufficient condition for the solvability of the linear FBSΔEs, under the monotone assumption, we obtain the existence and uniqueness theorem for the general nonlinear ones.

math.PR

Solvability of finite state forward-backward stochastic difference equations

In this paper, we consider the solvability problems for the fully coupled forward-backward stochastic difference equations (FBSΔEs) on spaces related to discrete time, finite state processes. On one hand, we provide the necessary and sufficient condition for the solvability of the linear FBSΔEs. On the other hand, under the assumption that the coefficients satisfy the monotone condition, we investigate the existence and uniqueness theorems for the general nonlinear FBSΔEs.

math.PR

Maximum principle for stochastic optimal control problem of finite state forward-backward stochastic difference systems

In this paper, we study the maximum principle for stochastic optimal control problems of forward-backward stochastic difference systems (FBSΔSs) where the uncertainty is modeled by a discrete time, finite state process, rather than white noises. Two types of FBSΔSs are investigated. The first one is described by a partially coupled forward-backward stochastic difference equation (FBSΔE) and the second one is described by a fully coupled FBSΔE. By adopting an appropriate representation of the product rule and an appropriate formulation of the backward stochastic difference equation (BSΔE), we deduce the adjoint difference equation. Finally, the maximum principle for this optimal control problem with the control domain being convex is established.

math.OC

Maximum principle for stochastic optimal control problem of forward-backward stochastic difference systems

In this paper, we study the maximum principle for stochastic optimal control problems of forward-backward stochastic difference systems (FBSΔSs). Two types of FBSΔSs are investigated. The first one is described by a partially coupled forward-backward stochastic difference equation (FBSΔE) and the second one is described by a fully coupled FBSΔE. By adopting an appropriate representation of the product rule and an appropriate formulation of the backward stochastic difference equation (BSΔE), we deduce the adjoint difference equation. Finally, the maximum principle for this optimal control problem with the control domain being convex is established.

math.OC

A Degree Condition for a Graph to have $(a,b)$-Parity Factors

Let $a,b,n$ be three positive integers such that $a\equiv b\pmod 2$ and $n\geq b(a+b)(a+b+2)/(2a)$. Let $G$ be a graph of order $n$ with minimum degree at least $a+b/a-1$. We show that $G$ has an $(a,b)$-parity factor, if $max\{d_G(u),d_G(v)\}\geq \frac{an}{a+b}$ for any two nonadjacent vertices $u,v$ of $G$. It is an extension of Nishimura's results for the existence of $k$-factors (\emph{J. Graph Theory}, \textbf{16} (1992), 141--151) and generalizes Li and Cai's result in some senses (\emph{J. Graph Theory}, \textbf{27} (1998), 1--6). These conditions are tight.

math.CO