Cover Image

Agnostic Learning of General ReLU Activation Using Gradient Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Awasthi, Pranjal, Tang, Alex, Vijayaraghavan, Aravindan
Format:	Preprint
Published:	2022
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals
by: Guo, Anxin, et al.
Published: (2024)

Stochastic Bandits with ReLU Neural Networks
by: Xu, Kan, et al.
Published: (2024)

Low-Degree Method Fails to Predict Robust Subspace Recovery
by: Jia, He, et al.
Published: (2026)

Compact Conformal Subgraphs
by: Gollapudi, Sreenivas, et al.
Published: (2026)

Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery
by: Gao, Chao, et al.
Published: (2025)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
by: Awasthi, Pranjal, et al.
Published: (2025)

Efficient Certificates of Anti-Concentration Beyond Gaussians
by: Bakshi, Ainesh, et al.
Published: (2024)

Computing High-dimensional Confidence Sets for Arbitrary Distributions
by: Gao, Chao, et al.
Published: (2025)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
by: Hertrich, Christoph, et al.
Published: (2021)

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
by: Bhaskara, Aditya, et al.
Published: (2024)

A Competitive Algorithm for Agnostic Active Learning
by: Price, Eric, et al.
Published: (2023)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
by: Diakonikolas, Ilias, et al.
Published: (2025)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
by: Diakonikolas, Ilias, et al.
Published: (2026)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
by: Shugart, Henry, et al.
Published: (2025)

Individual Privacy Accounting for Differentially Private Stochastic Gradient Descent
by: Yu, Da, et al.
Published: (2022)

Revisiting Agnostic PAC Learning
by: Hanneke, Steve, et al.
Published: (2024)

On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries
by: Joshi, Nirmit, et al.
Published: (2024)

Agnostic learning in (almost) optimal time via Gaussian surface area
by: Pesenti, Lucas, et al.
Published: (2026)

Grams: Gradient Descent with Adaptive Momentum Scaling
by: Cao, Yang, et al.
Published: (2024)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2024)

Learned LSM-trees: Two Approaches Using Learned Bloom Filters
by: Fidalgo, Nicholas, et al.
Published: (2025)

Fast Agnostic Learners in the Plane
by: Eden, Talya, et al.
Published: (2025)

Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)

Towards Optimal Robustness in Learning-Augmented Paging
by: Chen, Peng, et al.
Published: (2026)

Testable Learning of General Halfspaces under Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2026)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
by: Chen, Peng, et al.
Published: (2025)

Error-Tolerant E-Discovery Protocols
by: Dong, Jinshuo, et al.
Published: (2024)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
by: Blanchard, Moise
Published: (2024)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
by: Yuan, Jing, et al.
Published: (2024)

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
by: Boldrin, Cristian, et al.
Published: (2024)

Mistake-Bounded Language Generation
by: Kleinberg, Jon, et al.
Published: (2026)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026)

Language Generation in the Limit: Noise, Loss, and Feedback
by: Bai, Yannan, et al.
Published: (2025)

Learning Low Degree Hypergraphs
by: Balkanski, Eric, et al.
Published: (2022)

Generalized Top-k Mallows Model for Ranked Choices
by: Haddadan, Shahrzad, et al.
Published: (2025)

Active Learning with Simple Questions
by: Kontonis, Vasilis, et al.
Published: (2024)

Learning with Monotone Adversarial Corruptions
by: Larsen, Kasper Green, et al.
Published: (2026)

Testable Learning with Distribution Shift
by: Klivans, Adam R., et al.
Published: (2023)