Search arXiv⌕ Search

arXiv subjects

Kuan Zhang

Publications and source records attributed to Kuan Zhang.

At least 19 recordsLinked to original sources

Towards Generalist Game Agents: A Survey of Foundation Models in Virtual Worlds

The real world unfolds along a single set of physics laws, yet human intelligence demonstrates a remarkable capacity to generalize experiences from this singular physical existence into a multiverse of games, each governed by entirely different rules, aesthetics, physics, and objectives. This omni-reality adaptability is a hallmark of general intelligence. As Artificial Intelligence progresses towards Artificial General Intelligence, the multiverse of games has evolved from mere entertainment into the ultimate ground for training and evaluating AGI. The pursuit of this generality has unfolded across four eras: from environment-specific symbolic and reinforcement learning agents, to current large foundation models acting as generalist players, and toward a future creator stage where agent both creates new game worlds and continually evolves within them. We trace the full lifecycle of a generalist game player along four interdependent pillars: Dataset, Model, Harness, and Benchmark. Every advance across these pillars can be read as an attempt to break one of five fundamental trade-offs that currently bound the whole system. Building on this end-to-end view, we chart a five-step roadmap, progressing from single-game mastery to the ultimate creator stage in which the agent simultaneously creates and evolves within theoretical game multiverse. Taken together, our work offers a unified lens onto a rapidly shifting field, and a principled path toward the omnipotent generalist agent capable of seamlessly mastering any challenge within the multiverse of games, thereby paving the way for AGI.

cs.CV↗

Scaling in Games: Continued Pre-Training For Embodied Agents In Diverse Virtual Worlds

Scaling data, diversity and model capacity has improved embodied learning in physical environments, where diverse experiences remain grounded in shared physical laws. Whether these gains extend to virtual worlds with different visual styles, dynamics, controls, and objectives remains unclear. We investigate this question through a controlled study of continued pre-training (CPT) across three axes: data volume, diversity, and model size. Our 120 training configurations span four model sizes from 0.8B to 27B, six data budgets from 50 to 1,600 hours, and five mixtures ranging from Minecraft-only data to diverse multi-world corpora. We assess performance and generalization using three-level validation losses and gameplay benchmarks from in-corpus worlds to unseen worlds. Our results show: (1) more data improves in-corpus performance, diversity improves transfer to related worlds with limited gains in distant worlds, and model size improves data efficiency but generalizes worse to distant worlds under single-world training; (2) we observe an early interface phase with broad cross-world benefits and a later world phase with gains narrowed to in-corpus and related worlds, and fit an empirical scaling law relating validation loss to data volume, diversity and model size; and (3) our models are competitive with Minecraft specialists and frontier models in 3D worlds, and perform best in real-time settings. However, the limits of imitation and persistent gaps in distant worlds suggest that building generalist embodied agents requires richer training stages beyond continued pre-training.

cs.AI↗

Can World and Action Modeling Benefit Each Other under Unified Causal Training?

World and action modeling are closely related, yet their reciprocal benefits under unified causal training remain unclear. We introduce OneWM, a simple framework for unified causal training that treats actions as both conditions for world prediction and targets for policy learning within a shared video-action architecture. Using this framework, we investigate whether learning forward dynamics conditioned on specified actions improves action learning, and whether learning to generate actions in turn improves action-conditioned world modeling. We use LIBERO, LIBERO-Plus, and RoboCasa365 as embodied testbeds to evaluate both policy learning and world modeling, complemented by real-world policy experiments. Learning the visual consequences of specified actions improves policy performance and generalization across changing scenes. In turn, action learning improves multi-view world-prediction fidelity under the same architecture. Together, these results answer both questions positively, supporting reciprocal benefits between world modeling and action generation under unified causal training.

cs.CV↗

Evolving to Match Capabilities: Improving Harness Self-Evolution via Skill Adaptation

Harness self-evolution offers a practical route for LLM agents to improve from execution experience without updating model parameters. Its effectiveness depends on whether models can successfully act on the guidance provided by their harnesses. However, we find that harness benefits are not uniform across model capabilities: skills that improve stronger models can provide little benefit or even degrade performance for weaker ones. Across seven models and three benchmarks, we identify 103 task-skill pairs where skills improve GPT-5.6-luna by 31.1 points but degrade Gemma-4-E4B by 8.8 points. In 86% of failed weak-model runs, the violated requirement is already stated in the skill. This motivates skill adaptation: reformulating existing skills to match the executor's capabilities and make their guidance easier to execute. To achieve this, we diagnose failures in tool execution, context management, instruction following, and verification, and distill these diagnoses into a fixed meta-skill that guides adaptation during harness self-evolution. Guided by the meta-skill, a capable external rewriter, Kimi-K3, adapts skills without execution evidence, improving the three weak executors by 5.1-14.1 points over the original skills. We then incorporate this adaptation into a five-round self-evolution loop, where each model revises its own skill from execution trajectories and verifier feedback. Across seven executors, from Gemma-4-E4B to Kimi-K2.5, the meta-skill consistently improves final scores by 2.0-5.1 points over the same loop without the meta-skill. Our findings provide practical design guidance for developing more effective harness self-evolution methods.

cs.LG↗

Video-Arena: A Scalable Agentic Video Benchmark for Spatiotemporal Capability

Understanding and tracking a dynamic world are fundamental to visual intelligence. Existing video benchmarks provide limited insight into whether models can maintain a coherent understanding of evolving world state. Building such a benchmark from real-world videos is challenging because the underlying world state is partially observable, making annotations hard to obtain. To close this gap, we introduce Video-Arena, a benchmark that turns competitive games into scalable, verifiable tests of how well models understand evolving world states from videos. Specifically, inspired by how humans understand dynamic events, we evaluate spatiotemporal world state understanding and tracking through three task categories: perceiving critical events, interpreting state updates, and tracking the resulting states. Our pipeline can generate videos and aligned reference labels from game records at scale. To keep evaluation affordable and reproducible, we curate a golden set of 180 tasks across 9 games and run evaluations under two protocols: native visual understanding and tool-assisted agentic analysis. The best-performing systems achieve F1 scores of and under the two protocols, respectively. The result highlights that native models struggle to perceive events reliably, while tool-assisted systems improve event recovery but still struggle to interpret state updates and track the resulting states consistently over time. Our project page is in https://videoarena-bench.github.io

cs.CV↗

Rough backward stochastic differential equations

We develop an intrinsic well-posedness theory for nonlinear backward stochastic differential equations (BSDEs) driven simultaneously by Brownian motion and a (level-$2$) rough path of finite $p$-variation. Unlike earlier approaches based on smooth approximation or transformation methods, we formulate the equation directly by viewing its solution as a rough semimartingale (in the sense of \cite{friz2023rough}). This framework is particularly suited to BSDEs, whose Brownian martingale component is only implicitly defined and lacks the \emph{a priori} time regularity required by stochastic-sewing-based controlled rough path methods \cite{fhl21,allan2024rough}. We establish comparison, existence, uniqueness, and stability under the natural regularity condition $H\in C_b^γ$, $γ>p$. The main analytical difficulty, namely, the loss of integrability arising from nonlinear composition, is overcome through conditional $p$-variation norms with BMO-type properties. Finally, by randomizing the rough driver as a Brownian rough path, we establish a direct correspondence between rough BSDEs and backward doubly stochastic differential equations (BDSDEs).

math.PR↗

SnapBench: Benchmarking Snap-and-Ask Multimodal Retrieval for Mobile Interactions

Mobile AI acts as a visual oracle, empowering users to snap a picture of something and ask for information. Snap-and-ask retrieval is now one of the most common entry points for mobile AI, yet photos are often blurry, while text questions may be short or mistyped. Existing benchmarks only test on clean inputs or do not isolate paired robustness in snap-and-ask retrieval. Therefore, we introduce SnapBench, the first paired benchmark for robust snap-and-ask multimodal retrieval, spanning 1,145 queries, 9,085 gallery items under 53 controlled corruption conditions with human annotations. We evaluate 16 multimodal retrievers, covering dual-tower encoders and embedding-based VLMs. Results show that image corruptions substantially degrade retrieval, while text corruptions mainly affect text-only retrieval and have limited impact on joint retrieval. Clean image-only retrieval often outperforms joint retrieval, indicating the coarse-text drag and the lack of cross-modal fallback under noisy inputs. SnapBench provides a controlled testbed for evaluating robust retrieval in snap-and-ask scenarios. We further propose MOOR (Modality-anchored, Outlier-aware, Optimal Reweighting), a simple adaptive fusion approach, highlighting the need for reliability-aware modality calibration in snap-and-ask retrieval.

cs.CV↗

Two-nucleon systems at $m_π\approx292$ MeV from lattice QCD

Nucleon-nucleon systems in the $^3S_1$ and the $^1S_0$ channels are studied in lattice quantum chromodynamics at a pion mass of approximately $m_π\approx292$ MeV, employing three $N_f = 2+1$ ensembles with the same pion mass and lattice spacing $a=0.10530(18)$ fm but different spatial volumes. Finite-volume energies of the nucleon-nucleon systems are determined in both the rest frame and a moving frame. The distillation quark smearing method is applied to improve the precision and to ensure the symmetric correlators by using the same interpolating operators at sink and source. The scattering amplitudes are extracted from the finite-volume spectra using the Lüscher's finite-volume method. At the studied pion mass, both the $^3S_1$ (deuteron) and $^1S_0$(di-neutron) channels exhibit a virtual state pole, with binding energies of $6^{+5}_{-3}$ MeV and $11^{+6}_{-5}$ MeV, respectively. To investigate the effects of the left-hand cut, an alternative method -- the Non-Perturbative Hamiltonian framework (NPHF) -- is used for the scattering analysis and yields consistent results with those from the Lüscher method.

hep-lat↗

Towards Spatial Supersensing in the Wild

Humans can efficiently parse continuous sensory streams, from hours to years, scaffolding an internal world model that grounds spatial reasoning and prediction. To mimic this capacity, spatial supersensing challenges multimodal models to move beyond linguistic understanding toward true world modeling. However, their benchmark relies on synthetic long videos, formed by concatenating random short clips, and is mostly limited to household scenes, leaving real-world continuity and diversity underexplored. To address the gap, we introduce $\textbf{VSI-Super-Wild}$, a large-scale benchmark for evaluating spatial supersensing over long temporal horizons in diverse in-the-wild scenes. Notably, inspired by cognitive studies on how humans structure experience, we systematically probe the full triad of world state: the agent (observer), objects (scene items), and the environment (places and global layout). In total, VSI-Super-Wild contains $\textbf{6,980}$ human-verified question-answer pairs derived from $\textbf{442}$ real-world videos spanning 8 scene categories, including long-form recordings exceeding 4 hours. Results on VSI-Super-Wild expose a fundamental disconnect: despite advances in static image understanding, models consistently fail at tasks that require coherent world-state tracking over time. We characterize how performance degrades with world-state complexity and temporal horizon, and diagnose four failure modes: spatial collapse, semantic shortcuts, insufficient update, and instance confusion. This taxonomy reveals that models lack mechanisms to bind objects, agents, and environments into a unified spatial world model, a fundamental gap that defines the path forward for spatial supersensing.

cs.CV↗

GameVerse: Can Vision-Language Models Learn from Video-based Reflection?

Human gameplay is a visually grounded interaction loop in which players act, reflect on failures, and watch tutorials to refine strategies. Can Vision-Language Models (VLMs) also learn from video-based reflection? We present GameVerse, a comprehensive video game benchmark that enables a reflective visual interaction loop. Moving beyond traditional fire-and-forget evaluations, it uses a novel reflect-and-retry paradigm to assess how VLMs internalize visual experience and improve policies. To facilitate systematic and scalable evaluation, we also introduce a cognitive hierarchical taxonomy spanning 15 globally popular games, dual action space for both semantic and GUI control, and milestone evaluation using advanced VLMs to quantify progress. Our experiments show that VLMs benefit from video-based reflection in varied settings, and perform best by combining failure trajectories and expert tutorials-a training-free analogue to reinforcement learning (RL) plus supervised fine-tuning (SFT).Our project page is available at https://gameverse-bench.github.io/ . Our code is available at https://github.com/THUSI-Lab/GameVerse .

cs.CV↗

Microwave electrometry with quantum-limited resolutions in a Rydberg atom array

Microwave (MW) field sensing is foundational to modern technology, yet its evolution, reliant on classical antennas, is constrained by fundamental physical limits on field, temporal, and spatial resolutions. Here, we demonstrate an MW electrometry that simultaneously surpasses these constraints by using individual Rydberg atoms in an optical tweezer array as coherent sensors. This approach achieves a field sensitivity within 13% of the standard quantum limit, a response time that exceeds the Chu limit by more than 11 orders of magnitude, and in-situ near-field mapping with λ/3000 spatial resolution. This work establishes Rydberg-atom arrays as a powerful platform that unites quantum-limited sensitivity, nanosecond-scale response time, and sub-micrometer resolution, opening new avenues in quantum metrology and precision electromagnetic field imaging.

physics.atom-ph↗

Observation of non-Hermitian many-body phase transition in a Rydberg-atom array

Non-Hermitian quantum mechanics with parity-time (PT) symmetry offers a powerful framework for exploring the complex interplay of dissipation and coherent interactions in open quantum systems. While PT-symmetry breaking has been studied in various physical systems, its observation on a quantum many-body level remains elusive. Here, we experimentally realize a non-Hermitian XY model in a strongly-interacting Rydberg-atom array. By measuring the Loschmidt Echo of a fully polarized state, we observe distinct dynamical signatures of a PT-symmetry-breaking phase transition. Dipole interactions are found to play a crucial role, not only determining the transition point but also triggering a non-Hermitian many-body blockade effect that protects the Loschmidt Echo from decay with a non-monotonic dependence on the system size. Our results reveal intricate interaction-induced effects on PT-symmetry breaking and open the door for exploring non-Hermitian many-body dynamics beyond single-particle and mean-field paradigms.

quant-ph↗

Handling Label Noise via Instance-Level Difficulty Modeling and Dynamic Optimization

Recent studies indicate that deep neural networks degrade in generalization performance under noisy supervision. Existing methods focus on isolating clean subsets or correcting noisy labels, facing limitations such as high computational costs, heavy hyperparameter tuning process, and coarse-grained optimization. To address these challenges, we propose a novel two-stage noisy learning framework that enables instance-level optimization through a dynamically weighted loss function, avoiding hyperparameter tuning. To obtain stable and accurate information about noise modeling, we introduce a simple yet effective metric, termed wrong event, which dynamically models the cleanliness and difficulty of individual samples while maintaining computational costs. Our framework first collects wrong event information and builds a strong base model. Then we perform noise-robust training on the base model, using a probabilistic model to handle the wrong event information of samples. Experiments on five synthetic and real-world LNL benchmarks demonstrate our method surpasses state-of-the-art methods in performance, achieves a nearly 75% reduction in computational time and improves model scalability.

cs.LG↗

Backward stochastic differential equations with nonlinear Young drivers II

This paper continues our previous work (Part I, arXiv:2504.18632v3) on the well-posedness of backward stochastic differential equations (BSDEs) involving a nonlinear Young integral of the form $\int_{t}^{T}g(Y_{r})η(dr,X_{r})$, with particular focus on the case where the driver $η(t,x)$ is unbounded. To address this setting, we develop a new localization method that extends solvability from BSDEs with bounded drivers to those with unbounded ones. As a direct application, we derive a nonlinear Feynman-Kac formula for a class of partial differential equations driven by Young signals (Young PDEs). Moreover, employing the proposed localization method, we obtain error estimates that compare Cauchy-Dirichlet problems on bounded domains with their whole-space Cauchy counterparts, with special attention to non-Lipschitz PDEs.

math.PR↗

Real-time scattering and freeze-out dynamics in Rydberg-atom lattice gauge theory

Understanding the non-equilibrium dynamics of gauge theories remains a fundamental challenge in high-energy physics. Indeed, most large scale experiments on gauge theories intrinsically rely on very far-from equilibrium dynamics, from heavy-ion to lepton and hadron collisions, which is in general extremely challenging to treat ab initio. Quantum simulation holds intriguing potential in tackling this problem and pioneering experiments have observed different characteristic features of gauge theories, such as string breaking and false vacuum decay. Here, using a programmable Rydberg atom array, we observe real-time scattering and freeze-out dynamics in a (1+1)-dimensional U(1) lattice gauge theory. Through spatiotemporal Hamiltonian engineering, we demonstrate dynamical confinement-deconfinement transitions, revealing string fragmentation and symmetry restoration during quenches. We track scattering processes with single-site resolution across a range of parameter regimes. Utilizing a double quench protocol, we observe dynamical freeze-out: upon quenching the Hamiltonian after scattering, despite the injection of an extensive energy, the system evolution -- in terms of both low-order correlations and entanglement -- freezes, effectively stabilizing a highly correlated equilibrium state -- a situation that reminisces that of collisions between heavy ions. Our work establishes a high-resolution approach for probing non-perturbative gauge dynamics, opening alternative pathways toward studying far-from-equilibrium phenomena in high-energy physics.

cond-mat.quant-gas↗

Backward stochastic differential equations with nonlinear Young drivers I

This paper (alongside its companion, Part II \cite{BSDEYoung-II}) investigates backward stochastic differential equations (BSDEs) involving a nonlinear Young integral of the form $\int_{t}^{T}g(Y_{r})η(dr,X_{r})$, where the driver $η(t,x)$ is a space-time Hölder continuous function and $X$ is a diffusion process. Solutions to such equations provide a probabilistic interpretation of the solutions to stochastic partial differential equations (SPDEs) driven by space-time noise. Assuming the driver $η(t,x)$ is bounded, we establish the existence and uniqueness of the solutions to these BSDEs via a modified Picard iteration method. We then derive a comparison principle by analyzing the associated linear BSDEs and establish regularity properties of the solutions. As an application, we obtain Feynman-Kac formulae for a class of linear stochastic heat equations subject to Neumann boundary conditions.

math.PR↗

Parton Distribution Function of a Deuteron-like Dibaryon System from Lattice QCD

We report a lattice QCD calculation of the parton distribution function (PDF) of a deuteron-like dibaryon system using large-momentum effective theory. The calculation is done on three Wilson Clover ensembles with a fixed lattice spacing a=0.105 fm and two pion masses. The lattice matrix elements are computed at proton momenta up to 2.46 GeV with the signal of high momentum modes being improved by applying the momentum smearing technique. The state-of-the-art renormalization, matching and extrapolation are then applied to obtain the final result of the light-cone PDF. A comparison between the result of the dibaryon system and the sum of the proton and neutron PDFs is also given.

hep-lat↗

Reflected backward stochastic differential equations with rough drivers

In this paper, we investigate reflected backward stochastic differential equations driven by rough paths (rough RBSDEs), which can be viewed as probabilistic representations of nonlinear rough partial differential equations (rough PDEs) or stochastic partial differential equations (SPDEs) with obstacles. Furthermore, we demonstrate that solutions to rough RBSDEs solve the corresponding optimal stopping problems within a rough framework. This development provides effective and practical tools for pricing American options in the context of the rough volatility model, thus playing a crucial role in advancing the understanding and application of option pricing in complex market regimes. The well-posedness of rough RBSDEs is established using a variant of the Doss-Sussman transformation. Moreover, we show that rough RBSDEs can be approximated by a sequence of penalized BSDEs with rough drivers. For applications, we first develop the viscosity solution theory for rough PDEs with obstacles via rough RBSDEs. Second, we solve the corresponding optimal stopping problem and establish its connection with an American option pricing problem in the rough path setting.

math.PR↗