REVIEW 4 cited by
Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex-concave min-max problem is an active topic of research with efficient algorithms and sound theoretical foundations developed. However, it remains a challenge to design provably efficient algorithms for non-convex min-max problems with or without smoothness. In this paper, we study a family of non-convex min-max problems, whose objective function is weakly convex in the variables of minimization and is concave in the variables of maximization. We propose a proximally guided stochastic subgradient method and a proximally guided stochastic variance-reduced method for the non-smooth and smooth instances, respectively, in this family of problems. We analyze the time complexities of the proposed methods for finding a nearly stationary point of the outer minimization problem corresponding to the min-max problem.
Forward citations
Cited by 4 Pith papers
-
Stochastic AUC Maximization with Deep Neural Networks
Under the Polyak-Lojasiewicz condition, a proximal primal-dual algorithm and an AdaGrad-style variant maximize AUC with deep networks at O~(1/epsilon) sample complexity, with adaptive iteration complexity under slow c...
-
Stochastic First-order Methods for Convex and Nonconvex Functional Constrained Optimization
ConEx, a single-loop primal-dual method with constraint extrapolation, achieves best-known convergence rates for convex functional constrained problems, and a proximal point method achieves O(1/ε) complexity to approx...
-
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints
A proximally constrained subgradient method finds a nearly stationary point for weakly convex objectives with weakly convex constraints in O(1/epsilon^4) deterministic and O~(1/epsilon^6) stochastic iterations.
-
Stochastic Optimization for Non-convex Inf-Projection Problems
The paper provides stochastic algorithms with O(1/epsilon^{4/v}) iteration complexity for finding near-stationary points of non-convex inf-projection objectives, with a variance-regularization application.
Discussion (0). Continue with ORCID to comment.