A Systems-Theoretic View on the Convergence of Algorithms under Disturbances

• URL: http://arxiv.org/abs/2512.17598v1
• Date: Fri, 19 Dec 2025 14:05:20 GMT
• Title: A Systems-Theoretic View on the Convergence of Algorithms under Disturbances
• Authors: Guner Dilsad Er, Sebastian Trimpe, Michael Muehlebach,
• Abstract summary: This article extends known convergence guarantees of an algorithm operating in isolation.<n>We derive key inequalities that quantify the impact of disturbances.<n>We show how our result can be utilized to assess the effects of disturbances on algorithmic performance.
• Score: 17.08627888409747
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Algorithms increasingly operate within complex physical, social, and engineering systems where they are exposed to disturbances, noise, and interconnections with other dynamical systems. This article extends known convergence guarantees of an algorithm operating in isolation (i.e., without disturbances) and systematically derives stability bounds and convergence rates in the presence of such disturbances. By leveraging converse Lyapunov theorems, we derive key inequalities that quantify the impact of disturbances. We further demonstrate how our result can be utilized to assess the effects of disturbances on algorithmic performance in a wide variety of applications, including communication constraints in distributed learning, sensitivity in machine learning generalization, and intentional noise injection for privacy. This underpins the role of our result as a unifying tool for algorithm analysis in the presence of noise, disturbances, and interconnections with other dynamical systems.

Related papers

• Noise tolerance via reinforcement: Learning a reinforced quantum dynamics [0.0]
  Reinforcement has emerged as a powerful strategy to enhance the efficiency of learning and optimization algorithms.<n>We show that a reinforced quantum dynamics can exhibit significant robustness against interactions with a noisy environment.
  arXiv  Detail & Related papers  (2025-06-14T09:22:12Z)
• Estimates of loss function concentration in noisy parametrized quantum circuits [0.0]
  Variational quantum computing offers a powerful framework with applications across diverse fields such as quantum chemistry, machine learning, and optimization.<n>Its scalability is hindered by the exponential concentration of the loss function, known as the barren plateau problem.<n>We introduce a novel analytical framework that enables the description of the variance in layered noisy quantum circuits with arbitrary noise channels.
  arXiv  Detail & Related papers  (2024-10-02T18:00:09Z)
• Stochastic action for the entanglement of a noisy monitored two-qubit system [55.2480439325792]
  We study the effect of local unitary noise on the entanglement evolution of a two-qubit system subject to local monitoring and inter-qubit coupling. We construct a Hamiltonian by incorporating the noise into the Chantasri-Dressel-Jordan path integral and use it to identify the optimal entanglement dynamics. Numerical investigation of long-time steady-state entanglement reveals a non-monotonic relationship between concurrence and noise strength.
  arXiv  Detail & Related papers  (2024-03-13T11:14:10Z)
• Towards stable real-world equation discovery with assessing differentiating quality influence [52.2980614912553]
  We propose alternatives to the commonly used finite differences-based method. We evaluate these methods in terms of applicability to problems, similar to the real ones, and their ability to ensure the convergence of equation discovery algorithms.
  arXiv  Detail & Related papers  (2023-11-09T23:32:06Z)
• Learning Collective Behaviors from Observation [13.278752237440022]
  We present a comprehensive examination of learning methodologies employed for the structural identification of dynamical systems. Our approach not only ensures theoretical convergence guarantees but also exhibits computational efficiency when handling high-dimensional observational data.
  arXiv  Detail & Related papers  (2023-11-01T22:02:08Z)
• Measuring and Mitigating Interference in Reinforcement Learning [30.38857177546063]
  Catastrophic interference is common in many network-based learning systems. We provide a definition and novel measure of interference for value-based reinforcement learning methods.
  arXiv  Detail & Related papers  (2023-07-10T20:20:20Z)
• Latent Exploration for Reinforcement Learning [87.42776741119653]
  In Reinforcement Learning, agents learn policies by exploring and interacting with the environment. We propose LATent TIme-Correlated Exploration (Lattice), a method to inject temporally-correlated noise into the latent state of the policy network.
  arXiv  Detail & Related papers  (2023-05-31T17:40:43Z)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• Stability Analysis of Unfolded WMMSE for Power Allocation [80.71751088398209]
  Power allocation is one of the fundamental problems in wireless networks. It is essential that the output power allocation of these algorithms is stable with respect to input perturbations. In this paper, we focus on UWMMSE, a modern algorithm leveraging graph neural networks.
  arXiv  Detail & Related papers  (2021-10-14T15:44:19Z)
• Consistency of mechanistic causal discovery in continuous-time using Neural ODEs [85.7910042199734]
  We consider causal discovery in continuous-time for the study of dynamical systems. We propose a causal discovery algorithm based on penalized Neural ODEs.
  arXiv  Detail & Related papers  (2021-05-06T08:48:02Z)
• Robust Reinforcement Learning with Wasserstein Constraint [49.86490922809473]
  We show the existence of optimal robust policies, provide a sensitivity analysis for the perturbations, and then design a novel robust learning algorithm. The effectiveness of the proposed algorithm is verified in the Cart-Pole environment.
  arXiv  Detail & Related papers  (2020-06-01T13:48:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.