Provably training overparameterized neural network classifiers with non-convex constraints
From MaRDI portal
Publication:2106783
DOI10.1214/22-EJS2036MaRDI QIDQ2106783FDOQ2106783
Mladen Kolar, You-Lin Chen, Zhaoran Wang
Publication date: 19 December 2022
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.15274
Cites Work
- Title not available (Why is that?)
- Fairness through awareness
- Title not available (Why is that?)
- Online Learning and Online Convex Optimization
- Agnostic Learning of Monomials by Halfspaces Is Hard
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Title not available (Why is that?)
- Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
- Non-convex Optimization for Machine Learning
- An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians
- Stochastic Model-Based Minimization of Weakly Convex Functions
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- A selective overview of deep learning
- Gradient descent optimizes over-parameterized deep ReLU networks
- Wide neural networks of any depth evolve as linear models under gradient descent *
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
- Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
- Advancing subgroup fairness via sleeping experts
Cited In (3)
This page was built for publication: Provably training overparameterized neural network classifiers with non-convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106783)