Metraipolis › archive › dc_0dca579b453b

Machine Learning-Enabled Time-Skipping Method: Theory and Perturbation-Based Verification — arXiv:2610.41152

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41152
License (as archived)
CC0-1.0
Archived
2026-11-03T08:28:37.309Z
SHA-256 of the archived text
584809b59f6cace5093f4153fc29c732232575b28ff05502782ff50aff1a6949
Stable URL of this page
https://metraipolis.com/documento/dc_0dca579b453b

How to cite

Machine Learning-Enabled Time-Skipping Method: Theory and Perturbation-Based Verification — arXiv:2610.41152 — arXiv (en), https://arxiv.org/abs/2610.41152 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0dca579b453b (Metraipolis archive dc_0dca579b453b, sha256 584809b59f6cace5093f4153fc29c732232575b28ff05502782ff50aff1a6949)
BibTeX
@misc{dc0dca579b453b,
  title = {Machine Learning-Enabled Time-Skipping Method: Theory and Perturbation-Based Verification — arXiv:2610.41152},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41152},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0dca579b453b; sha256 584809b59f6cace5093f4153fc29c732232575b28ff05502782ff50aff1a6949},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41152. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Simulating the time evolution of practical mechanics problems requires many time steps. This cost is further compounded by the iterative nature of implicit solvers. We present a cycle-based Machine Learning-enabled Time-skipping (MLT) method. In each cycle, several time steps are skipped, a machine learning (ML) prediction bridges the gap to initialize one solver step, and the physics-based solver then runs for several steps to correct any accumulated errors. Using the Implicit Function Theorem, we derive first-order estimates that characterize how ML prediction errors propagate. These estimates identify when errors remain bounded across cycles and guide the choice of cycle parameters, independent of model architecture. We verify these estimates on the Allen-Cahn equation and a forced variant using controlled synthetic perturbations that emulate ML errors. Wall-clock measurements confirm the theoretical speedup is realizable in practice. The MLT method provides a robust framework for accelerating time-marching in dynamic simulations.

Tema degli esploratori: fisica e astronomia (elenco arXiv physics.comp-ph, nuovi lavori del giorno).
Categorie arXiv: Computational Physics (physics.comp-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.41152 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:10:23.759Z dalla pagina https://arxiv.org/list/physics.comp-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).