:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Busa-Fekete, Robert, Dick, Travis, Gentile, Claudio, Kaplan, Haim, Koren, Tomer, Stemmer, Uri
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.05355
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Statistical Learning from Attribution Sets
by: Applebaum, Lorne, et al.
Published: (2026)

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

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

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

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

Cost-Aware Learning
by: Mohri, Clara, et al.
Published: (2026)

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

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

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

Private Truly-Everlasting Robust-Prediction
by: Stemmer, Uri
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

RealStats: A Rigorous Real-Only Statistical Framework for Fake Image Detection
by: Zisman, Haim, et al.
Published: (2026)

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

Heterogeneous Treatment Effect in Time-to-Event Outcomes: Harnessing Censored Data with Recursively Imputed Trees
by: Meir, Tomer, et al.
Published: (2025)

On Local Overfitting and Forgetting in Deep Neural Networks
by: Stern, Uri, et al.
Published: (2024)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)

Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries
by: Cohen, Edith, et al.
Published: (2024)

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