Cover Image

What is Learnable in Valiant's Theory of the Learnable?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hanneke, Steve, Mehrotra, Anay, Velegkas, Grigoris, Zampetakis, Manolis
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Data Structures and Algorithms Statistics Theory Computation
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
by: Lee, Jane H., et al.
Published: (2024)

A Note on Non-Negative $L_1$-Approximating Polynomials
by: Lee, Jane H., et al.
Published: (2026)

Smoothed Analysis of Learning from Positive Samples
by: Lee, Jane H., et al.
Published: (2025)

Mean Estimation from Coarse Data: Characterizations and Efficient Algorithms
by: Kalavasis, Alkis, et al.
Published: (2026)

Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion
by: Mehrotra, Anay, et al.
Published: (2026)

On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability
by: Kalavasis, Alkis, et al.
Published: (2024)

On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse
by: Kalavasis, Alkis, et al.
Published: (2024)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)

On Language Generation in the Limit with Bounded Memory
by: Kleinberg, Jon, et al.
Published: (2026)

Differentially Private Language Generation and Identification in the Limit
by: Mehrotra, Anay, et al.
Published: (2026)

Language Generation with Infinite Contamination
by: Mehrotra, Anay, et al.
Published: (2025)

Transfer Learning Beyond Bounded Density Ratios
by: Kalavasis, Alkis, et al.
Published: (2024)

Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases and Beyond
by: Kalavasis, Alkis, et al.
Published: (2025)

Private List Learnability vs. Online List Learnability
by: Hanneke, Steve, et al.
Published: (2025)

Linear Regression with Unknown Truncation Beyond Gaussian Features
by: Kouridakis, Alexandros, et al.
Published: (2026)

DDPM Score Matching and Distribution Learning
by: Chewi, Sinho, et al.
Published: (2025)

Distribution Learnability and Robustness
by: Ben-David, Shai, et al.
Published: (2024)

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

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
by: Hanneke, Steve, et al.
Published: (2026)

Procurement Auctions via Approximately Optimal Submodular Optimization
by: Deng, Yuan, et al.
Published: (2024)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)

Private Statistical Estimation via Truncation
by: Zampetakis, Manolis, et al.
Published: (2025)

Replicable Clustering
by: Esfandiari, Hossein, et al.
Published: (2023)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
by: Epasto, Alessandro, et al.
Published: (2020)

Replicable Learning of Large-Margin Halfspaces
by: Kalavasis, Alkis, et al.
Published: (2024)

Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening
by: Kalavasis, Alkis, et al.
Published: (2024)

Not All Learnable Distribution Classes are Privately Learnable
by: Bun, Mark, et al.
Published: (2024)

Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms
by: Kalavasis, Alkis, et al.
Published: (2026)

Efficient Parameter Estimation of Truncated Boolean Product Distributions
by: Fotakis, Dimitris, et al.
Published: (2020)

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
by: Srinivasan, Vishwak, et al.
Published: (2023)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
by: Afzali, Mohammad, et al.
Published: (2023)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
by: Attias, Idan, et al.
Published: (2025)

Easy, robust approximate message passing for planted spike models
by: Ivkov, Misha, et al.
Published: (2026)

Complexity of Non-Log-Concave Sampling in Fisher Information
by: Chewi, Sinho, et al.
Published: (2026)

A proximal gradient algorithm for composite log-concave sampling
by: Liu, Linghai, et al.
Published: (2026)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Learning Multinomial Logits in $O(n \log n)$ time
by: Chierichetti, Flavio, et al.
Published: (2026)

High-dimensional estimation with missing data: Statistical and computational limits
by: Verchand, Kabir Aladin, et al.
Published: (2026)

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
by: Diakonikolas, Ilias, et al.
Published: (2026)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
by: Diakonikolas, Ilias, et al.
Published: (2026)