:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lange, Jane, Vasilyan, Arsen
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Machine Learning
Accès en ligne:	https://arxiv.org/abs/2505.13708
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
par: Goel, Surbhi, et autres
Publié: (2024)

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

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

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

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

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

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)

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

On the query complexity of sampling from non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

A proximal gradient algorithm for composite log-concave sampling
par: Liu, Linghai, et autres
Publié: (2026)

A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
par: Wadia, Neha S.
Publié: (2024)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

Limitations of Membership Queries in Testable Learning
par: Lange, Jane, et autres
Publié: (2025)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
par: Gu, Yuzhou, et autres
Publié: (2024)

Samplability makes learning easier
par: Blanc, Guy, et autres
Publié: (2025)

The adaptive complexity of parallelized log-concave sampling
par: Zhou, Huanjian, et autres
Publié: (2024)

A Distributional-Lifting Theorem for PAC Learning
par: Blanc, Guy, et autres
Publié: (2025)

Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
par: Oki, Taihei, et autres
Publié: (2026)

On the hardness of learning under symmetries
par: Kiani, Bobak T., et autres
Publié: (2024)

Sublinear-query relative-error testing of halfspaces
par: Chen, Xi, et autres
Publié: (2026)

Robust Learning-Augmented Dictionaries
par: Zeynali, Ali, et autres
Publié: (2024)

Robust Learning with Optimal Error
par: Blanc, Guy
Publié: (2026)

Outlier Robust Multivariate Polynomial Regression
par: Arora, Vipul, et autres
Publié: (2024)

Learning Multinomial Logits in $O(n \log n)$ time
par: Chierichetti, Flavio, et autres
Publié: (2026)

Provably learning a multi-head attention layer
par: Chen, Sitan, et autres
Publié: (2024)

Deletion Robust Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

Towards Optimal Robustness in Learning-Augmented Paging
par: Chen, Peng, et autres
Publié: (2026)

Robust Sparse Regression with Non-Isotropic Designs
par: Liu, Chih-Hung, et autres
Publié: (2024)

Unrolled denoising networks provably learn optimal Bayesian inference
par: Karan, Aayush, et autres
Publié: (2024)

Learning Juntas under Markov Random Fields
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Reliable Learning of Halfspaces under Gaussian Marginals
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Agnostic learning in (almost) optimal time via Gaussian surface area
par: Pesenti, Lucas, et autres
Publié: (2026)

Predicting quantum channels over general product distributions
par: Chen, Sitan, et autres
Publié: (2024)