Searcharxiv⌕ Search

arXiv subjects

Yuchen He

Publications and source records attributed to Yuchen He.

At least 19 recordsLinked to original sources

Super-resolution quantum imaging via multiphoton correlation

The resolution of conventional imaging is fundamentally constrained by the diffraction limit. Here we demonstrate that this limit can be overcome using classical thermal light, through the correlation of multiphoton subsystems. By resolving the photon numbers detected in the two arms of a Hanbury Brown-Twiss interferometer, the correlation function exhibits a narrowed peak or dip whose width is tunable via the average photon number. Temporal and spatial super-resolution enhancements up to 11.8-fold and 5.1-fold, respectively, are experimentally achieved. As a proof-of-principle experiment, a double-pinhole that is completely unresolved by standard ghost imaging becomes clearly distinguishable via the correlation of two-photon versus zero-photon. The principle of this super-resolution imaging can be interpreted as a combination of classical super-resolution imaging and quantum super-resolution imaging. This work provides a versatile platform for super-resolution imaging and lithography, and opens a new avenue for exploring the boundary between classical and nonclassical phenomena.

quant-ph↗

Understanding Simulated Annealing: from Weak Poincaré Inequalities to a Discrete Optimal Transport Framework

Simulated annealing follows a path of distributions from an easy initial law to a target. Standard analyses require rapid mixing at every fixed temperature, which can fail for multimodal targets even when annealing succeeds. Motivated by the continuous optimal-transport analysis of annealed Langevin dynamics by Guo, Tao, and Chen (ICLR 2025), we develop a discrete optimal-transport framework for finite-state annealing. The discrete action of the path integrates the minimum electrical energy needed to route the demand $-\partial_sπ_s$ through the chain's transition capacities. Like a path-dependent inverse conductance, it penalizes a bottleneck only when the path must move mass across it. We also introduce weak action, which leaves an $\varepsilon$ amount of this motion unrouted. Up to initialization error, action $\mathcal A$ gives reverse-KL error at most $\mathcal A/(4T)$ after $T$ expected updates, while weak action gives TV error at most $\varepsilon+\sqrt{\mathcal A^{w}_\varepsilon/(8T)}$. Paralleling canonical paths and Poincaré inequalities, we develop flow and spectral bounds, showing that pathwise (weak) Poincaré inequalities imply (weak) action bounds. We also show that a weak Poincaré inequality yields a genuine one after removing a small amount of mass. As a pathwise analogue of chain decomposition, we obtain a componentwise algorithm for mixtures with phase weights supplied at initialization. Applications include mean-field Ising and Potts models and bipartite spin systems. For every fixed $δ>0$, we give a polynomial-time single-site annealing sampler for uniform independent sets in $(d,D)$-biregular bipartite graphs with $D/d\geq1+δ$ and large $D$. To our knowledge, this is the first polynomial-time sampler requiring only a fixed multiplicative degree imbalance, strictly extending the $D\geq7d\log d$ regime of Cannon and Perkins (SODA 2020).

cs.DS↗

Nearly Optimal Submodular Sparsification, with and without Cardinality Constraints

We study the sparsification of decomposable submodular functions: given a sum $F(S) = \sum_{i=1}^m f_i(S)$ of $m$ nonnegative submodular functions on an $n$-element ground set $[n]$ (without assuming monotonicity or symmetry), the goal is to find a sparse reweighting $\widetilde{F}(S) = \sum_{i=1}^m w_i f_i(S)$ with at most $s \ll m$ nonzero weights that preserves $F(S)$ within a $(1 \pm \varepsilon)$ factor across a target family of queries. For all subset queries $S \subseteq [n]$, we give a polynomial-time randomized algorithm that constructs a sparsifier of size $O(n^2 \log n / \varepsilon^2)$. This improves upon the previous best upper bound of $O(n^3 / \varepsilon^2)$ by Kenneth and Krauthgamer and resolves their open conjecture up to a logarithmic factor, matching the $Ω(n^2)$ lower bound from directed cuts. Motivated by capacity budgets in submodular applications and the Restricted Isometry Property (RIP) in compressed sensing, we further study submodular sparsification under a cardinality constraint $|S| \le k$, and obtain a polynomial-time algorithm that constructs a sparsifier of size $O(n k \log n / \varepsilon^2)$, nearly matching the $Ω(nk)$ lower bound. This shows that a cardinality constraint unconditionally reduces the size of general submodular sparsifiers by a factor of roughly $k/n$; we complement this with $Ω(n)$ lower bounds showing that even regular symmetric or almost-regular monotone submodular functions cannot be sparsified to $o(n)$ size for $k = 2$ and $k = 1$, respectively.

cs.DS↗

SkillForge: Co-Evolving Skills and Agents via Dynamic Skill Lifecycles

Memory-augmented reinforcement learning strengthens LLM agents' ability to solve complex long-horizon tasks. Skills are one such form of memory, pairing instructions with an applicability condition over task types. However, retaining every skill indiscriminately as the policy improves lets obsolete or harmful entries accumulate and mislead the agent. We propose SkillForge, an agentic RL method that compiles and evolves the skill library through a fitness-driven skill lifecycle of trial, active, stable, and retired states, so that the skills and the model co-evolve throughout training. A pre-RL evaluation phase first uses the base model's own rollouts to pre-retire low-fitness skills, yielding a filtered library that then seeds supervised fine-tuning. Reinforcement learning takes over from this checkpoint, and at each iteration selective retirement, stabilization, and LLM-guided mutation continue to forge the skill library alongside policy optimization. Across multiple interactive agent benchmarks, SkillForge achieves the highest aggregate success rate, delivering up to 7.8% relative improvement over the strongest baseline while keeping the skill library compact throughout training. We introduce SkillFurnace, a dataset of 5k+ annotated records bundling retirement-filtered SFT trajectories, evolved skill libraries with fitness annotations, and retirement events with human-annotated failure categories to support research on skill quality and lifecycle management.

cs.AI↗

Finite-event modulation transfer through forward-scattering media

How spatial structure is transferred through a forward-scattering medium depends jointly on pattern scale and propagation distance. Starting from photon exit displacements, we derive modulation transfer while retaining the number, depths, and projected angles of individual deflections, with event occurrences described by a homogeneous Poisson process along the propagation path. The second angular moment yields a leading low-frequency loss proportional to $k^2z^3$, where $k$ is angular spatial frequency and $z$ is thickness. At finite frequency, the model predicts two coupled departures: loss bends below its low-frequency quadratic extrapolation at fixed thickness, and transfer curves separate by thickness at fixed $k^2z^3$. The leading corrections to both effects arise from the same fourth angular moment. For symmetric, nondegenerate projected-angle distributions, the full response further establishes increasing loss with thickness in the same medium at fixed joint variable. Binary-pattern measurements through TiO$_2$ suspensions span five nominal loadings, seven thicknesses, and 20 spatial frequencies, supporting the approximate low-frequency scaling and showing both departures. A Gaussian effective-angle response calibrated only on lower-frequency data predicts the held-out higher-frequency band without refitting, with a logarithmic root-mean-square error of 0.0181 compared with 0.1021 for quadratic extrapolation. The results show that finite-event statistics provide a common physical origin for spectral bending and thickness-dependent departure from low-frequency scaling, linking coarse-pattern transport to finer spatial structure.

physics.optics↗

Hardware-aware quantum attention for fast radio burst identification

Fast radio bursts (FRBs) are millisecond-duration extragalactic pulses whose discovery requires searches over large signal-parameter spaces and the rejection of candidate sets dominated by radio-frequency interference and noise. Integrating quantum processors into FRB searches requires a workflow connecting telescop data to hardware-compatible models. Here we develop a pipeline that converts raw search-mode PSRFITS data into dynamic-spectrum segments and identifies FRB-like signals using a hybrid Quantum Vision Transformer (QViT). On labelled FAST data, the selected QViT achieves a mean accuracy of 94.00% and recall of 98.30%, with similar performance to a compact classical Vision Transformer. Recall reaches 97.11% on an FRB source excluded from training and model selection. Real-device execution on 82 segments yields a mean simulator-hardware Hellinger fidelity of 0.9161 +/- 0.0074. The workflow connects raw telescope data to quantum-assisted identification and provides an experimental basis for assessing the measurement requirements that must be addressed before survey-scale deployment.

astro-ph.HE↗

Numerical Stability of Linear Algebra Operations over Relational Databases

A large body of work in the database literature develops efficient algorithms for linear algebra and machine learning over matrices defined by relational joins, yet the numerical stability of such computations has so far received no attention. This is a practical concern: a join matrix can be much larger than the input database, and the repeated copies of input values it contains compound the floating-point errors incurred by the numerical operations performed over it. This paper initiates a formal investigation of numerical stability for linear algebra over database joins. We first show that backward stability, the standard yardstick of numerical stability, loses its effectiveness in this setting: join matrices form a structured subspace of the ambient matrix space, so a perturbation explaining a computed result need not correspond to any perturbed input database. This failure already occurs for operations as simple as matrix-vector multiplication. To overcome this limitation, we introduce projected backward stability, a generalization of backward stability from the computation of one function to that of a composition of two functions, and establish its connection to classical backward stability. In our database setting, the two functions are the join query and the numerical operation. We further introduce the database condition number as the square root of the ratio of maximal to minimal number of copies of input data values into the join matrix, and show that it quantifies how a perturbation of the join matrix is amplified into a perturbation of the input database, independently of the computation used. The database condition number coincides with the classical condition number of the expansion matrix that replicates input values into the join matrix.

cs.DB↗

RATL: Learning from Retrieved Residuals for Robust Multivariate Time-Series Forecasting

Retrieval-augmented generation (RAG) complements parametric models with retrieved external evidence. The same idea is attractive for continuous-output regression, but directly reusing retrieved target values is often not robust when samples differ in output level, numerical scale, or local dynamics. Moreover, conventional forecasting pipelines generally use residuals for model optimization and error diagnosis, but do not retain individual historical residual examples as memory that can be accessed at inference time.For multivariate time-series forecasting, we propose RATL, a plug-in residual-retrieval and feedback-correction method. RATL freezes a base forecaster to construct retrieval keys and turns its historical forecast residuals into a train-only memory specific to that base model. At inference time, RATL retrieves residual trajectories from similar historical contexts subject to causal availability constraints, then uses a set-aware router operating over forecast blocks and variables to select and combine these trajectories. Experiments show that historical residuals matched to the current context contain reusable forecasting information and that RATL improves frozen base forecasters in most experimental settings. Ablations further show that learned routing strengthens raw residual feedback, while validation-based correction-strength selection limits residual over-injection.On real-world benchmarks, we use iTransformer as the primary frozen base forecaster, compare against multiple strong forecasting baselines, and test transferability across backbones. The results show that RATL can further improve base-forecaster performance in most settings.Overall, RATL shifts the retrieved object from historical target values to base-model-specific historical forecast errors, providing a plug-in, residual-memory-based paradigm for learned feedback correction in continuous-output forecasting.

cs.LG↗

The Lift Spectrum: How Measurement-to-Space Adaptivity Shapes Robustness in Image-Free Single-Pixel Sensing

Single-pixel sensing encodes a scene as a short sequence of coded measurements, and image-free methods infer the task directly from that sequence. We show that removing image reconstruction relocates the central design problem to the lift: how 1D measurements become a 2D task representation. We organize this choice as a lift spectrum from a fixed-physics inverse, through a learned static projection, to content-adaptive retrieval. These are not interchangeable forms of reconstruction: the fixed-physics route reconstructs an image consumed at inference, whereas our spatiotemporal soft-fusion (STSF) network lifts measurements directly into task features, and task-prioritized loss scheduling (TPLS) uses a separate learned reconstruction branch only as scheduled training supervision. A probe-selected recurrent encoder and a parameter-matched lift ablation identify the STSF design. In simulation, STSF+TPLS exceeds the prior image-free baseline on three datasets at 3.13% sampling (+3.2 to +9.9 pp foreground mIoU) and remains competitive down to 0.39%. The strongest clean-trained reconstruct-then-segment baseline wins without measurement noise, but measurement noise reverses the ranking: the reconstructed task input carries a 20-70x larger normalized relative perturbation than the measurements themselves. Stressed to failure, the three lift regions exhibit distinct dominant signatures--collapse, imprinting, and coarsening. STSF+TPLS transfers without fine-tuning to a real single-pixel bench, where the reversal reappears as a proof of concept; inference takes about 14 ms per mask on an RTX 4090. Within the tested fixed-acquisition regime, measurement-to-space adaptivity therefore organizes both the clean-to-noisy operating envelope and the failure a system encounters. Code and pretrained weights: https://github.com/Hanyuyuan6/STSF-TPLS.

eess.IV↗

MemeMind: Reference-Guided Trace Construction for Offline Context Optimization

Offline context optimization improves an agent by revising its instructions and examples while keeping the model frozen. This approach learns from rollouts on an adaptation set, but some queries produce only failed rollouts. In these cases, the optimizer sees no successful example of how the available tools can reach the correct answer. We introduce MemeMind, which uses an offline reference answer to recover this missing experience. TraceBuilder identifies the evidence required by the reference, executes text search, image retrieval, and visual grounding, and verifies the resulting tool trace before adding it to the adaptation buffer. ToolGuide then summarizes the collected traces into a shared guide and separate instructions for each tool. The reference answers and constructed traces are used only during adaptation, while inference uses the learned guides with a frozen model. We study this problem through Anime, Comic, and Game meme interpretation. These memes combine edited and ambiguous visual content, overlaid text, long tail franchise knowledge, and culture specific references. Their interpretation can require coordinated visual grounding, image retrieval, and text search, making them a demanding setting in which native rollout groups may fail together. We evaluate MemeMind on MemeX, a benchmark of 1,000 such memes annotated by experts. Across two Qwen3-VL models, two language partitions, and two independent judges, MemeMind improves over the strongest context optimization baseline by 22.0% and 21.1% on Qwen3-VL-30B-A3B, and by 8.1% and 8.0% on Qwen3-VL-235B-A22B under GPT-5 judging. Ablations and held out traces show that constructing successful tool use for failed groups provides the largest component gain and produces more effective evidence acquisition at inference time.

cs.CV↗

FeedbackTrack: Visual-Cortex-Inspired Cross-Frame Feedback for Transformer Tracking

Visual object tracking requires effective temporal integration, yet most Transformer trackers still rely on predominantly feed-forward feature extraction. Existing temporal mechanisms typically update templates, prompts, queries, or prediction states, while intermediate representations are rarely reused to modulate corresponding processing stages. We propose \textbf{FeedbackTrack}, a visual-cortex-inspired framework that introduces sparse, group-level layer-aligned cross-frame feedback into pretrained Transformer trackers. Previous-frame intermediate states are detached, cached, and returned to corresponding Transformer groups in the current frame through two lightweight pathways: Query Feedback for token-level query modulation and Gate Feedback for context-dependent feature modulation. FeedbackTrack preserves the original tracking pipeline with only a fixed-size one-frame cache. Across SPMTrack and ARTrackV2, FeedbackTrack consistently improves five backbone configurations on LaSOT and GOT-10k, achieving 83.4 AO and 79.1 AUC with SPMTrack-G while adding less than 1\% parameters. Controlled comparisons show that cross-frame feedback outperforms same-frame modulation by 1.8--3.2 AO points, demonstrating that the gains mainly come from recurrent historical information. Further analysis reveals a non-uniform depth-dependent organization of learned feedback strengths, highlighting the effectiveness of recurrent feedback for Transformer tracking.

cs.CV↗

Rogue Wave Statistics from a Sparse Coherent Structure Decomposition

While conventional rogue wave statistical models rely on linear or weakly nonlinear descriptions of random seas, we demonstrate experimentally that moderately or strongly nonlinear wave fields can be represented by sparse ensembles of coherent soliton-like packets. These packets exhibit log-normal amplitude distributions together with uniformly distributed phases and peak emergence times. This sparse coherent structure framework naturally leads to an extreme value description in which the probability of exceedance is governed by the tail of the coherent-structure amplitude distribution. The prediction is validated against laboratory hydrodynamic experiments across a variety of unidirectional sea states, showing good agreement with the experimental observations and comparing favourably with conventional statistical prediction models while retaining analytical simplicity. Our results provide a direct physics-based link between sparse coherent structures and rogue wave probabilities, with broader implications for nonlinear wave physics in optics, cold gases, and plasmas.

nlin.PS↗

MemeBench: What LVLMs Miss When Interpreting Culture-Dependent Memes

Large vision-language models have improved at describing visual content, but accurate descriptions do not ensure interpretation when meaning depends on knowledge beyond the pixels. Memes expose this gap because they rely on cultural entities, background knowledge, and community conventions. Most meme benchmarks reduce interpretation to labels or holistic scores, obscuring where an explanation breaks down. We introduce MemeBench, a diagnostic benchmark of 1,253 Chinese and English memes with human-written references and quality-controlled VIKR annotations, centered on anime, comics, games, and adjacent online subcultures. Its VIKR schema decomposes explanations into Visual clues, Identity links, Knowledge units, and Reasoning mechanisms. Across 26 LVLMs, every model covers visible content more reliably than the knowledge needed to interpret it, and even the strongest retains a 22.6% Visual-Knowledge gap. To test whether this diagnosis can guide improvement, we introduce KAR, an entity-guided retrieval baseline built on CultureBase. Across four controlled models, KAR raises VIKR Success by 3.6-7.4% and, compared with generic retrieval, repairs more answers and breaks fewer. Yet both retrieval conditions improve Identity and Knowledge while reducing Visual coverage in every comparison. MemeBench reveals whether an interpretation succeeds, what is missing, and whether targeted evidence fills the diagnosed gap.

cs.AI↗

Shoaling of Finite-Amplitude Rogue Waves

Rogue wave formation and enhancement over coastal areas have been documented over the last decade. However, this recent knowledge is in apparent contradiction with the established observation of sub-Gaussian wave statistics near shallow water. Current theories and experiments describe the rogue wave amplification near shallow water regimes, but only for small-amplitude waves, and thus, not accounting for wave-breaking processes. To address this gap, we perform experiments to probe inhomogeneous wave fields nearing the wave-breaking regime. We also show that by increasing the significant wave height towards the breaking limit, the kinetic energy grows faster than the variance of the surface elevation due to nonlinearity, providing a physical explanation why the occurrence of rogue wave first increases in shallower waters and suddenly decreases further shorewards.

physics.flu-dyn↗

Making Multimodal LLMs Reliable Chart Data Extractors: A Benchmark and Training Framework

Chart data extraction, which reverse-engineers data tables from chart images, is essential for reproducibility, analysis, retrieval, and redesign. Existing interactive tools are reliable but tedious, and mixed-initiative systems, while more efficient, lack generalizability. Recent multimodal large language models (MLLMs) offer a unified interface for chart interpretation, yet their ability to extract accurate data tables, especially without visible labels, remains unclear. We build a benchmark featuring diverse real-world charts without data labels to evaluate this capability. Results show that, while current MLLMs reliably reconstruct table structures, they struggle with precise value recovery. To address this, we revisit chart data extraction from a human-centered perspective and argue that extraction should follow a progressive learning process similar to how people read charts. Our training framework substantially improves numerical accuracy, achieving state-of-the-art performance with a 7B-parameter model. A user study further shows that our model effectively supports mixed-initiative workflows for reliable chart data extraction.

cs.HC↗

SAW: Stage-Aware Dynamic Weighting for Multi-Objective Reinforcement Learning in Large Language Models

Although multi-objective reinforcement learning (MORL) is central to aligning large language models with complex human preferences, the prevailing practice of static weighted summation overlooks a more fundamental phenomenon: reward learning is markedly asynchronous across objectives. Well-learned dimensions quickly produce homogeneous, low-variance signals whose residual noise contaminates the aggregated reward (in GRPO) or occupies a fixed share of the advantage budget (in GDPO), interfering with the scarce yet high-value signals carried by under-learned dimensions. To address this asynchrony, we propose Stage-Aware Dynamic Weighting (SAW), a lightweight, algorithm-agnostic dynamic weighting mechanism. SAW utilizes the coefficient of variation (CV) as a scale-invariant proxy for real-time informativeness, reweighting each dimension's reward or advantage contribution by its relative informativeness within the batch. Unlike gradient-based methods that require multiple forward and backward passes, SAW relies solely on batch-level statistics, introducing nearly negligible computational overhead. Experiments on tool-calling and text summarization tasks demonstrate that SAW consistently improves both training efficiency and final performance under both GRPO and GDPO frameworks, confirming it as a general-purpose plug-in for multi-reward LLM alignment. Our code is available at https://github.com/Zhaolutuan/SAW

cs.LG↗

PRIMED: Adaptive Modality Suppression for Referring Audio-Visual Segmentation via Biased Competition

Referring Audio-Visual Segmentation (Ref-AVS) seeks to localize and segment target objects in video frames based on visual, auditory, and textual referring cues. The task is challenging because the relevance of different modalities varies across referring expressions and scenes, while existing methods typically treat multimodal cues as homogeneous inputs for fusion, prompting, or reasoning, making them vulnerable to irrelevant or misleading modalities. To address this problem, we propose PRIMED, inspired by the biased competition theory in cognitive neuroscience, which explicitly models both visual perception and language-driven prior modulation, and enables more accurate Ref-AVS by adaptive modality suppression. Specifically, a Modality Prior Decoder first estimates whether the referring expression relies primarily on audio, vision, or their joint interaction, generating a modality prior to adaptively guide high-level attention. A Token Distiller further extracts compact global visual tokens from high-level features and shares them across Competition-aware Cross-modal Fusion modules to provide hierarchical global context. Additionally, we introduce a Spatial-Aware Semantic Alignment loss to further enhance foreground-background discrimination through contrastive learning. Extensive experiments on the Ref-AVS benchmark demonstrate that PRIMED achieves state-of-the-art overall performance.

cs.CV↗

Observation antibunching with classical light in a linear interferometer

Understanding the boundary between classical and nonclassical phenomena is important for both fundamental researches in quantum optics and applications in quantum information. One of the most interesting research directions in this field is exploring nonclassical effects with classical light. In this paper, we will show that it is possible to observe antibunching with thermal light in a Hanbury Brown-Twiss interferometer by treating single-photon detectors as photon-number-resolving detectors to perform photon-number projection measurements. Both temporal and spatial antibunching is observed via the correlation of two detectors detecting one and zero photon, respectively. By comparing the measured results of thermal and laser light, it is found that the observed antibunching arises from the combined effect of photon statistics of thermal light and photon-number projection measurement.The classical and nonclassical nature of the observed antibunching is analyzed. The results are helpful to understand the connection between classical and nonclassical correlation and may find applications in multiphoton interference and quantum imaging.

quant-ph↗