Terminal Attractor Overview

• Terminal attractors are absorbing sets that, once reached, prevent any further state changes, appearing in both gradient-based optimization flows and discrete Petri nets.
• Adaptive gradient descent algorithms leveraging terminal attractors dynamically adjust learning rates to escape shallow local minima and guarantee finite-time convergence.
• In safe Petri nets, terminal attractors define irreversible terminal strongly connected components, enabling precise identification of doomed configurations and basin boundaries.

A terminal attractor (TA) is a mathematical construct capturing stable, absorbing structures in two distinct but technically related domains: continuous dynamical systems (notably, optimization flows as in gradient descent) and finite discrete-state systems (specifically, the reachability graph of Petri nets). In both contexts, TAs formalize a set of states or parameter values that, once reached, cannot be left, and from which no further “escape” is possible under system evolution. Recent advances systematically utilize the terminal attractor framework to guarantee finite-time convergence in nonconvex optimization (Zhao et al., 2024) and to precisely characterize the irreversible fate of concurrent systems (Samboni et al., 2024).

1. Formal Definition Across Domains

In optimization and dynamical systems, the terminal attractor is defined via a state-dependent gradient flow. Given a differentiable loss $E: \mathbb{R}^d \rightarrow \mathbb{R}_+$, the system

$\frac{dw}{dt} = -\gamma(w)\nabla E(w)$

has a terminal attractor at $E=0$ if there exists a nonnegative, $C^1$ function $\Omega(E)$ such that

$\frac{dE}{dt} = -\Omega(E)$

with $\int_{E_0}^0 dE/\Omega(E)<\infty$. All trajectories with $E(0)>0$ reach $E=0$ in finite time. The set $\{E=0\}$ forms the absorbing manifold (Zhao et al., 2024).

In the context of safe Petri nets, a terminal attractor is a terminal strongly connected component (SCC) of the reachability graph: a set $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$0 where $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$1 is reachable markings, and $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$2, all outgoing transitions remain in $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$3. Once the system reaches $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$4, it cannot exit; $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$5 is an absorbing class of system behavior (Samboni et al., 2024).

2. Terminal Attractors in Gradient Systems

Terminal attractor theory in gradient descent exploits links to terminal sliding mode (TSM) control. The key is to enforce a differential equation

$\frac{dw}{dt} = -\gamma(w)\nabla E(w)$6

where $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$7 vanishes sublinearly near $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$8 (for instance, $\frac{dw}{dt} = -\gamma(w)\nabla E(w)$9, $E=0$0). Under the gradient flow induced by an adaptive gain $E=0$1, this ensures:

• Finite-time convergence to $E=0$2
• Escape from shallow local minima ($E=0$3 as $E=0$4 while $E=0$5)
• Infinite stability at the true minima as the solution violates the Lipschitz condition for $E=0$6 at $E=0$7, so the system remains at $E=0$8 once reached

The formal result is:

If $E=0$9, $C^1$0, then $C^1$1 for some $C^1$2, with

$C^1$3

for $C^1$4 (Zhao et al., 2024).

3. Adaptive Gradient Descent via Terminal Attractors

Zhao et al. (Zhao et al., 2024) derive four families of adaptive learning rate schedules enforcing TA behavior:

Schedule	Step Size Gain $C^1$5	Notable Property
TA	$C^1$6	Pure terminal attractor
FTA	$C^1$7	Hybrid of linear and sublinear terms
PTA	$C^1$8	Sigmoid suppresses infinite steps
PFTA	$C^1$9	Combines FTA and sigmoid damping

When discretized, each update is $\Omega(E)$0. Convergence to the terminal attractor occurs in provably finite time for TA and FTA; the placid versions (PTA, PFTA) regularize steps near stationary points while preserving the same global guarantees.

4. Finite-Time Convergence and Robustness

Both the original TA and all smoothed variants guarantee global, finite-time convergence to the terminal attractor:

• For TA with $\Omega(E)$1: $\Omega(E)$2
• For FTA: $\Omega(E)$3

PTA and PFTA inherit the finite absorption property as the sigmoid $\Omega(E)$4 for $\Omega(E)$5, but remain bounded for all $\Omega(E)$6. Escape of shallow local minima is achieved as $\Omega(E)$7 diverges when $\Omega(E)$8 with $\Omega(E)$9, which is not the case at a true global minimum ($\frac{dE}{dt} = -\Omega(E)$0).

Empirically, these algorithms outperform classical optimizers (SGD, Adam, L-BFGS) on both a synthetic function-approximation task and CIFAR-10 image classification, achieving faster and more stable convergence, and eliminating "edge-of-stability" oscillations (Zhao et al., 2024).

5. Terminal Attractors in Safe Petri Nets

In concurrent systems modeled by safe Petri nets, the TA corresponds to a terminal SCC of the reachability graph, analogous to an absorbing class. Formally, $\frac{dE}{dt} = -\Omega(E)$1 is a TA if it is a maximal SCC such that no arcs exit $\frac{dE}{dt} = -\Omega(E)$2. The set $\frac{dE}{dt} = -\Omega(E)$3 (basin of $\frac{dE}{dt} = -\Omega(E)$4) comprises all markings from which every infinite run is “doomed” to end up in $\frac{dE}{dt} = -\Omega(E)$5.

Net unfoldings provide a precise, algorithmic approach to TA and basin computation:

1. Compute a complete prefix $\frac{dE}{dt} = -\Omega(E)$6 of the unfolding.
2. Read off prime configurations and map markings.
3. Build the reachability graph and extract TAs using SCC algorithms.

Configurations in the unfolding are classified as doomed (all infinite continuations pass through undesirable states) or free. The boundary between the basin $\frac{dE}{dt} = -\Omega(E)$7 and its complement is characterized by cliff-edges (special sets of events in minimal doomed configurations) and associated ridges (original transitions whose firing constitutes an irreversible commitment to the TA) (Samboni et al., 2024).

6. Basin Characterization and Detection Algorithms

The MinDoo algorithm computes all minimal doomed configurations in the complete prefix $\frac{dE}{dt} = -\Omega(E)$8. For each minimal doomed configuration $\frac{dE}{dt} = -\Omega(E)$9, its crest $\int_{E_0}^0 dE/\Omega(E)<\infty$0 marks the cliff-edge. Any marking whose configurations avoid all crests remains in the basin $\int_{E_0}^0 dE/\Omega(E)<\infty$1. The effectiveness of these procedures is captured by:

• Theorem 6.1: MinDoo terminates and outputs all minimal doomed configurations in $\int_{E_0}^0 dE/\Omega(E)<\infty$2
• Basin boundary detection: markings able to fire a ridge are on the boundary of $\int_{E_0}^0 dE/\Omega(E)<\infty$3

Computational complexity depends on the size of $\int_{E_0}^0 dE/\Omega(E)<\infty$4, with Esparza prefixes bounded by $\int_{E_0}^0 dE/\Omega(E)<\infty$5 and McMillan prefixes potentially exponentially larger.

A consequence is a fine-grained "map" of the concurrent execution landscape, including all cliff-edges at which control is irreversibly lost to the terminal attractor.

7. Broader Significance and Analytical Insights

Terminal attractors unify the analysis of convergence (in continuous optimization) and irreversibility (in discrete systems). In optimization, they guarantee finite-time convergence and robustness to local minima by dynamically adjusting trajectory intensity based on the state, as rigorously shown in both theoretical and empirical domains (Zhao et al., 2024). In concurrent computation, TAs enable an exact accounting of system fate—necessary for verifying liveness, safety, and fairness properties. The attractor/basin formalism clarifies system resilience and highlights irreversible “cliff-edges” (Samboni et al., 2024).

A plausible implication is that state- or event-dependent “terminalizing” feedback is a general principle for engineering absorbing, robust, and rapidly convergent dynamics across both continuous and discrete systems.