A new triple-loop algorithm, Minimax-AIPE, solves convex-concave minimax problems with tilde O(epsilon^{-4/7}) second-order oracle calls, improving the previous O(epsilon^{-2/3}).
Universal Tensor Methods for Monotone Variational Inequalities
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study monotone variational inequalities whose operators have H\"older continuous higher-order derivatives. For a fixed order $p\geq 2$, we assume that the $(p-1)$-th derivative of the monotone operator is H\"older continuous with parameter $\nu\in[0,1]$ on a bounded closed convex set. We develop regularized tensor extragradient methods that combine a high-order Taylor approximation of the operator with an extragradient correction step. When the H\"older parameter $\nu$ is known, our regularized tensor extragradient method finds an $\epsilon$-weak solution using $\mathcal{O}(\epsilon^{-2/(p+\nu)})$ tensor-oracle calls. When $\nu$ is unknown, we propose a universal tensor extragradient method whose tensor-oracle complexity is $\mathcal{O}(\epsilon^{-2p/((p+1)(p-1+\nu))})$.
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(\epsilon^{-4/7})$ Second-Order Oracle Complexity
A new triple-loop algorithm, Minimax-AIPE, solves convex-concave minimax problems with tilde O(epsilon^{-4/7}) second-order oracle calls, improving the previous O(epsilon^{-2/3}).