Search arXiv⌕ Search

arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 307 records · Page 17Linked to original sources

Accelerating Noisy Variational Quantum Algorithms with Physics-Informed Denoising Networks

Variational quantum algorithms are promising for near-term quantum computing, but are severely limited by hardware noise and the substantial circuit overhead required for error mitigation methods such as Zero-Noise Extrapolation (ZNE). We propose a Physics-Informed Denoising Network (PIDN) that reduces the cost of ZNE by learning a surrogate model of its optimization dynamics. By viewing the variational update as a trajectory in the parameter space, PIDN is trained to reproduce ZNE-mitigated expectation values and gradient directions while incorporating a physics-informed loss that preserves the gradient descent dynamics. Once trained, PIDN replaces repeated multi-noise evaluations with denoised expectation and gradient estimation directly from the current noisy observation and the historical trajectory, significantly reducing circuit executions. We benchmark the approach on the quantum approximate optimization algorithm for 3-regular graphs, Sherrington-Kirkpatrick, and transverse-field Ising models, as well as the variational quantum eigensolver for LiH, BeH$_2$ and H$_2$O. Across all tasks, PIDN attains performance comparable to ZNE, while reducing the number of circuit executions by a factor of approximately 4 to 6. Gradient cosine similarity with ZNE remains above 0.95 throughout training. Robustness analysis shows that PIDN fails only when ZNE itself becomes unreliable, and ablation studies confirm the necessity of the physics-informed loss for maintaining directional consistency. We further find that PIDN tracks optimization dynamics most accurately when the effective loss landscape retains strong low-frequency structure. These results establish PIDN as a scalable, resource-efficient strategy for noise-resilient variational optimization in the noisy intermediate-scale quantum regime.

quant-ph↗

Quantum state preparation and transfer based on the bound state in the doublon continuum

Bound states in the continuum (BICs) have attracted intense interest, yet their many-particle counterparts remain largely unexplored in waveguide quantum electrodynamics. We identify and characterize a bound state embedded in the doublon continuum (BIDC) that emerges when four atoms couple to a coupled-resonator waveguide with strong on-site interaction. Exploiting this interaction-enabled BIDC, we show that (i) a distant, four-atom entangled state can be prepared with high fidelity, and (ii) quantum entangled states can be coherently transferred between spatially separated nodes. Our results establish a scalable mechanism for multi-particle state generation and routing in waveguide platforms, opening a route to interaction-protected quantum communication with many-particle BICs.

quant-ph↗

EvolvingAgent: Curriculum Self-evolving Agent with Continual World Model for Long-Horizon Tasks

Completing Long-Horizon (LH) tasks in open-ended worlds is an important yet difficult problem for embodied agents. Existing approaches suffer from two key challenges: (1) they heavily rely on experiences obtained from human-created data or curricula, failing to autonomously update and select multimodal experiences, and (2) they may encounter catastrophic forgetting issues when faced with new tasks, failing to autonomously update world knowledge. To solve these challenges, this paper presents {\bf EvolvingAgent}, a curriculum self-evolving agent with a continual World Model (WM), which can autonomously complete various LH tasks across environments through self-planning, self-control, and self-reflection, without human intervention. Specifically, EvolvingAgent contains three modules, i.e., i) the experience-driven task planner, which uses an LLM along with multimodal experiences to convert LH tasks into executable sub-tasks; ii) the WM-guided action controller, which leverages WM to generate low-level actions and incorporates a self-verification mechanism to update multimodal experiences; iii) the Curriculum Learning (CL) -based reflector, which implements a two-stage CL algorithm to select multimodal experiences for task-adaptive WM updates. By building a planner-controller-reflector closed-loop dynamic, the continual WM for EvolvingAgent can autonomously update multimodal experiences and world knowledge. We conducted extensive experiments on Minecraft, compared with existing methods, EvolvingAgent can improve 111.74{\%} average success rate, reduce more than 6x ineffective actions, and generalize to the Atari environment with human-level performance.

cs.RO↗

The NIRISS PASSAGE Spectroscopic Redshift Catalog in COSMOS

We present the Parallel Application of Slitless Spectroscopy to Analyze Galaxy Evolution (PASSAGE) spectroscopic redshift catalog in the COSMOS field. PASSAGE is a JWST Cycle 1 Near Infrared Imager and Slitless Spectrograph (NIRISS) wide-field slitless spectroscopy (WFSS) pure-parallel survey, obtaining near-infrared spectra of thousands of extragalactic sources. 15 out of 63 PASSAGE fields fall within the Hubble Space Telescope (HST) COSMOS footprint, of which 11 overlap with COSMOS-Web, a JWST treasury survey providing additional space-based photometry. We present our custom line-finding algorithm and visual inspection effort used to identify emission lines and derive the spectroscopic redshifts for line-emitting sources in PASSAGE. The line-finding algorithm identifies between ~200 and 950 line-emitting candidates per field, of which typically 47% were identified as true emission lines post visual inspection. We identify 2183 emission line sources at 0.08 5), multi-line emitting sources. This agreement weakens for PASSAGE single-line emitters with ambiguous identities. These single-line emitters are likely mis-identified around 18% of the time based on comparisons to photometric redshifts. We derive stellar masses using PASSAGE photometry and spectroscopic redshifts, in broad agreement with existing COSMOS-Web stellar masses, but with some discrepancy driven by redshift disagreements. We publicly release this spectroscopic redshift catalog, which will enable community-led science in prime extragalactic fields and serve as a crucial dataset for validating Euclid and Roman spectroscopy.

astro-ph.GA↗

Indirect reciprocity beyond pairwise interactions

Cooperation in groups underpins collective responses to challenges from climate governance to public goods provision, yet how moral evaluation sustains it remains poorly understood. Indirect reciprocity -- cooperating to build a good reputation -- is well characterized for pairwise interactions, but real collective action requires individuals to be judged against the reputational profile of an entire group. Here we develop a general framework for multiplayer indirect reciprocity and show that stable group cooperation obeys a simple organizing principle: `all good, help; one bad, halt'. This rule is both necessary and sufficient for cooperation to emerge, and it recovers the classical leading eight norms in the pairwise limit. We further show that group structure fundamentally changes reputation dynamics: unlike pairwise models, which are monostable, multiplayer systems exhibit bistability and hysteresis, with a critical tipping point separating cooperative and defective regimes. Assessment of the latent norms of large language models reveals that they shift toward punitive defection when provided with richer social information, yet fail to follow the full logic of `all good, help; one bad, halt'. Our results establish a unifying principle for reputation-based cooperation in groups and provide a benchmark for evaluating cooperative alignment in artificial intelligence.

physics.soc-ph↗

Annotating and Auditing the Safety Properties of Unsafe Rust

In Rust, unsafe code is the sole source of potential undefined behaviors. To avoid misuse, Rust developers should clarify the safety properties for each unsafe API. However, the community currently lacks a key standard for safety documentation: existing safety comments in the source code and safety documentation can be ad hoc and incomplete. This paper presents a tag-centric methodology for auditing the consistency and completeness of safety documentation. We first derive a taxonomy of Safety Tags to formalize natural-language requirements. Second, because API soundness frequently relies on struct invariants, we propose a set of empirical rules to systematically audit the structural consistency of safety documentation. We implemented this methodology in safety-tool, a static linter that automatically enforces structural consistency between local safety annotations and callee requirements. Our approach was applied to the Rust standard library, fixing documentation issues on 27 APIs with 61 safety tags and identifying safety tags that are applicable to 96.1% of the public unsafe APIs in libstd. Furthermore, we have formalized the tagging idea through a Rust RFC to the wider community. We believe that the approach establishes a standardized practice of safety documentation and helps significantly reduce safety perils.

cs.PL↗

BlindGuard: Safeguarding LLM-based Multi-Agent Systems under Unknown Attacks

The security of LLM-based multi-agent systems (MAS) is critically threatened by propagation vulnerability, where malicious agents can distort collective decision-making through inter-agent message interactions. While existing supervised defense methods demonstrate promising performance, they may be impractical in real-world scenarios due to their heavy reliance on labeled malicious agents to train a supervised malicious detection model. To enable practical and generalizable MAS defenses, in this paper, we propose BlindGuard, an unsupervised defense method that learns without requiring any attack-specific labels or prior knowledge of malicious behaviors. To this end, we establish a hierarchical agent encoder to capture individual, neighborhood, and global interaction patterns of each agent, providing a comprehensive understanding for malicious agent detection. Meanwhile, we design a corruption-guided detector that consists of directional noise injection and contrastive learning, allowing effective detection model training solely on normal agent behaviors. Extensive experiments show that BlindGuard effectively detects diverse attack types (i.e., prompt injection, memory poisoning, and tool attack) across MAS with various communication patterns while maintaining superior generalizability compared to supervised baselines. The code is available at: https://github.com/MR9812/BlindGuard.

cs.AI↗

Revisable by Design: A Theory of Streaming LLM Agent Execution

Current LLM agents operate under an implicit but universal assumption: execution is a transaction -- the user submits a request, the agent works in isolation, and only upon completion does the dialogue resume. This forces users into a binary choice: wait for a potentially incorrect output, or interrupt and lose all progress. We reject this assumption and propose the stream paradigm, in which agent execution and user intervention are concurrent, interleaved processes sharing a bidirectional channel. We formalize this paradigm through a reversibility taxonomy that classifies every agent action as Idempotent, Reversible, Compensable, or Irreversible, and arrive at a core conclusion: an agent's flexibility is bounded by its reversibility. We prove that conflicting compensable actions impose unavoidable adaptation costs and that conflicting irreversible actions make full specification satisfaction impossible -- these costs are properties of the action space, not of the algorithm. Guided by this insight, we present the Revision Absorber, a reactive algorithm based on the Earliest-Conflict Rollback rule that is structurally optimal under mild assumptions. Experiments on StreamBench with real LLM agents validate all predictions: the Absorber matches the quality of a brute-force full-restart baseline while wasting an order of magnitude fewer steps of already-completed work, turning mid-execution revisions from a dead-end into a first-class interaction.

cs.LG↗

MTServe: Efficient Serving for Generative Recommendation Models with Hierarchical Caches

Generative recommendation (GR) offers superior modeling capabilities but suffers from prohibitive inference costs due to the repeated encoding of long user histories. While cross-request Key-Value (KV) cache reuse presents a significant optimization opportunity, the massive scale of individual user states creates a storage explosion that far exceeds physical GPU limits. We propose MTServe, a hierarchical cache management system that virtualizes GPU memory by leveraging host RAM as a scalable backup store. To bridge the I/O gap between tiers, MTServe introduces a suite of system-level optimizations, including a hybrid storage layout, an asynchronous data transfer pipeline, and a locality-driven replacement policy. On both public and production datasets, MTServe delivers up to 3.1* speedup while maintaining near-perfect hit ratios (>98.5%).

cs.LG↗

Amoeba: Runtime Tensor Parallel Transformation for LLM Inference Services

In Large Language Model (LLM) inference services, it is challenging to make a parallelism strategy configuration, to efficiently process the requests of variance context lengths. Requests of long context require high degree of parallelism to provide more memory for Key-Value (KV) Cache, while requests of short context prefer low degree of parallelism to increase concurrency, thus improving throughput. To maintain high throughput while supporting large context lengths on demand, we propose Amoeba, a runtime Tensor Parallel (TP) transformation for online LLM inference services, which adaptively adjusts the TP of running instances to align with the dynamics of incoming requests. Evaluations using real-world traces show that Amoeba improves throughput by 1.75x-6.57x compared to state-of-the-art solutions.

cs.DC↗

FurnSet: Exploiting Repeats for 3D Scene Reconstruction

Single-view 3D scene reconstruction involves inferring both object geometry and spatial layout. Existing methods typically reconstruct objects independently or rely on implicit scene context, failing to exploit the repeated instances commonly present in realworld scenes. We propose FurnSet, a framework that explicitly identifies and leverages repeated object instances to improve reconstruction. Our method introduces per-object CLS tokens and a set-aware self-attention mechanism that groups identical instances and aggregates complementary observations across them, enabling joint reconstruction. We further combine scene-level and object-level conditioning to guide object reconstruction, followed by layout optimization using object point clouds with 3D and 2D projection losses for scene alignment. Experiments on 3D-Future and 3D-Front demonstrate improved scene reconstruction quality, highlighting the effectiveness of exploiting repetition for robust 3D scene reconstruction.

cs.CV↗

Towards Secure Logging: Characterizing and Benchmarking Logging Code Security Issues with LLMs

Logging code plays an important role in software systems by recording key events and behaviors, which are essential for debugging and monitoring. However, insecure logging practices can inadvertently expose sensitive information or enable attacks such as log injection, posing serious threats to system security and privacy. Prior research has examined general defects in logging code, but systematic analysis of logging code security issues remains limited, particularly in leveraging LLMs for detection and repair. In this paper, we derive a comprehensive taxonomy of logging code security issues, encompassing four common issue categories and 10 corresponding patterns. We further construct a benchmark dataset with 101 real-world logging security issue reports that have been manually reviewed and annotated. We then propose an automated framework that incorporates various contextual knowledge to evaluate LLMs' capabilities in detecting and repairing logging security issues. Our experimental results reveal a notable disparity in performance: while LLMs are moderately effective at detecting security issues (e.g., the accuracy ranges from 12.9% to 52.5% on average), they face noticeable challenges in reliably generating correct code repairs. We also find that the issue description alone improves the LLMs' detection accuracy more than the security pattern explanation or a combination of both. Overall, our findings provide actionable insights for practitioners and highlight the potential and limitations of current LLMs for secure logging.

cs.SE↗

Galaxy Metallicity Gradients in the Reionization Epoch from the FIRE-2 Simulations

We employ the high-redshift suite of FIRE-2 cosmological hydrodynamic zoom-in simulations to investigate the evolution of gas-phase metallicity radial gradients in galaxies in the epoch of reionization (EoR). Our sample consists of 22 galaxies spanning the redshift range $z \sim 10-5$. We find that galaxies at $z\sim10$ exhibit a median metallicity gradient of $-0.15\,\mathrm{dex\cdot kpc^{-1}}$ with substantial scatter, which gradually flatten to $-0.1\,\mathrm{dex\cdot kpc^{-1}}$ at $z\sim6$, accompanied by a reduction in scatter. In the EoR, metallicity gradients correlate positively with stellar mass: more massive galaxies display flatter gradients with smaller scatter, broadly consistent with recent JWST observations. At fixed stellar mass, galaxies with higher star formation rates (SFRs) exhibit steeper negative gradients, while sSFR shows a strong anti-correlation with gradient slope. Because EoR galaxies in FIRE-2 generally lack significant rotational support, we adopt the ratio of peak-to-peak velocity shear to twice the velocity dispersion ($Δv/2σ$) as a proxy for the strength of gas flows. We find a strong positive correlation between metallicity gradients and $Δv/2σ$: galaxies with lower $Δv/2σ$ (i.e., weaker gas flows) tend to exhibit steeper negative gradients. Furthermore, galaxies with steeper gradients display higher central SFR surface densities, suggesting localized star formation with inefficient interstellar medium mixing that drives inside-out chemical enrichment in galaxy evolution in the early Universe.

astro-ph.GA↗

How Much Thinking is Enough? Quantifying and Understanding Redundancy in LLM Reasoning

Reasoning-capable large language models solve hard problems by emitting long chains of thought, paying heavily in latency, GPU time, and energy. Casual inspection of their traces reveals extensive reformulation, verification, and circular self-reflection, yet how much of this deliberation is actually necessary has never been measured at scale or explained from first principles. This paper closes both gaps. We formalise reasoning redundancy directly in terms of the reasoning model itself: the redundancy of a correct trace is the largest fraction of its trailing segmented steps that can be truncated while $π$, forced to terminate thinking and emit a final answer, still produces the correct answer. A large-scale quantification across four frontier reasoning models and two mathematical benchmarks shows that step-level redundancy is consistently high -- between 61% and 93% across the 8 (model, benchmark) conditions we study, with the median critical prefix equal to a single segmented step in six of the eight conditions -- that the finding is robust to the choice of judge family, and that although $ρ$ decreases with problem difficulty on MATH-500, all four models remain substantially redundant ($ρ\in [46\%, 85\%]$) even on the hardest Level-5 problems. We then prove that this redundancy is a structural consequence of length-agnostic outcome rewards, not a model-specific artefact: under any such reward, no finite expected stopping time is optimal. The result holds regardless of RL algorithm, base model, data distribution, or whether the policy is obtained via RL or distillation; over-thinking is therefore not a bug to be patched in individual models but a structural property of how current reasoning models are trained. Code: https://github.com/zhiyuanZhai20/how-much-thinking-is-enough

cs.AI↗

Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking

Exact subgraph matching on large-scale graphs remains a challenging problem due to high computational complexity and distributed system constraints. Existing GNN-based path embedding (GNN-PE) frameworks achieve efficient exact matching on single machines but lack scalability and optimization for distributed environments. To address this gap, we propose three core innovations to extend GNN-PE to distributed systems: (1) a lightweight dynamic correlation-aware load balancing and hot migration mechanism that fuses multi-dimensional metrics (CPU, communication, memory) and guarantees index consistency; (2) an online incremental learning-based multi-GPU collaborative dynamic caching strategy with heterogeneous GPU adaptation and graph-structure-aware replacement; (3) a query plan ranking method driven by dominance embedding pruning potential (PE-score) that optimizes execution order. Through METIS partitioning, parallel offline preprocessing, and lightweight metadata management, our approach achieves "minimum edge cut + load balancing + non-interruptible queries" in distributed scenarios (tens of machines), significantly improving the efficiency and stability of distributed subgraph matching.

cs.DB↗

Galaxies at z > 10: ΛCDM predicts increased Star Formation Efficiency

We show that the rest-frame UV statistics and global properties of galaxies at 7 <= z <= 14 are naturally reproduced within the standard ΛCDM framework when galaxy formation is modeled with UniverseMachine applied to the high-resolution Uchuu N-body simulation. Our model matches the UV luminosity functions over five magnitudes and reproduces the evolution of the UV (and inferred star formation rate) density once internal dust attenuation is included. Comparisons with spectroscopically confirmed JWST/HST galaxies show good agreement with the stellar mass-SFR and stellar mass-UV luminosity relations. In contrast, earlier claims of insufficient stellar masses at z=8 are inconsistent with our model and are likely driven by systematic uncertainties, including AGN contamination, dust attenuation, and the lack of JWST/MIRI constraints. A key prediction is that the star-formation efficiency increases with redshift at fixed halo mass, reaching 2-3 percent of baryons converted into stars by z=10-12. These results demonstrate that current JWST observations of early galaxy populations can be explained within the ΛCDM framework.

astro-ph.GA↗

Solution of the Ising model with Brascamp-Kunz boundary conditions by the transfer matrix method

The square lattice Ising model under the Brascamp-Kunz boundary conditions is a well-known exactly solvable lattice model. The exact solution of this system has been derived within the framework of Pfaffian-type method. In this paper we provide a derivation for the solution by the Schultz-Mattis-Lieb method in the transfer matrix formalism. We set special interactions on the boundaries and take certain limit of these interactions, so that the system under the Brascamp-Kunz boundary conditions is transformed into another system under the toroidal boundary conditions. The Schultz-Mattis-Lieb method is applied to the mapping system and the partition function is exactly solved in the fermionic representation. The Fisher zeros are analytically calculated and the physical critical point is identified. We also discuss the difference between the transfer matrix approaches to the Brascamp-Kunz and to the toroidal boundary conditions. Our work introduces a member to the family of transfer-matrix-based studies for Ising model under various boundary conditions.

cond-mat.stat-mech↗

When Surfaces Lie: Exploiting Wrinkle-Induced Attention Shift to Attack Vision-Language Models

Visual-Language Models (VLMs) have demonstrated exceptional cross-modal understanding across various tasks, including zero-shot classification, image captioning, and visual question answering. However, their robustness to physically plausible non-rigid deformations-such as wrinkles on flexible surfaces-remains poorly understood. In this work, we propose a parametric structural perturbation method inspired by the mechanics of three-dimensional fabric wrinkles. Specifically, our method generates photorealistic non-rigid perturbations by constructing multi-scale wrinkle fields and integrating displacement field distortion with surface-consistent appearance variations. To achieve an optimal balance between visual naturalness and adversarial effectiveness, we design a hierarchical fitness function in a low-dimensional parameter space and employ an optimization-based search strategy. We evaluate our approach using a two-stage framework: perturbations are first optimized on a zero-shot classification proxy task and subsequently assessed for transferability on generative tasks. Experimental results demonstrate that our method significantly degrades the performance of various state-of-the-art VLMs, consistently outperforming baselines in both image captioning and visual question-answering tasks.

cs.CV↗