Searcharxiv⌕ Search

arXiv subjects

Jian Wang

Publications and source records attributed to Jian Wang.

At least 109 records · Page 6Linked to original sources

Uncertainty in a Single Pass: A Closed-Form Identity for One-Step Flow Matching

Flow matching provides a highly effective framework for generative modeling, yet estimating the uncertainty of its generated samples remains a fundamental challenge. Existing methods rely on auxiliary variance heads, model ensembles, or iterative covariance propagation, which invariably introduce accumulated errors and structural interference along the noise-to-image trajectory. We resolve these limitations by adapting Tweedie's formula to the linear flow matching interpolant, yielding an exact, closed-form identity for the posterior covariance. Because this identity relies exclusively on the divergence of the learned velocity field, it can be evaluated post hoc on pretrained models without any architectural modifications. This analytical formulation proves exceptionally powerful for single-step generative frameworks. By computing the end-to-end posterior covariance in one forward pass, our approach completely bypasses the compounding errors inherent to sequential integration. This mechanism fundamentally enhances robustness, providing highly accurate and stable uncertainty estimates while preventing the numerical degradation typical of multi-step approximations. We validate our framework across benchmark datasets, including CIFAR-10 and real brain MRI scans. The resulting divergence-based uncertainty maps are highly interpretable and tightly correlated with empirical reconstruction errors. Crucially, in medical imaging, this precise localization of structural ambiguity provides essential decision support for high-stakes clinical tasks such as tumor boundary delineation and neurosurgical planning.

cs.LG↗

Bell nonlocality with directly generated telecom-band spin-photon entanglement

Quantum nonlocality, typically revealed through entanglement distribution across quantum networks, is a cornerstone of quantum information science. Long-distance distribution of entanglement requires the information carrier, i.e. flying photons, to operate in the minimum-loss telecom band of optical fiber. While extensive efforts have been devoted to the direct generation of entanglement between C-band telecom photons and various stationary spins, the verification of quantum nonlocality remains an outstanding challenge. Here, utilizing a dipole transition in rubidium atoms with a wavelength of 1530 nm and a cavity-assisted protocol, we achieve resonant excitation and direct emission of C-band telecom photons from a single atom, generating spin-photon entanglement with a measured Bell state fidelity exceeding 91.4%. We then verify Bell nonlocality by observing a Bell inequality violation of 2.455(77) > 2 using this high-quality entangled pair. These results extend the wavelength of a single-atom quantum emitter to the telecom C-band, achieving sufficiently high-fidelity spin-photon entanglement to finally verify Bell nonlocality. This work thereby provides a promising building block for a large-scale atom-based quantum network capable of distributed quantum metrology and long-distance quantum communication.

quant-ph↗

MediRec: Enhancing Chinese Medication Recommendation with Explainable Clinical Reasoning

Large language models (LLMs) have shown strong potential for clinical decision support through their advanced language understanding and reasoning capabilities. However, their application to Chinese clinical medication recommendation remains largely unexplored. Existing approaches are primarily developed on English electronic health record datasets and focus on coarse-grained medication code prediction, offering limited support for interpretable clinical decision-making. In this work, we propose MediRec, an explainable LLM-based framework for Chinese medication recommendation from electronic health records. MediRec combines clinically grounded reasoning-chain distillation with reinforcement learning to improve both recommendation accuracy and interpretability. Comprehensive experiments on a Chinese medication recommendation benchmark show that MediRec achieves strong performance, with an F1 score of 0.5813 and a Jaccard score of 0.4626. Further analyses indicate that MediRec generates clinically plausible recommendations with transparent reasoning, demonstrating its effectiveness for explainable medication decision support in Chinese healthcare settings.

cs.CL↗

Moderate deviation principles for stochastic 2D hydrodynamics-type systems with multiplicative jump noise

This paper establishes a moderate deviation principle for a class of stochastic 2D hydrodynamical-type systems driven by multiplicative jump noise. The proof does not require compactness of the embedding in the associated Gelfand triple, so the result applies to both bounded and unbounded domains. The combination of finite-dimensional projections and integration by parts is used to prove the strong continuity of the skeleton solution map with respect to weakly convergent controls. This approach avoids the time discretization and intricate jump estimates used in earlier treatments of noncompact settings.

math.PR↗

Cognivia: A Cognitive Behavioral Therapy Copilot for Evidence-Based Mental Healthcare

Cognitive distortion amplifies negative emotions and contributes to mental health disorders. Cognitive Behavioral Therapy (CBT) is an effective way to address cognitive distortions, but its large-scale application is limited by the shortage of professional therapists. Although large language models (LLMs) have recently been explored for mental health applications, existing methods still suffer from limited domain specificity, overly flattering responses, and the absence of well-defined annotations for cognitive distortions. This paper proposes Cognivia, an evidence-based artificial intelligence therapist that integrates automatic cognitive distortion identification and rational response generation. Our framework is built on authoritative CBT texts widely regarded as core paradigms and standard references. It is further augmented with mental health question-answer (Q and A) data, and employs multi-stage prompting and structured generation strategies under the supervision of behavioral science experts. Then we fine-tune a lightweight LLM on this augmented CBT dataset to obtain Cognivia. In addition, we propose the first hierarchical quality evaluation framework for assessing LLM-generated rational responses, developed through collaboration between AI researchers and behavioral science experts. Cognivia is evaluated using lexical metrics, LLM-based Judges with two complementary criteria, and human evaluation by 10 behavioral science experts. It consistently outperforms the baseline methods in cognitive distortion recognition and rational response generation, demonstrating its effectiveness. Our code is available at https://github.com/SNOWTEAM2023/Cognivia.

cs.AI↗

The homomorphism threshold of odd cycle $C_{2k-1}$ is below $\frac{1}{2k-1}$

The homomorphism threshold $δ_{\text{hom}}(H)$ of a graph $H$ asks how large the minimum degree of an $H$-free graph has to be in order to force a homomorphism to a bounded $H$-free graph. Determining this threshold is in general very difficult, and the odd cycles $C_{2k-1}$ are among the most important open cases for $k\ge 3$. Ebsen and Schacht proved the general upper bound $δ_{\text{hom}}(C_{2k-1})\le\frac{1}{2k-1}$, while a breakthrough of Sankar, using topological methods and a graph-theoretic analogue of homotopy equivalence, gave the first positive lower bound. The value $\frac{1}{2k-1}$ appeared particularly compelling: Ebsen and Schacht obtained the same exact threshold when all odd cycles of length at most $2k-1$ are forbidden, Huang, Liu, Rong and Xu later proved that it is the exact blowup threshold of $C_{2k-1}$, and Letzter and Snyder also explicitly asked whether $δ_{\text{hom}}(C_{5})=\frac{1}{5}$. Surprisingly, we show that the upper bound can be improved. More precisely, for every integer $k\ge3$, we prove $$ \frac{1}{2\left((k-1)^{4k-5}(2k-1)+\frac{(k-1)^{4k-5}-1}{k-2}\right)} \le δ_{\text{hom}}(C_{2k-1}) \le \frac{4(k-1)}{4(k-1)(2k-1)+1} < \frac{1}{2k-1}. $$ The new lower bound comes from a new graph-theoretic construction based on a sparse homomorphism theorem of Nešetřil and Zhu, and it improves Sankar's quantitative bound. The improved upper bound follows from a new structural argument that controls common neighborhoods along short odd paths. Our results have various consequences, in particular, every odd cycle of length at least five has pairwise distinct chromatic, homomorphism, polynomial removal, and linear removal thresholds, resolving two conjectures of Fox and Wigderson.

math.CO↗

The Curse of Precision: A Data Scaling Law for High-Precision Robotic Manipulation

While scaling laws for imitation learning have primarily focused on generalization in open-world settings, the relationship between data and precision in closed-world tasks like robotic assembly remains largely unexplored. This paper systematically investigates this relationship and introduces a novel scaling law. We find that to achieve a fixed success rate, the required number of demonstrations $N$ grows super-exponentially as the target precision $P$ approaches a limit $c$. This relationship is accurately captured by the model $\log(N) \propto 1/(P-c)$. Crucially, we reveal that the limit precision $c$ is not a static physical constant of the task but an emergent property of the entire agent system, including its sensors and expert policy. Through experiments on canonical manipulation tasks, we validate this law and demonstrate that improving system components, such as adding a wrist camera or using a more effective expert, measurably lowers $c$, thus expanding the system's achievable precision. Our work provides a new theoretical framework for precision in robotics and a quantitative metric to evaluate system capabilities. Furthermore, these findings provide a practical methodology for guiding the development and debugging of high-precision manipulation systems.

cs.RO↗

SequenceFI: Non-intrusive Temporal Fault Injection for Microservice Systems

Fault injection is widely used to evaluate the resilience of microservice systems, where client requests often span multiple services and execution stages. Existing request-level techniques usually control where and what faults are injected, but not when they are activated within a distributed execution. This limitation makes it difficult to reproduce timing-dependent failures, such as failures after state-changing side effects, order-sensitive concurrent responses, and partial failures among repeated downstream calls. This paper presents SequenceFI, a non-intrusive framework for temporal fault injection in microservice systems. SequenceFI observes message-level send and receive events, propagates compact temporal evidence along request executions, and triggers faults only when occurrence-sensitive temporal guards are satisfied. It further synthesizes temporal guards from traces, reducing the need for exhaustive enumeration of temporal fault-injection configurations, while requiring no modifications to application code or serialization libraries. We implement SequenceFI on Kubernetes and evaluate it on four widely used microservice benchmarks. Across nine temporal-fault scenarios and 450 valid trials, SequenceFI achieves 100.0\% temporal success without premature or multiple injections, finds effective configurations in one attempt on average, and reduces aggregate end-to-end search time by 95.91\% compared with H-Random.

cs.SE↗

ScaleMoGen: Autoregressive Next-Scale Prediction for Human Motion Generation

We present ScaleMoGen, a scale-wise autoregressive framework for text-driven human motion generation. Unlike conventional autoregressive approaches that rely on standard next-token prediction, ScaleMoGen frames motion generation as a coarse-to-fine process. We quantize 3D motions into compositional discrete tokens across multiple skeletal-emporal scales of increasing granularity, learning to generate motion by autoregressively predicting next-scale token maps. To maintain structural integrity, our motion tokenizers and quantizers are explicitly designed so that discrete tokens at every scale strictly preserve the skeletal hierarchy. Additionally, we employ bitwise quantization and prediction, which efficiently scale up the tokenizer vocabulary to preserve motion details and stabilize optimization. Extensive experiments demonstrate that ScaleMoGen achieves state-of-the-art performance, establishing an FID of 0.030 (vs. 0.045 for MoMask) on HumanML3D and a CLIP Score of 0.693 (vs. 0.685 for MoMask++) on the SnapMoGen dataset. Furthermore, we demonstrate that our skeletal-temporal multi-scale representation naturally facilitates training-free, text-guided motion editing.

cs.CV↗

Probing GHz Spin Dynamics Across Magnetic Phase Transitions in CrCl3 Nanoflakes Using Nitrogen-Vacancy Microscopy

CrCl3, a layered van der Waals (vdW) magnet, exhibits in-plane magnetic anisotropy and enhanced interlayer coupling upon stacking, making it an ideal platform to host exotic nanoscale magnetic phenomena such as magnon hydrodynamics and meron-like topological spin defects. When interfaced with other vdW materials, its antiferromagnetic-to-ferromagnetic and ferromagnetic-to-paramagnetic phase transitions and magnetic anisotropy can be tuned by voltage, strain, and layer stacking. Understanding the spin dynamics of CrCl3 at its magnetic phase transitions is crucial to its applications in magnonics. Here, we investigate the spin dynamics of CrCl3 nanoflakes using cryogenic diamond quantum sensing microscopy, based on measuring optically detected magnetic resonance, Rabi oscillations, and spin-lattice relaxation time (T1) of shallow nitrogen vacancy (NV) centers in diamond. In the ferromagnetic regime, we observe a pronounced reduction in the NV spin resonance contrast, a collapse of the Rabi oscillations, and a strong enhancement by two orders of magnitude of the relaxation rate G1 = 1/T1. These observations indicate intensified spin fluctuations in the gigahertz range. Broadband ferromagnetic resonance spectroscopy on CrCl3 crystals reveals resonance frequencies in the 4-15 GHz range together with a linewidth of ~24 mT, further supporting the NV measurements. A phenomenological model of magnetic-noise-induced NV relaxation reproduces the temperature dependence of G1 by combining antiferromagnetic, ferromagnetic, and paramagnetic fluctuation channels, indicating that magnetic noise is strongest in the ferromagnetic regime and evolves markedly across the phase transition. These results are crucial for using CrCl3 in 2D magnonics and hybrid quantum-magnon systems.

cond-mat.mes-hall↗

Bounded VC-dimension implies the Erdős--Rado sunflower conjecture

The Erdős--Rado sunflower conjecture asserts that, for every fixed integer $r\ge 3$, there is a constant $K(r)$ such that every $\ell$-uniform family with more than $K(r)^{\ell}$ members contains an $r$-sunflower. We prove this conjecture for families of bounded VC-dimension.

math.CO↗

Higgs boson decay to massive bottom quarks at order $α_s^4$ induced by top-quark Yukawa couplings

The Higgs boson decay to massive bottom quarks has the largest branching ratio. The decay is mainly induced by the bottom-quark Yukawa coupling with the decay rate calculated up to $O(α_s^4)$ assuming the massless final-state bottom quark. The top-quark Yukawa coupling induced contribution starts at $O(α_s^2)$, and exhibits logarithmic and power enhancements, making the perturbative expansion converge slowly, which is a feature not present in the hadronic Higgs boson decay. We present a calculation of such contributions at $O(α_s^4)$ to the decay into massive bottom quarks in which the squared amplitudes contain two top-quark Yukawa couplings and the final state must include at least a bottom quark pair. We find that they increase the decay width, relative to the result up to $O(α_s^3)$, by $0.4\%$, larger than the experimental precision at future lepton colliders, and reduce the scale dependence significantly down to $0.4\%$.

hep-ph↗

AnomExpert: Identifying and Selecting Anatomical Planes for Prenatal Ultrasound Anomaly Diagnosis

Life-limiting congenital anomalies require accurate prenatal diagnosis for appropriate clinical decision-making. Prenatal ultrasound (US) examinations involve multiple anatomical planes, and diagnosis depends on identifying anatomical planes and selecting diagnostically relevant planes for each anomaly. Existing automated methods either rely on plane-level annotations or aggregate heterogeneous images without explicitly modeling these diagnostic capabilities. We propose AnomExpert, a prototype-driven framework for prenatal US anomaly diagnosis using only case-level supervision. AnomExpert introduces learnable plane prototypes to organize unordered images into latent representations corresponding to anatomical planes without requiring plane annotations. A disease-aware sparse selection mechanism further selects diagnostically relevant planes for each anomaly. Experiments on a multi-center dataset of 3,654 cases show that AnomExpert consistently outperforms nine representative multi-instance learning methods. Using a ViT-small backbone, it achieves 86.9% accuracy and 84.2% F1-score while maintaining parameter efficiency. These findings indicate that modeling anatomical plane identification and disease-specific plane selection improves weakly supervised multi-plane prenatal US anomaly classification. The code is available at https://github.com/TIanCat/AnomExpert.

cs.CV↗

RegHead: Non-Humanoid Head Blendshapes via Feed-Forward Registration

We present RegHead, a framework for constructing semantic blendshape sets for animatable non-humanoid head avatars. With a fixed expression vocabulary, semantic blendshapes provide a low-dimensional and interpretable animation interface and support cross-identity retargeting. Building such blendshape sets remains expensive because (i) expression-consistent supervision is scarce, (ii) generated 4D assets typically lack correspondence, and (iii) facial motion is highly localized. We propose (1) a large-scale dataset of non-humanoid identities paired with a shared expression vocabulary, obtained by expanding a small artist-rigged library via fine-tuned image editing; (2) a dense stochastic anchor motion representation tailored to localized facial deformations; and (3) a fast feed-forward registration model that converts unregistered expression meshes into a corresponded blendshape basis by predicting anchor-based deformations from the neutral shape. Experiments show that our approach produces higher-fidelity expression meshes than baselines, while running orders of magnitude faster than optimization. We further demonstrate real-time retargeting from human face tracking signals to non-humanoid characters, capturing both head pose and localized facial motions. Our project page is available at https://snap-research.github.io/RegHead/.

cs.CV↗

Essential spectrum for Brox-type diffusion processes

This paper investigates the essential spectrum and compactness property of Markov semigroups generated by multi-dimensional Brox diffusion processes under two types of random media: stationary Gaussian random fields and semi-selfsimilar Lévy random fields. For Gaussian environments satisfying general stationary covariance growth conditions, we prove that the associated semigroup is almost surely noncompact; if the covariance function grows sublinearly at infinity, then the bottom of the essential spectrum vanishes almost surely, with fractional Brownian fields as a concrete example. For multi-dimensional semi-selfsimilar Lévy environments with scaling index $α\in(1,2)$, we show that the essential spectral bottom equals zero almost surely for arbitrary space dimension $d\ge1$, and the same conclusion holds for one-dimensional symmetric $α$-stable Lévy processes with any $α\in(0,2)$. Furthermore, we study one-dimensional diffusion operators perturbed by random Lévy drift. When $0<δ\le 1/α$, random environmental fluctuations can destroy the compactness of semigroups induced by deterministic power-law potentials $\pm|x|^δ$, even if the unperturbed semigroup is compact. The analysis relies on almost sure volume growth estimates for the random reference measure induced by environmental potentials, sample path asymptotics of random fields, ergodic theory of scaling transforms, and spectral criteria for regular Dirichlet forms. A unified framework linking sample path behaviors of random potentials to spectral characteristics of diffusion semigroups is established, and several open problems for large potential exponents are stated.

math.PR↗

Approximate N$^2$LO and N$^3$LO QCD Predictions for $tW$ Production

We present high-precision predictions for associated $tW$ production at the LHC that incorporate the next-to-next-to-leading order hard and soft functions as well as the complete next-to-next-to-next-to-leading order scale-dependent terms derived from the corresponding anomalous dimensions. These higher-order corrections, which dominate the full perturbative results, increase the next-to-leading order cross section by more than 10\%. Based on the comparison with ATLAS and CMS measurements, we directly extract the Cabibbo-Kobayashi-Maskawa matrix element $|V_{tb}|=0.99\pm 0.03({\rm expt})\pm 0.03({\rm theor})$ without assuming unitarity, achieving a precision comparable with the current world average value.

hep-ph↗

Riemannian Positive Mass Theorem in All Dimensions in the Presence of Low-Codimension Singularities

We prove the Riemannian positive mass theorem in all dimensions for asymptotically flat $L^\infty$-metrics with subcritical singular sets. More precisely, we consider complete asymptotically flat manifolds whose metrics are smooth away from a compact singular set of Minkowski dimension less than $n-3+\frac{2}{n}$, and whose scalar curvature is nonnegative on the regular set. We show that the ADM mass of each asymptotically flat end is nonnegative, and that the mass vanishes in some end only in the Euclidean case. For the rigidity statement, we require additionally that the Minkowski dimension of the singular set is not larger than $n-3+\frac{1}{n-1}$. This gives an asymptotically flat analogue of Schoen's codimension-three conjecture for positive scalar curvature. The proof combines a density theorem for singular asymptotically flat metrics, capacity estimates across the singular set, conformal blow-up inspired by Bi-Hao-He-Shi-Zhu [3], and a $μ$-bubble dimension-descent argument adapted from Brendle-Wang [6].

math.DG↗

VideoAgent: All-in-One Framework for Video Understanding and Editing

Video editing has become essential in digital media creation, yet existing automated systems are restricted to short segment processing and domain-specific tasks. They face two critical limitations: i) inability to handle diverse video comprehension and editing operations, and ii) lack of long-video understanding for coherent narrative creation. We propose VideoAgent, an all-in-one agentic framework addressing these challenges through two key innovations. First, we develop automated video shot creation with shot planning agents for coherent narratives and cross-modal retrieval for aligned visual content. Second, we design a multi-agent orchestration framework integrating over thirty specialized editing agents. Intent parsing filters relevant tools while textual-gradient graph optimization assembles complex editing pipelines. Extensive experiments on our newly-proposed VideoEdit benchmark and public datasets demonstrate VideoAgent's superiority over existing multimodal LLMs and agentic systems. VideoAgent achieves 87-95% orchestration success rates while reducing API costs by 60%. Human evaluation across six video categories shows VideoAgent produces professional-quality content approaching human-level performance, with ratings only 4% below human-created videos. We release our code at https://github.com/HKUDS/VideoAgent.

cs.CV↗