Convergence Properties of PF-Exec: Homogeneous Structure, Anchored Closed Form, and Gain Dynamics

Hanzhang Jia, Liheng Zeng, Yiran Li, Yi Gao, Bo MaarXiv 2026 · arXiv

TL;DR

This paper provides the mathematical "why" behind PF-Exec, a robust algorithm for balancing loads in massive UAV relay networks. By separating the problem into closed-form "recovery directions" and adaptive "execution gains," the authors prove the system can survive extreme traffic bursts that cause standard end-to-end learning methods to collapse.

What Problem Does This Paper Address?

Managing a fleet of 100+ UAVs acting as relays is a nightmare of coupled variables. You have to simultaneously decide which users connect to which drone (association), how to split bandwidth, how much power to use, and where the drones should hover.

In "deep overload" scenarios—like a sudden crowd surge at a stadium—the mathematical signals (gradients) used by standard optimization or Deep Reinforcement Learning (DRL) often vanish or become unstable. DRL agents trained from scratch frequently "collapse" under this pressure, failing to find a way back to a balanced state. This paper seeks to establish a layered mathematical framework that guarantees stability and convergence even when the network is pushed to its limits.

Fig. 1. System and load coupling. UAVs reach the host base station over the backhaul hop and serve ground users over the access hop. The load of a UAV is set jointly by association on the demand side and by position, bandwidth and power on the capacity side, and UAVs are coupled through a shared user pool and through interference.

Methods

The authors analyze the PF-Exec architecture, which uses a "layered" approach to separate direction (where to go) from speed (how fast to move).

  1. Homogeneous Decomposition: They prove that demand-proportional bandwidth allocation yields a first-order homogeneous structure. This allows them to derive "equal-load" targets for bandwidth and position in closed form, meaning they can be calculated directly without iterative searching.
  2. The Logarithmic Knee: To handle overload, they introduce a "logarithmic knee" mapping for load. Unlike standard "clipping" (which makes the gradient zero in overload), this knee preserves a strictly positive gradient, ensuring the system always knows the direction back to safety.
  3. Damped Softmax Association: They model user association as a damped softmax process and prove the existence of a fixed point using Brouwer’s theorem.
  4. Truncated 1D Gain Iteration: The "Executor" part of the system uses a neural network to learn a gain (speed) for each dimension. The authors provide a complete characterization of this dynamic, proving it stays bounded even if the learned gain is suboptimal.
  5. Numerical Audit: Instead of just theoretical proofs, they perform a "commissioning check" on 60 real-world states from simulations to verify that their mathematical identities (like homogeneity) hold up to machine precision.
The layered block-coordinate update flow of the PF-Exec algorithm.

Datasets

The paper doesn't use a static dataset but evaluates its theory against simulations of UAV relay networks (ranging from 3 to 100 UAVs). They specifically look at two crowd scenarios:

  • Flow: Steady movement.
  • Burst: Sudden aggregations that test the system's limits. The "Numerical Audit" uses 60 snapshot states captured from these simulations to verify theoretical properties like homogeneity and spectral radius.

Key Insights and Ideas

  • Direction vs. Speed: A core finding is that a correct "direction" is a necessary basis for stability, but "speed adaptation" is the essential complement. A correct direction paired with a constant, high speed will still cause the system to collapse in high-pressure settings.
  • The Failure of Global Contraction: Most convergence proofs rely on a "global Euclidean contraction" (the idea that the system naturally shrinks toward a single point). This paper shows that in real UAV networks, the "spectral radius" (a measure of local expansion) can be as high as 3107—far above the value of 1 required for standard proofs.
  • Stability Without Contraction: Despite the lack of global contraction, the system remains stable because the executor's bounded dynamics and the direction decider's closed-form recovery paths act as a safety envelope.
  • Gradient Preservation: By using the "Logarithmic Knee" view, the system avoids the "dead zones" created by traditional clipping, allowing it to recover from deep overload.
Comparison of different load "views." Note how the "knee" view avoids the failure modes of clipping.

Key Results

  • Homogeneity Precision: The numerical audit confirmed that the "demand-scale drift" (a key theoretical assumption) is practically zero, measured at $2.7 \times 10^{-16}$ (machine precision).
  • Convergence Characterization: They proved that for an equivalent gain $\gamma < 2$, the error vanishes geometrically. At $\gamma = 2$, the system reaches the target or enters a stable oscillation. Even for $\gamma > 2$, the system remains globally bounded.
  • Fairness Alignment: The authors proved that their "potential function" (what the algorithm optimizes) shares the same global optimum as the Jain Fairness Index, ensuring that mathematical stability translates to real-world network quality.

Limitations and Future Work

  • Frozen Association: Many of the proofs are derived under "frozen association," meaning they look at how bandwidth and position converge assuming the user-to-UAV connections are momentarily static. A joint theorem covering the full simultaneous alternation is a suggested next step.
  • Optimality vs. Safety: While the paper proves the system is safe (bounded), it doesn't yet provide a quantitative relation between the learned gain and optimal return, leaving room for future "optimality characterization."
  • Centralized Reporting: While the execution is decentralized, evaluating the "fleet-wide potential" for reporting still requires some centralized coordination, though the authors note this can be done offline.

Summary updated

Abstract

This paper establishes a layered mathematical char acterisation of PF-Exec, the algorithm of the companion system paper. Demand-proportional bandwidth allocation yields an exact first-order homogeneous decomposition, from which the equal-load bandwidth target and its feasibility bound follow in closed form. The logarithmic knee view preserves strict load order and shares its global optimum with the Jain fairness index, while the demand-weighted centroid minimises the position potential. The damped softmax association block possesses a fixed point on the product of simplices. The truncated one-dimensional gain iteration admits a complete characterisation, with geomet ric convergence below the critical gain, initial-value-dependent bounded oscillation at it, and a family of bounded two-state cycles above it. A global invariant error ball and an explicit tracking recursion complete the execution guarantee. A numerical audit confirms the structural identities on every measured state and quantifies the local amplification of the coupled association and resource dynamics. Together, the results explain how closed form recovery directions and bounded adaptive gains provide stable execution without requiring a global Euclidean contraction assumption.
BibTeX
@misc{jia2026convergence,
  author = {Hanzhang Jia and Liheng Zeng and Yiran Li and Yi Gao and Bo Ma},
  title = {{Convergence Properties of PF-Exec: Homogeneous Structure, Anchored Closed Form, and Gain Dynamics}},
  year = {2026},
  eprint = {2611.17488},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.17488},
}
Figure