New algorithm solves structured nonconvex-nonconcave min-max problems.
problem Min-max optimization challenges in deep learning.
method Generalized extragradient algorithm for structured nonconvex-nonconcave problems.
result Algorithm converges to stationary points in Euclidean and ℓp spaces. DS-GDA solves nonconvex-nonconcave problems without regularity conditions.
problem Nonconvex-nonconcave minimax optimization challenges.
method Doubly smoothed gradient descent ascent method (DS-GDA).
result Achieves convergence on various nonconvex-nonconcave problems.
The paper analyzes PPM for nonconvex-nonconcave problems, identifying three regions with varying convergence guarantees.
problem Challenges in nonconvex-nonconcave minimax optimization.
method Classic proximal point method with insights from the Moreau envelope.
result Identification of three regions with varying convergence guarantees for PPM.
New method tackles nonconvex-nonconcave problems with local KL condition.
problem Nonconvex-nonconcave minimax problems under varying KL conditions.
method Inexact proximal gradient method for KL-structured subproblems.
result Complexity guarantees for approximate stationary points.
New method solves complex constrained optimization problems.
problem Constrained nonconvex-nonconcave minimax optimization problems.
method Inexact proximal gradient method using sequential convex programming.
result Established complexity guarantees for approximate stationary points.
Paper proposes algorithms for solving nonconvex-nonconcave problems with complexity guarantees.
problem Nonconvex-nonconcave minimax problems with PL condition.
method Zeroth-order AGDA and VRAGDA algorithms.
result Iteration complexities for obtaining ε-stationary points.
Nonconvex minimax problems appear frequently in emerging machine learning applications, such as generative adversarial networks and adversarial learning. Simple algorithms such as the gradient descent ascent (GDA) are the common practice for solving these nonconvex games and receive lots of empirical success. Yet, it i…
New algorithm converges to equilibrium in nonconvex-nonconcave optimization problems without dimension dependence.
problem Min-max optimization in nonconvex-nonconcave landscapes.
method Convergent algorithm with greedy max-player updates and proposal distribution for min-player.
result Algorithm converges to equilibrium in non-dependent iterations, suitable for GAN training.
Paper proves Sion's theorem in geodesic spaces and develops a Riemannian extragradient method.
problem Understanding saddle points in nonconvex-nonconcave minimax problems.
method Geodesic metric space version of Sion's theorem and Riemannian extragradient method.
result Developed a Riemannian extragradient algorithm for smooth minimax problems.
Minimax optimization has found extensive applications in modern machine learning, in settings such as generative adversarial networks (GANs), adversarial training and multi-agent reinforcement learning. As most of these applications involve continuous nonconvex-nonconcave formulations, a very basic question arises---"w…
Proposes an efficient alternative to nonconvex-nonconcave min-max optimization.
problem Min-max optimization challenges in nonconvex-nonconcave settings.
method Introduces ε-greedy adversarial equilibrium model and proves its existence.
result Existence of ε-greedy adversarial equilibrium for smooth bounded functions.
Paper analyzes convergence of GDA for nonconvex-nonconcave minimax problems.
problem Understanding convergence of GDA for nonconvex-nonconcave minimax problems.
method Local convergence analysis of GDA with stepsize ratio Θ(κ).
result Stepsize ratio of Θ(κ) is necessary and sufficient for local convergence of GDA to a Stackelberg Equilibrium.
New NPG variants ensure parameter convergence in multi-agent learning.
problem Non-convergence of parameters in NPG for multi-agent learning.
method Proposed variants of NPG for multi-agent learning scenarios.
result Global last-iterate parameter convergence guarantees in various multi-agent learning settings.
New algorithms solve nonconvex-nonconcave minimax optimization problems.
problem Solving minimax optimization problems in machine learning.
method Two novel Newton-type algorithms for nonconvex-nonconcave minimax optimization.
result Proved local convergence at strict local minimax points.
GAIL with neural networks converges to global optima and has a known rate.
problem Uncertainty about GAIL with neural networks achieving global optimality.
method Gradient-based alternating updates algorithm.
result Established sublinear convergence to globally optimal solution.
New algorithms solve stochastic variational inequalities without bounded variance assumption.
problem Solving stochastic variational inequalities without bounded variance assumption.
method Developed algorithms for two classes of problems: monotone and structured nonmonotone VIs.
result Oracle complexity of O(ε^-4) for solving VIs with unbounded domains and possibly unbounded variance.
New SGDA method speeds up nonconvex minimax optimization.
problem Improving convergence of nonconvex minimax optimization.
method SGDA with random reshuffling for nonconvex-PŁ objectives.
result Convergence rates faster than with-replacement SGDA.
Optimizes solving complex min-max problems with stochastic and nonconvex elements.
problem Min-max problems with stochastic and nonconvex elements.
method Combines conic nonexpansiveness, refined inexact Halpern iteration, and multilevel Monte Carlo estimator.
result Optimal or best-known complexity guarantees for $ρ< rac{1}{L}$, improving previous results.
Study efficient convergence of RL algorithm with function approximation.
problem Convergence of actor-critic algorithm with nonlinear function approximation.
method Stochastic gradient descent ascent with adaptive proximal term, Polyak-Łojasiewicz condition.
result First efficient convergence result with rate of O(sqrt{ln(N d G^2) / N}).
A new method trains physics-constrained neural networks more efficiently.
problem Training machine learning tools with limited data and physical constraints.
method Dual-Dimer method for searching saddle points in nonconvex-nonconcave functions.
result The Dual-Dimer method improves training efficiency and convergence speed.
We study the global convergence of policy optimization for finding the Nash equilibria (NE) in zero-sum linear quadratic (LQ) games. To this end, we first investigate the landscape of LQ games, viewing it as a nonconvex-nonconcave saddle-point problem in the policy space. Specifically, we show that despite its nonconve…
A federated minimax framework for heterogeneous clients.
problem Training with edge devices having different datasets and capabilities.
method Proposes a federated minimax optimization framework with normalized updates.
result Improves convergence and communication complexity for nonconvex functions.
Sampling without replacement speeds up optimization in minimax problems.
problem Optimizing minimax problems with faster convergence rates.
method Analysis of gradient descent ascent and proximal point method with two sampling strategies.
result Sampling without replacement leads to faster convergence rates in minimax optimization.
Improved FTPL algorithm reduces regret in predictable minimax games.
problem Online learning and minimax games with predictable loss sequences.
method Optimistic modification of FTPL with dual regularization view.
result Tighter regret bounds for predictable sequences, O(T−1/2) accuracy. The paper introduces new structures for left-symmetric algebroids.
problem Developing new mathematical structures for left-symmetric algebroids.
method Introducing Koszul-Vinberg-Nijenhuis structures and related concepts.
result Koszul-Vinberg-Nijenhuis structures provide a hierarchy of structures.
We give a notion of compatibility between a Riemannian structure and a Jacobi structure. We prove that in case of fundamental examples of Jacobi structures : Poisson structures, contact structures and locally conformally symplectic structures, we get respectively Riemann-Poisson structures in the sense of M. Boucetta, …
We give a notion of compatibility between a Riemannian metric and a Jacobi structure. We prove that in case of Poisson structures, contact structures and locally conformally symplectic structures, fundamental examples of Jacobi structures, we get respectively Riemann-Poisson structures in the sense of M. Boucetta, $\fr…
Defines structure constants for specific geometric structures on Lie groups.
problem No specific problem stated; focuses on defining structure constants.
method Not explicitly detailed in the abstract.
result Defines structure constants for almost complex, almost symplectic, and Riemannian structures on a local Lie group.
Study on G2∗ structures and almost para-contact structures in 7D.
problem Understanding the relation between G2∗ structures and almost para-contact structures. method Calculating projections using properties of G2∗ structures. result Determined the class of almost para-contact structures induced by G2∗ structures. Defines a new Poisson structure for generalized Sasakian spaces.
problem No specific problem stated; focuses on new structure definition.
method Defines a canonical Poisson structure on generalized contact metric spaces.
result Shows distinction between generalized Sasakian and coKähler structures.
In a preceding paper we introduced a notion of compatibility between a Jacobi structure and a Riemannian structure on a smooth manifold. We proved that in the case of fundamental examples of Jacobi structures : Poisson structures, contact structures and locally conformally symplectic structures, we get respectively Rie…
Study on types of generalized hypercomplex structures on tori and Kodaira-Thurston surface.
problem Characterizing types of generalized hypercomplex structures.
method Analysis of S2-family of generalized complex structures and study of twistor spaces. result Existence of generalized hypercomplex structures on 4n-dimensional tori with non-maximal types. Classifies complex Dirac structures with invariants and local structure.
problem Classifying complex Dirac structures.
method Introducing invariants (order, type), proving existence and splitting theorems.
result Pointwise classification and local structure of complex Dirac structures.
Extends corner structure study to general case, constructs normal Trans-Sasakian structures.
problem Extending corner structure study to general case without conditions.
method Extends corner structure to general case, constructs Trans-Sasakian structures from non-normal corner structures.
result Constructs normal Trans-Sasakian structures from non-normal corner structures.
New metric structures generalize Sasakian and cosymplectic structures, proving rigidity and finding conditions.
problem Generalizing Sasakian and cosymplectic structures to new metric structures.
method Introducing weak structures and proving rigidity of Sasakian structures.
result Any weak Sasakian structure is homothetically equivalent to a Sasakian structure.
3D projective structures can be metrized with conformal structures.
problem Weyl metrizability of 3D projective structures.
method Interpreting Weyl metrizability as CR submanifolds in 7D.
result Beltrami's theorem extends to conformal structures in 3D.
Hypersymplectic structures with torsion on Lie algebroids are investigated. We show that each hypersymplectic structure with torsion on a Lie algebroid determines three Nijenhuis morphisms. From a contravariant point of view, these structures are twisted Poisson structures. We prove the existence of a one-to-one corres…
Study equivalence between Hessian and Born structures on tangent bundles.
problem Equivalence between Hessian and Born structures on tangent bundles.
method Analyzing conditions for Hessian structures and integrability of induced almost Born structures.
result Conditions for equivalence between Hessian and Born structures are established.
Introduces compatibility between Dirac structures and Nijenhuis tensors.
problem No specific problem stated; focuses on extending Poisson-Nijenhuis structures.
method Introduces compatibility between Dirac structures and (1,1)-tensor fields.
result Properties of Dirac-Nijenhuis structures studied, including connections and integrations.
We introduce generalized almost contact structures which admit the B-field transformations on odd dimensional manifolds. We provide definition of generalized Sasakain structures from the view point of the generalized almost contact structures. We obtain a generalized Sasakian structure on a non-compact manifold which…
Introduces semi-abelian generalized complex structures.
problem Deformation theory of abelian complex structures.
method Definition and examples of semi-abelian generalized complex structures.
result Illustration of new concept with examples.
Introduces VB-structures for geometric objects on manifolds.
problem Properties of higher tangent lifts of geometric structures.
method Introduces weighted structures for various geometric objects on a manifold with a homogeneity structure.
result Proves interesting properties of various weighted structures.
The paper studies nilpotent structures in oriented neutral vector bundles and neutral hyperKähler structures.
problem Nilpotent structures in oriented neutral vector bundles and their relation to neutral hyperKähler structures.
method Defined H-nilpotent structures for Lie subgroups of SO(2n,2n) related to neutral hyperKähler structures. result Existence of complex and paracomplex structures forming neutral hyperKähler structures if and only if there exists an H-nilpotent structure. Spin-structures on real Bott manifolds with Kähler structure are characterized.
problem Existence of spin-structures on real Bott manifolds with Kähler structure.
method Ishida characterization and techniques from \cite{PS16} using characteristic classes.
result Necessary and sufficient condition for the existence of spin-structures on M. Expanding on previous work, this note generalizes geometric structures results.
problem Generalizing geometric structures results.
method Generalization to a class of geometric structures including integrable almost-complex structures.
result Main results generalized to a broader class of geometric structures.
Exotic hypercomplex structures on a torus are proven to not exist.
problem Existence of exotic hypercomplex structures on a torus.
method Classification of complete flat affine structures on real tori using the Obata connection.
result Exotic hypercomplex structures on a torus do not exist.
Parabolic almost conformally symplectic structures were introduced in the first part of this series of articles as a class of geometric structures which have an underlying almost conformally symplectic structure. If this underlying structure is conformally symplectic, then one obtains a PCS-structure. In the current ar…
In this paper, we show the existence of (co-oriented) contact structures on certain classes of G2-manifolds, and that these two structures are compatible in certain ways. Moreover, we prove that any seven-manifold with a spin structure (and so any manifold with G2-structure) admits an almost contact structure. We…