arXiv subjects

Chen Jia

Publications and source records attributed to Chen Jia.

At least 19 recordsLinked to original sources

arXiv2026

Transmission and filtering of stochastic rhythms in bursty gene expression

How stochastic rhythms in upstream regulatory signals are transmitted to downstream gene expression is a fundamental question in systems biology. Although experiments have shown that molecular degradation strongly influences downstream rhythmic responses, a general quantitative theory explaining how degradation, stochastic bursting, and upstream timing variability jointly govern rhythm transmission remains lacking. Here we develop a general analytical framework based on a martingale-based orthogonal decomposition, applicable to arbitrarily complex upstream dynamics, including memory effects. We derive exact autocorrelation and power-spectrum transmission laws, establish an oscillation-efficiency contraction principle, and identify a critical degradation rate that provides a necessary and sufficient condition for stochastic rhythm transmission. An explicit rhythm-transmission relation reveals that increasing burst frequency and modulation depth promotes rhythm transmission, whereas greater variability in upstream cycle duration suppresses it. In particular, increasing burst size leaves oscillation efficiency unchanged. The predicted degradation threshold correctly separates all ten pulsing and nonpulsing p53 target proteins reported in previous experiments. These results provide a theoretical foundation for understanding how cells selectively preserve or integrate rhythmic regulatory signals.

q-bio.MN↗

arXiv2026

Fundamental Bounds on the Oscillation Efficiency of Markov Networks

Stochastic oscillations are commonly identified through peaks in their power spectra, yet the fundamental limits on their strength and energetic cost remain unclear. Here we establish universal dynamical and thermodynamic bounds on oscillation efficiency in Markov networks, showing how finite state spaces constrain spectral peak enhancement. In particular, we demonstrate that networks maximizing modal coherence need not maximize oscillation efficiency. We further derive dissipation bounds that connect oscillation efficiency to the relaxation speed and stationary probabilities, revealing an unavoidable energetic cost of maintaining pronounced oscillations at a specified relaxation timescale. These bounds remain strictly positive in regimes where existing explicit spectral dissipation estimates vanish, with stronger constraints for normal networks and uniform rings. Our results distinguish spectral oscillatory strength from modal coherence and reveal how network dynamics and thermodynamic dissipation jointly limit stochastic oscillations.

cond-mat.stat-mech↗

arXiv2026

Long-time behavior of reducible stochastic linear reaction networks: a spectral and structural classification

Exponential ergodicity of stochastic reaction networks has attracted considerable attention in recent years [SIAM J. Appl. Dyn. Syst. 24, 1668-1710 (2025)]. Here, we provide a structural classification of the long-time behavior of reducible stochastic linear reaction networks under the $L^1$-Wasserstein and total variation distances. The classification is determined by the maximal eigenvalue $λ_{\max}$ of the first-order influx matrix $A$, the position of the zero-order influx vector $b$ relative to the left nullspace of $A$, and the conservation-law structure of the network restricted to the persistent species. We first prove that every stochastic linear reaction network is non-explosive. In the stable regime $λ_{\max}<0$, the process converges exponentially fast to a unique stationary distribution. In the critical regime $λ_{\max}=0$, when the zero eigenvalue of $A$ is semisimple and $b$ is orthogonal to the left nullspace of $A$, exponential convergence occurs if and only if a regularity condition on the restricted network is satisfied. If these two spectral conditions hold but the regularity condition fails, convergence occurs only in total variation and is non-exponential. In the divergent regimes, no closed irreducible positive recurrent class can contain an interior state, and any stationary distribution, if it exists, must be supported on the boundary. Moreover, by employing a coupling method, we obtain the optimal convergence rate in the exponentially convergent cases.

math.PR↗

arXiv2026

Sharp Critical Minimax Laws and No-Learning Thresholds in Continuous-Time Adaptive Control

We study episodic continuous-time control with an unknown vector control gain, scalar state, quadratic action cost, and smooth convex terminal cost. In the scalar Gaussian experiment, let $Δ(H)$ denote the minimax improvement over zero control and set $δ=\sqrt2H^2-1$. We prove the critical law $$ Δ(H)\asymp δ^4\sqrt{\log(1/δ)} \qquad (δ\downarrow0), $$ with a matching lower and upper bound. The lower bound follows from a uniform deficit--energy inequality valid for fully adaptive controls with unbounded amplitudes, while a moving soft-threshold feedback attains the rate. For local parameters $θ=N^{-1/4}h$, $|h|\le H$, we show that the normalized minimax regret over $N$ episodes is within $O(N^{-1/2})$ of a fixed-horizon Gaussian sequential control problem, without an additional dimension factor. The terminal task enters the limit only through $c_g=\operatorname{Var}(g(Z))$. The Gaussian problem exhibits an exact no-learning phase transition: $$ C_d^T(H)=TH^2/2 \iff H^4T\le d^2/2, $$ yielding the asymptotic task boundary $c_gH^4=d^2/2$.

math.OC↗

arXiv2026

TTRSD: Test-Time Reinforcement Learning with Self-Distillation for Vision-Language Models

Test-time reinforcement learning enables vision-language models (VLMs) to adapt using unlabeled inputs. However, repeated sampling under fixed visual conditions can reinforce shared perceptual errors, while sequence-level rewards fail to isolate visual perception the foundational bottleneck that anchors multimodal reasoning risking the degradation of pre-trained reasoning capabilities. We propose TTRSD, a test-time reinforcement learning framework combining multi-view answer-level self-distillation with visual contrastive token selection. A shared policy aggregates teacher predictions across original, cropped, and downsampled views into an answer distribution. Student trajectories generated from the original image receive rewards based on the support for their final answers in this distribution. To allocate this feedback precisely toward perceptual bottlenecks, we compare the log-probabilities of the same sampled tokens under original and visually ablated inputs while holding their textual prefixes fixed, selecting visually sensitive positions for policy-gradient updates. TTRSD separates update direction, determined by group-relative advantages, from update position, determined by visual sensitivity, without requiring ground-truth labels, external verifiers, or a separate teacher. With only 20 unlabeled adaptation samples, TTRSD improves performance across seven benchmarks and three VLMs, raising InternVL3-2B's MMMU accuracy from 35.79% to 49.32%(+13.53%), demonstrating cross-dataset generalization while preserving inherent reasoning integrity.

cs.CV↗

arXiv2026

Compass: Degradation-Simulated Reciprocal Learning with Lightweight Needle RWKV for Multimodal Crack Segmentation under Missing Modalities

In multimodal crack segmentation for industrial facilities, the key challenge is preventing missing modalities from degrading pixel-level performance while maintaining low computational cost. Existing methods struggle to address semantic degradation caused by missing modalities. We propose Compass, a lightweight network for robust crack segmentation under arbitrary missing modalities. Compass comprises Degradation Simulation Distillation (DSD), Needle Block, and Evidential Topology-Preserving Fusion (ETPF). DSD constructs a degradation simulation stream that mimics more severe missing conditions and performs reciprocal distillation with the original stream, decoupling complete perception from degradation adaptation. Within DSD, Feature-Aware Prototype Transmitter (FAPT) performs modality agnostic prototype-guided feature completion to maintain semantic integrity under incomplete modality conditions. As a lightweight backbone, Needle injects crack-direction cues into WKV modulation and combines connectivity-aware gating with anisotropic context probing for structure-aware modeling. ETPF fuses multimodal features via Dempster-Shafer evidential combination with uncertainty-gated decoding, preserving crack topology while suppressing unreliable features. Experiments on three datasets demonstrate state-of-the-art (SOTA) performance under diverse missing modality scenarios. Even with 90\% depth modality missing on CrackDepth, Compass achieves F1 of 0.8216 and mIoU of 0.8434 with only 2.58M parameters. The code is available at https://github.com/Karl1109/Compass.

cs.CV↗

arXiv2026

MAC-XA: Multi-view Anatomy-Correspondence Fusion for Coronary Stenosis Reporting from X-ray Angiography

Multi-view reasoning in coronary X-ray angiography is inherently a cross-projection geometric problem, yet automated report generation in this setting remains largely unexplored. The 3D vascular topology leads to projection-dependent branch overlap and foreshortening, rendering single-view modeling fundamentally incomplete and unstable for lesion localization and stenosis grading. Although multi-view fusion appears promising, learning anatomically consistent fusion from real angiograms is impeded by a critical limitation: cross-view alignment is unobservable and cannot be explicitly supervised. Consequently, conventional fusion relies on implicit correlations rather than verified anatomical correspondence. We address this by reformulating multi-view stenosis reporting as an alignment-constrained aggregation problem. A controllable synthetic angiography generation strategy is introduced to expose geometry-derived patch-level correspondence supervision unavailable in real data. An anatomy-correspondence module learns cross-view correspondence matrices that explicitly align auxiliary features within the main-view coordinate space prior to fusion, thereby constraining evidence aggregation to anatomically consistent regions. Experiments on synthetic data and zero-shot transfer to real angiograms show that this alignment-constrained design improves correspondence consistency and structured stenosis reporting compared to single-view modeling and conventional multi-view fusion methods. The code will be publicly available upon publication.

cs.CV↗

arXiv2026

Appearance-Preserving Refinement of Generated 3D Assets for Monochromatic Fabrication

Recent advances in 3D mesh generation have enabled the creation of visually realistic assets. However, much of their visual fidelity is encoded in textures rather than geometry. When such assets are fabricated using monochromatic materials, texture information is largely lost, causing visually important details to disappear even when the original geometry is faithfully preserved. A key challenge is that the geometric perturbations required to recover texture-dependent appearance cues often introduce sharp local features and high-frequency surface structures, which may increase stress concentration and fabrication risk. In this paper, we present GenMF, an appearance-oriented geometry refinement framework for monochromatic fabrication. GenMF transforms texture-dependent visual cues into geometry-induced shading effects and formulates geometry refinement as a balance between appearance preservation and fabrication-oriented robustness. To discourage structurally and narrow the gap between simulation and physical manufacturing, we further introduce a differentiable stress-aware regularization based on a learned thermal-stress predictor. Experimental results demonstrate that GenMF significantly improves appearance preservation under monochromatic rendering while reducing stress concentration under a consistent thermo-mechanical simulation setting. Physical 3D printing examples further show that the refined geometries preserve more recognizable visual details while remaining suitable for fabrication. These results suggest that appearance-aware geometry refinement provides an effective bridge between generated 3D assets and fabrication-ready monochromatic objects.

cs.GR↗

arXiv2026

See More, Think Deeper: Query-Expanded Visual Evidence and Answer-Clue Guided Reflection for Long Video Understanding

Recent advances in Video Large Language Models (Video-LLMs) have enabled performance on long-video understanding tasks. However, existing methods still face two key limitations: evidence acquisition often relies on a single search intent, and answer generation lacks an effective visual feedback mechanism. To address these limitations, we propose \textbf{CoVER}, a Comprehensive Visual Evidence and Reflection framework for long-video understanding. CoVER enables Video-LLMs to \textbf{See More} by dynamically gathering query-expanded visual evidence, and \textbf{Think Deeper} by verifying draft answers with effective answer-specific visual feedback. Together, these mechanisms shift long-video understanding from answer-centric generation to evidence-centric and visually verifiable reasoning. Experimental results show that CoVER-7B substantially outperforms models with the same parameter scale and even surpasses state-of-the-art closed-source models on certain metrics.

cs.CV↗

arXiv2026

SCRWKV: Ultra-Compact Structure-Calibrated Vision-RWKV for Topological Crack Segmentation

Achieving pixel-level accurate segmentation of structural cracks across diverse scenarios remains a formidable challenge. Existing methods face significant bottlenecks in balancing crack topology modeling with computational efficiency, often failing to reconcile high segmentation quality with low resource demands. To address these limitations, we propose the Ultra-Compact Structure-Calibrated Vision RWKV (SCRWKV), a network that achieves high-precision modeling via a novel Structure-Field Encoder (SFE) backbone while maintaining linear complexity. The SFE integrates the Adaptive Multi-scale Cascaded Modulator (AMCM) to enhance texture representation and utilizes the Structure-Calibrated Insight Unit (SCIU) as its core engine. Specifically, the SCIU employs the Geometry-guided Bidirectional Structure Transformation (GBST) to capture topological correlations and integrates the Dynamic Self-Calibrating Decay (DSCD) into Dy-WKV to suppress noise propagation. Furthermore, we introduce a lightweight Cross-Scale Harmonic Fusion (CSHF) decoder to achieve precise feature aggregation. Systematic evaluations on multiple benchmarks characterized by complex textures and severe interference demonstrate that SCRWKV, with only 1.22M parameters, significantly outperforms SOTA methods. Achieving an F1 score of 0.8428 and mIoU of 0.8512 on the TUT dataset, the model confirms its robust potential for efficient real-world deployment. The code is available at https://github.com/zhxhzy/SCRWKV.

cs.CV↗

arXiv2026

High-bandwidth Coherence Cloning using Optical-Phase-Locking Feedforward

Ultra-narrow-linewidth lasers with suppressed high-frequency phase noise are critical for quantum control and precision metrology. While optical phase locking (OPL) is the standard technique for cloning the coherence of such sources, its effectiveness is often limited at high frequencies by feedback latency. We present a robust feedforward architecture that overcomes this limitation by recycling and demodulating the existing master-slave beat signal to drive a single electro-optic modulator for near-instantaneous noise cancellation. This approach eliminates the extraneous sidebands and transmission losses typical of more complex modulators. Through active stabilization of the beat amplitude and demodulation phase, we demonstrate robust suppression exceeding 30 dB from 10 kHz to 10 MHz. This hardware-efficient framework is readily compatible with standard OPL setups, offering a scalable solution for high-fidelity coherent control.

quant-ph↗

arXiv2026

Probing False Vacuum Decay and Bubble Nucleation in a Rydberg Atom Array

In quantum field theory (QFT), the "vacuum" is not just empty space but the lowest-energy state of a quantum field. If the energy landscape has multiple local minima, the local ground states are the false vacuum (FV) which can tunnel towards the global ground state (true vacuum, TV). This process exhibits signature akin to classical supercooled gas transitions and many-body tunneling in discrete quantum systems. Here, we study the FV decay and bubble nucleation in a Rydberg atom ring. The $1/r^6$ van-der-Waals interactions and individual-site addressability allow us to explore physics beyond the standard Ising model. We observe that the FV decay rate decreases exponentially with the inverse of the symmetry-breaking field, directly mirroring QFT predictions. Moreover, we demonstrate that even minor deviations from the ideal metastable state can cause a stark departure from this universal scaling law. Extending beyond short-time decay dynamics, we also examine resonant bubble nucleation, a feature distinctive to systems with discrete energy spectra. Our findings and methods open avenues for future studies of many-body tunneling in higher dimensions or more complex geometries.

quant-ph↗

arXiv2026

Staircase Cascaded Fusion of Lightweight Local Pattern Recognition and Long-Range Dependencies for Structural Crack Segmentation

Accurately segmenting structural cracks at the pixel level remains a major hurdle, as existing methods fail to integrate local textures with pixel dependencies, often leading to fragmented and incomplete predictions. Moreover, their high parameter counts and substantial computational demands hinder practical deployment on resource-constrained edge devices. To address these challenges, we propose CrackSCF, a Lightweight Cascaded Fusion Crack Segmentation Network designed to achieve robust crack segmentation with exceptional computational efficiency. We design a lightweight convolutional block (LRDS) to replace all standard convolutions. This approach efficiently captures local patterns while operating with a minimal computational footprint. For a holistic perception of crack structures, a lightweight Long-range Dependency Extractor (LDE) captures global dependencies. These are then intelligently unified with local patterns by our Staircase Cascaded Fusion Module (SCFM), ensuring the final segmentation maps are both seamless in continuity and rich in fine-grained detail. To comprehensively evaluate our method, this paper created the challenging TUT benchmark dataset and evaluated it alongside five other public datasets. The experimental results show that the CrackSCF method consistently outperforms the existing methods, and it demonstrates greater robustness in dealing with complex background noise. On the TUT dataset, CrackSCF achieved 0.8382 on F1 score and 0.8473 on mIoU, and it only required 4.79M parameters.

cs.CV↗

arXiv2026

Distribution-informed Efficient Conformal Prediction for Full Ranking

Quantifying uncertainty is critical for the safe deployment of ranking models in real-world applications. Recent work offers a rigorous solution using conformal prediction in a full ranking scenario, which aims to construct prediction sets for the absolute ranks of test items based on the relative ranks of calibration items. However, relying on upper bounds of non-conformity scores renders the method overly conservative, resulting in substantially large prediction sets. To address this, we propose Distribution-informed Conformal Ranking (DCR), which produces efficient prediction sets by deriving the exact distribution of non-conformity scores. In particular, we find that the absolute ranks of calibration items follow Negative Hypergeometric distributions, conditional on their relative ranks. DCR thus uses the rank distribution to derive non-conformity score distribution and determine conformal thresholds. We provide theoretical guarantees that DCR achieves improved efficiency over the baseline while ensuring valid coverage under mild assumptions. Extensive experiments demonstrate the superiority of DCR, reducing average prediction set size by up to 36%, while maintaining valid coverage.

cs.LG↗

arXiv2025

Bootstrapping LLMs via Preference-Based Policy Optimization

Bootstrapping large language models (LLMs) through preference-based policy optimization offers a promising direction for aligning model behavior with human preferences without relying on extensive manual annotations. In this work, we propose a novel preference-based policy optimization (PbPO) framework that formulates the learning process as a min-max game between the main policy and a reward model (RM). The RM is constrained within a confidence set derived from preference data to ensure reliable exploitation. Our iterative online algorithm actively collects preference data through guided exploration of the evolving policy, enabling continual self-improvement of both the policy and the RM. We provide theoretical guarantees for our method, establishing high-probability regret bounds for both settings with sequence-level RM and token-level RM, demonstrating its effectiveness in bootstrapping LLMs. Extensive experiments on five benchmarks show that our approach consistently outperforms existing state-of-the-art preference optimization techniques.

cs.AI↗

arXiv2025

Observation of average topological phase in disordered Rydberg atom array

Topological phases have been extensively studied over the past two decades, primarily in quantum pure states, where they are protected by exact symmetries. Recently, numerous studies have theoretically demonstrated the existence of average symmetry-protected topological (SPT) phases in mixed quantum states, which naturally arise in real systems due to decoherence or disorder. Despite extensive experimental observations of exact SPT phases in various systems, ranging from solid-state materials to synthetic matters, average SPT phases are yet to be observed until this work. Here we report direct observations of disorder-induced many-body interacting average SPT phase in an atom array at half-filling, whereby random offsets to tweezer locations forming a lattice implement structural disorder, resulting in fluctuating long-range dipolar interactions between tweezer confined single atoms. The induced topological phase is vindicated by the spatially resolved atom-atom correlation functions for different forms of dimer compositions. The ground state degeneracy in disordered configurations is detected and compared to the regular lattice without disorder. By probing the quench dynamics of a highly excited state, we observe markedly slower decay of edge spin magnetization in comparison to the bulk spin, consistent with the presence of topologically protected edge modes in disordered lattices.

cond-mat.quant-gas↗

arXiv2025

LIDAR: Lightweight Adaptive Cue-Aware Fusion Vision Mamba for Multimodal Segmentation of Structural Cracks

Achieving pixel-level segmentation with low computational cost using multimodal data remains a key challenge in crack segmentation tasks. Existing methods lack the capability for adaptive perception and efficient interactive fusion of cross-modal features. To address these challenges, we propose a Lightweight Adaptive Cue-Aware Vision Mamba network (LIDAR), which efficiently perceives and integrates morphological and textural cues from different modalities under multimodal crack scenarios, generating clear pixel-level crack segmentation maps. Specifically, LIDAR is composed of a Lightweight Adaptive Cue-Aware Visual State Space module (LacaVSS) and a Lightweight Dual Domain Dynamic Collaborative Fusion module (LD3CF). LacaVSS adaptively models crack cues through the proposed mask-guided Efficient Dynamic Guided Scanning Strategy (EDG-SS), while LD3CF leverages an Adaptive Frequency Domain Perceptron (AFDP) and a dual-pooling fusion strategy to effectively capture spatial and frequency-domain cues across modalities. Moreover, we design a Lightweight Dynamically Modulated Multi-Kernel convolution (LDMK) to perceive complex morphological structures with minimal computational overhead, replacing most convolutional operations in LIDAR. Experiments on three datasets demonstrate that our method outperforms other state-of-the-art (SOTA) methods. On the light-field depth dataset, our method achieves 0.8204 in F1 and 0.8465 in mIoU with only 5.35M parameters. Code and datasets are available at https://github.com/Karl1109/LIDAR-Mamba.

cs.CV↗

arXiv2025

Online Knowledge Distillation with Reward Guidance

This work studies knowledge distillation (KD) for large language models (LLMs) through preference optimization. We propose a reward-guided imitation learning framework for sequential KD, formulating a min-max optimization problem between the policy and reward model (RM) to minimize the performance gap between the student and teacher policies. Specifically, the reward optimization is constrained to achieve near-optimality within a confidence set for preference alignment. For preference data construction, we explore both offline and online preference-based KD. Additionally, we reformulate the RM using the $Q$-value function and extend the framework to white-box KD, where the teacher policy's predicted probabilities are accessible. Theoretical analysis and empirical results demonstrate the effectiveness of the proposed framework.

cs.LG↗