Cover Image

Smoothed Analysis of Learning from Positive Samples

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lee, Jane H., Mehrotra, Anay, Zampetakis, Manolis
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Data Structures and Algorithms Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

What is Learnable in Valiant's Theory of the Learnable?
by: Hanneke, Steve, et al.
Published: (2026)

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)

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)

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

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

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

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

Sample-Efficient Private Learning of Mixtures of Gaussians
by: Ashtiani, Hassan, et al.
Published: (2024)

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

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

On Learning Parallel Pancakes with Mostly Uniform Weights
by: Diakonikolas, Ilias, et al.
Published: (2025)

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

The Geometry of Efficient Nonconvex Sampling
by: Vempala, Santosh S., et al.
Published: (2026)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
by: Kook, Yunbum, et al.
Published: (2024)

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
by: Kook, Yunbum, et al.
Published: (2024)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
by: Gay, William, et al.
Published: (2025)

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

Sample-Efficient Linear Regression with Self-Selection Bias
by: Gaitonde, Jason, et al.
Published: (2024)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
by: Gupta, Shivam, et al.
Published: (2024)

Attainability of Two-Point Testing Rates for Finite-Sample Location Estimation
by: Compton, Spencer, et al.
Published: (2025)

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

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
by: Gomez-Leos, Alejandro, et al.
Published: (2024)

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

Linear Regression under Missing or Corrupted Coordinates
by: Diakonikolas, Ilias, et al.
Published: (2025)

Is Transductive Learning Equivalent to PAC Learning?
by: Dughmi, Shaddin, et al.
Published: (2024)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
by: Diakonikolas, Ilias, et al.
Published: (2024)

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

Learning Mixtures of Gaussians Using Diffusion Models
by: Gatmiry, Khashayar, et al.
Published: (2024)

On the Statistical Complexity of Sample Amplification
by: Axelrod, Brian, et al.
Published: (2022)

One-Shot Learning for k-SAT
by: Galanis, Andreas, et al.
Published: (2025)

Online Learning of Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

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

Statistical Query Lower Bounds for Learning Truncated Gaussians
by: Diakonikolas, Ilias, et al.
Published: (2024)

Learning the Sherrington-Kirkpatrick Model Even at Low Temperature
by: Chandrasekaran, Gautam, et al.
Published: (2024)

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

Robust Learning of Multi-index Models via Iterative Subspace Approximation
by: Diakonikolas, Ilias, et al.
Published: (2025)