Copertina

Nearly Optimal Sample Complexity for Learning with Label Proportions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Busa-Fekete, Robert, Dick, Travis, Gentile, Claudio, Kaplan, Haim, Koren, Tomer, Stemmer, Uri
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimal Learning from Label Proportions with General Loss Functions
di: Applebaum, Lorne, et al.
Pubblicazione: (2025)

Statistical Learning from Attribution Sets
di: Applebaum, Lorne, et al.
Pubblicazione: (2026)

Auditing Privacy Mechanisms via Label Inference Attacks
di: Busa-Fekete, Róbert István, et al.
Pubblicazione: (2024)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
di: Sherman, Uri, et al.
Pubblicazione: (2025)

Bayesian Perspective on Memorization and Reconstruction
di: Kaplan, Haim, et al.
Pubblicazione: (2025)

TBDFiltering: Sample-Efficient Tree-Based Data Filtering
di: Busa-Fekete, Robert Istvan, et al.
Pubblicazione: (2026)

Cost-Aware Learning
di: Mohri, Clara, et al.
Pubblicazione: (2026)

Near-optimal algorithms for private estimation and sequential testing of collision probability
di: Busa-Fekete, Robert, et al.
Pubblicazione: (2025)

Rate-Optimal Policy Optimization for Linear Markov Decision Processes
di: Sherman, Uri, et al.
Pubblicazione: (2023)

The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization
di: Schliserman, Matan, et al.
Pubblicazione: (2024)

Private Truly-Everlasting Robust-Prediction
di: Stemmer, Uri
Pubblicazione: (2024)

From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards
di: Erez, Liad, et al.
Pubblicazione: (2025)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
di: Sherman, Uri, et al.
Pubblicazione: (2025)

Complexity of Vector-valued Prediction: From Linear Models to Stochastic Convex Optimization
di: Schliserman, Matan, et al.
Pubblicazione: (2024)

The Hidden Cost of Approximation in Online Mirror Descent
di: Schlisselberg, Ofir, et al.
Pubblicazione: (2025)

Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime
di: Attia, Amit, et al.
Pubblicazione: (2025)

Optimal Rates in Continual Linear Regression via Increasing Regularization
di: Levinstein, Ran, et al.
Pubblicazione: (2025)

Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization
di: Attia, Amit, et al.
Pubblicazione: (2025)

Multiclass Loss Geometry Matters for Generalization of Gradient Descent in Separable Classification
di: Schliserman, Matan, et al.
Pubblicazione: (2025)

Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back
di: Cohen, Alon, et al.
Pubblicazione: (2025)

From Continual Learning to SGD and Back: Better Rates for Continual Linear Models
di: Evron, Itay, et al.
Pubblicazione: (2025)

Differentially Private Release and Learning of Threshold Functions
di: Bun, Mark, et al.
Pubblicazione: (2015)

The Sample Complexity of Multiclass and Sparse Contextual Bandits
di: Erez, Liad, et al.
Pubblicazione: (2026)

How Free is Parameter-Free Stochastic Optimization?
di: Attia, Amit, et al.
Pubblicazione: (2024)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
di: Rapoport, Emma, et al.
Pubblicazione: (2025)

The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for $\ell_2$ Norm Estimation
di: Ahmadian, Sara, et al.
Pubblicazione: (2025)

Theoretical Proportion Label Perturbation for Learning from Label Proportions in Large Bags
di: Kubo, Shunsuke, et al.
Pubblicazione: (2024)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
di: Attia, Amit, et al.
Pubblicazione: (2024)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
di: Erez, Liad, et al.
Pubblicazione: (2022)

Near-Optimal Sample Complexity for Online Constrained MDPs
di: Liu, Chang, et al.
Pubblicazione: (2026)

Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
di: Kayal, Aya, et al.
Pubblicazione: (2025)

Proportion Estimation by Masked Learning from Label Proportion
di: Okuo, Takumi, et al.
Pubblicazione: (2024)

Flat Minima and Generalization: Insights from Stochastic Convex Optimization
di: Schliserman, Matan, et al.
Pubblicazione: (2025)

Protecting the Undeleted in Machine Unlearning
di: Cohen, Aloni, et al.
Pubblicazione: (2026)

Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching
di: Attia, Amit, et al.
Pubblicazione: (2024)

Multiplicative Reweighting for Robust Neural Network Optimization
di: Bar, Noga, et al.
Pubblicazione: (2021)

Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity
di: Li, Bo, et al.
Pubblicazione: (2025)

Near Optimal Non-asymptotic Sample Complexity of 1-Identification
di: Li, Zitian, et al.
Pubblicazione: (2025)

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
di: Li, Zhenghao, et al.
Pubblicazione: (2025)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
di: Shi, Laixi, et al.
Pubblicazione: (2022)