Image de couverture de livre

Faster Rates for Private Adversarial Bandits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asi, Hilal, Raman, Vinod, Talwar, Kunal
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tracking the Best Expert Privately
par: Saha, Aadirupa, et autres
Publié: (2025)

On Privately Estimating a Single Parameter
par: Asi, Hilal, et autres
Publié: (2025)

Private Online Learning via Lazy Algorithms
par: Asi, Hilal, et autres
Publié: (2024)

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages
par: Asi, Hilal, et autres
Publié: (2024)

PREAMBLE: Private and Efficient Aggregation via Block Sparse Vectors
par: Asi, Hilal, et autres
Publié: (2025)

AdaBoN: Adaptive Best-of-N Alignment
par: Raman, Vinod, et autres
Publié: (2025)

Faster Algorithms for User-Level Private Stochastic Convex Optimization
par: Lowy, Andrew, et autres
Publié: (2024)

Privacy-Computation trade-offs in Private Repetition and Metaselection
par: Talwar, Kunal
Publié: (2024)

Instance-Optimality for Private KL Distribution Estimation
par: Ye, Jiayuan, et autres
Publié: (2025)

Adaptive Batch Size for Privately Finding Second-Order Stationary Points
par: Liu, Daogao, et autres
Publié: (2024)

Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions
par: Asi, Hilal, et autres
Publié: (2024)

Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
par: Lyu, Xin, et autres
Publié: (2024)

DP-Dueling: Learning from Preference Feedback without Compromising User Privacy
par: Saha, Aadirupa, et autres
Publié: (2024)

Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
par: Kornowski, Guy, et autres
Publié: (2024)

Multiclass Online Learnability under Bandit Feedback
par: Raman, Ananth, et autres
Publié: (2023)

Apple Tasting: Combinatorial Dimensions and Minimax Rates
par: Raman, Vinod, et autres
Publié: (2023)

How many labelers do you have? A closer look at gold-standard labels
par: Cheng, Chen, et autres
Publié: (2022)

Generation from Noisy Examples
par: Raman, Ananth, et autres
Publié: (2025)

Instance-Optimal Private Density Estimation in the Wasserstein Distance
par: Feldman, Vitaly, et autres
Publié: (2024)

Concentration of the Langevin Algorithm's Stationary Distribution
par: Altschuler, Jason M., et autres
Publié: (2022)

Cram Less to Fit More: Training Data Pruning Improves Memorization of Facts
par: Ye, Jiayuan, et autres
Publié: (2026)

Faster Margin Maximization Rates for Generic and Adversarially Robust Optimization Methods
par: Wang, Guanghui, et autres
Publié: (2023)

Enabling Differentially Private Federated Learning for Speech Recognition: Benchmarks, Adaptive Optimizers and Gradient Clipping
par: Pelikan, Martin, et autres
Publié: (2023)

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)

Online Classification with Predictions
par: Raman, Vinod, et autres
Publié: (2024)

Differentially Private Kernelized Contextual Bandits
par: Pavlovic, Nikola, et autres
Publié: (2025)

Locally Differentially Private Thresholding Bandits
par: Barbara, Annalisa, et autres
Publié: (2025)

Generation through the lens of learning theory
par: Li, Jiaxun, et autres
Publié: (2024)

The Complexity of Sequential Prediction in Dynamical Systems
par: Raman, Vinod, et autres
Publié: (2024)

Online Learning with Set-Valued Feedback
par: Raman, Vinod, et autres
Publié: (2023)

Online Infinite-Dimensional Regression: Learning Linear Operators
par: Raman, Vinod, et autres
Publié: (2023)

A Combinatorial Characterization of Supervised Online Learnability
par: Raman, Vinod, et autres
Publié: (2023)

A Characterization of Multioutput Learnability
par: Raman, Vinod, et autres
Publié: (2023)

On Generation in Metric Spaces
par: Li, Jiaxun, et autres
Publié: (2026)

Smoothed Online Classification can be Harder than Batch Classification
par: Raman, Vinod, et autres
Publié: (2024)

Faster Q-Learning Algorithms for Restless Bandits
par: Kakarapalli, Parvish, et autres
Publié: (2024)

Adversarial Multi-dueling Bandits
par: Gajane, Pratik
Publié: (2024)

Adversarial Bandit over Bandits: Hierarchical Bandits for Online Configuration Management
par: Avin, Chen, et autres
Publié: (2025)

Faster Rates For Federated Variational Inequalities
par: Wang, Guanghui, et autres
Publié: (2026)