Image de couverture de livre

Tolerant Algorithms for Learning with Arbitrary Covariate Shift

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goel, Surbhi, Shetty, Abhishek, Stavropoulos, Konstantinos, Vasilyan, Arsen
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Testing Noise Assumptions of Learning Algorithms
par: Goel, Surbhi, et autres
Publié: (2025)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
par: Klivans, Adam R., et autres
Publié: (2024)

Testable Learning with Distribution Shift
par: Klivans, Adam R., et autres
Publié: (2023)

Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
par: Klivans, Adam R., et autres
Publié: (2026)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Efficient Discrepancy Testing for Learning with Distribution Shift
par: Chandrasekaran, Gautam, et autres
Publié: (2024)

Iterative Chow Filtering for Learning with Distribution Shift
par: Chandrasekaran, Gautam, et autres
Publié: (2026)

Learning Constant-Depth Circuits in Malicious Noise Models
par: Klivans, Adam R., et autres
Publié: (2024)

The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
par: Klivans, Adam R., et autres
Publié: (2025)

Robust learning of halfspaces under log-concave marginals
par: Lange, Jane, et autres
Publié: (2025)

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

Learning $\mathsf{AC}^0$ Under Graphical Models
par: Chandrasekaran, Gautam, et autres
Publié: (2026)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
par: Lange, Jane, et autres
Publié: (2023)

Efficient and Provable Algorithms for Covariate Shift
par: Adil, Deeksha, et autres
Publié: (2025)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Stochastic Bandits with ReLU Neural Networks
par: Xu, Kan, et autres
Publié: (2024)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
par: Eden, Talya, et autres
Publié: (2025)

Efficient Calibration for Decision Making
par: Gopalan, Parikshit, et autres
Publié: (2025)

The Importance of Being Smoothly Calibrated
par: Gopalan, Parikshit, et autres
Publié: (2026)

Learning with Monotone Adversarial Corruptions
par: Larsen, Kasper Green, et autres
Publié: (2026)

Sparse Linear Regression is Easy on Random Supports
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Provably Learning from Modern Language Models via Low Logit Rank
par: Golowich, Noah, et autres
Publié: (2025)

Smooth Nash Equilibria: Algorithms and Complexity
par: Daskalakis, Constantinos, et autres
Publié: (2023)

Signal-Aware Workload Shifting Algorithms with Uncertainty-Quantified Predictors
par: Johnson, Ezra, et autres
Publié: (2025)

Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking
par: Rohatgi, Dhruv, et autres
Publié: (2025)

Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals
par: Guo, Anxin, et autres
Publié: (2024)

Tractable Agreement Protocols
par: Collina, Natalie, et autres
Publié: (2024)

On Purely Private Covariance Estimation
par: d'Orsi, Tommaso, et autres
Publié: (2025)

Omnipredictors for Regression and the Approximate Rank of Convex Functions
par: Gopalan, Parikshit, et autres
Publié: (2024)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
par: Chen, Yixin, et autres
Publié: (2026)

Learning-Augmented Algorithms with Explicit Predictors
par: Elias, Marek, et autres
Publié: (2024)

Algorithms with Calibrated Machine Learning Predictions
par: Shen, Judy Hanwen, et autres
Publié: (2025)

Learning-Augmented Algorithms for $k$-median via Online Learning
par: Hebbar, Anish, et autres
Publié: (2026)

Learning-Augmented Streaming Algorithms for Correlation Clustering
par: Dong, Yinhao, et autres
Publié: (2025)

A Competitive Algorithm for Agnostic Active Learning
par: Price, Eric, et autres
Publié: (2023)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
par: Croquevielle, Luis Alberto, et autres
Publié: (2026)

Prediction-Specific Design of Learning-Augmented Algorithms
par: Li, Sizhe, et autres
Publié: (2025)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)