arXiv subjects

Jian Wang

Publications and source records attributed to Jian Wang.

At least 127 records · Page 7Linked to original sources

arXiv2026

Analytic result of a three-loop integral family in the Higgs decay to four massive bottom quarks

When calculating the decay width of $H\to b\bar{b}b\bar{b}$ induced by the effective Higgs-gluon-gluon interaction using the optical theorem, the three-loop Feynman diagrams are encountered. Among them, there is an interesting integral family, which involves not only the sectors evaluated to multiple polylogarithms but also those related to an elliptic curve and a K3 surface. We demonstrate how to construct and solve the canonical differential equation for the entire family, which includes mixing between different sectors, by using the recently proposed algorithm in~\cite{e-collaboration:2025frv, Bree:2025tug}. Analytical results for all master integrals in this family up to the first two orders of $\varepsilon$ are given.

hep-ph↗

arXiv2026

Motion-Focused Latent Action Enables Cross-Embodiment VLA Training from Human EgoVideos

Training generalist Vision-Language-Action(VLA) models typically requires massive, diverse robotic datasets with high-fidelity action annotations. While egocentric human manipulation videos are abundant and capture significant environmental diversity, the absence of action labels makes them difficult to use in conventional training paradigms. To address this, we propose a latent-action-based framework designed to extract general action priors from unlabeled human videos. The architecture features a Hybrid Disentangled VQ-VAE that decouples motion dynamics from environmental backgrounds through physical masks, enabling the construction of a cross-embodiment action codebook. By pre-training on human videos with the codebook, the VLM backbone learns deep representations of action intent. For adaptation to specific embodiments, we introduce an intent-perception decoupling strategy where the VLM predicts the action intent while a separate frozen visual encoder provides state-specific features to the action expert, thereby reducing action hallucinations. Results in simulation and real-world environments show that our method, pre-trained exclusively on unlabeled human videos, performs competitively with state-of-the-art VLA models trained on massive annotated datasets, requiring only 50 trajectories for downstream adaptation.

cs.CV↗

arXiv2026

Strengthening and interface-mediated plastic co-deformation in an ultrafine Cr-Ni eutectic: A nanomechanical investigation

Ultrafine eutectic heterostructures provide a stringent test of plasticity in high-strength materials, where deformation must be accommodated through interfaces and strain gradients. Room temperature ductility is typically limited by premature fracture of the hard phase, leaving open the fundamental questions regarding the interface spacing, atomic structure and local chemistry that enable plastic co-deformation. Here we address this question using a model system of Cr-Ni binary alloy, processed via electron-beam powder bed fusion that produces a lamellar eutectic microstructure of Cr-rich BCC and Ni-rich FCC phases, with an average interlamellar spacing of ~450 nm. Atomic-resolution STEM revealed a stepped semi-coherent FCC/BCC interface with the Kurdjumov-Sachs orientation relationship and Ni-enrichment confined to a few atomic planes on the BCC side. In situ micro-scale compression and tension tests in SEM demonstrate high flow stresses coupled with large plastic strains without cracking, indicating stable accommodation of plastic incompatibility. Correlative TEM/HR-STEM establishes a deformation sequence: initial plasticity is dominated by strain-gradient driven dislocation accumulation in the FCC lamellae adjacent to interfaces, followed by deformation twinning in FCC and local interfacial shear and reorientation. The BCC phase subsequently develops a high density of mobile dislocations. Atomistic modeling has been employed to understand the influence of the FCC/BCC interface atomic structure and chemistry on the slip activation in the hard phase. These findings show that nanoscale confinement, stepped K-S interfacial structure, and interfacial chemistry collectively promote dislocation glide in a hard phase below its monolithic brittle to ductile transition temperature, and plastic codeformation at high flow strengths.

cond-mat.mtrl-sci↗

arXiv2026

Surface code logical operations on a superconducting quantum processor

Fault-tolerant quantum computation requires logical operations that manipulate encoded information while preserving quantum error-correction protection. In planar surface-code architectures, code deformation and lattice surgery provide a local, measurement-based route to such operations. Here we experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor. We first implement a reusable primitive layer comprising merge and split, patch expansion and shrinkage, and deformations mediated by domain walls and twist defects. We then compose these primitives to realize logical state routing, the logical controlled-NOT gate, and the single-qubit Hadamard and phase gates, which together form a Clifford-generating set. All operations are implemented on distance-three rotated surface-code patches with multi-round syndrome extraction and neural-network decoding, without post-selection. Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.

quant-ph↗

arXiv2026

Tunable Extended Magnetic Non-Fermi Liquid in Graphene Moiré Heterostructures

Exploring exotic quantum metallic states beyond Landau's Fermi liquid theory remains a central focus in condensed matter physics. Such non-Fermi liquid behavior is mostly observed near quantum criticality, yet growing attention is directed toward extended NFL phases with intrinsic quantum fluctuations rooted in the extended ground state. While these extended NFL states have been previously reported only in a limited set of d- and f-electron systems, realizing a single, highly tunable platform capable of exhibiting multiple resistance exponent values is essential for uncovering the connection between the resistance exponent and the dominant quantum fluctuations coupled to quasiparticles. However, corresponding experimental progress remains elusive. Here, we report the observation of tunable extended non-Fermi liquid behavior in twisted double bilayer graphene encapsulated by aligned hBN layers. This NFL phase spans a broad range of carrier densities and exhibiting a carrier density dependent resistance exponent. Combined with temperature dependent resistance, magnetotransport and differential resistance measurements, these findings support a scenario where strong quantum fluctuations emerge from the interplay between localized and itinerant carriers. Our work establishes a highly tunable platform beyond conventional frameworks to investigate the organizing principles of non-Fermi liquid physics manifested in diverse behaviors.

cond-mat.mes-hall↗

arXiv2026

Andreev reflection mediated by topological corner states in a two-dimensional honeycomb lattice

Topological corner states in two-dimensional second-order topological insulators (SOTIs) are localized in real space. We numerically demonstrate that such localized topological corner states can mediate Andreev reflection when coupled to a superconducting lead. We consider a transport setup based on a two-dimensional honeycomb lattice, consisting of a normal lead, a central SOTI region, and a superconducting lead. The central SOTI region is described by the modified Kane--Mele model with an in-plane Zeeman field and hosts topological corner states in a diamond-shaped flake. Although the central region is insulating, the local density of states shows that incident electrons can turn the localized corner state into an extended scattering state, which forms a resonant tunneling channel to the superconducting lead. This process leads to a perfect Andreev reflection peak near zero energy. Away from this resonance, antiresonance dips appear in the Andreev reflection spectrum, and their positions can be tuned by the Zeeman field strength. We show that the suppression of Andreev reflection is caused by quantum interference and the imbalance between electron and hole dwell times in the central region. These results demonstrate that topological corner states can provide a resonant tunneling path to the superconducting interface and mediate Andreev reflection in second-order topological systems.

cond-mat.mes-hall↗

arXiv2026

SimpleSearch-VL: A Simple Recipe for Multimodal Agentic Deep Search

We present SimpleSearch-VL, an efficient, reliable, and practical framework for multimodal agentic search. Its core idea is to improve the agent's own search-and-verification process rather than scaling data, tools, or auxiliary model components. For efficiency, Factorized Adaptive Rollout (FAR) improves sampling efficiency by forming more informative training groups while using redundant samples to mitigate long-tail latency and expose hard samples. For reliability, SimpleSearch-VL performs evidence-verified reasoning, explicitly using chain-of-thought verification to assess the relevance of retrieved visual and textual cues to the original context. For practicality, SimpleSearch-VL keeps a lightweight tool interface and performs webpage self-summary within the agent, requiring no additional external dependencies. With only 5K supervised tool-interleaved trajectories and 2K RL data, SimpleSearch-VL improves Qwen3-VL agentic baselines by 15.8 and 16.0 average points for the 8B and 30B-A3B variants, respectively. The SimpleSearch-VL-30B-A3B model further achieves performance competitive with agentic Gemini-3-Pro.

cs.CV↗

arXiv2026

Search for L4 Earth Trojan asteroids with the 2.5-meter Wide Field Survey Telescope

Earth Trojan asteroids (ETAs) are a mysterious population, and dynamically stable ETAs, if primordial, could be "living fossils" of the early solar system. To date, there are only two known ETAs, but both are temporary ETAs. The aim of our survey is to discover new temporary or stable ETAs; in the absence of detections, we derive upper limits on the population of stable ETAs. We conducted the largest wide-area survey of the Earth's L4 Lagrange point region so far using the Wide Field Survey Telescope, covering about 236.74 deg^2, corresponding to 33.24% of the probability coverage for sky regions where dynamically stable L4 ETAs are likely to reside. No new ETAs were detected in our survey. We place a cumulative upper limit of N(H < 19.1) < 19 on the stable population of objects larger than ~520 m (for an assumed albedo of 0.15). This represents the most stringent constraint on the ETA population to date.

astro-ph.EP↗

arXiv2026

Deep Image Prototype Learning with Geometric Heat-Kernel Priors

Learning unsupervised representations of medical imaging cohorts can reveal anatomically meaningful prototypes without expert labels, which are often noisy and fail to capture true pathological heterogeneity. However, existing deep latent-variable models estimate Gaussian mixture priors via Euclidean averaging, producing prototypes that drift off the curved data manifold and degenerate as the number of sub-populations grows. We propose a manifold-anchored variational framework built on a geometry-aware Expectation-Maximization (EM) algorithm, whose M-step selects each sub-population prototype as the graph medoid with the highest diffusion centrality on a heat-kernel-weighted latent graph, ensuring that every prototype remains on-manifold. A Dirichlet energy regularizer enforces geometric smoothness of the latent space, and a per-sub-population uncertainty score enables label-free quality assessment. The manifold-anchored EM is a general-purpose geometric tool that extends standard EM and applies readily to other latent-variable models beyond this setting. On cardiac scar and brain MRI benchmarks, our framework attains the highest accuracy among all compared methods, produces the sharpest prototypes reported to date, and remains stable at large sub-population counts where all baselines degenerate. Code and implementation details are available at https://github.com/jr-xing/On-Manifold-Variational-Learning-with-Heat-Kernel-Priors.

cs.CV↗

arXiv2026

High-order convergence rates of periodic homogenization for symmetric Lévy type operators

In this paper, we establish higher-order convergence rates of the periodic homogenizatio for symmetric Lévy-type operators, encompassing the subcritical $α$-stable regime, critical regime, and supercritical diffusive regime. To this end, we develop a systematic framework to decompose the contributions of the underlying jumping kernel across small, intermediate, and large spatial scales -- a strategy tailored to all the aforementioned regimes. To the best of our knowledge, this work represents the first comprehensive study of higher-order convergence rates in the homogenization of non-local operators.

math.PR↗

arXiv2026

RAGA: Real Time Ray Traced Gaussian Shadow Casting for 3DGS Avatar-Scene Interaction

We study the problem of physically plausible shadow casting when animating 3D Gaussian Splatting (3DGS) avatars, either individually or in multi-avatar and object-interaction scenarios, within existing 3DGS scenes. In contrast to prior methods that rely on binary hit tests and mesh-based shadow casters, our method performs shadow computation entirely in Gaussian space, without requiring any mesh reconstruction. We introduce RAGA, a Ray-Traced Gaussian Shadow Casting formulation based on exact ray-Gaussian line integrals. For each occluding Gaussian, we integrate the opacity profile along the shadow ray and normalize by the theoretical maximum integral, producing a weight that captures how the ray traverses the occluder rather than merely whether an intersection occurred. To reduce temporal variance from clothing deformations in animated avatars, we further introduce an avatar proxy representation that stabilizes shadow casting while preserving visual fidelity. We implement RAGA using custom CUDA kernels integrated with the NVIDIA OptiX framework; as such, our shadow tracer runs at rates of about 50 FPS. We evaluate on single-avatar, multi-avatar, and avatar-object interaction scenarios across multiple datasets, demonstrating substantially improved shadow realism, temporal stability, and scene coherence. Our project page is available at https://miraymen.github.io/raga/.

cs.CV↗

arXiv2026

Spatial Transcriptomics as Images for Large-Scale Pretraining

Spatial Transcriptomics (ST) profiles thousands of gene expression values at discrete spots with precise coordinates on tissue sections, preserving spatial context essential for clinical and pathological studies. With rising sequencing throughput and advancing platforms, the expanding data volumes motivate large-scale ST pretraining. However, the fundamental unit for pretraining, i.e., what constitutes a single training sample, remains ill-posed. Existing choices fall into two camps: (1) treating each spot as an independent sample, which discards spatial dependencies and collapses ST into single-cell transcriptomics; and (2) treating an entire slide as a single sample, which produces prohibitively large inputs and drastically fewer training examples, undermining effective pretraining. To address this gap, we propose treating spatial transcriptomics as croppable images. Specifically, we define a multi-channel image representation with fixed spatial size by cropping patches from raw slides, thereby preserving spatial context while substantially increasing the number of training samples. Along the channel dimension, we define gene subset selection rules to control input dimensionality and improve pretraining stability. Extensive experiments show that the proposed image-like dataset construction for ST pretraining consistently improves downstream performance, outperforming conventional pretraining schemes. Ablation studies verify that both spatial patching and channel design are necessary, establishing a unified, practical paradigm for organizing ST data and enabling large-scale pretraining.

cs.CV↗

arXiv2026

EHR-Complex: Benchmarking Medical Agents for Complex Clinical Reasoning

Clinical agents promise to democratize access to electronic health records (EHRs), yet existing benchmarks fail to reflect the complexity of practical EHR analysis, e.g., often operating on idealized, clean EHRs via static SQL generation rather than interactive execution. In this work, we introduce EHR-Complex, a large-scale benchmark designed for interactive clinical database reasoning. Built on the large MIMIC-IV substrate (365K patients, 31 tables, 500M+ records), EHR-Complex comprises about 52K tasks spanning six clinical intents, supporting both patient-level and population-level queries, where each task requires an agent to interact with a sandboxed environment by executing SQL queries or Python code. Notably, EHR-Complex considers the real-world SQL task complexity for longitudinal multi-table aggregation and compositional reasoning, resulting in 31.93 SQL structural components per query on average. Evaluation results on EHR-Complex reveal the clinical difficulty of these EHR reasoning scenarios, with the top-performing model achieving only 62.3% exact-match accuracy. Pass^k consistency drops below 50% for nearly all evaluated models at k=4, exposing broad stochastic fragility. A fine-grained analysis of more than 3,800 failed trajectories for representative LLMs reveals three dominant failure modes: SQL logic errors, medical-code lookup failures, and semantic misunderstandings. EHR-Complex provides a rigorous testbed for clinical agents and highlights remaining gaps in robust reasoning for large-scale EHR analysis.

cs.AI↗

arXiv2026

What Makes Effective Supervision in Latent Chain-of-Thought: An Information-Theoretic Analysis

Latent Chain-of-Thought (CoT) internalizes reasoning within continuous hidden states, offering a promising alternative to verbose discrete reasoning traces. However, robust latent reasoning remains difficult because outcome supervision provides weak learning signals and leaves latent trajectories prone to semantic drift. In this work, we analyze Latent CoT from an information-theoretic perspective and identify this failure as a dual collapse: gradient attenuation along the optimization path and representational drift in the latent space. We further decompose process supervision into two complementary dimensions: Trajectory Supervision, which injects dense stepwise reasoning signals, and Space Supervision, which preserves the semantic structure of the latent manifold. Our analysis shows that rigid geometric compression can collapse the reasoning space, whereas generative reconstruction provides a more flexible semantic anchor that better preserves information capacity. To measure these effects, we introduce the Unified Latent Probe (ULP), which quantifies the mutual information between latent trajectories and explicit reasoning steps. Experiments reveal a clear Information-Performance Binding: reasoning accuracy depends on the information fidelity preserved in the latent chain. These findings provide a principled framework for latent reasoning supervision and suggest shifting from geometric imitation toward mutual information maximization. Our code is available at \href{https://github.com/EIT-NLP/Supervision-in-Latent-CoT}{this repository}.

cs.LG↗

arXiv2026

SurveyLens: A Discipline-Aware Benchmark for Automatic Survey Generation

Automatic Survey Generation (ASG) aims to produce comprehensive literature surveys by retrieving, organizing, and synthesizing academic papers. Despite rapid progress in specialized ASG frameworks and Deep Research agents, existing evaluations largely center on Computer Science or rely on generic criteria, leaving it unclear whether current systems satisfy the survey standards of diverse disciplines. We introduce SurveyLens, the first discipline-aware ASG benchmark. SurveyLens comprises SurveyLens-1k, a curated dataset of 1,000 human-written surveys across 10 disciplines, and a dual-lens framework that combines discipline-aware rubric scoring with reference-based alignment to human-written surveys. Evaluating 11 state-of-the-art systems across vanilla LLMs, ASG systems, and Deep Research agents, we find that Deep Research agents are the only paradigm robust across all 10 disciplines, ASG systems lead on structural planning, and all paradigms remain weak on reference quality, providing practical guidance for discipline-specific tool selection and future ASG design.

cs.CL↗

arXiv2026

A Stable SBP-SAT FDTD Subgridding Method Without Region Split

A provably stable summation-by-parts simultaneous approximation term (SBP-SAT) finite-difference time-domain (FDTD) subgridding method without region split is proposed. By designing projection SBP operators tailored for embedded topological features and deriving the corresponding SAT boundary conditions, this approach guarantees long-time stability through discrete energy analysis. Unlike conventional SBP-SAT FDTD subgridding techniques that rely on aligned or multi-block configurations, the proposed method enables a direct coupling between an internal refined region and a single surrounding coarse-grid domain without introducing auxiliary blocks or causing domain fragmentation. Numerical results validate the efficiency, accuracy, and topological flexibility of the proposed method. Compared with existing multi-block SBP-SAT methods, this method effectively reduces computational complexity by minimizing SAT boundary conditions and improves calculation accuracy near grid interfaces.

cs.CE↗

arXiv2026

TICoder: A Repository-Level Code Generation Framework with Test-Driven Planning and Implementation-Aware Reuse

Repository-level code generation with Large Language Models (LLMs) remains challenging, primarily due to complex dependencies and limited context windows. Recent approaches adopt retrieval-augmented generation (RAG) and the planning mechanism to reuse potential callee functions in the repository. However, these approaches often suffer from two limitations: lack of test-driven behavioral guidance during planning and overlooking the implementation logic embedded in repository code during reuse. As a result, generated plans may not align with expected behaviors, and retrieved functions may not be effectively reused. In this paper, we propose TICoder, a novel repository-level code generation framework that improves both planning and reuse. TICoder introduces a test-driven iterative planning mechanism that leverages test cases as behavioral specifications to refine implementation steps. Furthermore, TICoder employs an implementation-aware code reuse strategy, which retrieves potential callee functions using a dual-view similarity that captures both functional and implementation aspects. We then identify relevant usage patterns through a dual-stage selection strategy, combining structure-based clustering and perplexity-based filtering. We conduct extensive experiments on widely used repository-level code generation benchmarks with various LLMs. Experimental results demonstrate that TICoder outperforms state-of-the-art (SOTA) methods, achieving an average improvement of 11.52%.

cs.SE↗

arXiv2026

SlimSearcher: Training Efficiency-Aware Web Agents via Adaptive Reward Gating

Deep research agents have demonstrated remarkable capabilities in complex information-seeking tasks, yet this power comes at a steep computational cost. Driven by accuracy-focused training paradigms, current models adopt brute-force strategies characterized by blind tool dependency and performative reasoning-generating long, redundant trajectories that are far from necessary for resolving these tasks, leading to wasteful tool calls and excessive token consumption. To overcome this efficiency trap, we propose SlimSearcher, a principled framework that pushes the Pareto frontier between accuracy and computational cost across both Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL). In the SFT stage, SlimSearcher employs Pareto-efficient filtration to distill trajectories that are both successful and economical, guiding the model toward inherently efficiency-aware search behaviors. During RL, we introduce Adaptive Reward Gating, a dynamic reward-shaping mechanism that evaluates relative tool and token efficiency within a sampled cohort. By cascading these adaptive efficiency metrics with a strict correctness gate, our approach effectively avoids the brevity bias associated with absolute penalties and mitigates reward hacking. Extensive experiments on long-horizon benchmarks, including GAIA, BrowseComp, and XBenchDeepSearch, demonstrate that SlimSearcher reduces average tool-call rounds by 17%-58% while maintaining or improving accuracy.

cs.LG↗