conftrace_

agnostic learning

76 papers

Explore in graph

Co-occurring keywords

pac learning (283) sample complexity (1169) learning theory (519) active learning (1301) halfspace learning (30) boosting algorithm (78) gaussian distribution (127) vc dimension (108) multiclass classification (181) online learning (1777)

Papers

Agnostic Learnability of Halfspaces via Logistic Loss ICML 2022
Simple and near-optimal algorithms for hidden stratification and multi-group learning ICML 2022
Realizable Learning is All You Need COLT 2022
On Learning and Refutation in Noninteractive Local Differential Privacy NIPS 2022
Online Agnostic Multiclass Boosting NIPS 2022
Agnostic Learning of Halfspaces with Gradient Descent via Soft Margins ICML 2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model COLT 2021
Agnostic Proper Learning of Halfspaces under Gaussian Marginals COLT 2021
Agnostic Reinforcement Learning with Low-Rank MDPs and Rich Observations NIPS 2021
Multiclass Boosting and the Cost of Weak Learning NIPS 2021
Multi-group Agnostic PAC Learnability ICML 2021
Agnostic Learning of a Single Neuron with Gradient Descent NIPS 2020
Provable guarantees for decision tree induction: the agnostic setting ICML 2020
A General Method for Robust Learning from Batches NIPS 2020
Statistical-Query Lower Bounds via Functional Gradients NIPS 2020
Online Agnostic Boosting via Regret Minimization NIPS 2020
Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals NIPS 2020
Limits of Private Learning with Access to Public Data NIPS 2019
A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes ALT 2019
Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin NIPS 2019
Sum-of-squares meets square loss: Fast rates for agnostic tensor completion COLT 2019
Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness ICML 2018
Optimal Quantum Sample Complexity of Learning Algorithms JMLR 2018
Lifelong Learning in Costly Feature Spaces ALT 2017
Supervised learning through the lens of compression NIPS 2016