Searcharxiv⌕ Search

arXiv subjects

Zihan Wang

Publications and source records attributed to Zihan Wang.

At least 127 records · Page 7Linked to original sources

The First Challenge on Mobile Real-World Image Super-Resolution at NTIRE 2026: Benchmark Results and Method Overview

This paper provides a review of the NTIRE 2026 challenge on mobile real-world image super-resolution, highlighting the proposed solutions and the resulting outcomes. The challenge aims to recover high-resolution (HR) images from low-resolution (LR) counterparts generated through unknown degradations with a x4 scaling factor while ensuring the models remain executable on mobile devices. The objective is to develop effective and efficient network designs or solutions that achieve state-of-the-art real-world image super-resolution performance. The track of the challenge evaluates performance using a weighted combination of image quality assessment (IQA) score and speedup ratios. The competition attracted 108 registrants, with 16 teams achieving a valid score in the final ranking. This collaborative effort advances the performance of mobile real-world image super-resolution while offering an in-depth overview of the latest trends in the field.

cs.CV↗

Reionization Topology as a Probe of Self-Interacting Dark Matter

The topology of cosmic reionization, the sizes, shapes, and connectivity of ionized bubbles is a primary observable of next-generation 21\,cm experiments. We show that this topology is sensitive to the microphysics of dark matter. Self-interacting dark matter (SIDM), with cross-sections $σ/m\sim 1$--$10\;\mathrm{cm^2/g}$ motivated by small-scale structure anomalies, reduces halo gas binding energies and increases the duty cycle of ionizing-photon escape. At fixed global neutral fraction $\bar{x}_{\rm HI}$, this reshapes the source population from rare, very bright emitters to more numerous, moderate emitters, producing qualitatively different ionization morphology. We decompose the effect into two scale-dependent levers: a $2$--$3\%$ emissivity-weighted bias shift at $k\lesssim 0.1\;h/\mathrm{Mpc}$, and a factor $2$--$4$ shot-noise suppression at $k\sim 0.1$--$1\;h/\mathrm{Mpc}$. A halo-by-halo semi-numerical simulation at $128^3$ resolution confirms a $\sim 60$--$70\%$ increase in the Euler characteristic of the ionization field for $σ/m \gtrsim 2\;\mathrm{cm^2/g}$, detected at $3.8σ$ across ten independent realizations. A blowout model connecting the binding-energy reduction to the duty cycle through the ISM column density distribution yields a detection threshold at $σ/m \sim 1$--$2\;\mathrm{cm^2/g}$. The signal exceeds the CDM baryonic uncertainty band and is robust to the functional form of the emissivity parametrization. The signal persists even if gravitational heating offsets $50$--$75\%$ of the blowout enhancement, and is not diluted by unresolved low-mass sources. Velocity-dependent SIDM produces a qualitatively distinct opposite-sign bias shift. These predictions are testable with SKA1-Low, establishing reionization as a new arena for probing dark matter models complementary to dwarf galaxies and galaxy clusters.

astro-ph.CO↗

ChartNet: A Million-Scale, High-Quality Multimodal Dataset for Robust Chart Understanding

Understanding charts requires models to jointly reason over geometric visual patterns, structured numerical data, and natural language -- a capability where current vision-language models (VLMs) remain limited. We introduce ChartNet, a high-quality, million-scale multimodal dataset designed to advance chart interpretation and reasoning. ChartNet leverages a novel code-guided synthesis pipeline to generate 1.5 million diverse chart samples spanning 24 chart types and 6 plotting libraries. Each sample consists of five aligned components: plotting code, rendered chart image, data table, natural language summary, and question-answering with reasoning, providing fine-grained cross-modal alignment. To capture the full spectrum of chart comprehension, ChartNet additionally includes specialized subsets encompassing human annotated data, real-world data, safety, and grounding. Moreover, a rigorous quality-filtering pipeline ensures visual fidelity, semantic accuracy, and diversity across chart representations. Fine-tuning on ChartNet consistently improves results across benchmarks, demonstrating its utility as large-scale supervision for multimodal models. As the largest open-source dataset of its kind, ChartNet aims to support the development of foundation models with robust and generalizable capabilities for data visualization understanding. The dataset is publicly available at https://huggingface.co/datasets/ibm-granite/ChartNet

cs.CV↗

Dark QCD Origin of the NANOGrav Signal and Self-Interacting Dark Matter

The NANOGrav 15-year stochastic gravitational wave background (SGWB) amplitude $A_{\rm yr} \approx 2.4 \times 10^{-15}$ lies at the upper edge of population synthesis predictions for supermassive black hole binaries (SMBHBs), motivating exploration of additional cosmological sources. We present a phenomenological framework based on an $\text{SU}(3)_D$ gauge theory that can simultaneously accommodate the gravitational wave signal and resolve small-scale structure anomalies via Self-Interacting Dark Matter (SIDM). The dark matter candidate is a heavy dark baryon $χ= QQQ$ with mass $m_χ\approx 40$~GeV, which self-interacts through a light pseudo-dilaton $d$ $m_d \approx 20$--$50$~MeV as a pseudo-Goldstone boson of approximate scale invariance arising in near-conformal gauge theories with $N_f \sim 6$--$8$ light flavors. A first-order phase transition at the MeV scale, enabled by walking dynamics near the conformal window, produces gravitational waves in the PTA band. For representative parameters $T_n \approx 5$--$6$~MeV, $α\sim 500$--$1000$, $β/H_* \sim 30$--$50$, the model provides a fit to NANOGrav data comparable to SMBHB while naturally connecting the gravitational wave amplitude to the dark matter relic density through entropy dilution $D \approx α^{3/4}$. We present explicit calculations of the bounce action, bubble wall velocity, and $ΔN_{\rm eff}$, demonstrating that the benchmark parameters are theoretically consistent and cosmologically safe ($ΔN_{\rm eff} \lesssim 0.1$ for $m_π> 2m_d$). The distinctive spectral shape ($f^3 \to f^{-4}$) provides a robust prediction testable with future PTAs.

astro-ph.CO↗

Precise Aggressive Aerial Maneuvers with Sensorimotor Policies

Precise aggressive maneuvers with lightweight onboard sensors remains a key bottleneck in fully exploiting the maneuverability of drones. Such maneuvers are critical for expanding the systems' accessible area by navigating through narrow openings in the environment. Among the most relevant problems, a representative one is aggressive traversal through narrow gaps with quadrotors under SE(3) constraints, which require the quadrotors to leverage a momentary tilted attitude and the asymmetry of the airframe to navigate through gaps. In this paper, we achieve such maneuvers by developing sensorimotor policies directly mapping onboard vision and proprioception into low-level control commands. The policies are trained using reinforcement learning (RL) with end-to-end policy distillation in simulation. We mitigate the fundamental hardness of model-free RL's exploration on the restricted solution space with an initialization strategy leveraging trajectories generated by a model-based planner. Careful sim-to-real design allows the policy to control a quadrotor through narrow gaps with low clearances and high repeatability. For instance, the proposed method enables a quadrotor to navigate a rectangular gap at a 5 cm clearance, tilted at up to 90-degree orientation, without knowledge of the gap's position or orientation. Without training on dynamic gaps, the policy can reactively servo the quadrotor to traverse through a moving gap. The proposed method is also validated by training and deploying policies on challenging tracks of narrow gaps placed closely. The flexibility of the policy learning method is demonstrated by developing policies for geometrically diverse gaps, without relying on manually defined traversal poses and visual features.

cs.RO↗

Time Series Gaussian Chain Graph Models

Time series graphical models have recently received considerable attention for characterizing (conditional) dependence structures in multivariate time series. In many applications, the multivariate series exhibit variable-partitioned blockwise dependence, with distinct patterns within and across blocks. In this paper, we introduce a new class of time series Gaussian chain graph models that represent contemporaneous and lagged causal relations via directed edges across blocks, while capturing within-block conditional dependencies through undirected edges. In the frequency domain, this formulation induces a cross-frequency shared group sparse plus group low-rank decomposition of the inverse spectral density matrices, which we exploit to establish identifiability of the time series chain graph structure. Building on this, we then propose a three-stage learning procedure for estimating the undirected and directed edge sets, which involves optimizing a regularized Whittle likelihood with a group lasso penalty to encourage group sparsity and a novel tensor-unfolding nuclear norm penalty to enforce group low-rank structure. We investigate the asymptotic properties of the proposed method, ensuring its consistency for exact recovery of the chain graph structure. The superior empirical performance of the proposed method is demonstrated through both extensive simulation studies and an application to U.S. macroeconomic data that highlights key monetary policy transmission mechanisms.

stat.ME↗

RAGEN-2: Reasoning Collapse in Agentic RL

RL training of multi-turn LLM agents is inherently unstable, and reasoning quality directly determines task performance. Entropy is widely used to track reasoning stability. However, entropy only measures diversity within the same input, and cannot tell whether reasoning actually responds to different inputs. In RAGEN-2, we find that even with stable entropy, models can rely on fixed templates that look diverse but are input-agnostic. We call this template collapse, a failure mode invisible to entropy and all existing metrics. To diagnose this failure, we decompose reasoning quality into within-input diversity (Entropy) and cross-input distinguishability (Mutual Information, MI), and introduce a family of mutual information proxies for online diagnosis. Across diverse tasks, mutual information correlates with final performance much more strongly than entropy, making it a more reliable proxy for reasoning quality. We further explain template collapse with a signal-to-noise ratio (SNR) mechanism. Low reward variance weakens task gradients, letting regularization terms dominate and erase cross-input reasoning differences. To address this, we propose SNR-Aware Filtering to select high-signal prompts per iteration using reward variance as a lightweight proxy. Across planning, math reasoning, web navigation, and code execution, the method consistently improves both input dependence and task performance.

cs.LG↗

LensAgent: A Self Evolving Agent for Autonomous Physical Inference of Sub-galactic Structure

Probing dark matter distribution on sub-galactic scales is essential for testing the Cold Dark Matter ($Λ$CDM) paradigm. Strong gravitational lensing, as one of the most powerful approach by far, provides a direct, purely gravitational probe of these substructures. However, extracting cosmological constraints is severely bottlenecked by the mass-sheet degeneracy (MSD) and the unscalable nature of manual and neural-network modeling. Here, we introduce LensAgent, a pioneering training-free, large language model (LLM)-driven agentic framework for the autonomous physical inference of mass distributions. Operating as an autonomous scientific agent, LensAgent couples high-level logical reasoning with deterministic physical modeling tools, demonstarting successful reconstruction of mass distribution in SLACS Grade A strong lensing systems. This self-evolving architecture enables the robust extraction of sub-galactic substructures at scale, unlocking the cosmological potential of upcoming wide-field surveys such as the Rubin Observatory (LSST) and Euclid.

astro-ph.GA↗

WFR-FM: Simulation-Free Dynamic Unbalanced Optimal Transport

The Wasserstein-Fisher-Rao (WFR) metric extends dynamic optimal transport (OT) by coupling displacement with change of mass, providing a principled geometry for modeling unbalanced snapshot dynamics. Existing WFR solvers, however, are often unstable, computationally expensive, and difficult to scale. Here we introduce WFR Flow Matching (WFR-FM), a simulation-free training algorithm that unifies flow matching with dynamic unbalanced OT. Unlike classical flow matching which regresses only a transport vector field, WFR-FM simultaneously regresses a vector field for displacement and a scalar growth rate function for birth-death dynamics, yielding continuous flows under the WFR geometry. Theoretically, we show that minimizing the WFR-FM loss exactly recovers WFR geodesics. Empirically, WFR-FM yields more accurate and robust trajectory inference in single-cell biology, reconstructing consistent dynamics with proliferation and apoptosis, estimating time-varying growth fields, and applying to generative dynamics under imbalanced data. It outperforms state-of-the-art baselines in efficiency, stability, and reconstruction accuracy. Overall, WFR-FM establishes a unified and efficient paradigm for learning dynamical systems from unbalanced snapshots, where not only states but also mass evolve over time. The Python code is available at https://github.com/QiangweiPeng/WFR-FM.

cs.LG↗

MindCube: Spatial Mental Modeling from Limited Views

Can Vision-Language Models (VLMs) imagine the full scene from just a few views, like humans do? Humans form spatial mental models naturally, internal representations of unseen space, to reason about layout, perspective, and motion. Our MindCube benchmark with 21,154 questions across 3,268 images exposes this critical gap, where existing VLMs exhibit near-random performance. Using MindCube, we systematically evaluate how well VLMs build robust spatial mental models through representing positions (cognitive mapping), orientations (perspective-taking), and dynamics (mental simulation for "what-if" movements). We then explore three approaches to help approximate spatial mental models in VLMs, focusing on incorporating unseen intermediate views, natural language reasoning chains, and cognitive maps. The significant improvement comes from a synergistic approach, "map-then-reason", that jointly trains the model to first generate a cognitive map and then reason upon it. By training models to reason over these internal maps, we boosted accuracy from 37.8% to 57.8% (+20.0%). Adding reinforcement learning pushed performance even further to 61.3% (+23.5%). Our key insight is that such scaffolding of spatial mental models, actively constructing and utilizing internal structured spatial representations with flexible reasoning processes, significantly improves understanding of unobservable space.

cs.AI↗

On world-volume supersymmetry of supermembrane action in static gauge

We review and elaborate on the issue of 3d world volume supersymmetry that appears as a residual part of global target space supersymmetry in the BST supermembrane action. While there is no direct ``spinning membrane'' analog of the world-volume supersymmetric spinning string action that could be obtained by coupling $D$ copies of 3d scalar multiplet to 3d supergravity, we discuss how one may construct an $N=1$ 3d supersymmetric analog of the derivative expansion of the bosonic membrane action in static gauge. We compare the resulting $N=1$ supersymmetric action for eight 3d scalar multiplets to the $N=8$ 3d supersymmetric action describing the $D=11$ supermembrane in the static gauge. The two actions are not equivalent which is related to the fact that the full $N=8$ supersymmetry of the static-gauge $D=11$ supermembrane action can be realised only if the fermions are described by an $SO(8)$ spinor rather than vector. The two actions are still directly related in special dimensions $D=4$ and 5. We also compute the one-loop world-volume scattering amplitudes for the two theories, finding that they indeed agree for $D=4,5$ but disagree for $D=11$.

hep-th↗

CompBench: Benchmarking Complex Instruction-guided Image Editing

While real-world applications increasingly demand intricate scene manipulation, existing instruction-guided image editing benchmarks often oversimplify task complexity and lack comprehensive, fine-grained instructions. To bridge this gap, we introduce CompBench, a large-scale benchmark specifically designed for complex instruction-guided image editing. CompBench features challenging editing scenarios that incorporate fine-grained instruction following, spatial and contextual reasoning, thereby enabling comprehensive evaluation of image editing models' precise manipulation capabilities. To construct CompBench, we propose an MLLM-human collaborative framework with tailored task pipelines. Furthermore, we propose an instruction decoupling strategy that disentangles editing intents into four key dimensions: location, appearance, dynamics, and objects, ensuring closer alignment between instructions and complex editing requirements. Extensive evaluations reveal that CompBench exposes fundamental limitations of current image editing models and provides critical insights for the development of next-generation instruction-guided image editing systems. Our project page is available at https://comp-bench.github.io/.

cs.CV↗

PAWS: Perception of Articulation in the Wild at Scale from Egocentric Videos

Articulation perception aims to recover the motion and structure of articulated objects (e.g., drawers and cupboards), and is fundamental to 3D scene understanding in robotics, simulation, and animation. Existing learning-based methods rely heavily on supervised training with high-quality 3D data and manual annotations, limiting scalability and diversity. To address this limitation, we propose PAWS, a method that directly extracts object articulations from hand-object interactions in large-scale in-the-wild egocentric videos. We evaluate our method on the public data sets, including HD-EPIC and Arti4D data sets, achieving significant improvements over baselines. We further demonstrate that the extracted articulations benefit downstream tasks, including fine-tuning 3D articulation prediction models and enabling robot manipulation. See the project website at https://aaltoml.github.io/PAWS/.

cs.CV↗

Convexity of the longitudinal variation of third-order resonance driving terms and its application in dynamic aperture optimization

The optimization of the dynamic aperture (DA) of a storage ring is typically a non-convex problem with multiple local optima. Recent studies showed that reducing the variation of resonance driving terms (RDTs) along the longitudinal position improves DA very effectively, as the reduction in the longitudinal variation of lower-order RDTs suppresses higher-order nonlinear terms. Therefore, minimizing the longitudinal variation of third-order RDTs is crucial for DA optimization. In this paper, we prove that the longitudinal variation of third-order RDTs, quantified using their RMS value $f_{3,\mathrm{rms}}$ at sextupole locations, is a special convex function. In the space of sextupole strengths, the iso-surfaces of $f_{3,\mathrm{rms}}$ are a series of concentric and coaxial ellipsoidal surfaces, with the central position possessing minimum $f_{3,\mathrm{rms}}$. The scanning results of a storage ring lattice show a strong consistency between the distributions of $f_{3,\mathrm{rms}}$ and DA, indicating that the optimization of DA can be regarded as a roughly approximate convex optimization problem. Based on this, a fast DA optimization method based on particle tracking is developed, where a high-quality initial population for an intelligent algorithm is generated with a Gaussian distribution based on the geometric structure of $f_{3,\mathrm{rms}}$.

physics.acc-ph↗

Scalar-Mediated Inelastic Dark Matter as a Solution to Small-Scale Structure Anomalies

We propose a scalar-mediated Self-Interacting Dark Matter (SIDM) model to address small-scale structure anomalies such as the core-cusp and diversity problems. The model is composed by a leptophilic scalar mediator and a pseudo-Dirac dark matter candidate with a mass splitting of 100ev.We imposed a dark discrete $\mathbb{Z}_2$ symmetry forbids tree-level elastic scattering. Therefore creates kinematic threshold that suppresses scattering in ultra-faint satellite galaxies while enabling large self-interaction cross-sections in dwarf galaxies via resonant enhancement. To satisfy Big Bang Nucleosynthesis (BBN) requirements, we introduce a dimension-5 magnetic dipole operator that enable the decay of the excited state ($χ_2 \rightarrow χ_1 γ$). This operator also provides a unique, low-threshold signal for direct detection experiments, characterized by a distinct $1/E_R$ recoil spectrum. We identify a benchmark parameter space around ($m_χ\approx 40$ GeV, $m_ϕ\approx 20$ MeV) where non-perturbative coupled-channel dynamics successfully reconcile astrophysical observations with cosmological bounds, including CMB constraints on annihilation.

hep-ph↗

Collaborative Temporal Feature Generation via Critic-Free Reinforcement Learning for Cross-User Sensor-Based Activity Recognition

Human Activity Recognition using wearable inertial sensors is foundational to healthcare monitoring, fitness analytics, and context-aware computing, yet its deployment is hindered by cross-user variability arising from heterogeneous physiological traits, motor habits, and sensor placements. Existing domain generalization approaches either neglect temporal dependencies in sensor streams or depend on impractical target-domain annotations. We propose a different paradigm: modeling generalizable feature extraction as a collaborative sequential generation process governed by reinforcement learning. Our framework, CTFG (Collaborative Temporal Feature Generation), employs a Transformer-based autoregressive generator that incrementally constructs feature token sequences, each conditioned on prior context and the encoded sensor input. The generator is optimized via Group-Relative Policy Optimization, a critic-free algorithm that evaluates each generated sequence against a cohort of alternatives sampled from the same input, deriving advantages through intra-group normalization rather than learned value estimation. This design eliminates the distribution-dependent bias inherent in critic-based methods and provides self-calibrating optimization signals that remain stable across heterogeneous user distributions. A tri-objective reward comprising class discrimination, cross-user invariance, and temporal fidelity jointly shapes the feature space to separate activities, align user distributions, and preserve fine-grained temporal content. Evaluations on the DSADS and PAMAP2 benchmarks demonstrate state-of-the-art cross-user accuracy (88.53\% and 75.22\%), substantial reduction in inter-task training variance, accelerated convergence, and robust generalization under varying action-space dimensionalities.

cs.LG↗

GLM-OCR Technical Report

GLM-OCR is an efficient 0.9B-parameter compact multimodal model designed for real-world document understanding. It combines a 0.4B-parameter CogViT visual encoder with a 0.5B-parameter GLM language decoder, achieving a strong balance between computational efficiency and recognition performance. To address the inefficiency of standard autoregressive decoding in deterministic OCR tasks, GLM-OCR introduces a Multi-Token Prediction (MTP) mechanism that predicts multiple tokens per step, significantly improving decoding throughput while keeping memory overhead low through shared parameters. At the system level, a two-stage pipeline is adopted: PP-DocLayout-V3 first performs layout analysis, followed by parallel region-level recognition. Extensive evaluations on public benchmarks and industrial scenarios show that GLM-OCR achieves competitive or state-of-the-art performance in document parsing, text and formula transcription, table structure recovery, and key information extraction. Its compact architecture and structured generation make it suitable for both resource-constrained edge deployment and large-scale production systems.

cs.CL↗

How Vulnerable Are AI Agents to Indirect Prompt Injections? Insights from a Large-Scale Public Competition

LLM based agents are increasingly deployed in high stakes settings where they process external data sources such as emails, documents, and code repositories. This creates exposure to indirect prompt injection attacks, where adversarial instructions embedded in external content manipulate agent behavior without user awareness. A critical but underexplored dimension of this threat is concealment: since users tend to observe only an agent's final response, an attack can conceal its existence by presenting no clue of compromise in the final user facing response while successfully executing harmful actions. This leaves users unaware of the manipulation and likely to accept harmful outcomes as legitimate. We present findings from a large scale public red teaming competition evaluating this dual objective across three agent settings: tool calling, coding, and computer use. The competition attracted 464 participants who submitted 272000 attack attempts against 13 frontier models, yielding 8648 successful attacks across 41 scenarios. All models proved vulnerable, with attack success rates ranging from 0.5% (Claude Opus 4.5) to 8.5% (Gemini 2.5 Pro). We identify universal attack strategies that transfer across 21 of 41 behaviors and multiple model families, suggesting fundamental weaknesses in instruction following architectures. Capability and robustness showed weak correlation, with Gemini 2.5 Pro exhibiting both high capability and high vulnerability. To address benchmark saturation and obsoleteness, we will endeavor to deliver quarterly updates through continued red teaming competitions. We open source the competition environment for use in evaluations, along with 95 successful attacks against Qwen that did not transfer to any closed source model. We share model-specific attack data with respective frontier labs and the full dataset with the UK AISI and US CAISI to support robustness research.

cs.CR↗