arXiv subjects

Yue Xu

Publications and source records attributed to Yue Xu.

At least 37 records · Page 2Linked to original sources

arXiv2026

Polylogarithmic Bounds for Nested Cycles without Geometric Crossings

A problem of Erdős asks for extremal conditions forcing edge-disjoint cycles with a prescribed nested structure. In the geometric version, the nesting is required to be noncrossing with respect to the cyclic orders. Fernández, Kim, Kim and Liu proved that constant average degree forces two such cycles. We prove a polylogarithmic bound for the natural multi-layer version: for every fixed $k\ge 3$, every sufficiently large $n$-vertex graph with at least \[ C_k n(\log n)^{k-1}(\log\log n)^{k-3} \] edges contains $k$ pairwise edge-disjoint nested cycles without geometric crossings. The proof combines the robust sublinear expander framework of Alon, Bucić, Sauermann, Zakharov and Zamir with a controlled wrapping lemma that permits the layers to be built successively with controlled length.

math.CO↗

arXiv2026

EVA: Editing for Versatile Alignment against Jailbreaks

Large Language Models (LLMs) and Vision Language Models (VLMs) have demonstrated impressive capabilities but remain vulnerable to jailbreaking attacks, where adversaries exploit textual or visual triggers to bypass safety guardrails. Recent defenses typically rely on safety fine-tuning or external filters to reduce the model's likelihood of producing harmful content. While effective to some extent, these methods often incur significant computational overheads and suffer from the safety utility trade-off, degrading the model's performance on benign tasks. To address these challenges, we propose EVA (Editing for Versatile Alignment against Jailbreaks), a novel framework that pioneers the application of direct model editing for safety alignment. EVA reframes safety alignment as a precise knowledge correction task. Instead of retraining massive parameters, EVA identifies and surgically edits specific neurons responsible for the model's susceptibility to harmful instructions, while leaving the vast majority of the model unchanged. By localizing the updates, EVA effectively neutralizes harmful behaviors without compromising the model's general reasoning capabilities. Extensive experiments demonstrate that EVA outperforms baselines in mitigating jailbreaks across both LLMs and VLMs, offering a precise and efficient solution for post-deployment safety alignment.

cs.CR↗

arXiv2026

SEAR: Schema-Based Evaluation and Routing for LLM Gateways

Evaluating production LLM responses and routing requests across providers in LLM gateways requires fine-grained quality signals and operationally grounded decisions. To address this gap, we present SEAR, a schema-based evaluation and routing system for multi-model, multi-provider LLM gateways. SEAR defines an extensible relational schema covering both LLM evaluation signals (context, intent, response characteristics, issue attribution, and quality scores) and gateway operational metrics (latency, cost, throughput), with cross-table consistency links across around one hundred typed, SQL-queryable columns. To populate the evaluation signals reliably, SEAR proposes self-contained signal instructions, in-schema reasoning, and multi-stage generation that produces database-ready structured outputs. Because signals are derived through LLM reasoning rather than shallow classifiers, SEAR captures complex request semantics, enables human-interpretable routing explanations, and unifies evaluation and routing in a single query layer. Across thousands of production sessions, SEAR achieves strong signal accuracy on human-labeled data and supports practical routing decisions, including large cost reductions with comparable quality.

cs.DB↗

arXiv2026

Toward Personalized LLM-Powered Agents: Foundations, Evaluation, and Future Directions

Large language models have enabled agentic systems that reason, plan, and interact with tools and environments to accomplish complex tasks. As these agents operate over extended interaction horizons, their effectiveness increasingly depends on adapting behavior to individual users and maintaining continuity across interactions, giving rise to personalized LLM-powered agents (PLAs). In such long-term, user-dependent settings, personalization permeates the entire decision pipeline rather than remaining confined to surface-level response generation. This survey provides a capability-oriented review of personalized LLM-powered agents. Existing work is organized around four interdependent capabilities: profile modeling, memory, planning, and action execution. Using this taxonomy, representative methods are synthesized and analyzed to illustrate how user signals are represented, propagated, and utilized across the agent pipeline, highlighting cross-component interactions and recurring design challenges. Evaluation metrics and benchmarking paradigms tailored to personalized agents are further examined, along with application scenarios ranging from conversational assistants to domain-specific expert systems. By clarifying the design space of personalization in agent systems, this survey provides a structured foundation for developing more user-aligned, adaptive, and deployable LLM-powered agents.

cs.AI↗

arXiv2026

Adapter-Augmented Bandits for Online Multi-Constrained Multi-Modal Inference Scheduling

Multi-modal large language model (MLLM) inference scheduling enables strong response quality under practical and heterogeneous budgets, beyond what a homogeneous single-backend setting can offer. Yet online MLLM task scheduling is nontrivial, as requests vary sharply in modality composition and latent reasoning difficulty, while execution backends incur distinct, time-varying costs due to system jitter and network variation. These coupled uncertainties pose two core challenges: deriving semantically faithful yet scheduling-relevant multi-modal task representations, and making low-overhead online decisions over irreversible multi-dimensional budgets. Accordingly, we propose \emph{M-CMAB} (\underline{M}ulti-modal \underline{M}ulti-constraint \underline{C}ontextual \underline{M}ulti-\underline{A}rmed \underline{B}andit), a multi-adapter-enhanced MLLM inference scheduling framework with three components: (i) a CLS-attentive, frozen-backbone \emph{Predictor} that extracts compact task representations and updates only lightweight adapters for action-specific estimation; (ii) a primal-dual \emph{Constrainer} that maintains online Lagrange multipliers to enforce long-horizon constraints via per-round objectives; and (iii) a two-phase \emph{Scheduler} that balances exploration and exploitation under irreversible budgets. We establish a regret guarantee under multi-dimensional knapsack constraints. On a composite multimodal benchmark with heterogeneous backends, \emph{M-CMAB} consistently outperforms state-of-the-art baselines across budget regimes, achieving up to 14.18% higher reward and closely tracking an oracle-aided upper bound. Codes are available at https://anonymous.4open.science/r/M2CMAB/.

cs.LG↗

arXiv2026

SusBench: An Online Benchmark for Evaluating Dark Pattern Susceptibility of Computer-Use Agents

As LLM-based computer-use agents (CUAs) begin to autonomously interact with real-world interfaces, understanding their vulnerability to manipulative interface designs becomes increasingly critical. We introduce SusBench, an online benchmark for evaluating the susceptibility of CUAs to UI dark patterns, designs that aim to manipulate or deceive users into taking unintentional actions. Drawing nine common dark pattern types from existing taxonomies, we developed a method for constructing believable dark patterns on real-world consumer websites through code injections, and designed 313 evaluation tasks across 55 websites. Our study with 29 participants showed that humans perceived our dark pattern injections to be highly realistic, with the vast majority of participants not noticing that these had been injected by the research team. We evaluated five state-of-the-art CUAs on the benchmark. We found that both human participants and agents are particularly susceptible to the dark patterns of Preselection, Trick Wording, and Hidden Information, while being resilient to other overt dark patterns. Our findings inform the development of more trustworthy CUAs, their use as potential human proxies in evaluating deceptive designs, and the regulation of an online environment increasingly navigated by autonomous agents.

cs.HC↗

arXiv2026

Quantum Charging Advantage in Superconducting Solid-State Batteries

Quantum battery, as a novel energy storage device, offers the potential for unprecedented efficiency and performance beyond the capabilities of classical systems, with broad implications for future quantum technologies. Here, we experimentally \RefC{demonstrate quantum charging advantage (QCA)} in a scalable solid-state quantum battery. More specifically, we show how double-excitation Hamiltonians for two-level systems promote scalable QCA \RefB{with standard methods.} We effectively implement the collective evolution of quantum systems with 2 up to 12 battery cells in a superconducting quantum processor, and study the performance of quantum charging compared to its uncorrelated classical counterpart. The model considered is a linear chain of superconducting transmon qubits with only \textit{nearest-neighbor} and \textit{pairwise} interactions, which constitute the simplest model of a multi-cell quantum battery. Our results empirically realize substantial QCA without the necessity of adopting long-range and many-body interactions \RefB{ and showcase the quantum features of the QB charging processes with measurements of non-zero coherent ergotropy, incoherent ergotropy and entanglement,} revealing a promising prospect for further developments of efficient and experimentally feasible protocols for QCA.

quant-ph↗

arXiv2026

Quantum-Enhanced Sensing Enabled by Scrambling-Induced Genuine Multipartite Entanglement

Quantum sensing leverages quantum resources to surpass the standard quantum limit, yet many existing protocols rely on the preparation of complex entangled states and Hamiltonian engineering, posing challenges for universality and scalability. Here, we report an experimental realization of a universal protocol, known as Butterfly Metrology, proposed in [arXiv:2411.12794], demonstrating a scrambling-based approach for quantum-enhanced sensing on a superconducting quantum processor. By exploiting many-body information scrambling, we observe quantum-enhanced sensitivity to an encoded phase beyond the standard quantum limit, with a scaling consistent with a factor-of-two of the Heisenberg limit for system sizes of up to 10 qubits. Importantly, we experimentally establish a connection between the enhanced sensitivity and the dynamics of the out-of-time-order correlator (OTOC), and show that the buildup of scrambling-induced genuine multipartite entanglement underlies the observed sensitivity enhancement. Our results demonstrate a scalable and practical approach for quantum-enhanced sensing in interacting many-body quantum systems.

quant-ph↗

arXiv2026

EveNet: A Foundation Model for Particle Collision Data Analysis

While deep learning is transforming data analysis in high-energy physics, computational challenges limit its potential. We address these challenges in the context of collider physics by introducing EveNet, an event-level foundation model pretrained on 500 million simulated collision events using a hybrid objective of self-supervised learning and physics-informed supervision. By leveraging a shared particle-cloud representation, EveNet outperforms state-of-the-art baselines across diverse tasks, including searches for heavy resonances and exotic Higgs decays, and demonstrates exceptional data efficiency in low-statistics regimes. Crucially, we validate the transferability of the model to experimental data by rediscovering the $Υ$ meson in CMS Open Data and show its capacity for precision physics through the robust extraction of quantum correlation observables stable against systematic uncertainties. These results indicate that EveNet can successfully encode the fundamental physical structure of particle interactions, which offers a unified and resource-efficient framework to accelerate discovery at current and future colliders.

hep-ex↗

arXiv2025

Auto-Search and Refinement: An Automated Framework for Gender Bias Mitigation in Large Language Models

Pre-training large language models (LLMs) on vast text corpora enhances natural language processing capabilities but risks encoding social biases, particularly gender bias. While parameter-modification methods like fine-tuning mitigate bias, they are resource-intensive, unsuitable for closed-source models, and lack adaptability to evolving societal norms. Instruction-based approaches offer flexibility but often compromise task performance. To address these limitations, we propose $\textbf{FaIRMaker}$, an automated and model-independent framework that employs an $\textbf{auto-search and refinement}$ paradigm to adaptively generate Fairwords, which act as instructions integrated into input queries to reduce gender bias and enhance response quality. Extensive experiments demonstrate that FaIRMaker automatically searches for and dynamically refines Fairwords, effectively mitigating gender bias while preserving task integrity and ensuring compatibility with both API-based and open-source LLMs.

cs.CL↗

arXiv2025

Unsupervised Monocular Depth Estimation Based on Hierarchical Feature-Guided Diffusion

Unsupervised monocular depth estimation has received widespread attention because of its capability to train without ground truth. In real-world scenarios, the images may be blurry or noisy due to the influence of weather conditions and inherent limitations of the camera. Therefore, it is particularly important to develop a robust depth estimation model. Benefiting from the training strategies of generative networks, generative-based methods often exhibit enhanced robustness. In light of this, we employ a well-converging diffusion model among generative networks for unsupervised monocular depth estimation. Additionally, we propose a hierarchical feature-guided denoising module. This model significantly enriches the model's capacity for learning and interpreting depth distribution by fully leveraging image features to guide the denoising process. Furthermore, we explore the implicit depth within reprojection and design an implicit depth consistency loss. This loss function serves to enhance the performance of the model and ensure the scale consistency of depth within a video sequence. We conduct experiments on the KITTI, Make3D, and our self-collected SIMIT datasets. The results indicate that our approach stands out among generative-based models, while also showcasing remarkable robustness.

cs.CV↗

arXiv2025

exUMI: Extensible Robot Teaching System with Action-aware Task-agnostic Tactile Representation

Tactile-aware robot learning faces critical challenges in data collection and representation due to data scarcity and sparsity, and the absence of force feedback in existing systems. To address these limitations, we introduce a tactile robot learning system with both hardware and algorithm innovations. We present exUMI, an extensible data collection device that enhances the vanilla UMI with robust proprioception (via AR MoCap and rotary encoder), modular visuo-tactile sensing, and automated calibration, achieving 100% data usability. Building on an efficient collection of over 1 M tactile frames, we propose Tactile Prediction Pretraining (TPP), a representation learning framework through action-aware temporal tactile prediction, capturing contact dynamics and mitigating tactile sparsity. Real-world experiments show that TPP outperforms traditional tactile imitation learning. Our work bridges the gap between human tactile intuition and robot learning through co-designed hardware and algorithms, offering open-source resources to advance contact-rich manipulation research. Project page: https://silicx.github.io/exUMI.

cs.RO↗

arXiv2025

Generalized Turan number with given size

Generalized Turán problem with given size, denoted as $\mathrm{mex}(m,K_r,F)$, determines the maximum number of $K_r$-copies in an $F$-free graph with $m$ edges. We prove that for $r\ge 3$ and $α\in(\frac 2 r,1]$, any graph $G$ with $m$ edges and $Ω(m^{\frac{αr}{2}})$ $K_r$-copies has a subgraph of order $n_0=Ω(m^\fracα{2})$, which contains $Ω(n_0^{\frac{i(r-2)α}{(2-α)r-2}})$ $K_i$-copies for each $i = 2, \ldots, r$. This implies an upper bound of $\mathrm{mex}(m, K_r, F)$ when an upper bound of $\mathrm{ex}(n,K_r,F)$ is known. Furthermore, we establish an improved upper bound of $\mathrm{mex}(m, K_r, F)$ by $\mathrm{ex}(n, F)$ and $\min_{v_0 \in V(F)} \mathrm{ex}(n, K_r, F - v_0)$. As a corollary, we show $\mathrm{mex}(m, K_r, K_{s,t}) = Θ( m^{\frac{rs - \binom{r}{2}}{2s-1}} )$ for $r \geq 3$, $s \geq 2r-2$ and $t \geq (s-1)! + 1$, and obtain non-trivial bounds for other graph classes such as complete $r$-partite graphs and $K_s \vee C_\ell$, etc.

math.CO↗

arXiv2025

SimAD: A Simple Dissimilarity-based Approach for Time Series Anomaly Detection

Despite the prevalence of reconstruction-based deep learning methods, time series anomaly detection remains a tremendous challenge. Existing approaches often struggle with limited temporal contexts, insufficient representation of normal patterns, and flawed evaluation metrics, all of which hinder their effectiveness in detecting anomalous behavior. To address these issues, we introduce a $\textbf{Sim}$ple dissimilarity-based approach for time series $\textbf{A}$nomaly $\textbf{D}$etection, referred to as $\textbf{SimAD}$. Specifically, SimAD first incorporates a patching-based feature extractor capable of processing extended temporal windows and employs the EmbedPatch encoder to fully integrate normal behavioral patterns. Second, we design an innovative ContrastFusion module in SimAD, which strengthens the robustness of anomaly detection by highlighting the distributional differences between normal and abnormal data. Third, we introduce two robust enhanced evaluation metrics, Unbiased Affiliation (UAff) and Normalized Affiliation (NAff), designed to overcome the limitations of existing metrics by providing better distinctiveness and semantic clarity. The reliability of these two metrics has been demonstrated by both theoretical and experimental analyses. Experiments conducted on seven diverse time series datasets clearly demonstrate SimAD's superior performance compared to state-of-the-art methods, achieving relative improvements of $\textbf{19.85%}$ on F1, $\textbf{4.44%}$ on Aff-F1, $\textbf{77.79%}$ on NAff-F1, and $\textbf{9.69%}$ on AUC on six multivariate datasets. Code and pre-trained models are available at https://github.com/EmorZz1G/SimAD.

cs.LG↗

arXiv2025

Error term in the Cohen-Lenstra heuristic via random matrix approach

The Cohen-Lenstra heuristic predicts the distribution of ideal class groups over number fields. Random matrix models provide a natural framework for explaining this heuristic, and recent results demonstrate the effectiveness of these tools. In this paper, we extend the analysis of the random matrix model to examine the error term in the Cohen-Lenstra heuristic. Additionally, we derive the asymptotic distribution of the corank of random matrices over finite fields, which can be modeled as a special class of Markov chains.

math.PR↗

arXiv2025

Imaging the Meissner effect in pressurized bilayer nickelate with integrated multi-parameter quantum sensor

Recent reports on the signatures of high-temperature superconductivity with a critical temperature Tc close to 80 K have triggered great research interest and extensive follow-up studies. Although the zero resistance has been successfully achieved under improved hydrostatic pressure conditions, the Meissner effect of $\mathrm{La_{3}Ni_{2}O_{7-δ}}$ under high pressure remains controversial. Here, using shallow nitrogen-vacancy centers implanted on the culet of diamond anvils as in-situ quantum sensors, we observe compelling evidence for the Meissner effect in polycrystalline bilayer nickelate samples: the magnetic field expulsion during both field cooling and field warming processes. In particular, we explore the multiparameter measurement capacity of the diamond quantum sensors to extract the weak demagnetization signal of $\mathrm{La_{3}Ni_{2}O_{7-δ}}$. The correlated measurements of Raman spectra and magnetic imaging indicate an incomplete structural transformation related to the displacement of oxygen ions emerging in the non-superconducting region. Our work clarifies the controversy about the Meissner effect of $\mathrm{La_{3}Ni_{2}O_{7-δ}}$ and contributes to the development of quantum sensing of weak signals under high-pressure conditions.

cond-mat.supr-con↗

arXiv2025

Display Content, Display Methods and Evaluation Methods of the HCI in Explainable Recommender Systems: A Survey

Explainable Recommender Systems (XRS) aim to provide users with understandable reasons for the recommendations generated by these systems, representing a crucial research direction in artificial intelligence (AI). Recent research has increasingly focused on the algorithms, display, and evaluation methodologies of XRS. While current research and reviews primarily emphasize the algorithmic aspects, with fewer studies addressing the Human-Computer Interaction (HCI) layer of XRS. Additionally, existing reviews lack a unified taxonomy for XRS and there is insufficient attention given to the emerging area of short video recommendations. In this study, we synthesize existing literature and surveys on XRS, presenting a unified framework for its research and development. The main contributions are as follows: 1) We adopt a lifecycle perspective to systematically summarize the technologies and methods used in XRS, addressing challenges posed by the diversity and complexity of algorithmic models and explanation techniques. 2) For the first time, we highlight the application of multimedia, particularly video-based explanations, along with its potential, technical pathways, and challenges in XRS. 3) We provide a structured overview of evaluation methods from both qualitative and quantitative dimensions. These findings provide valuable insights for the systematic design, progress, and testing of XRS.

cs.HC↗

arXiv2025

Reconstruction of Antarctic sea ice thickness from sparse satellite laser altimetry data using a partial convolutional neural network

The persistent lack of spatially complete Antarctic sea ice thickness (SIT) data at sub-monthly resolution has fundamentally constrained the quantitative understanding of large-scale sea ice mass balance processes. In this study, a pan-Antarctic SIT dataset at 5-day and 12.5 km resolution was developed based on sparse Ice, Cloud and Land Elevation Satellite (ICESat: 2003-2009) and ICESat-2 (2018-2024) along-track laser altimetry SIT retrievals using a deep learning approach. The reconstructed SIT was quantitatively validated against independent upward-looking sonar (ULS) observations and showed higher accuracy than the other four satellite-derived and reanalyzed Antarctic SIT datasets. The temporal evolution of the reconstructed SIT was further validated by ULS and ICESat-2 observations. Consistent seasonal cycles and intra-seasonal tendencies across these datasets confirm the reconstruction's reliability. Beyond advancing the mechanistic understanding of Antarctic sea ice variability and climate linkages, this reconstruction dataset's near-real-time updating capability offers operational value for monitoring and forecasting the Antarctic sea ice state.

physics.geo-ph↗