Searcharxiv⌕ Search

arXiv subjects

Yue Yu

Publications and source records attributed to Yue Yu.

At least 73 records · Page 4Linked to original sources
arXiv2026

Schrödingerization for quantum linear systems problems with near-optimal dependence on matrix queries

We develop a quantum algorithm for linear algebraic equations $ A\bb{x} = \bb{b} $ from the perspective of Schrödingerization-form problems, which are characterized by a system of linear convection equations in one higher dimension. When $ A $ is positive definite, the solution $ \bb{x} $ can be interpreted as the steady-state solution to a system of linear ordinary differential equations (ODEs). This ODE system can be solved by using the linear combination of Hamiltonian simulation (LCHS) method in \cite{ACL2023LCH2}, which serves as the continuous implementation of the Fourier transform in the Schrödingerization method from \cite{JLY22SchrShort, JLY22SchrLong}. Schrödingerization transforms linear partial differential equations (PDEs) and ODEs with non-unitary dynamics into Schrödinger-type systems via the so-called warped phase transformation that maps the equation into one higher dimension. When $ A $ is a general Hermitian matrix, the inverse matrix can still be represented in the LCHS form in \cite{ACL2023LCH2}, but with a kernel function based on the Fourier approach in \cite{Childs2017QLSA}. Although this LCHS form provides the steady-state solution to a system of linear ODEs associated with the least-squares equation, applying Schrödingerization to this least-squares system is not appropriate, as it results in a much larger condition number. We demonstrate that in both cases, the solution $ \bb{x} $ can be expressed as the LCHS of Schrödingerization-form problems. We provide a detailed implementation and error analysis. Furthermore, we incorporate a block preconditioning technique to achieve nearly linear scaling in the condition number, thereby attaining near-optimal query complexity.

quant-ph↗
arXiv2026

Optimal error analysis of an interior penalty virtual element method for fourth-order singular perturbation problems

In recent studies \cite{ZZ24, FY24}, the Interior Penalty Virtual Element Method (IPVEM) has been developed for solving a fourth-order singular perturbation problem, with uniform convergence established in the lowest-order case concerning the perturbation parameter. However, the resulting uniform convergence rate is only of half-order, which is suboptimal. In this work, we demonstrate that the proposed IPVEM in fact achieves optimal and uniform error estimates, even in the presence of boundary layers. The theoretical results are substantiated through extensive numerical experiments, which confirm the validity of the error estimates and highlight the method's effectiveness for singularly perturbed problems.

math.NA↗
arXiv2026

Compressive hyperspectral phasor imaging with single-pixel detection for spectral tasks

Spectral vision task plays a pivotal role in extracting discriminative spectral-spatial features from high-dimensional data, enabling fine-grained identification beyond human vision. Traditional methods usually involve first collecting rich spectral-spatial information and then using complex algorithms to digitally process it into scene classification and recognition. However, the complexity of processing massive three-dimensional (3D) hyperspectral datasets poses challenges for algorithms. Here, we demonstrate a compressive Hyperspectral Phasor Imaging with Single-pixel detection (HyPIS) that leverages highly compressed spatial-spectral data to achieve spectral task. Two optical encoders are used for wavelength-dependent sine- and cosine-encoding that transforms spectral signals into a two-dimensional (2D) phasor plot. By applying spatial-temporal illumination patterns, a single-pixel detector is enough to reconstruct the phasor image of the object. This allows to directly generate pixel-wise spectral task, bypassing 3D hyperspectral data. Our experiments show that HyPIS can perform real-time classification and recognition tasks of different scenes, reducing the required amount of data by two orders of magnitude, and it can still accurately classify under low light and uneven lighting conditions. This work develops a completely new spectral technology that enables spectral tasks to be performed without obtaining high-resolution hyperspectral datasets, holding promise for spectral applications in mobile devices, robotics, and satellite technologies.

physics.optics↗
arXiv2026

Quantum algorithms for the fractional Poisson equation via rational approximation

This paper presents a quantum algorithm for solving the fractional Poisson equation \((-Δ)^s u = f\) with \(s \in (0,1)\) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage. The rational approximation represents the inverse fractional Laplacian as a weighted sum of standard resolvents, transforming the original nonlocal problem into a collection of shifted integer-order partial differential equations. These equations are consolidated into a single large linear system through a modified right-hand side construction that simplifies the quantum implementation. To enable practical implementation, we develop explicit quantum circuits via the Schrödingerization technique, which converts the non-unitary dynamics of the linear system into a higher-dimensional Schrödinger-type equation, allowing the use of standard Hamiltonian simulation. The circuit construction leverages the decomposition of shift operators to realize the discrete Laplacian and employs controlled operations to implement the select oracle. Under finite difference discretization, we provide detailed algorithmic procedures utilizing block-encoding techniques for the coefficient matrices. A comprehensive complexity analysis demonstrates that the quantum algorithm achieves a dependence on the inverse mesh size \(h^{-1}\) that is independent of the spatial dimension \(d\), in stark contrast to classical methods which suffer from exponential growth in high dimensions. This establishes an exponential quantum advantage for high-dimensional fractional problems, effectively overcoming the curse of dimensionality that limits classical approaches.

quant-ph↗
arXiv2026

Benchmarking PhD-Level Coding in 3D Geometric Computer Vision

AI-assisted coding has rapidly reshaped software practice and research workflows, yet today's models still struggle to produce correct code for complex 3D geometric vision. If models could reliably write such code, the research of our community would change substantially. To measure progress toward that goal, we introduce GeoCodeBench, a PhD-level benchmark that evaluates coding for 3D vision. Each problem is a fill-in-the-function implementation task curated from representative papers at recent venues: we first let a tool propose candidate functions from official repositories, then perform careful human screening to select core 3D geometric components. For every target, we generate diverse, edge-case unit tests, enabling fully automatic, reproducible scoring. We evaluate eight representative open- and closed-source models to reflect the current ecosystem. The best model, GPT-5, attains only 36.6% pass rate, revealing a large gap between current capabilities and dependable 3D scientific coding. GeoCodeBench organizes tasks into a two-level hierarchy: General 3D capability (geometric transformations and mechanics/optics formulation) and Research capability (novel algorithm implementation and geometric logic routing). Scores are positively correlated across these axes, but research-oriented tasks are markedly harder. Context ablations further show that "more paper text" is not always better: cutting off at the Method section statistically outperforms full-paper inputs, highlighting unresolved challenges in long-context scientific comprehension. Together, these findings position GeoCodeBench as a rigorous testbed for advancing from generic coding to trustworthy 3D geometric vision coding.

cs.CV↗
arXiv2026

Nonlinear Trajectory Optimization Models for Energy-Sharing UAV-UGV Systems with Multiple Task Locations

Energy-sharing UAV-UGV systems extend the endurance of Uncrewed Aerial Vehicles (UAVs) by leveraging Uncrewed Ground Vehicles (UGVs) as mobile charging stations, enabling persistent autonomy in infrastructure-sparse environments. Trajectory optimization for these systems is often challenging due to UGVs' terrain access constraints and the discrete nature of task scheduling. We propose a smooth nonlinear program model for the joint trajectory optimization for these systems. Unlike existing models, the proposed model allows smooth parameterization of UGVs' terrain access constraints and supports partial UAV recharging. Further, it introduces a smooth approximation of disjunctive constraints that eliminates the need for computationally expensive integer programming and enables efficient solutions via nonlinear programming algorithms. We demonstrate the proposed model on a one-UAV-one-UGV system with multiple task locations. Compared with mixed-integer nonlinear programs, this model reduces the computation time by orders of magnitude.

math.OC↗
arXiv2026

The Load Management Paradox: Correcting the Healthy-Worker Survivor Effect in NBA Injury Modeling

In professional sports analytics, evaluating the relationship between accumulated workload and injury risk is a central objective. However, naive survival models applied to NBA game-log data consistently yield a paradox: players who recently logged heavy minutes appear less likely to sustain an injury. We demonstrate that this counterintuitive result is an artifact of the healthy-worker survivor effect, wherein conditioning on game participation induces severe collider bias driven by unobserved latent fitness. To address this structural confounding, we develop a Marginal Structural Piecewise Exponential Model (MS-PEM) that unifies inverse probability of treatment weighting (IPTW) with flexible piecewise-exponential additive models and weighted cumulative exposure (WCE). A simulation study confirms that this selection mechanism is mathematically sufficient to entirely reverse the sign of the true association between workload and injury. Applying the MS-PEM to 78,594 player-game observations across three NBA seasons (encompassing 771 players and 2,439 injury events), we find that adjusting for observed selection reliably shifts the hazard back toward the underlying physiological relationship. While the exact magnitude of the correction is sensitive to outcome-model regularization (attenuating the paradoxical weight function by 1% to 2% under conservative cross-validation and up to 63% to 78% under lighter penalization), the positive direction of the causal correction is highly robust across multiple propensity specifications and doubly robust checks. Ultimately, these results provide a methodological template for bias-aware sports injury modeling, while cautioning that models relying strictly on observational game logs will systematically underestimate the true risk of heavy workloads without richer physiological data for full causal identification.

stat.AP↗
arXiv2026

Agile-VLA: Few-Shot Industrial Pose Rectification via Implicit Affordance Anchoring

Deploying Vision-Language-Action (VLA) models on resource-constrained edge platforms encounters a fundamental conflict between high-latency semantic inference and the high-frequency control required for dynamic manipulation. To address the challenge, this paper presents Agile-VLA, a hierarchical framework designed for industrial pose reorientation tasks on edge devices such as the NVIDIA Jetson Orin Nano. The core innovation is an Implicit Affordance Anchoring mechanism that directly maps geometric visual cues, specifically centroid and rim keypoint anchors, into structured parametric action primitives, thereby substantially reducing reliance on high-latency semantic inference during closed-loop control. By decoupling perception (10 Hz) from control (50 Hz) via an asynchronous dual-stream architecture, the system effectively mitigates the frequency mismatch inherent in edge-based robot learning. Experimental results on a standard 6-DoF manipulator demonstrate that Agile-VLA achieves robust rectification of complex, irregular workpieces using only 5-shot demonstrations through extrinsic dexterity.

cs.RO↗
arXiv2026

PiCo: Active Manifold Canonicalization for Robust Robotic Visual Anomaly Detection

Industrial deployment of robotic visual anomaly detection (VAD) is fundamentally constrained by passive perception under diverse 6-DoF pose configurations and unstable operating conditions such as illumination changes and shadows, where intrinsic semantic anomalies and physical disturbances coexist and interact. To overcome these limitations, a paradigm shift from passive feature learning to Active Canonicalization is proposed. PiCo (Pose-in-Condition Canonicalization) is introduced as a unified framework that actively projects observations onto a condition-invariant canonical manifold. PiCo operates through a cascaded mechanism. The first stage, Active Physical Canonicalization, enables a robotic agent to reorient objects in order to reduce geometric uncertainty at its source. The second stage, Neural Latent Canonicalization, adopts a three-stage denoising hierarchy consisting of photometric processing at the input level, latent refinement at the feature level, and contextual reasoning at the semantic level, progressively eliminating nuisance factors across representational scales. Extensive evaluations on the large-scale M2AD benchmark demonstrate the superiority of this paradigm. PiCo achieves a state-of-the-art 93.7% O-AUROC, representing a 3.7% improvement over prior methods in static settings, and attains 98.5% accuracy in active closed-loop scenarios. These results demonstrate that active manifold canonicalization is critical for robust embodied perception.

cs.CV↗
arXiv2026

PHANTOM Hand

Tendon-driven underactuated hands excel in adaptive grasping but often suffer from kinematic unpredictability and highly non-linear force transmission. This ambiguity limits their ability to perform precise free-motion shaping and deliver reliable payloads for complex manipulation tasks. To address this, we introduce the PHANTOM Hand (Hybrid Precision-Augmented Compliance): a modular, 1:1 human-scale system featuring 6 actuators and 15 degrees of freedom (DoFs). We propose a unified framework that bridges the gap between precise analytic shaping and robust compliant grasping. By deriving a sparse mapping from physical geometry and integrating a mechanics-based compensation model, we effectively suppress kinematic drift caused by spring counter-tension and tendon elasticity. This approach achieves sub-degree kinematic reproducibility for free-motion planning while retaining the inherent mechanical compliance required for stable physical interaction. Experimental validation confirms the system's capabilities through (1) kinematic analysis verifying sub-degree global accuracy across the workspace; (2) static expressibility tests demonstrating complex hand gestures; (3) diverse grasping experiments covering power, precision, and tool-use categories; and (4) quantitative fingertip force characterization. The results demonstrate that the PHANTOM hand successfully combines analytic kinematic precision with continuous, predictable force output, significantly expanding the payload and dexterity of underactuated hands. To drive the development of the underactuated manipulation ecosystem, all hardware designs and control scripts are fully open-sourced for community engagement.

cs.RO↗
arXiv2026

C$^2$-Cite: Contextual-Aware Citation Generation for Attributed Large Language Models

The attribution technique enhances the credibility of LLMs by adding citations to the generated sentences, enabling users to trace back to the original sources and verify the reliability of the output. However, existing instruction-tuned attributed LLMs often fail to properly interpret the contextual semantics of citation symbols (e.g., [i]) during text generation. This shortcoming arises from their insufficient awareness of the context information surrounding citation markers, which in turn leads to disjointed references and poor integration of retrieved knowledge into the generated content. To address this issue, we propose a novel \textbf{C}ontextual-aware \textbf{C}itation generation framework (\textbf{C$^2$}-\textbf{Cite}) that explicitly integrates the semantic relationships between citation markers and their referenced content. Specifically, a contextual citation alignment mechanism is adopted: it first encodes the retrieved document contexts into the symbol representation of citations, then aligns the marker numbers by decoding information from a citation router function. This mechanism enables the transformation of citation markers from generic placeholders into active knowledge pointers that link to the referenced source information. Experimental results on the ALCE benchmark across three datasets validate our framework C$^2$-Cite++: it outperforms the SOTA baseline by an average of 5.8\% in citation quality and 17.4\% in response correctness. The implementation is publicly available at https://github.com/BAI-LAB/c2cite

cs.IR↗
arXiv2026

Temperature-dependent acoustic loss at microwave frequencies in thin-film lithium niobate

Thin-film lithium niobate (TFLN) has emerged as a versatile platform for phononic and photonic devices with applications ranging from classical signal processing to quantum technologies. However, acoustic loss fundamentally limits the performance of acoustic devices on TFLN platforms, yet its physical origin remains insufficiently understood. Here, we systematically investigate acoustic propagation loss in various TFLN platforms, including lithium niobate on insulator (LNOI), lithium niobate on sapphire (LNOS), suspended LN thin films, and bulk LN at gigahertz frequencies over temperatures ranging from 4 K to above room temperature. Using a delay-line method, we extract frequency- and temperature-dependent losses for Rayleigh, shear-horizontal, and Lamb modes. We observe an anomalous non-monotonic temperature dependence in LNOI that closely resembles acoustic loss in amorphous materials, indicating a dominant loss channel associated with the buried oxide layer at low temperatures. At elevated temperatures, the loss converges to the Akhiezer damping governed by phonon-phonon interactions. High-resolution electron microscopy further reveals nanoscale interfacial crystal impurities that may contribute to the increased acoustic loss in TFLN platforms relative to bulk LN. These results elucidate the acoustic loss mechanisms in TFLN and provide guidelines for designing low-loss acoustic devices.

physics.app-ph↗
arXiv2026

A Deep-Learning-Boosted Framework for Quantum Sensing with Nitrogen-Vacancy Centers in Diamond

Nitrogen-vacancy (NV) centers in diamond are a versatile quantum sensing platform for high sensitivity measurements of magnetic fields, temperature and strain with nanoscale spatial resolution. A common bottleneck is the analysis of optically detected magnetic resonance (ODMR) spectra, where target quantities are encoded in resonance features. Conventional nonlinear fitting is often computationally expensive, sensitive to initialization, and prone to failure at low signal-to-noise ratio (SNR). Here we introduce a robust, efficient machine learning (ML) framework for real-time ODMR analysis based on a one-dimensional convolutional neural network (1D-CNN). The model performs direct parameter inference without initial guesses or iterative optimization, and is naturally parallelizable on graphics processing units (GPU) for high-throughput processing. We validate the approach on both synthetic and experimental datasets, showing improved throughput, accuracy and robustness than standard nonlinear fitting, with the largest gains in the low-SNR regime. We further validate our methods in two representative sensing applications: diagnosing intracellular temperature changes using nanodiamond probes and widefield magnetic imaging of superconducting vortices in a high-temperature superconductor. This deep-learning inference framework enables fast and reliable extraction of physical parameters from complex ODMR data and provides a scalable route to real-time quantum sensing and imaging.

quant-ph↗
arXiv2026

Examining Reasoning LLMs-as-Judges in Non-Verifiable LLM Post-Training

Reasoning LLMs-as-Judges, which can benefit from inference-time scaling, provide a promising path for extending the success of reasoning models to non-verifiable domains where the output correctness/quality cannot be directly checked. However, while reasoning judges have shown better performance on static evaluation benchmarks, their effectiveness in actual policy training has not been systematically examined. Therefore, we conduct a rigorous study to investigate the actual impact of non-reasoning and reasoning judges in reinforcement-learning-based LLM alignment. Our controlled synthetic setting, where a "gold-standard" judge (gpt-oss-120b) provides preference annotations to train smaller judges, reveals key differences between non-reasoning and reasoning judges: non-reasoning judges lead to reward hacking easily, while reasoning judges can lead to policies that achieve strong performance when evaluated by the gold-standard judge. Interestingly, we find that the reasoning-judge-trained policies achieve such strong performance by learning to generate highly effective adversarial outputs that can also score well on popular benchmarks such as Arena-Hard by deceiving other LLM-judges. Combined with our further analysis, our study highlights both important findings and room for improvements for applying (reasoning) LLM-judges in non-verifiable LLM post-training.

cs.AI↗
arXiv2026

Ferroaxial magnets: time-reversal-even mirror symmetry violation from spin order

We investigate ferroaxial magnets, a new class of spin-order-driven multiferroic magnets in which magnetic ordering induces mirror-symmetry breaking while preserving both time-reversal and spatial-inversion symmetries. These systems exhibit a ferromagnet-like axial anisotropy that allows optical control of the ferroaxial polarization, while their macroscopic time-reversal symmetry makes them attractive for antiferromagnetic spintronics. Using spin crystallographic group analysis, we identify the candidate materials and the nonrelativistic ferroaxial nature stemming from the strong exchange splitting of magnets. Furthermore, a symmetry-based identification shows magnetic materials that host ferroaxial order and metallic conductivity, realizing the ferroaxial metal state that undergoes a ferroaxial phase transition while remaining metallic. As a direct probe for the ferroaxial metal, we propose a third-order nonlinear Hall effect originating from the transverse coupling between the electric field and Berry curvature dipole mediated by the ferroaxial anisotropy. Our results establish ferroaxial magnets as a platform for nonrelativistic multiferroicity and spintronic applications.

cond-mat.mtrl-sci↗
arXiv2026

Flash from the Past: New Gamma-Ray Constraints on Light CP-even Scalar from SN1987A

We derive new constraints on light CP-even scalars using old gamma-ray observations in the direction of SN1987A by the Solar Maximum Mission (SMM) satellite. Light scalars can be abundantly produced in the supernova core via the nucleon bremsstrahlung process, can stream out of the supernova-environment and decay into photons -- either primary photons or secondary photons from lepton-antilepton pairs -- thus leading to a gamma-ray signal. From the non-observation of excess photon flux by SMM after the detection of the neutrino burst from SN1987A, we set new constraints on the mixing angle of the CP-even scalar with the Standard Model Higgs boson.

hep-ph↗
arXiv2026

SpecFuse: Ensembling Large Language Models via Next-Segment Prediction

Ensembles of generative large language models (LLMs) are a promising way to compensate for individual model limitations, integrating the strengths of different LLMs. Existing LLM ensemble methods, however, face limitations such as first-token delay and challenges in long-range semantic collaboration between models, Moreover, they typically assume equal voting weights for all models during ensemble, ignoring task-specific performance differences among models. In this work, we propose SpecEM, a training-free, plug-and-play LLM ensemble framework that dynamically adjusts each model's model contribution in real time based on task performance. Inspired by speculative decoding, SpecEM iteratively performs drafting and verification, allowing models to collaborate semantically at the segment level for integrated output. Furthermore, we introduce an online feedback mechanism with multiplicative weight updates, where each model's voting weight is adjusted on-the-fly according to how often it outperforms others during verification stage, ensuring that stronger models exert greater influence during ensembling. Experimental results on five LLM families (ranging from 7B to 72B parameters) and six benchmark datasets, spanning open-domain instruction following, reasoning, commonsense, demonstrate consistent performance improvements compared to state-of-the-art LLM ensemble methods. Our code is available at https://github.com/lvbotenbest/SpecEM.

cs.CL↗
arXiv2026

SecP-Tuning: Efficient Privacy-Preserving Prompt Tuning for Large Language Models via MPC

Large Language Models (LLMs) have revolutionized numerous fields, yet their adaptation to specialized tasks in privacy-sensitive domains such as healthcare and finance remains constrained due to the scarcity of accessible training data caused by stringent privacy requirements. Secure Multi-party Computation (MPC)-based privacy-preserving machine learning provides theoretical guarantees for the privacy of model parameters and data. However, its application to LLMs has been predominantly limited to inference, as fine-tuning introduces significant efficiency challenges, particularly in backward propagation, optimizer, and self-attention operations. To address these challenges, we propose SecP-Tuning, the first MPC-based framework designed for efficient, privacy-preserving prompt tuning of LLMs. SecP-Tuning innovatively integrates Forward-only Tuning (FoT) through the ``data owner-server interaction" paradigm, effectively removing the need for privacy-preserving computations in backward propagation and optimization processes. Furthermore, it devises an efficient privacy-preserving Random Feature Attention (RFA), effectively mitigating the computational complexity of softmax-based self-attention and circumventing MPC-incompatible nonlinear operations. Experimental results demonstrate that, compared to full-Parameter Supervised Fine-Tuning (SFT) and gradient-based prompt tuning, SecP-Tuning achieves approximately 12x and 16x end-to-end acceleration, as well as 17x and 20x reductions in communication overhead, respectively. Moreover, it delivers performance comparable to gradient-based methods across multiple few-shot tasks.

cs.LG↗