Search arXiv⌕ Search

arXiv subjects

Xu Zhang

Publications and source records attributed to Xu Zhang.

At least 37 records · Page 2Linked to original sources

Error-Propagation Modeling for Failure Attribution in LLM-Based Multi-Agent Systems

LLM-based multi-agent systems (MASs) are increasingly used to solve complex tasks through coordinated reasoning, tool use, and interaction with external resources. However, attributing failures in such systems remains challenging because the observed outcome often does not directly reveal the error responsible for the failed execution. In this work, the attribution target is the decisive error, defined as the agent--step pair whose correction would recover the failed execution. Existing approaches largely identify suspicious steps without explicitly modeling how errors propagate across interactions or persist in unresolved loops, making decisive errors difficult to distinguish from downstream failure symptoms. We propose \textbf{E}rror-Propagation \textbf{M}odeling for \textbf{F}ailure \textbf{A}ttribution (\textbf{EMFA}). EMFA constructs a structured representation of the failed trajectory, models both cascading propagation and persistent interaction loops, and uses propagation-aware candidate screening followed by counterfactual verification to identify the decisive agent--step pair. On the Who\&When benchmark, EMFA achieves state-of-the-art step-level attribution accuracy and remains competitive at the agent level. It improves the previous best step-level results by 3.45 and 4.40 percentage points on the Hand-Crafted and Algorithm-Generated subsets, respectively.

cs.AI↗

Recompose and Refine Latent Reasoning Flows for Vision-Language-Action Models

Latent reasoning enables vision-language-action (VLA) models to transform multimodal observations into task-relevant internal states before generating continuous robot actions. While existing methods learn to generate or refine such states for each policy query, they discard successful reasoning after execution and therefore reconstruct similar computation from scratch. We present Reasoning and Flow Memory (FLOWMEM), a unified VLA model that turns successful latent computation into reusable reasoning experience. Rather than appending a fixed retrieved context, FLOWMEM dynamically retrieves and recomposes compatible latent fragments as the embodied context evolves, forming a reasoning route that follows the temporal structure and progress of successful computation. The route is then refined using current visual and proprioceptive evidence before it conditions action generation. Experiments on RoboMME and LIBERO-Plus show that FLOWMEM attains 48.0% and 77.3% success, outperforming memory-free policies by 1.7 and 4.1 percentage points, respectively. These results demonstrate the value of reusing successful latent computation for closed-loop VLA control.

cs.AI↗

Geometry-Conforming Finite Element Methods for Interface Problems on Fitted and Unfitted Meshes

We develop an arbitrary-degree geometry-conforming finite element (GC-FE) framework for two-dimensional elliptic boundary value and interface problems on curved domains. Using the Frenet--Serret transformation, curved-boundary and interface-fitted segments are represented exactly, while polynomials in Frenet coordinates generate generally nonpolynomial local shape functions in physical coordinates. For interface-unfitted meshes, GC-FE spaces on curved-boundary elements are coupled with geometry-conforming immersed finite element (GC-IFE) spaces on interface-cut elements, with standard polynomial spaces used elsewhere. We establish optimal approximation, inverse, and trace estimates for the GC-FE spaces. For fitted meshes, we prove well-posedness and optimal error estimates in energy and $L^2$ norms for a symmetric interior penalty discontinuous Galerkin discretization. By retaining the prescribed curves exactly, the method avoids the geometric variational crime associated with curved-geometry approximation and requires no corresponding geometric consistency estimates. Numerical experiments confirm the predicted rates, show global accuracy comparable to nodal isoparametric finite elements and smaller true-interface trace errors in the reported tests, and demonstrate the coupled GC-FE-GC-IFE method on interface-unfitted meshes.

math.NA↗

Origin of superconductivity in bilayer nickelates: a Quantum Monte Carlo study for a sign-problem-free effective model

Using determinant Quantum Monte Carlo, we investigate the interplay between doping, inter-layer tunneling and onsite Hund's coupling in stabilizing superconductivity (SC) in a two-orbital model for the bilayer nickelate $\text{La}_3\text{Ni}_2\text{O}_7$. With realistic dispersion and for certain values of the interaction parameters, the auxiliary-field-decoupled fermion Hamiltonian has Kramers anti-unitary symmetries which guarantee the absence of a sign problem. The same anti-unitary symmetries can also be used to show there is a second instability towards $(π,π)$ inter-layer bond order (BO) in the strong interaction limit. We indicate the possible connection between this bond order and the enigmatic density wave state observed in experiment, and clarify the decisive role played by the inter-layer tunneling in the competition between SC and BO. Finally, possible directions on how to enhance the SC transition temperature and stabilize the SC phase are also discussed.

cond-mat.str-el↗

Sobolev spaces in infinite dimensions

The classical theory of Sobolev spaces in finite dimensions is well established. Because infinite-dimensional spaces possess inherent analytical and topological complexities, developing a theory of Sobolev spaces for functions of infinitely many variables---rather than merely extending the classical finite-dimensional theory---is far from routine and has led to long-standing open problems. In this paper, we establish such a theory and systematically determine the extent to which these classical results can be carried over to this setting. By carefully adapting the tools introduced in our recent works, we establish a series of infinite-dimensional counterparts of the classical theorems and, in the process, reveal new phenomena with no finite-dimensional analogue. The methods and concepts developed here, together with the results obtained, furnish a robust framework for further study of Sobolev spaces and related problems in infinite-dimensional analysis.

math.FA↗

Topology-Consistent Task Planning over Cellular Workflow Complexes for LLM-based Agents

Task planning for LLM agents requires workflows that satisfy both user intent and complex sub-task dependencies. While existing planners work well for sequential or directed acyclic graph (DAG)-like structures, they struggle with workflow patterns such as verification-correction loops, convergent branch merging, and reusable intermediate states that arise naturally in real-world tool orchestration. We present TopoPlanner, a topology-consistent planning framework that lifts tool dependency graphs into cellular workflow complexes and uses them as topologyaware context for LLM tool planning. TopoPlanner retrieves a request-relevant closed subcomplex through cosheaf-consistent cellular retrieval, performs multidimensional structural reasoning over the retrieved topology, and interfaces the resulting cellular representation with the planner LLM for tool-sequence generation. Experiments on four tool-planning benchmarks with topology-guided loop, merge, and loop-merge workflows show consistent improvements over prompt-based and graph-enhanced baselines across different local LLM backbones.

cs.AI↗

CoMemBench: Benchmarking Collaborative Memory Boundaries across Multi-Agent Workflow Topologies

Multi-agent workflows require task-relevant information to be shared across agents, while irrelevant, stale, unverified, or incompatible information must remain isolated. We call this task-conditioned scope of information a collaborative memory boundary. Workflow topology determines which intermediate artifacts are applicable to which downstream workers and when they cease to be valid, thereby providing a structural stress dimension for sharing and isolation. Existing memory benchmarks primarily evaluate retention and retrieval, whereas multi-agent benchmarks emphasize coordination and end-to-end completion, leaving topology-conditioned memory boundaries largely unmeasured. We introduce CoMemBench, an execution-grounded benchmark for collaborative memory sharing and isolation across multi-agent workflow topologies. It constructs 800 composite workflows across four domains from source-grounded dependency graphs, with node-local specifications, verifiable artifact handoffs, native evaluators, and matched isolation challenges. CoMemBench measures workflow completion, verified node progress, required-handoff reliability, isolation robustness, and token cost. Experiments reveal a sharing-isolation trade-off: broader context improves information availability but can weaken isolation, while system rankings shift across topologies and artifact violations.

cs.AI↗

GARDiff: Graph-Aligned Residual Diffusion for Probabilistic Multivariate Time-Series Forecasting

Diffusion models have recently shown strong potential for probabilistic multivariate time-series forecasting by modeling complex conditional distributions. Recent decoupled diffusion frameworks further separate forecasting into deterministic prediction and stochastic residual generation, making it natural to derive dependency graphs from deterministic representations and use them to guide residual diffusion. However, we show that this direct structural transfer is unreliable. Although deterministic-derived graphs encode useful global dependency priors, they exhibit substantial edge-level misalignment with residual dependency structures, introducing inaccurate or redundant conditions during residual generation. This reveals a previously overlooked deterministic-to-residual structural alignment problem in decoupled diffusion forecasting. To address this problem, we propose GARDiff, a Graph-Aligned Residual Diffusion framework for probabilistic multivariate time-series forecasting. Instead of treating deterministic-derived graphs as fixed diffusion conditions, GARDiff progressively adapts them to residual generation. Specifically, GARDiff estimates residual uncertainty to distinguish high- and low-uncertainty regions, enabling uncertainty-aware structural refinement, and further performs timestep-aware edge sparsification during reverse diffusion to evolve graph conditions from broad dependency aggregation to localized residual refinement. Extensive experiments on six real-world benchmarks demonstrate that GARDiff consistently improves probabilistic forecasting performance and uncertainty calibration over strong baselines.

cs.LG↗

Topological Coherence for Self-evolving Multi-agent Systems

Complex tasks inherently couple workflow structure, agent responsibility, collaboration, and memory access: task regions delimit responsibility and tool scope, cross-region dependencies give rise to handoffs, and ownership boundaries delimit private and selectively shared memory. Existing methods can jointly optimize agent and communication structures, yet such optimization does not by itself require responsibility, handoff, and memory boundaries to remain consistent with task dependencies. We term this requirement topological coherence. We introduce TOCOMAS, a Topology-Coherent Multi-Agent System. TOCOMAS grounds a task graph in tool interfaces, organizes compatible task nodes into reusable responsibility domains, and derives dependency-induced and profile-conditioned collaboration together with boundary-regulated memory visibility. During online self-evolution, TOCOMAS proposes coupled changes to agent, collaboration, and memory policies, retaining for subsequent tasks only candidates that satisfy structural constraints and improve evaluated reward. Across BBEH, WorkBench, SWE-Bench-Verified, and CoMemBench, TOCOMAS improves task success over baselines across backbones. CoMemBench also shows gains over the self-evolving baseline in verified progress, handoffs, and memory isolation.

cs.AI↗

Verifiable constraint qualifications for infinite-dimensional optimization problems and their applications to optimal control problems

This paper employs a finite codimensionality condition to establish an enhanced Fritz John condition for general constrained nonlinear infinite-dimensional optimization problems. In applications, this approach provides a new, unified framework for deriving first-order necessary conditions across a broad class of optimal control problems involving both deterministic and stochastic systems. Compared to existing constraint qualifications, our finite codimensionality condition, which is equivalent to the validity of certain \textit{a priori} estimates, yields a direct and analytically tractable verification method for each application. Furthermore, the core ideas of this method can be further extended to investigate the KKT conditions for infinite-dimensional optimization problems.

math.OC↗

Relevance-Resolution Transfer via Scale-Decomposable Fractional Diffusion for Multi-Length Cross-Modal Hash Retrieval

Cross-modal hashing enables efficient retrieval by encoding heterogeneous data into compact binary codes. Recent methods exploit fine-grained relations encoded in multi-label training structure, yet none of them constrains how those relations survive as consistent candidate rankings in finite, multi-length Hamming spaces, which we term the relevance resolution bottleneck (RRB). To address the RRB, we propose MultiBit, which transfers relevance resolution from multi-label structure to multi-length Hamming spaces. MultiBit first constructs a scale-decomposable fractional relation teacher from dataset-level label co-occurrence and label specificity, and models dependencies from local to long-range over continuous diffusion scales. It then maps the discretized diffusion scales and their quadrature weights to scale-aware bit subblocks of the maximum-length code, organizes the target code lengths as nested prefixes, and aligns their Hamming candidate rankings with the teacher relations. Experiments on multiple benchmarks demonstrate improved retrieval accuracy. Code is available in the supplementary material.

cs.IR↗

IChart2Code: Benchmarking Multimodal Large Language Models for Interactive Chart Code Generation

Interactive chart code generation requires models to reproduce a reference chart's appearance and underlying data and correctly implement the state changes triggered by specified user interactions. Existing chart-to-code benchmarks focus on static outputs and lack task representations or evaluation protocols for interaction specification, browser execution, and post-interaction verification. We introduce IChart2Code, a benchmark comprising 377 tasks across 20 chart forms and 13 data families, with 1209 interaction requirements in six families. Each task provides a reference screenshot, task-local data, and natural-language interaction requirements, with executable HTML/JavaScript code as the target output. We further develop a browser-based evaluation protocol with an Executability gate and three rubric-guided dimensions: Data Fidelity, Static Visual Correctness, and Interaction Correctness. The protocol tests runtime viability, consistency with task-local data, fidelity of the initial rendering to the reference screenshot, and interaction-induced state changes in a sandboxed browser. A rubric-guided MLLM judge evaluates task-specific items for the three scored dimensions using the collected browser observations and achieves an overall item-level F1 score of 0.8844 against adjudicated human labels. We also propose TRAIL, a trajectory-guided dual-agent framework for interactive chart code generation. An Inspector derives task-specific inspection checks, executes them in the browser, and uses the resulting trajectories to diagnose failures and produce structured repair feedback. Averaged across four MLLMs, TRAIL improves the four evaluation dimensions over direct prompting by 7.89, 4.98, 3.45, and 4.47 percentage points, respectively.

cs.SE↗

Weak mixing for dynamical systems with ${\bm{\mathscr M}}_{\bmα}$-shadowing

This paper studies weak mixing for two classes of dynamical systems with the \(\mathscr{M}_α\)-shadowing property using the generic factor characterization of weak scattering. First, for every \(α\in[0,1)\), every \(M\)-system with the \(\mathscr{M}_α\)-shadowing property is weakly mixing, thereby answering [P. Oprocha et. al., On partial shadowing of complete pseudo-orbits, J. Math. Anal. Appl., Question~1] negatively. Second, for every \(α\in(0,1)\), the \(\mathscr{M}_α\)-shadowing property implies weak mixing for \(E\)-systems and, in particular, for dynamical systems whose measure center is the whole space.Finally, an \(E\)-system with the \(\mathscr{M}_{0}\)-shadowing property which is not weakly mixing is constructed, showing that the parameter range \(α\in(0,1)\) in the \(E\)-system result is optimal.

math.DS↗

Three-body unitary determination of the $f_1(1285)$ and $f_1(1420)$ pole positions

We study the $I^G(J^{PC})=0^+(1^{++})$ $K\bar Kπ$ system in an infinite-volume three-body unitary framework, focusing on the pole content of the region of the $f_1(1285)$ and $f_1(1420)$ resonances. The coupled $πa_0$-$K\bar K^*$ amplitude is constructed in the spectator-isobar representation, where the one-particle-exchange interaction required by three-body unitarity automatically incorporates the triangle-singularity mechanism. The short-range three-body interaction is constrained by fitting the $0^+(1^{++})$ component of the BESIII $K^0_SK^0_Sπ^0$ invariant-mass distribution in the $J/ψ\toγ(K^0_SK^0_Sπ^0)$ decay. Analytically continuing the fitted amplitude to the relevant unphysical Riemann sheets, we find two robust poles: \begin{align} \sqrt{s_{f_1(1285)}}&= \left(1277\pm2\pm1\right) -\mathrm{i}\left(12\pm1\pm0\right)\text{MeV}\,,\notag\\ \sqrt{s_{f_1(1420)}}&= \left(1435\pm2\pm7\right) -\mathrm{i}\left(40\pm2\pm1\right)\text{MeV}\,.\notag \end{align} The pole trajectories indicate that the $f_1(1285)$ originates from dressing a bare state introduced in the potential. In contrast, the $f_1(1420)$ is predominantly dynamically generated, and a single-channel analysis traces it to an $S$-wave $K\bar K^*$ quasi-bound state mixed with the nearby bare state, supporting its hadronic-molecule interpretation. We also find an additional pole deeper in the complex plane in the best-fit amplitude on the same Riemann sheet as the $f_1(1285)$. This additional pole is generated by the $P$-wave $πa_0$ contact interaction alone. It has a sizable cutoff and two-body-input dependence, and leaves little visible imprint on the physical lineshape. Finally, we provide a detailed and pedagogical appendix on how three-body cuts affect the solution of the integral equation.

hep-ph↗

SkillIR: Evolving Scene-Aware Skills for Agentic Image Restoration

This paper studies agentic image restoration, in which multimodal agents coordinate specialized restoration tools to recover images affected by complex degradations. Existing restoration agents often derive complete tool-use plans from the original degraded image or retrieve previously successful trajectories, providing limited support for adapting individual actions to evolving intermediate restoration states. We find that accepted tool executions can change the residual degradation state and, consequently, the applicability of subsequent tools. To address this issue, we propose SkillIR, a skill-guided framework that represents restoration experience as degradation-centered action evidence rather than complete tool-use trajectories. SkillIR consolidates context-dependent action outcomes into scene-aware restoration skills that characterize applicable conditions, expected effects, and attributable failure cases. Instead of prescribing a complete restoration plan, the retrieved skills guide one bounded action at a time within a verified residual-state loop: each tool output is treated as a candidate, committed only after transition verification, and followed by reassessment of the active residual degradations. After each rollout, the resulting evidence is used to create, refine, or patch dynamic skills, enabling accumulated restoration experience to improve decision-making for subsequent inputs. Experiments on synthetic and real-world multi-degradation datasets demonstrate that SkillIR improves restoration quality and enables more reliable and effective tool use.

cs.CV↗

Quantitative linear approximation for controllability of quasi-linear parabolic equations

This paper studies the relationship between the controllability of a quasi-linear parabolic equation and that of its linear counterpart. Under suitable assumptions, we prove that for sufficiently small initial data both systems are null controllable, and that the differences between their corresponding controls and states satisfy a higher-order error estimate. Unlike standard controllability problems, the controls constructed here not only steer the system to a prescribed target at a given terminal time, but are also designed to ensure that the deviation between the nonlinear and linear dynamics obeys the aforementioned estimate. This method is applicable to general nonlinear partial differential equations, and the approximation order for controllability is optimal.

math.OC↗

SAM-on-the-Curve: Sharpness-Aware Mode Connectivity for Robust Weight-Space Interpolation

Deep neural networks that are independently trained to similar performance can be connected by low-loss parametric curves in weight space, a phenomenon known as Mode Connectivity (MC). This geometric property underpins practical techniques such as weight averaging, model ensembling, and model merging. We argue that low-loss connectivity is an incomplete geometric criterion: it controls loss only along a one-dimensional trajectory while leaving the surrounding weight-space neighborhood unconstrained, so the optimized curve may traverse sharp ridges that become fragile under distribution shift. We therefore reformulate mode connectivity as a neighborhood-robust path optimization problem, seeking a curve whose entire local neighborhood maintains low loss. We propose Sharp Mode Connectivity (SMC), which applies a first-order sharpness-aware approximation to the resulting minimax functional, enforcing flatness along the entire curve rather than only on it. We derive a practical optimization algorithm for connectivity paths under this sharpness-aware objective. Under severe blur corruptions from CIFAR-10-C, SMC achieves up to 6.09\% absolute accuracy improvement over standard MC. Remarkably, SMC produces negative loss barriers, meaning that models obtained at interior points of the optimized path can outperform the average endpoint loss. These results, validated across ResNet-18, VGG16-BN, and ViT-Tiny on CIFAR-10 and ImageNet-100, establish path-wise flatness as a practical principle for robust weight-space interpolation.

cs.LG↗

A Structural Relationship Between Crouzeix-Raviart Immersed Finite Elements for Elliptic and Stokes Interface Problems

In this paper, we study the structural relationship between immersed finite element (IFE) spaces for scalar elliptic and Stokes interface problems on unfitted meshes. Although IFE methods have been widely developed for individual partial differential equation models, the algebraic connection between scalar and vector IFE spaces has not been systematically explored. We establish a precise unisolvence relationship between the immersed Crouzeix-Raviart (CR) element for elliptic interface problems and the immersed CR-$P_0$ element for Stokes interface problems in both gradient and stress formulations. By analyzing the block structure of the local IFE matrices, we show that the determinant of the Stokes IFE matrix factorizes in terms of the determinant of the corresponding elliptic IFE matrix. This factorization reveals an intrinsic algebraic link between the two classes of immersed elements and explains the unisolvence of the Stokes IFE spaces through the scalar elliptic case. The same result extends naturally to three dimensions and significantly simplifies the corresponding analysis. Numerical experiments confirm optimal convergence rates for both velocity and pressure in three-dimensional Stokes interface problems.

math.NA↗