Searcharxiv⌕ Search

arXiv subjects

Yang He

Publications and source records attributed to Yang He.

At least 19 recordsLinked to original sources

Quantum periods and threefold flips

We study regularized quantum periods under birational contractions involving threefold flips. Let $g:X \dashrightarrow X'$ be a birational map between Fano threefolds with terminal quotient singularities which contracts exactly one prime divisor $E$ and extracts no divisor. We prove that $$ \lim_{r \rightarrow +\infty}\widehat{G}_{X,rE}(t) =\widehat{G}_{X'}(t). $$ The proof uses logarithmically smooth degenerations and positive discrepancies on good resolutions. Compatibility with orbifold invariants is proved using successive quotient-point extractions and the two-component orbifold degeneration formula. We also define stationary descendant invariants of projective terminal Fano threefolds by good resolutions and prove compatibility with a given projective $\mathbb{Q}$-smoothing. The period comparison extends to projective $\mathbb{Q}$-factorial terminal Fano endpoints under the same hypothesis on the birational map. Its proof compares the endpoints on a common resolution.

math.AG↗

Hidden Coherence and Controlled Quasihole Motion in a Fermionic Laughlin State on a Superconducting Quantum Processor

Fractional quantum Hall (FQH) states support fractionalized excitations and geometric phases, yet experimentally resolving the many-body coherence encoded in their wave functions remains challenging. Here, we prepare a three-electron $ν=1/3$ Laughlin state on the Haldane sphere using seven superconducting qubits and reconstruct its many-body density matrix. Through Read's composite-boson construction, we reveal vortex-dressed coherence that remains appreciable over a larger separation range than electron coherence. The extended profile is suppressed in a Fock-diagonal reference constructed from the measured populations, demonstrating its dependence on off-diagonal many-body coherence. We further prepare a one-flux-added quasihole and characterize its fractional charge response against finite-size benchmarks. Controlled quasihole motion yields an effective geometric-phase signature from the reconstructed dominant-eigenstate trajectory. These complementary measurements provide microscopic access to the coherent structure and quasihole response of a finite fermionic Laughlin state, demonstrating an experimental route to probing strongly correlated FQH wave functions on programmable quantum processors.

quant-ph↗

FocusBranch: Combinatorial Branch-and-Bound for $\ell_0$ Neural Network Robustness Verification

Verifying the local robustness of neural networks under $\ell_0$ perturbations is inherently combinatorial, as it must reason over all sparse subsets of $ε$ perturbed pixels. This paper presents FocusBranch, a combinatorial branch-and-bound framework for $\ell_0$ robustness verification. The key insight is to make the $\ell_0$-ball decomposable and branchable using a node abstraction, which consists of a focus pixel set $\mathcal{S}$ and a level $l$, permitting at most $ε-l$ pixels outside $\mathcal{S}$. This abstraction unifies two branching mechanisms: concrete nodes branch through upper shadows to fix additional perturbed locations, while super nodes branch through covering designs to cover many perturbation cases with fewer child nodes. FocusBranch proves node safety by concretizing linear relaxations over node-constrained $\ell_0$-balls and recursively branches on unknown nodes. Rather than relying on a fixed verification plan, it samples nodes across levels to estimate safe rates and costs, then selects a starting level and branching strategy predicted to minimize verification time. Experiments on fully connected and convolutional classifiers for MNIST, Fashion-MNIST, and CIFAR-10 show that FocusBranch verifies $\ell_0$ robustness effectively across architectures and outperforms state-of-the-art verifiers. The code is available at: https://github.com/simpl-group/FocusBranch.

cs.LG↗

STAR-VF: Spatio-Temporal Aware Representation Condensation for Data-Efficient Video Fusion

Video fusion aims to integrate complementary cues from heterogeneous sources, producing visually informative videos with coherent spatio-temporal structures. Jointly learning cross-modal complementarity and temporal dependencies typically relies on large-scale, high-quality video datasets, whose storage and repeated use during optimization incur substantial costs, making data-efficient learning highly desirable. To address this challenge, we rethink video fusion from the perspective of dataset condensation and propose STAR-VF, the first framework that condenses spatio-temporal representations for data-efficient video fusion. STAR-VF condenses the original training set into a compact set of learnable spatio-temporal representations, which are decoded into synthetic video clips and optimized using feature-level supervision provided by a frozen proxy model. The resulting condensed data preserves fusion-relevant spatial and temporal cues without requiring ground-truth fused videos as supervision. To adapt fusion learning to condensed representations, we equip the final fusion model with flow-free inter-frame temporal modeling and query-driven intra-frame aggregation, enabling direct temporal interaction and adaptive selection of fusion-relevant information in representation space. Extensive experiments on infrared-visible, multi-exposure, multi-focus, and medical video fusion benchmarks demonstrate that STAR-VF, trained with only approximately 1/16 of the original temporal training set, achieves fusion quality comparable to methods trained on the full data. Further analyses validate the contributions of learned condensation and flow-free temporal modeling, and demonstrate the robustness of the condensed supervision across different proxy encoders and downstream fusion models. Project page: https://zju-xyc.github.io/STAR-VF-Project-Page/.

cs.CV↗

TTT in VLA Models: Exploring Training with Human Demonstrations

Long-horizon robot tasks require retaining and using past information. We integrate Test-Time Training (TTT), which stores context in fast weights, into InternVLA-A1 and Pi0.5 to study action generation conditioned on human demonstrations through training on paired demonstrations and robot trajectories. We implement memory transfer between the two phases and truncated backpropagation, and examine training objectives, gradient coverage, and contrastive regularization across video, short-video, and single-frame cue tasks. In our experiments, adding TTT and training on paired data at the current scale did not lead to consistent target selection based on demonstrations. Under the tested settings, shorter sequences, full trajectory gradient connectivity, and contrastive regularization did not clearly improve responsiveness to demonstrations. When demonstrations were reduced to single-frame cues, real-robot execution still showed a preference for cups at fixed positions. We document the implementation, training configurations, and observations to support further inspection and replication.

cs.RO↗

On the gap of thresholds

We propose an algorithm to compute the gap numbers of log canonical thresholds, anticanonical thresholds, and $\mathbb{R}$-complementary thresholds for surface pairs with a given rational hyperstandard coefficient set. As an example, we compute these gap numbers for a special hyperstandard set that appears in the effective boundedness of $n$-complements for surface pairs.

math.AG↗

WAM-Cache: Staleness-Bounded KV Reuse for Efficient World Action Models

World Action Models (WAMs) enable generalist robot manipulation by conditioning an action expert on representations from a pretrained video Diffusion Transformer (DiT). In closed-loop control, the video DiT runs at every chunk to encode the current observation into layerwise key-value (KV) pairs that the action expert queries. This prefill dominates the per-chunk computational cost, yet existing training-free accelerations leave it fully dense. We present WAM-Cache, a training-free framework that retains layerwise key-value representations across chunks and recomputes only a sparse refresh set of tokens. Crucially, we find that the intuitive heuristic of refreshing visually drifted tokens plateaus far below the dense baseline, even with an oracle predicting ground-truth KV drift. Downstream action accuracy is instead governed by where the action expert attends, not by what moved. WAM-Cache therefore selects the refresh set by uniting the action expert's cross-attention with visual latent surprise, complemented by a strict age bound that suppresses compounding error. On Fast-WAM, WAM-Cache cuts video DiT prefill FLOPs by 32-42% across RoboTwin 2.0, LIBERO, and real-world experiments, while staying within 0.7-1.8 percentage points of the dense policy in simulation and 2.5 points on a real robot.

cs.RO↗

A superconducting qutrit link beyond the qubit limit

Superconducting microwave links have enabled deterministic state transfer and remote entanglement between qubits, but deterministic links have so far operated with an effectively two-dimensional transmitted Hilbert space. Here we demonstrate a superconducting qutrit link between two independently packaged nodes connected by a microwave channel. Each node combines a transmon qutrit, a transmission resonator, and a tunable Purcell-filter interface, allowing the two remote microwave-photon interfaces to be matched in both frequency and bandwidth. We implement two transition-selective photon-mediated operations that transfer the $|e\rangle$ and $|f\rangle$ qutrit components in distinct temporal modes of the same channel. We tomographically characterize arbitrary qutrit-state transfer, obtaining a mean transferred-state fidelity of 83.68% and a qutrit process fidelity of 77.12%, exceeding both the classical qutrit-transfer benchmark and the best possible average fidelity of an effective qubit channel used to transmit an arbitrary qutrit. Using partial-transfer operations, we reconstruct a remote two-qutrit state with negativity 0.730, a tomography-inferred dense-coding capacity of 2.273 bits, and a tomography-inferred Collins-Gisin-Linden-Massar-Popescu (CGLMP) parameter $I_3=2.332$, all beyond the corresponding qubit or local bounds. These results demonstrate a superconducting microwave link that uses the native three-level structure of transmons as a genuine high-dimensional communication resource.

quant-ph↗

On syzygies of Mori fibre spaces

We introduce homological and homotopical $r$-syzygies of Mori fibre spaces as a generalization of Sarkisov links and relations of Sarkisov links. For any proper morphism $Y/R$, we construct a contractible (if not empty) CW complex such that there is a 1-1 correspondence between its cells and the central models of $Y/R$. We derive from this CW complex a long exact sequence and a spectral sequence converging to the (co)homology of the relative birational automorphism group of $Y/R$. As an application, we compute the second group homology of the second Cremona group.

math.AG↗

Emergence of thermal recoil jets in high-energy heavy-ion collisions

In the established paradigm of jet quenching in relativistic heavy-ion collisions, jets from initial hard parton scatterings are suppressed due to their interaction with the quark-gluon plasma (QGP), serving as crucial tomographic probes of QGP properties. Within the linear Boltzmann transport model, we find that the QGP is also capable of absorbing and reprocessing energy deposited by the hard jets into emergent jet-like objects, providing an alternative production mechanism of thermal recoil jets. These emergent thermal recoil jets exhibit distinct transverse momentum ($p_\mathrm{T}$) and jet-cone size ($R$) dependencies different from the hard jets, and interpret the puzzling observation of the enhanced yields of hadron triggered jets at large azimuthal angle relative to the away side and solely at small $p_\mathrm{T}$ and large $R$. These thermal recoil jets are predicted to have unique substructures, such as a jet shape that increases with radius and a thermal-like distribution of their constituents, which await verification in future experimental analyses.

nucl-th↗

From Generation to Simulation: How Far Are World Models from Being True Simulators?

With the rapid progress of diffusion models and large-scale video generation, generative world models are increasingly expected to replace traditional simulators, including physics engines, game engines, and reinforcement-learning environments. Yet the remaining distance from generation to simulation lacks a systematic assessment. We present a capability-based study using an external yardstick: eight capabilities of a traditional simulator, namely asset construction, physics engine, interaction, controllability, stability, state feedback, diversity, and evaluation metrics. We trace three main technical routes--latent dynamics, video generation, and joint-embedding prediction--and map exactly 200 representative works published from 2018 to June 2026 onto these capabilities. Our analysis shows that world models have achieved functional substitution in interaction and controllability for specific scenarios, but remain short of traditional simulators in formal guarantees of physical laws, structured state feedback, and reproducible long-horizon evolution. State feedback is the most neglected cross-route shortcoming: only 6 of 163 implementation papers expose a runtime interface for querying entity states or physical parameters. We identify six research directions: formalized physics, a unified action interface, first-class state feedback, long-horizon stability, downstream-utility evaluation, and cross-route hybridization. Project page: https://github.com/AtongWang/world-model-simulators

cs.AI↗

FlexSQL: Flexible Exploration and Execution Make Better Text-to-SQL Agents

Text-to-SQL over large analytical databases requires navigating complex schemas, resolving ambiguous queries, and grounding decisions in actual data. Most current systems follow a fixed pipeline where schema elements are retrieved once upfront and the database is only revisited for post-hoc repair, limiting recovery from early mistakes. We present FlexSQL, a text-to-SQL agent whose core design principle is flexible database interaction: the agent can explore schema structure, inspect data values, and run verification queries at any point during reasoning. FlexSQL generates diverse execution plans to cover multiple query interpretations, implements each plan in either SQL or Python depending on the task, and uses a two-tiered repair mechanism that can backtrack from code-level errors to plan-level revisions. On Spider2-Snow, using gpt-oss-120b, FlexSQL achieves a 65.4\% score, outperforming strong open-source baselines that use stronger, larger models such as gpt-o3 and DeepSeek-R1. When integrated into a general-purpose coding agent (as skills in Claude Code), our approach yields over 10\% relative improvement on Spider2-Snow. Further analysis shows that flexible exploration and flexible execution jointly contribute to the effectiveness of our approach, highlighting flexibility as a key design principle. Our code is available at: https://github.com/StringNLPLAB/FlexSQL

cs.CL↗

Analytic Boundary Terms for Arbitrary Crystal Geometries and Direct-Sum Evaluation of Madelung Constants in Triclinic Lattices

The direct-sum evaluation of Madelung constants is complicated by the conditional convergence of lattice sums, which gives rise to a shape-dependent boundary term. In this work, we present, for the first time, a closed-form analytic expression for this boundary term that is valid for arbitrary crystal geometries. For general triclinic lattices, this boundary term maps exactly onto the electrostatic potential generated by a set of uniformly charged parallelograms. In addition, we demonstrate that the residual finite-size correction for a crystal of characteristic size $p$ decays as $(2p+1)^{-2}$. Building on these results, we develop a robust direct-sum method for the accurate computation of Madelung constants in arbitrary triclinic lattices and validate its effectiveness through explicit calculations on representative Bravais lattices.

cond-mat.other↗

Active Passivation Tunes Hotspot Locations in GaN Transistors with In Situ Thermal Mechanical Visualization

Efficient thermal dissipation has become critical in emerging electronic devices. However, most existing studies have primarily focused on engineering heat dissipation pathways, largely overlooking the intrinsic behavior of the heat source itself. We demonstrate an active passivation technology that proactively tunes hotspot locations in GaN transistors. By adjusting the active passivation layer length, the hotspot is shifted from the gate edge to the drain-side AP edge, establishing a clear one-to-one spatial correlation. In-situ thermal-mechanical visualization via micro-Raman thermography, combined with multi-physics electro-thermal-mechanical simulations, directly captures the spatial redistribution of both temperature and thermal stress profiles. Electrical analysis confirms that this hotspot migration is driven by the spatial shift of the peak electric field and localized Joule heating. This proactive heat-source tuning strategy provides critical design guidelines for power electronics.

physics.app-ph↗

SR-Agent: An Experience-Driven Agentic Framework for Post-Ranking Strategy Refinement in E-Commerce Recommendation

User experience is a first-class objective in industrial e-commerce recommender systems (RS). Post-ranking strategies, which govern diversity, similarity, and exposure over a ranked list, are widely deployed in industrial RS for their simplicity and low serving cost. However, as the online recommendation environment evolves continuously, these statically configured strategies gradually become stale, thereby degrading the user experience. Refining them typically relies on manual inspection, diagnosis, and updates, making it slow, costly, and difficult to scale or reuse. Although recent LLM-based agents (e.g., RecUserSim, SimUSER, and Self-EvolveRec) offer promising directions, none of them close the full loop of automated, self-evolving strategy refinement. To bridge this gap, we introduce SR-Agent, which, to the best of our knowledge, is the first agentic framework deployed to refine post-ranking strategies in industrial RS. SR-Agent unifies three components: (i) a UserSim agent that applies inspection skills to surface user-perceived bad cases; (ii) an Analysis agent that consolidates recurring bad cases into structured, reusable diagnoses; and (iii) a constrained Strategy Refinement Harness that maps diagnoses to typed and bounded actions, gated by a four-stage reward pipeline with reversible rollback. Deployed on the Kuaishou e-commerce platform, SR-Agent continuously runs this refinement loop and, in a one-month online A/B test, increases order volume by 0.71%, browsing depth by 0.34%, and clicked-category diversity by 0.48%, while markedly shortening the refinement cycle and lowering operational cost.

cs.AI↗

ResearchStudio-Reel: Automate the Last Mile of Research from Paper to Poster, Video, and Blog

Despite growing automation, turning a paper into a coherent poster, talk video, and blog piece often remains a labor-intensive last mile. Recent systems increasingly generate multiple dissemination formats, but a practical workflow must also keep the outputs editable in native tools and bound into one navigable deliverable for revision and reuse. We present ResearchStudio-Reel, a native-editable dissemination workspace that binds its three artifacts into one interactive deliverable at the experience level, implemented as five skills executable in Claude Code and Codex: one shared extractor, three editable artifact generators, and one interactive convergence layer. A shared asset bundle feeds a PowerPoint poster and video deck, plus a bilingual Word blog; rather than re-rendering the paper into a fourth format, Paper2Reel converges these already-produced artifacts at the experience level, binding poster regions, video segments, and blog passages into one interactive viewer. Artifact-specific release checks make this delivery contract testable, and Paper2Poster additionally uses a measured-fill loop. On the Paper2Poster benchmark, our Claude Code configuration achieves the best scores among automated systems on all three aesthetic sub-criteria and the best or tied-best scores on two of three information sub-criteria. Under two VLMjudges, it exceeds the authors' posters in average aesthetics (3.56 vs. 3.03) and wins on overall quality on 74 and 95 of the 100 papers under the two judges. The full pipeline additionally packages the native-editable source artifacts and their aligned viewer. Project is available at https://aka.ms/ResearchStudio

cs.CV↗

Neutron-source fidelity for laser-driven D--D lithium-blanket tritium-breeding tests

Compact deuterium--deuterium (D--D) neutron sources can provide controllable irradiation fields for lithium-blanket studies, although their broad joint energy and angle distributions differ from the conventional $2.45$~MeV isotropic representation. We couple particle-in-cell (PIC) simulations of target-normal-sheath-accelerated deuterons with a thick-target $D(d,n)^{3}$He source model and Monte Carlo neutron transport. For natural lithium, the seven two-dimensional sources change tritium production per source neutron by $-2.5\%$ to $+54.1\%$ relative to the ideal source. The matched three-dimensional calculation gives an increase of $43.5\%$ and lowers the corresponding ratio from $1.5406$ to $1.4350$. Source substitutions show that the difference is predominantly spectral, since the real spectrum alone gives a factor of $1.4199$, while using the real neutron emission directions in place of isotropic emission adds only a further factor of $1.0106$ in the three-dimensional case. The real spectrum lowers the $^{6}$Li contribution by $6.9\%$, but the accessible $^{7}$Li$(n,Xt)$ response exceeds this loss. Enrichment to $90\%$ $^{6}$Li keeps the total change within $\pm1.5\%$. In the matched three-dimensional converter and blanket calculation, direct $D(d,p)$T production is $0.8458$ tritons per source neutron and accounts for $98.1\%$ and $86.9\%$ of the combined production for natural and enriched lithium, respectively. High-density polyethylene moderation raises tritium production by about one order of magnitude but first weakens and then reverses the increase in blanket tritium production. The analysis quantifies source-model effects in compact breeding tests.

physics.plasm-ph↗

ResearchStudio-Idea: An Evidence-Grounded Research-Ideation Skill Suite from ML Conference Outcomes

Large language models have made research ideation increasingly accessible, yet effective idea development requires more than generating candidate directions. Researchers must ground a problem in current literature, identify meaningful bottlenecks, differentiate from existing solutions, and evaluate risks before committing to implementation. We present ResearchStudio-Idea as a reusable skill suite for this first mile of research ideation. The suite includes Paper-Search, a standalone multi-source literature search skill; Scoop-Check, a standalone prior-art collision checker for novelty claims; and IdeaSpark, the end-to-end skill that composes evidence grounding, pattern-guided generation, collision retrieval, audit, and idea-card rendering into one workflow. IdeaSpark is constructed from a corpus of 1,947 machine learning conference papers collected from ICLR, ICML, and NeurIPS between 2021 and 2025, including Oral papers, a separately tracked high-citation subset, and rejected submissions. Analysis of these outcomes reveals 31 recurring ideation sub-patterns, consolidated into 15 reusable ideation patterns. Each pattern is operationalized as a structured card containing research contexts, bottleneck types, differentiation strategies, supporting precedents, and common failure modes. Given a research problem and an evidence bundle, IdeaSpark evaluates evidence readiness, reconstructs the surrounding research context, identifies unresolved bottlenecks, selects relevant patterns, instantiates one candidate direction, retrieves potentially conflicting prior work, and performs outcome-informed auditing. This workflow transforms reusable ideation patterns into traceable research proposals. Blind automated-judge evaluations show that IdeaSpark consistently produces stronger research proposals than no-skill and generic-skill baselines while maintaining competitive novelty.

cs.AI↗