Open Source
Learning observable propagation with sparse local moments
arXiv cs.NA0 views
arXiv:2611.18448v1 Announce Type: cross Abstract: We propose a unified framework for predicting local moment dynamics in high-dimensional many-body systems from short-time trajectories. Thanks to the locality of the dynamics, we construct the transition moment matrices by projecting the Markov operator onto low-order connected-cluster basis functions supported near the target observable. Exploiting the spatial decay of time-lagged correlations, {these matrices} can be approximated in sparse-plus-low-rank form using trajectory samples, with computational cost scaling linearly in the system dimension and the number of trajectories. The learning error can be further reduced by correcting the memory effect induced by the Galerkin projection. We numerically demonstrate the effectiveness of the framework in extrapolating the dynamics of various many-body systems, including Langevin and Glauber dynamics for classical systems as well as Lindblad dynamics for open quantum systems. In addition, for a class of single-site Glauber dynamics, we establish error bounds for sparse-plus-low-rank compression and uniform-in-time bounds for connected-cluster approximation and observable propagation with compressed transition moment matrices.
Source:https://arxiv.org/abs/2611.18448PreviousBalancing-based model reduction for output-constrained optimal control of switched linear systemsNextFrom smoothed analysis to backward error: The power of adaptive perturbations
Related posts
What Should World Models Forget? Stratified Retention for Continual Adaptation
0arXiv eess.SP
uhd-rfsoc: Bringing Off-the-Shelf RFSoC Boards to Unmodified UHD Applications
0arXiv eess.SP
An Axiomatic Framework for Reinforcement Learning in Open Multi-Agent Systems
0arXiv cs.MA
From Facts to Insights: A Persona-Driven Dual Memory Framework and Dataset for Role-Playing Agents
0arXiv cs.MA
A Taxonomy of Real Faults in Hybrid Quantum-Classical Architectures
0arXiv cs.SE
SyclKittens: A Tile Programming Model for Programmers and Coding Agents on Intel GPUs
0arXiv cs.DC