Copertina

Efficient Discrepancy Testing for Learning with Distribution Shift

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chandrasekaran, Gautam, Klivans, Adam R., Kontonis, Vasilis, Stavropoulos, Konstantinos, Vasilyan, Arsen
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Iterative Chow Filtering for Learning with Distribution Shift
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2026)

Testable Learning with Distribution Shift
di: Klivans, Adam R., et al.
Pubblicazione: (2023)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
di: Klivans, Adam R., et al.
Pubblicazione: (2024)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2025)

Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
di: Klivans, Adam R., et al.
Pubblicazione: (2026)

Testing Noise Assumptions of Learning Algorithms
di: Goel, Surbhi, et al.
Pubblicazione: (2025)

Learning Constant-Depth Circuits in Malicious Noise Models
di: Klivans, Adam R., et al.
Pubblicazione: (2024)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2025)

The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
di: Klivans, Adam R., et al.
Pubblicazione: (2025)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2025)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
di: Goel, Surbhi, et al.
Pubblicazione: (2024)

Learning Juntas under Markov Random Fields
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2025)

Learning $\mathsf{AC}^0$ Under Graphical Models
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2026)

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

Sparse Linear Regression is Easy on Random Supports
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2025)

Robust learning of halfspaces under log-concave marginals
di: Lange, Jane, et al.
Pubblicazione: (2025)

Active Learning with Simple Questions
di: Kontonis, Vasilis, et al.
Pubblicazione: (2024)

Learning general Gaussian mixtures with efficient score matching
di: Chen, Sitan, et al.
Pubblicazione: (2024)

Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2024)

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

Efficient Calibration for Decision Making
di: Gopalan, Parikshit, et al.
Pubblicazione: (2025)

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
di: Chandrasekaran, Gautam, et al.
Pubblicazione: (2024)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
di: Eden, Talya, et al.
Pubblicazione: (2025)

The Importance of Being Smoothly Calibrated
di: Gopalan, Parikshit, et al.
Pubblicazione: (2026)

Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension
di: Klivans, Adam R., et al.
Pubblicazione: (2026)

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
di: Lange, Jane, et al.
Pubblicazione: (2023)

Efficient and Provable Algorithms for Covariate Shift
di: Adil, Deeksha, et al.
Pubblicazione: (2025)

Signal-Aware Workload Shifting Algorithms with Uncertainty-Quantified Predictors
di: Johnson, Ezra, et al.
Pubblicazione: (2025)

Testing Support Size More Efficiently Than Learning Histograms
di: Pinto Jr., Renato Ferreira, et al.
Pubblicazione: (2024)

Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
di: Kamath, Gautam, et al.
Pubblicazione: (2025)

Optimal Algorithms for Augmented Testing of Discrete Distributions
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2024)

Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
di: Aliakbarpour, Maryam, et al.
Pubblicazione: (2026)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
di: Gayen, Sutanu, et al.
Pubblicazione: (2024)

Learning and Testing Convex Functions
di: Pinto Jr., Renato Ferreira, et al.
Pubblicazione: (2025)

Efficient Adaptive Data Analysis over Dense Distributions
di: Huh, Joon Suk
Pubblicazione: (2026)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
di: Li, Shuyao, et al.
Pubblicazione: (2024)

Distribution Learning Meets Graph Structure Sampling
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2024)

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

New Statistical and Computational Results for Learning Junta Distributions
di: Beretta, Lorenzo
Pubblicazione: (2025)

Towards Efficient Contrastive PAC Learning
di: Shen, Jie
Pubblicazione: (2025)