No article text was recorded for this version.
agnostic learning
Version 2 of 2131 papers142 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Learning using Local Membership Queries under Smooth Distributions
- Blog: Statistical Query Lower Bounds for Smoothed Agnostic Learning
- Blog: On the Parameterized Complexity of Learning Logic
- Blog: Agnostic PAC-Learning of Functions on Analog Neural Nets
- Blog: Potential-Based Agnostic Boosting
- Blog: On Learnability wih Computable Learners
- Blog: Approximate resilience, monotonicity, and the complexity of agnostic learning
- Blog: Multicalibration as Boosting for Regression
- Blog: Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noise
- Blog: Realizable Learning is All You Need
- Blog: On the Power of Membership Queries in Agnostic Learning
- Blog: Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
- Blog: Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals
- Blog: Properly Learning Poisson Binomial Distributions in Almost Polynomial Time
- Blog: Statistical-Query Lower Bounds via Functional Gradients
- Blog: Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching
- Blog: Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
- Blog: The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model
- Blog: Efficient Testable Learning of Halfspaces with Adversarial Label Noise
- Blog: Adversarial Resilience in Sequential Prediction via Abstention
- Blog: Adversarially Robust Learning with Uncertain Perturbation Sets
- Blog: Efficient Private Algorithms for Learning Large-Margin Halfspaces
- Blog: Parameterized Complexity of Small Decision Tree Learning
- Blog: Robust Regression of General ReLUs with Queries
- Blog: The Complexity of Adversarially Robust Proper Learning of Halfspaces with Agnostic Noise
- Blog: Using More Data to Speed-up Training Time
- Blog: Robustly Learning Monotone Single-Index Models
- Blog: Agnostic Active Learning of Single Index Models with Linear Sample Complexity
- Blog: Agnostic Learning of Disjunctions on Symmetric Distributions
- Blog: Agnostic Estimation of Mean and Covariance
- Blog: Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals
- Blog: Statistical-Query Lower Bounds via Functional Gradients
- Blog: Learning by Refuting
- Blog: The Computational Complexity of Training ReLU(s)
- Blog: Efficient Quantum Agnostic Improper Learning of Decision Trees
- Blog: Robustly Learning a Single Neuron via Sharpness
- Blog: Provable Robustness of Adversarial Training for Learning Halfspaces with Noise
- Blog: Classification Protocols with Minimal Disclosure
- Blog: Faster Algorithms for Agnostically Learning Disjunctions and their Implications
- Blog: Efficient Density Estimation via Piecewise Polynomial Approximation
- Blog: Hardness of Learning a Single Neuron with Adversarial Label Noise
- Blog: Learning General Halfspaces with Adversarial Label Noise via Online Gradient Descent
- Blog: Active Learning for Single Neuron Models with Lipschitz Non-Linearities
- Blog: List Learning with Attribute Noise
- Blog: Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals
- Blog: Agnostic Learning of General ReLU Activation Using Gradient Descent
- Blog: Approximation Schemes for ReLU Regression
- Blog: Improper Learning by Refuting
- Blog: Agnostic Selective Classification
- Blog: Learning a Single Neuron with Adversarial Label Noise via Gradient Descent
- Blog: Active Learning for Single Neuron Models with Lipschitz Non-Linearities
- Blog: Properly learning decision trees in almost polynomial time
- Blog: Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression
- Blog: Bounded Memory Active Learning through Enriched Queries
- Blog: Robust Model Selection and Nearly-Proper Learning for GMMs
- Blog: Distribution-Specific Agnostic Conditional Classification With Halfspaces
- Blog: Agnostic Membership Query Learning with Nontrivial Savings: New Results, Techniques
- Blog: Omnipredicting Single-Index Models with Multi-Index Models
- Blog: Agnostic Learning of Monomials by Halfspaces Is Hard
- Blog: Robustly Learning Monotone Generalized Linear Models via Data Augmentation
Showing 60 of 131 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_agnostic_learning_3a071816,
title = {agnostic learning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/agnostic-learning/rdr_3a0718167872479aab73b9f5d7e94c46},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_agnostic_learning_3a071816_v2,
title = {agnostic learning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/agnostic-learning/rdr_3a0718167872479aab73b9f5d7e94c46/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}