Image de couverture de livre

On the ERM Principle in Meta-Learning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Alon, Yannay, Hanneke, Steve, Moran, Shay, Shalit, Uri
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Theory of Universal Agnostic Learning
par: Hanneke, Steve, et autres
Publié: (2026)

Universal rates of ERM for agnostic learning
par: Hanneke, Steve, et autres
Publié: (2025)

List Sample Compression and Uniform Convergence
par: Hanneke, Steve, et autres
Publié: (2024)

Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
par: Hanneke, Steve, et autres
Publié: (2026)

Optimal Mistake Bounds for Transductive Online Learning
par: Chase, Zachary, et autres
Publié: (2025)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
par: Attias, Idan, et autres
Publié: (2025)

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
par: Filmus, Yuval, et autres
Publié: (2024)

Data Selection for ERMs
par: Hanneke, Steve, et autres
Publié: (2025)

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
par: Filmus, Yuval, et autres
Publié: (2023)

An Optimal Sauer Lemma Over $k$-ary Alphabets
par: Hanneke, Steve, et autres
Publié: (2026)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
par: Hanneke, Steve, et autres
Publié: (2026)

On the Learning Curves of Revenue Maximization
par: Hanneke, Steve, et autres
Publié: (2026)

Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
par: Cohen, Alon, et autres
Publié: (2025)

Adversarial Resilience in Sequential Prediction via Abstention
par: Goel, Surbhi, et autres
Publié: (2023)

Private List Learnability vs. Online List Learnability
par: Hanneke, Steve, et autres
Publié: (2025)

Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem
par: Fioravanti, Simone, et autres
Publié: (2024)

Benchmarks for Reinforcement Learning with Biased Offline Data and Imperfect Simulators
par: Linial, Ori, et autres
Publié: (2024)

Boosting Simple Learners
par: Alon, Noga, et autres
Publié: (2020)

Dual VC Dimension Obstructs Sample Compression by Embeddings
par: Chase, Zachary, et autres
Publié: (2024)

Set Valued Predictions For Robust Domain Generalization
par: Tsibulsky, Ron, et autres
Publié: (2025)

Heterogeneous Treatment Effect in Time-to-Event Outcomes: Harnessing Censored Data with Recursively Imputed Trees
par: Meir, Tomer, et autres
Publié: (2025)

Preference-based Conditional Treatment Effects and Policy Learning
par: Parnas, Dovid, et autres
Publié: (2026)

The Dimension of Self-Directed Learning
par: Devulapalli, Pramith, et autres
Publié: (2024)

Universal Multiclass Transductive Online Learning
par: Hanneke, Steve, et autres
Publié: (2026)

Learning from Snapshots of Discrete and Continuous Data Streams
par: Devulapalli, Pramith, et autres
Publié: (2024)

A Unified Characterization of Private Learnability via Graph Theory
par: Alon, Noga, et autres
Publié: (2023)

When More Data Doesn't Help: Limits of Adaptation in Multitask Learning
par: Hanneke, Steve, et autres
Publié: (2026)

Malign Overfitting: Interpolation Can Provably Preclude Invariance
par: Wald, Yoav, et autres
Publié: (2022)

Structured Hybrid Mechanistic Models for Robust Estimation of Time-Dependent Intervention Outcomes
par: Meir, Tomer, et autres
Publié: (2026)

Adaptive Sample Aggregation In Transfer Learning
par: Hanneke, Steve, et autres
Publié: (2024)

Can Copyright be Reduced to Privacy?
par: Elkin-Koren, Niva, et autres
Publié: (2023)

Universal Rates of Empirical Risk Minimization
par: Hanneke, Steve, et autres
Publié: (2024)

On Characterizing Learnability for Adversarial Noisy Bandits
par: Hanneke, Steve, et autres
Publié: (2026)

Adversarially Robust PAC Learnability of Real-Valued Functions
par: Attias, Idan, et autres
Publié: (2022)

A Theory of Optimistically Universal Online Learnability for General Concept Classes
par: Hanneke, Steve, et autres
Publié: (2025)

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
par: Attias, Idan, et autres
Publié: (2026)

Aiming for Relevance
par: Porat, Bar Eini, et autres
Publié: (2024)

A Complete Characterization of Learnability for Stochastic Noisy Bandits
par: Hanneke, Steve, et autres
Publié: (2024)

Efficient Agnostic Learning with Average Smoothness
par: Hanneke, Steve, et autres
Publié: (2023)

The Real Price of Bandit Information in Multiclass Classification
par: Erez, Liad, et autres
Publié: (2024)