Provably training overparameterized neural network classifiers with non-convex constraints

DOI10.1214/22-EJS2036MaRDI QIDQ2106783FDOQ2106783

Authors: You-Lin Chen, Zhaoran Wang, Mladen Kolar 

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

zbMATH Keywords

neural tangent kernelnon-convex constrained optimizationonline learning with non-convex losses

Mathematics Subject Classification ID

Statistics (62-XX)

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?)
• Following the leader and fast rates in online linear prediction: curved constraint sets and other regularities
• 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)

• Provable Training of a ReLU Gate with an Iterative Non-Gradient Algorithm
• Provably Training Overparameterized Neural Network Classifiers with Non-convex Constraints
• Title not available (Why is that?)

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)