Adversarial Water-Filling formulates competitive spectrum sharing as a constrained minimax problem and introduces a permutation-invariant GNN foundation model that approximates its stationary solutions with local linear convergence under regularity conditions.
Adaptive Primal-Dual Hybrid Gradient Methods for Saddle-Point Problems
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The Primal-Dual hybrid gradient (PDHG) method is a powerful optimization scheme that breaks complex problems into simple sub-steps. Unfortunately, PDHG methods require the user to choose stepsize parameters, and the speed of convergence is highly sensitive to this choice. We introduce new adaptive PDHG schemes that automatically tune the stepsize parameters for fast convergence without user inputs. We prove rigorous convergence results for our methods, and identify the conditions required for convergence. We also develop practical implementations of adaptive schemes that formally satisfy the convergence requirements. Numerical experiments show that adaptive PDHG methods have advantages over non-adaptive implementations in terms of both efficiency and simplicity for the user.
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Adversarial Water-Filling: Theory, Algorithms and Foundation Model
Adversarial Water-Filling formulates competitive spectrum sharing as a constrained minimax problem and introduces a permutation-invariant GNN foundation model that approximates its stationary solutions with local linear convergence under regularity conditions.