Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
20works
0followers
20topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

20 published item(s)

preprint2026arXiv

Align-GRAG: Anchor and Rationale Guided Dual Alignment for Graph Retrieval-Augmented Generation

Despite the strong abilities, large language models (LLMs) still suffer from hallucinations and reliance on outdated knowledge, raising concerns in knowledge-intensive tasks. Graph-based retrieval-augmented generation (GRAG) enriches LLMs with knowledge by retrieving graphs leveraging relational evidence, but it faces two challenges: structure-coupled irrelevant knowledge introduced by neighbor expansion and structure-reasoning discrepancy between graph embeddings and LLM semantics. We propose \ourmodel, an anchor-and-rationale guided refinement framework to address these challenges. It prompts an LLM to extract anchors and rationale chains, which provide intermediate supervision for \textbf{(1) node-level alignment} that identifies critical nodes and prunes noisy evidence, and \textbf{(2) graph-level alignment} that bridges graph and language semantic spaces via contrastive learning. Extensive experiments on commonsense reasoning, scene graph understanding, and knowledge graph reasoning demonstrate consistent gains over 18 strong baselines, validating the effectiveness of \ourmodel for improving graph-grounded generation. The code can be found in https://anonymous.4open.science/r/Align-GRAG-F3D8/.

preprint2026arXiv

AutoTrust: Benchmarking Trustworthiness in Large Vision Language Models for Autonomous Driving

Recent advancements in large vision language models (VLMs) tailored for autonomous driving (AD) have shown strong scene understanding and reasoning capabilities, making them undeniable candidates for end-to-end driving systems. However, limited work exists on studying the trustworthiness of DriveVLMs -- a critical factor that directly impacts public transportation safety. In this paper, we introduce AutoTrust, a comprehensive trustworthiness benchmark for large vision-language models in autonomous driving (DriveVLMs), considering diverse perspectives -- including trustfulness, safety, robustness, privacy, and fairness. We constructed the largest visual question-answering dataset for investigating trustworthiness issues in driving scenarios, comprising over 10k unique scenes and 18k queries. We evaluated six publicly available VLMs, spanning from generalist to specialist, from open-source to commercial models. Our exhaustive evaluations have unveiled previously undiscovered vulnerabilities of DriveVLMs to trustworthiness threats. Specifically, we found that the general VLMs like LLaVA-v1.6 and GPT-4o-mini surprisingly outperform specialized models fine-tuned for driving in terms of overall trustworthiness. DriveVLMs like DriveLM-Agent are particularly vulnerable to disclosing sensitive information. Additionally, both generalist and specialist VLMs remain susceptible to adversarial attacks and struggle to ensure unbiased decision-making across diverse environments and populations. Our findings call for immediate and decisive action to address the trustworthiness of DriveVLMs -- an issue of critical importance to public safety and the welfare of all citizens relying on autonomous transportation systems. We release all the codes and datasets in https://github.com/taco-group/AutoTrust.

preprint2026arXiv

Exploring Recommender System Evaluation: A Multi-Modal User Agent Framework for A/B Testing

In recommender systems, online A/B testing is a crucial method for evaluating the performance of different models. However, conducting online A/B testing often presents significant challenges, including substantial economic costs, user experience degradation, and considerable time requirements. With the Large Language Models' powerful capacity, LLM-based agent shows great potential to replace traditional online A/B testing. Nonetheless, current agents fail to simulate the perception process and interaction patterns, due to the lack of real environments and visual perception capability. To address these challenges, we introduce a multi-modal user agent for A/B testing (A/B Agent). Specifically, we construct a recommendation sandbox environment for A/B testing, enabling multimodal and multi-page interactions that align with real user behavior on online platforms. The designed agent leverages multimodal information perception, fine-grained user preferences, and integrates profiles, action memory retrieval, and a fatigue system to simulate complex human decision-making. We validated the potential of the agent as an alternative to traditional A/B testing from three perspectives: model, data, and features. Furthermore, we found that the data generated by A/B Agent can effectively enhance the capabilities of recommendation models. Our code is publicly available at https://github.com/Applied-Machine-Learning-Lab/ABAgent.

preprint2026arXiv

Hardware-Efficient Rydberg Atomic Quantum Solvers for NP Problems

Developing hardware-efficient implementations of quantum algorithms is crucial in the NISQ era to achieve practical quantum advantage. Here, we construct a generic quantum solver for NP problems based on Grover's search algorithm, specifically tailored for Rydberg-atom quantum computing platforms. We design the quantum oracles in the search algorithm using parallelizable single-qubit and multi-qubit entangling gates in the Rydberg atom system, yielding a unified framework for solving a broad class of NP problems with provable quadratic quantum speedup. We analyze the experimental resource requirements considering the unique qubit connectivity of the dynamically reconfigurable qubits in the optical tweezer array. The required qubit number scales linearly with the problem size, representing a significant improvement over existing Rydberg-based quantum annealing approaches that incur quadratic overhead. These results provide a concrete roadmap for future experimental efforts towards demonstrating quantum advantage in NP problem solving using Rydberg atomic systems. Our construction indicates that atomic qubits offer favorable circuit depth scaling compared to quantum processors with fixed local connectivity.

preprint2026arXiv

JPU: Bridging Jailbreak Defense and Unlearning via On-Policy Path Rectification

Despite extensive safety alignment, Large Language Models (LLMs) often fail against jailbreak attacks. While machine unlearning has emerged as a promising defense by erasing specific harmful parameters, current methods remain vulnerable to diverse jailbreaks. We first conduct an empirical study and discover that this failure mechanism is caused by jailbreaks primarily activating non-erased parameters in the intermediate layers. Further, by probing the underlying mechanism through which these circumvented parameters reassemble into the prohibited output, we verify the persistent existence of dynamic $\textbf{jailbreak paths}$ and show that the inability to rectify them constitutes the fundamental gap in existing unlearning defenses. To bridge this gap, we propose $\textbf{J}$ailbreak $\textbf{P}$ath $\textbf{U}$nlearning (JPU), which is the first to rectify dynamic jailbreak paths towards safety anchors by dynamically mining on-policy adversarial samples to expose vulnerabilities and identify jailbreak paths. Extensive experiments demonstrate that JPU significantly enhances jailbreak resistance against dynamic attacks while preserving the model's utility.

preprint2026arXiv

Learning Higher-Order Structure from Incomplete Spatiotemporal Data: Multi-Scale Hypergraph Laplacians with Neural Refinement

Sensor networks increasingly govern modern infrastructure, yet the data they lose are rarely missing in the uniform-random patterns assumed by standard imputation benchmarks. Loop detectors go offline during calibration, roadside cabinets silence clusters of nearby sensors, and newly installed instruments provide no history. Such failures create structured absences whose values are constrained by higher-order relations among groups of sensors, not merely by pairwise proximity. Existing low-rank and graph-based methods often miss this collective structure and can fail when missingness becomes coherent. We introduce Multi-Scale Hypergraph Laplacians (MSHL), a two-stage framework for learning higher-order structure from incomplete spatiotemporal observations. The Discovery stage builds a multi-scale hypergraph from complementary topology and residual-correlation evidence, with an observation-only selector that adapts to the supported interaction scale. The Refinement stage adds a small hypergraph-conditioned residual network that is safe by construction: it learns nonlinear corrections where informative residual features exist and defers to the linear estimate where they do not. We prove that MSHL represents group-conservation patterns inaccessible to pairwise graph priors, adapts to the best fixed scale up to a logarithmic factor, transfers this advantage to held-out imputation error, and admits a one-sided refinement guarantee. On two real traffic networks evaluated across scattered cell missingness, contiguous block outages, and whole-sensor blackouts at five rates, MSHL improves over a pairwise-graph baseline whenever higher-order structure is identifiable and otherwise matches it within sampling noise. The results point to a broader principle for reliable infrastructure learning: missing data should be treated not as isolated entries to fill, but as evidence of structure to discover.

preprint2026arXiv

Personalized Deep Research: A User-Centric Framework, Dataset, and Hybrid Evaluation for Knowledge Discovery

Deep Research agents driven by LLMs have automated the scholarly discovery pipeline, from planning and query formulation to iterative web exploration. Yet they remain constrained by a static, ``one-size-fits-all'' retrieval paradigm. Current systems fail to adaptively adjust the depth and breadth of exploration based on the user's existing expertise or latent interests, frequently resulting in reports that are either redundant for experts or overly dense for novices. To address this, we introduce Personalized Deep Research (PDR), a framework that integrates dynamic user context into the core retrieval-reasoning loop. Rather than treating personalization as a post-hoc formatting step, PDR unifies user profile modeling with iterative query development, dual-stage (private/public) retrieval, and context-aware synthesis. This allows the system to autonomously align research sub-goals with user intent and optimize the stopping criteria for evidence collection. To facilitate benchmarking, we release the PDR Dataset, covering four realistic user tasks, and propose a hybrid evaluation framework combining lexical metrics with LLM-based judgments to assess factual accuracy and personalization alignment. Experimental results against commercial baselines demonstrate that PDR significantly improves retrieval utility and report relevance, effectively bridging the gap between generic information retrieval and personalized knowledge acquisition. The resource is available to the public at https://github.com/Applied-Machine-Learning-Lab/SIGIR2026_PDR.

preprint2026arXiv

Rethinking Residual Distribution in Locate-then-Edit Model Editing

Model editing enables targeted updates to the knowledge of large language models (LLMs) with minimal retraining. Among existing approaches, locate-then-edit methods constitute a prominent paradigm: they first identify critical layers, then compute residuals at the final critical layer based on the target edit, and finally apply least-squares-based multi-layer updates via $\textbf{residual distribution}$. While empirically effective, we identify a counterintuitive failure mode: residual distribution, a core mechanism in these methods, introduces weight shift errors that undermine editing precision. Through theoretical and empirical analysis, we show that such errors increase with the distribution distance, batch size, and edit sequence length, ultimately leading to inaccurate or suboptimal edits. To address this, we propose the $\textbf{B}$oundary $\textbf{L}$ayer $\textbf{U}$pdat$\textbf{E (BLUE)}$ strategy to enhance locate-then-edit methods. Sequential batch editing experiments on three LLMs and two datasets demonstrate that BLUE not only delivers an average performance improvement of 35.59\%, significantly advancing the state of the art in model editing, but also enhances the preservation of LLMs' general capabilities. Our code is available at https://github.com/xpq-tech/BLUE.

preprint2025arXiv

Double Supersolid Phase in a Bosonic t-J-V Model with Rydberg Atoms

Recent advances in Rydberg tweezer arrays bring novel opportunities for programmable quantum simulations beyond previous capabilities. In this work, we investigate a bosonic t-J-V model currently realized with Rydberg atoms. Through large-scale quantum Monte Carlo simulations, we uncover an emergent double supersolid (DSS) phase with the coexistence of two superfluids and crystalline order. Tunable long-range tunneling and repulsive hole-hole interactions enable a rich phase diagram featuring a double superfluid phase, a DSS phase, and an antiferromagnetic insulator. Intriguingly, within the DSS regime we observe an unconventional thermal enhancement of crystalline order. Our results establish the bosonic t-J-V model as a promising and experimentally accessible platform for exploring exotic quantum phases in Rydberg atom arrays.

preprint2024arXiv

Convergence of the momentum method for semialgebraic functions with locally Lipschitz gradients

We propose a new length formula that governs the iterates of the momentum method when minimizing differentiable semialgebraic functions with locally Lipschitz gradients. It enables us to establish local convergence, global convergence, and convergence to local minimizers without assuming global Lipschitz continuity of the gradient, coercivity, and a global growth condition, as is done in the literature. As a result, we provide the first convergence guarantee of the momentum method starting from arbitrary initial points when applied to principal component analysis, matrix sensing, and linear neural networks.

preprint2022arXiv

Quantum precision measurement of two-dimensional forces with ${\bf 10^{-28}}$-Newton stability

High-precision sensing of vectorial forces has broad impact on both fundamental research and technological applications such as the examination of vacuum fluctuations \cite{casimir09rmp} and the detection of surface roughness of nanostructures \cite{RevModPhys.89.035002}. Recent years have witnessed much progress on sensing alternating electromagnetic forces for the rapidly advancing quantum technology -- orders-of-magnitude improvement has been accomplished on the detection sensitivity with atomic sensors \cite{Schreppler1486,Shaniv2017,Gilmore673}, whereas precision measurement of static {electromagnetic} forces lags far behind with the corresponding long-term stability rarely demonstrated. Here, based on quantum atomic matter waves confined by an optical lattice, we perform precision measurement of static {electromagnetic} forces by imaging coherent wave mechanics in the reciprocal space. We achieve a state-of-the-art measurement sensitivity of $ 2.30(8)\times 10^{-26}$ N/$\sqrt{\rm \bf Hz}$. Long-term stabilities on the order of $10^{-28}$ N are observed in the two spatial components of a force, which allows probing atomic Van der Waals forces at a millimeter distance \cite{NatureNanoScanning}. As a further illustrative application, we use our atomic sensor to calibrate the control precision of an alternating electromagnetic force applied in the experiment. Future developments of our method hold promise for delivering unprecedented atom-based quantum force sensing technologies.

preprint2021arXiv

Evidence of Potts-Nematic Superfluidity in a Hexagonal $sp^2$ Optical Lattice

As in between liquid and crystal phases lies a nematic liquid crystal, which breaks rotation with preservation of translation symmetry, there is a nematic superfluid phase bridging a superfluid and a supersolid. The nematic order also emerges in interacting electrons and has been found to largely intertwine with multi-orbital correlation in high-temperature superconductivity, where Ising nematicity arises from a four-fold rotation symmetry $C_4$ broken down to $C_2$. Here we report an observation of a three-state ($\mathbb{Z}_3$) quantum nematic order, dubbed "Potts-nematicity", in a system of cold atoms loaded in an excited band of a hexagonal optical lattice described by an $sp^2$-orbital hybridized model. This Potts-nematic quantum state spontaneously breaks a three-fold rotation symmetry of the lattice, qualitatively distinct from the Ising nematicity. Our field theory analysis shows that the Potts-nematic order is stabilized by intricate renormalization effects enabled by strong inter-orbital mixing present in the hexagonal lattice. This discovery paves a way to investigate quantum vestigial orders in multi-orbital atomic superfluids.

preprint2021arXiv

Hard instance learning for quantum adiabatic prime factorization

Prime factorization is a difficult problem with classical computing, whose exponential hardness is the foundation of Rivest-Shamir-Adleman (RSA) cryptography. With programmable quantum devices, adiabatic quantum computing has been proposed as a plausible approach to solve prime factorization, having promising advantage over classical computing. Here, we find there are certain hard instances that are consistently intractable for both classical simulated annealing and un-configured adiabatic quantum computing (AQC). Aiming at an automated architecture for optimal configuration of quantum adiabatic factorization, we apply a deep reinforcement learning (RL) method to configure the AQC algorithm. By setting the success probability of the worst-case problem instances as the reward to RL, we show the AQC performance on the hard instances is dramatically improved by RL configuration. The success probability also becomes more evenly distributed over different problem instances, meaning the configured AQC is more stable as compared to the un-configured case. Through a technique of transfer learning, we find prominent evidence that the framework of AQC configuration is scalable -- the configured AQC as trained on five qubits remains working efficiently on nine qubits with a minimal amount of additional training cost.

preprint2021arXiv

The Reservoir Learning Power across Quantum Many-Boby Localization Transition

Harnessing the quantum computation power of the present noisy-intermediate-size-quantum devices has received tremendous interest in the last few years. Here we study the learning power of a one-dimensional long-range randomly-coupled quantum spin chain, within the framework of reservoir computing. In time sequence learning tasks, we find the system in the quantum many-body localized (MBL) phase holds long-term memory, which can be attributed to the emergent local integrals of motion. On the other hand, MBL phase does not provide sufficient nonlinearity in learning highly-nonlinear time sequences, which we show in a parity check task. This is reversed in the quantum ergodic phase, which provides sufficient nonlinearity but compromises memory capacity. In a complex learning task of Mackey-Glass prediction that requires both sufficient memory capacity and nonlinearity, we find optimal learning performance near the MBL-to-ergodic transition. This leads to a guiding principle of quantum reservoir engineering at the edge of quantum ergodicity reaching optimal learning power for generic complex reservoir learning tasks. Our theoretical finding can be readily tested with present experiments.

preprint2020arXiv

$f$-wave superfluidity from repulsive interaction in Rydberg-dressed Fermi gas

Interacting Fermi gas provides an ideal model system to understand unconventional pairing and intertwined orders relevant to a large class of quantum materials. Rydberg-dressed Fermi gas is a recent experimental system where the sign, strength, and range of the interaction can be controlled. The interaction in momentum space has a negative minimum at $q_c$ inversely proportional to the characteristic length-scale in real space, the soft-core radius $r_c$. We show theoretically that single-component (spinless) Rydberg-dressed Fermi gas in two dimensions has a rich phase diagram with novel superfluid and density wave orders due to the interplay of the Fermi momentum $p_F$, interaction range $r_c$, and interaction strength $u_0$. For repulsive bare interactions $u_0>0$, the dominant instability is $f$-wave superfluid for $p_Fr_c\lesssim 2$, and density wave for $p_Fr_c\gtrsim 4$. The $f$-wave pairing in this repulsive Fermi gas is reminiscent of the conventional Kohn-Luttinger mechanism, but has a much higher $T_c$. For attractive bare interactions $u_0<0$, the leading instability is $p$-wave pairing. The phase diagram is obtained from functional renormalization group that treats all competing many-body instabilities in the particle-particle and particle-hole channels on equal footing.

preprint2020arXiv

A comparison study on the growth pattern of traffic oscillations in car-following experiments

The evolution of oscillations is a very important issue in traffic flow studies. A recent car-following experiment (Experiment-I) showed that the speed standard deviation grows in a concave way along a platoon of vehicles following one another. This finding indicates that the traditional traffic instability mechanism is debatable, in which the speed standard deviation initially grows in a convex way. This paper has investigated the growth pattern of traffic oscillations in another car-following experiment (Experiment-II) and compared it with that in Experiment-I. It is shown that the speed standard deviation also exhibits concave growth characteristics in Experiment-II. The paired-sample t-test and the Mann-Kendall (MK) trend test showed that there is no significant difference between the two datasets. However, the acceleration standard deviation was remarkably larger in Experiment-II since drivers were asked to follow closely. Furthermore, a comparison experiment has been performed which indicates that the set of experiments on a circular track can be considered equivalent to that on a straight track. Our study is expected to shed light not only on traffic flow dynamics itself but also on the future design of the experiment scheme.

preprint2020arXiv

Chiral Induced Spin Selectivity as a Spontaneous Intertwined Order

Chiral induced spin selectivity (CISS) describes efficient spin filtering by chiral molecules. This phenomenon has led to nanoscale manipulation of quantum spins with promising applications to spintronics and quantum computing, since its discovery nearly two decades ago. However, its underlying mechanism still remains mysterious for the required spin-orbit interaction (SOI) strength is unexpectedly large. Here we report a multi-orbital theory for CISS, where an effective SOI emerges from spontaneous formation of electron-hole pairing caused by many-body correlation. This mechanism produces a strong SOI to the order of tens of milielectronvolts which could support the large spin polarization observed in CISS at room temperature. One central ingredient of our theory is the Wannier functions of the valence and conduction bands correspond respectively to one- and two-dimensional representation of the spatial rotation symmetry around the molecule elongation direction. The induced SOI strength is found to decrease when the band gap increases. Our theory may provide important guidance for searching other molecules with CISS effects.

preprint2020arXiv

Dimension Crossing Turbulent Cascade in an Excited Lattice Bose Gas

Turbulence is an intriguing non-equilibrium state, which originates from fluid mechanics and has far-reaching consequences in the description of climate physics, the characterization of quantum hydrodynamics, and the understanding of cosmic evolution. The concept of turbulent cascade describing the energy redistribution across different length scales offers one profound route to reconcile fundamental conservative forces with observational energy non-conservation of accelerating expansion of the universe bypassing the cosmological constant. Here, we observe a dimension crossing turbulent energy cascade in an atomic Bose-Einstein condensate confined in a two-dimensional (2d) optical lattice forming a 2d array of tubes, which exhibits universal behaviors in the dynamical energy-redistribution across different dimensions. By exciting atoms into the optical-lattice high bands, the excessive energy of this quantum many-body system is found to cascade from the transverse two-dimensional lattice directions to the continuous dimension, giving rise to a one-dimensional turbulent energy cascade, which is in general challenging to reach due to integrability. We expect this observed novel phenomenon of dimension-crossing energy cascade may inspire microscopic theories for modeling positive cosmological constant of our inflationary universe.

preprint2020arXiv

Modeling and Analysis of Excess Commuting with Trip Chains

Commuting, like other types of human travel, is complex in nature, such as trip-chaining behavior involving making stops of multiple purposes between two anchors. According to the 2001 National Household Travel Survey, about one half of weekday U.S. workers made a stop during their commute. In excess commuting studies that examine a region&#39;s overall commuting efficiency, commuting is, however, simplified as nonstop travel from homes to jobs. This research fills this gap by proposing a trip-chaining-based model to integrate trip-chaining behavior into excess commuting. Based on a case study of the Tampa Bay region of Florida, this research finds that traditional excess commuting studies underestimate both actual and optimal commute, while overestimate excess commuting. For chained commuting trips alone, for example, the mean minimum commute time is increased by 70 percent from 5.48 minutes to 9.32 minutes after trip-chaining is accounted for. The gaps are found to vary across trip-chaining types by a disaggregate analysis by types of chain activities. Hence, policymakers and planners are cautioned of omitting trip-chaining behavior in making urban transportation and land use policies. In addition, the proposed model can be adopted to study the efficiency of non-work travel.

preprint2020arXiv

Quantum Adiabatic Algorithm Design using Reinforcement Learning

Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically applicable to a class of problems with solution hard-to-find but easy-to-verify, e.g., searching and NP-complete problems. We benchmark this approach in Grover-search and 3-SAT problems, and find that the adiabatic-algorithm obtained by our RL approach leads to significant improvement in the resultant success probability. In application to Grover search, our RL-design automatically produces an adiabatic quantum algorithm that has the quadratic speedup. We find for all our studied cases that quantitatively the RL-designed algorithm has a better performance compared to the analytically constructed non-linear Hamiltonian path when the encoding Hamiltonian is solvable, and that this RL-design approach remains applicable even when the non-linear Hamiltonian path is not analytically available. In 3-SAT, we find RL-design has fascinating transferability---the adiabatic algorithm obtained by training on a specific choice of clause number leads to better performance consistently over the linear algorithm on different clause numbers. These findings suggest the applicability of reinforcement learning for automated quantum adiabatic algorithm design. Further considering the established complexity-equivalence of circuit and adiabatic quantum algorithms, we expect the RL-designed adiabatic algorithm to inspire novel circuit algorithms as well. Our approach is potentially applicable to different quantum hardwares from trapped-ions and optical-lattices to superconducting-qubit devices.