Search arXiv⌕ Search

arXiv subjects

Fei Gao

Publications and source records attributed to Fei Gao.

At least 91 records · Page 5Linked to original sources

ATRS: Adaptive Trajectory Re-splitting via a Shared Neural Policy for Parallel Optimization

Parallel trajectory optimization via the Alternating Direction Method of Multipliers (ADMM) has emerged as a scalable approach to long-horizon motion planning. However, existing frameworks typically decompose the problem into parallel subproblems based on a predefined fixed structure. Such structural rigidity often causes optimization stagnation in highly constrained regions, where a few lagging subproblems delay global convergence. A natural remedy is to adaptively re-split these stagnating segments online. Yet, deciding when, where, and how to split exceeds the capability of rule-based heuristics. To this end, we propose ATRS, a novel framework that embeds a shared Deep Reinforcement Learning policy into the parallel ADMM loop. We formulate this adaptive adjustment as a Multi-Agent Shared-Policy Markov Decision Process, where all trajectory segments act as homogeneous agents and share a unified neural policy network. This parameter-sharing architecture endows the system with size invariance, enabling it to handle dynamically changing segment counts during re-splitting and generalize to arbitrary trajectory lengths. Furthermore, our formulation inherently supports zero-shot generalization to unseen environments, as our network relies solely on the internal states of the numerical solver rather than on the geometric features of the environment. To ensure solver stability, a Confidence-Based Election mechanism selects only the most stagnating segment for re-splitting at each step. Extensive simulations demonstrate that ATRS accelerates convergence, reducing the number of iterations by up to 26.0% and the computation time by up to 19.1%. Real-world experiments further confirm its applicability to both large-scale offline global planning and real-time onboard replanning within 35 ms per cycle, with no sim-to-real degradation.

cs.RO↗

From Membership-Privacy Leakage to Quantum Machine Unlearning

Quantum machine learning (QML) has the potential to achieve quantum advantage for specific tasks by combining quantum computation with classical machine learning (ML). In classical ML, a significant challenge is membership-privacy leakage, whereby an attacker can infer from model outputs whether specific data were used in training. When specific data are required to be withdrawn, removing their influence from the trained model becomes necessary. Machine unlearning (MU) addresses this issue by enabling the model to forget the withdrawn data, thereby preventing membership-privacy leakage. However, this leakage remains underexplored in QML. This raises two research questions: do QML models leak membership privacy about their training data, and can MU methods efficiently mitigate such leakage in QML models? We investigate these questions using two quantum neural network (QNN) architectures, a basic QNN and a hybrid QNN, evaluated in noiseless simulations and cloud quantum device demonstrations. To answer the first question, we analyze how quantum constraints shape membership-privacy leakage in QML and then formalize a realistic gray-box threat model accordingly. Based on this, we design a membership inference attack (MIA) tailored to QNN outputs, and our results provide clear evidence of membership leakage in both QNNs. To answer the second question, we propose a quantum machine unlearning (QMU) framework, comprising three MU mechanisms. Evaluations on two QNN architectures show that QMU removes the influence of the withdrawn data while preserving accuracy for retained data. A comparative analysis further characterizes the three MU mechanisms with respect to data dependence, computational cost, and robustness.

quant-ph↗

Configuration interaction extension of AGP for incorporating inter-geminal correlations

In this paper, we develop a class of antisymmetrized geminal power configuration interaction (AGP-CI) wave functions that extend the AGP framework by incorporating inter-geminal correlations through a CI expansion. To make these wavefunctions computationally tractable, we evaluate them by rewriting the AGP-CI ansatz as a linear combination of AGPs (LC-AGP), for which overlaps and Hamiltonian matrix elements can be computed with standard AGP machinery. Motivated by border-rank decompositions, we further reorganize this ansatz into a compact linear combination of AGPs depending on a small deformation parameter $τ$, which controls how closely the truncated expansion approximates the full AGP-CI state. Benchmark applications to the Hubbard model and to the small molecules H$_2$O and N$_2$ demonstrate that the proposed wavefunctions achieve consistently high accuracy and outperform the LC-AGP, particularly for systems with more electrons and in strongly correlated regimes.

physics.chem-ph↗

Precise Aggressive Aerial Maneuvers with Sensorimotor Policies

Precise aggressive maneuvers with lightweight onboard sensors remains a key bottleneck in fully exploiting the maneuverability of drones. Such maneuvers are critical for expanding the systems' accessible area by navigating through narrow openings in the environment. Among the most relevant problems, a representative one is aggressive traversal through narrow gaps with quadrotors under SE(3) constraints, which require the quadrotors to leverage a momentary tilted attitude and the asymmetry of the airframe to navigate through gaps. In this paper, we achieve such maneuvers by developing sensorimotor policies directly mapping onboard vision and proprioception into low-level control commands. The policies are trained using reinforcement learning (RL) with end-to-end policy distillation in simulation. We mitigate the fundamental hardness of model-free RL's exploration on the restricted solution space with an initialization strategy leveraging trajectories generated by a model-based planner. Careful sim-to-real design allows the policy to control a quadrotor through narrow gaps with low clearances and high repeatability. For instance, the proposed method enables a quadrotor to navigate a rectangular gap at a 5 cm clearance, tilted at up to 90-degree orientation, without knowledge of the gap's position or orientation. Without training on dynamic gaps, the policy can reactively servo the quadrotor to traverse through a moving gap. The proposed method is also validated by training and deploying policies on challenging tracks of narrow gaps placed closely. The flexibility of the policy learning method is demonstrated by developing policies for geometrically diverse gaps, without relying on manually defined traversal poses and visual features.

cs.RO↗

Primitive-based Truncated Diffusion for Efficient Trajectory Generation of Differential Drive Mobile Manipulators

We present a learning-enhanced motion planner for differential drive mobile manipulators to improve efficiency, success rate, and optimality. For task representation encoder, we propose a keypoint sequence extraction module that maps boundary states to 3D space via differentiable forward kinematics. Point clouds and keypoints are encoded separately and fused with attention, enabling effective integration of environment and boundary states information. We also propose a primitive-based truncated diffusion model that samples from a biased distribution. Compared with vanilla diffusion model, this framework improves the efficiency and diversity of the solution. Denoised paths are refined by trajectory optimization to ensure dynamic feasibility and task-specific optimality. In cluttered 3D simulations, our method achieves higher success rate, improved trajectory diversity, and competitive runtime compared to vanilla diffusion and classical baselines. The source code is released at https://github.com/nmoma/nmoma .

cs.RO↗

Rotor-Failure-Aware Quadrotors Flight in Unknown Environments

Rotor failures in quadrotors may result in high-speed rotation and vibration due to rotor imbalance, which introduces significant challenges for autonomous flight in unknown environments. The mainstream approaches against rotor failures rely on fault-tolerant control (FTC) and predefined trajectory tracking. To the best of our knowledge, online failure detection and diagnosis (FDD), trajectory planning, and FTC of the post-failure quadrotors in unknown and complex environments have not yet been achieved. This paper presents a rotor-failure-aware quadrotor navigation system designed to mitigate the impacts of rotor imbalance. First, a composite FDD-based nonlinear model predictive controller (NMPC), incorporating motor dynamics, is designed to ensure fast failure detection and flight stability. Second, a rotor-failure-aware planner is designed to leverage FDD results and spatial-temporal joint optimization, while a LiDAR-based quadrotor platform with four anti-torque plates is designed to enable reliable perception under high-speed rotation. Lastly, extensive benchmarks against state-of-the-art methods highlight the superior performance of the proposed approach in addressing rotor failures, including propeller unloading and motor stoppage. The experimental results demonstrate, for the first time, that our approach enables autonomous quadrotor flight with rotor failures in challenging environments, including cluttered rooms and unknown forests.

cs.RO↗

Vector sketch animation generation with differentiable motion trajectories

Sketching is a direct and inexpensive means of visual expression. Though image-based sketching has been well studied, video-based sketch animation generation is still very challenging due to the temporal coherence requirement. In this paper, we propose a novel end-to-end automatic generation approach for vector sketch animation. To solve the flickering issue, we introduce a Differentiable Motion Trajectory (DMT) representation that describes the frame-wise movement of stroke control points using differentiable polynomial-based trajectories. DMT enables global semantic gradient propagation across multiple frames, significantly improving the semantic consistency and temporal coherence, and producing high-framerate output. DMT employs a Bernstein basis to balance the sensitivity of polynomial parameters, thus achieving more stable optimization. Instead of implicit fields, we introduce sparse track points for explicit spatial modeling, which improves efficiency and supports long-duration video processing. Evaluations on DAVIS and LVOS datasets demonstrate the superiority of our approach over SOTA methods. Cross-domain validation on 3D models and text-to-video data confirms the robustness and compatibility of our approach.

cs.GR↗

Auxiliary-qubit-free quantum approximate optimization algorithm for the minimum dominating set problem

Quantum Approximate Optimization Algorithm (QAOA) is a promising framework for solving combinatorial optimization problems on near-term quantum devices. One such problem is the Minimum Dominating Set (MDS), which is known to be NP-hard. Existing QAOA algorithms for this problem typically require numerous auxiliary qubits, which increases circuit overhead and hardware requirements. In this paper, we propose an auxiliary-qubit-free QAOA algorithm based on Hamiltonian evolution (AQFH-QAOA) for the MDS problem. Unlike previous studies that require numerous auxiliary qubits, our algorithm eliminates the need for auxiliary qubits, thus significantly reducing circuit overhead. In addition, we present an auxiliary-qubit-free optimized implementation of the previously proposed Guerrero's QAOA algorithm (AQFG-QAOA) by utilizing gate decomposition techniques. Through a detailed analysis of gate complexity, we evaluate the applicability of these two algorithms. Numerical experiments demonstrate that our proposed algorithm achieves competitive solution quality compared to existing QAOA algorithms, making it a promising candidate for implementation on near-term quantum devices.

quant-ph↗

AJF: Adaptive Jailbreak Framework Based on the Comprehension Ability of Black-Box Large Language Models

Recent advancements in adversarial jailbreak attacks have exposed critical vulnerabilities in Large Language Models (LLMs), enabling the circumvention of alignment safeguards through increasingly sophisticated prompt manipulations. Our experiments find that the effectiveness of jailbreak strategies is influenced by the comprehension ability of the target LLM. Building on this insight, we propose an Adaptive Jailbreak Framework (AJF) based on the comprehension ability of black-box large language models. Specifically, AJF first categorizes the comprehension ability of the LLM and then applies different strategies accordingly: For models with limited comprehension ability (Type-I LLMs), AJF integrates layered semantic mutations with an encryption technique (MuEn strategy), to more effectively evade the LLM's defenses during the input and inference stages. For models with strong comprehension ability (Type-II LLMs), AJF employs a more complex strategy that builds upon the MuEn strategy by adding an additional layer: inducing the LLM to generate an encrypted response. This forms a dual-end encryption scheme (MuDeEn strategy), further bypassing the LLM's defenses during the output stage. Experimental results demonstrate the effectiveness of our approach, achieving attack success rates of \textbf{98.9\%} on GPT-4o (29 May 2025 release) and \textbf{99.8\%} on GPT-4.1 (8 July 2025 release). Our work contributes to a deeper understanding of the vulnerabilities in current LLMs alignment mechanisms.

cs.CL↗

DPxFin: Adaptive Differential Privacy for Anti-Money Laundering Detection via Reputation-Weighted Federated Learning

In the modern financial system, combating money laundering is a critical challenge complicated by data privacy concerns and increasingly complex fraud transaction patterns. Although federated learning (FL) is a promising problem-solving approach as it allows institutions to train their models without sharing their data, it has the drawback of being prone to privacy leakage, specifically in tabular data forms like financial data. To address this, we propose DPxFin, a novel federated framework that integrates reputation-guided adaptive differential privacy. Our approach computes client reputation by evaluating the alignment between locally trained models and the global model. Based on this reputation, we dynamically assign differential privacy noise to client updates, enhancing privacy while maintaining overall model utility. Clients with higher reputations receive lower noise to amplify their trustworthy contributions, while low-reputation clients are allocated stronger noise to mitigate risk. We validate DPxFin on the Anti-Money Laundering (AML) dataset under both IID and non-IID settings using Multi Layer Perceptron (MLP). Experimental analysis established that our approach has a more desirable trade-off between accuracy and privacy than those of traditional FL and fixed-noise Differential Privacy (DP) baselines, where performance improvements were consistent, even though on a modest scale. Moreover, DPxFin does withstand tabular data leakage attacks, proving its effectiveness under real-world financial conditions.

cs.LG↗

Development of a dual-phase xenon time projection chamber prototype for the RELICS experiment

The RELICS (REactor neutrino LIquid xenon Coherent elastic Scattering) experiment aims to detect coherent elastic neutrino-nucleus scattering from reactor antineutrinos using a dual-phase xenon time projection chamber. To validate the detector concept and ensure technical reliability for the full-scale experiment, a dedicated prototype was designed, constructed, and operated. This work presents an overview of the design, construction, and operational performance of the prototype, with emphasis on its major subsystems, including the TPC, cryogenic and xenon purification systems, slow control, and data acquisition. During operation, the detector demonstrated the capability to achieve a sub-keV energy threshold required for the RELICS physics program, as reflected by a measured single electron gain of 34.30~$\pm$~0.01~(stat.)~PE/e$^-$ and the successful detection of 0.27~keV L-shell decay events from $^{37}$Ar. In addition, essential data analysis techniques and simulation frameworks were developed and validated, establishing the methodological foundation for future RELICS operations. The successful construction and operation of this prototype confirm the feasibility of the core technologies and provide a crucial experimental basis for the final RELICS detector.

physics.ins-det↗

Extracting freeze-out conditions in beam energy scan via functional QCD

Fluctuations of conserved charges provide a link between high quality theoretical results and precision measurements of heavy ion collisions. We compare results for ratios of the lowest order baryon number susceptibilities from functional QCD approaches to proton number cumulants extracted from experiments. We find that they meet at a specific temperature and chemical potential for each collision energy. This is indicative of the respective freeze-out point. From this self-consistent determination of the freeze-out parameters we extract a prediction for the kurtosis on the freeze-out line. We find quantitative agreement with experimental data where available, despite comparing apples (baryons) with oranges (protons). At a collision energy around 5 GeV, our kurtosis exhibits a peak structure indicative of the critical end point of QCD.

hep-ph↗

Proximal Learning for Trials With External Controls: A Case Study in HIV Prevention

With the advent of effective pre-exposure prophylaxis agents, active-controlled HIV prevention trials have become a common study design. Nevertheless, estimating absolute efficacy relative to a placebo remains important. In this paper, we introduce a novel application of proximal causal inference methods to estimate the counterfactual cumulative HIV incidence under placebo for participants in an active-controlled trial of cabotegravir, using external control data from a placebo-controlled trial with similar eligibility criteria. We leverage baseline sexually transmitted infection status and geographic region as negative control outcome and exposure variables, respectively. We address two key challenges: unmeasured differences in HIV risk between trials and statistical difficulties arising from low HIV incidence rates in both studies. To overcome these challenges, we develop two proximal inference approaches: (1) a semiparametric inverse probability of censoring weighting estimator, and (2) a two-stage regression-based strategy tailored to low-event-rate settings. Our theoretical and numerical investigations demonstrate these methods yield reliable estimates of the counterfactual one-year cumulative HIV incidence under placebo, and provide robust evidence of the superior efficacy of cabotegravir compared with placebo. These findings highlight the potential of proximal inference methods to estimate placebo-controlled effects in both single-arm and active-controlled trials by leveraging external controls.

stat.ME↗

Design and characterization of a photosensor system for the RELICS experiment

In this paper, we present the design and characterization of a photosensor system developed for the RELICS experiment. An extended dynamic range base was designed to mitigate photomultiplier tube (PMT) saturation caused by intense cosmic muon backgrounds in the surface-level RELICS detector. The system employs dual readout from the anode and the seventh dynode to extend the linear response range of the PMT. In particular, our characterization and measurements of Hamamatsu R8520-406 PMTs confirm stable operation under positive high-voltage bias, extending the linear response range by more than an order of magnitude. Furthermore, a model of PMT saturation and recovery was developed to evaluate the influence of cosmic muon signals in the RELICS detector. The results demonstrate the system capability to detect coherent elastic neutrino-nucleus scattering signals under surface-level cosmic backgrounds, and suggest the potential to extend the scientific reach of RELICS to MeV-scale interactions.

physics.ins-det↗

Flavor dependence of chiral symmetry breaking and the conformal window

We investigate the phase structure of Quantum Chromodynamics (QCD) in the vacuum as a function of quark flavor number $N_f$ within the chiral limit. By self-consistently solving the coupled DSEs for the quark and gluon propagators in a minimal QCD scheme, we elucidate the nonperturbative dynamics governing dynamical chiral symmetry breaking. Our calculations determine a critical flavor number of $N_f^c=6.81$ which marks the chiral symmetry restoration of quarks. Further analysis reveals the critical exponents of the chiral condensate as $ -\langle\barψ ψ\rangle\sim |N_f-N_f^c|^{0.53(9)}$, characterized the second order feature of this phase transition of chiral symmetry. Additionally, we discuss the implications for the walking regime towards the conformal window at larger flavor.

hep-ph↗

Demonstration of High-Gain Harmonic Lasing in a Terahertz Free-Electron Laser

Compact Free-Electron Lasers (FELs) offering broad, continuous spectral tunability are traditionally constrained by fixed-parameter magnetic structures and the necessity for high-energy electron beams. High-gain Harmonic Lasing (HL) has long been proposed as a solution to overcome these limitations; however, a robust experimental verification of this principle has remained absent. Here, we report the first experimental demonstration of high-gain HL. By employing a frequency-tunable electron beam density modulation to dominate the fundamental instability, we achieved sustained FEL amplification at the 3rd and 5th harmonics of the wiggler. The HL mode generated output power comparable to conventional fundamental operation with enhanced stability and narrower spectral bandwidth. Notably, we demonstrate that HL extends the spectral coverage by a factor of two under fixed facility constraints, achieving pulse energies up to 540 μJ. These results establish high-gain HL as a versatile mechanism for advancing compact, wavelength-flexible FEL facilities.

physics.acc-ph↗

Iterative Partition Search Variational Quantum Algorithm for Solving Shortest Vector Problem

The Partition Search Algorithm (PSA) and Iterative Quantum Optimization with an Adaptive Problem (IQOAP) are leading variational quantum algorithms for solving Shortest Vector Problem (SVP). However, each has limitations that restrict its practical impact. IQOAP suffers from ineffective iterations that fail to update the lattice basis, whereas PSA's static partitioning leads to oversized search spaces. In this work, we propose the Iterative Partition Search Algorithm (IPSA), which systematically addresses these drawbacks by integrating a "1-tailed search spaces" with a dynamic, stack-managed iterative process. Specifically, the "1-tailed" strategy ensures that every successful execution yields an effective lattice basis update, thereby eliminating the ineffective iterations associated with IQOAP. Concurrently, the dynamic iterative process reduces the required qubit count, thereby avoiding the limitation of an oversized search space inherent to PSA. We validate IPSA on the Baihua superconducting quantum processor via the Quafu platform. Small-scale real hardware experiments demonstrate that, compared to PSA, IPSA achieves a 14-fold increase in success rate at a cost of less than double the total circuit depth. Conversely, compared to IQOAP, IPSA reduces the total circuit depth by 82.7% while achieving approximately 2.5 times its success rate. Furthermore, we also conduct numerical simulations whose results are in good agreement with the experimental findings and extend our analysis.

quant-ph↗

Revisiting the first-order QCD phase transition in dense strong interaction matter

We revisit the phase structure and thermodynamics of QCD in the low temperature and high density region, where a strong, first-order phase transition is expected beyond the critical end point. By solving the quark gap equation in the continuum QCD approach, we reveal the coexistence of the multi-phases both in the microscopic dynamics of chiral symmetry breaking and also in the thermodynamic observables, which manifests the existence of spinodal decomposition during the first-order QCD phase transitions. We also analyse the interface structure of the co-exist Nambu and Wigner phases in the isothermal process during the first-order transition. In particular, the interface tension and interface entropy density are extracted from the isothermal trajectories, which further allows for an analysis on the formation of nuclear bubble, including the bubble radius and its stability at different temperatures. Our predictions may serve as useful inputs for further investigations in heavy-ion physics or astrophysics research.

hep-ph↗