Cover Image

Statistical Learning from Attribution Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Applebaum, Lorne, Busa-Fekete, Robert, Chen, August Y., Gentile, Claudio, Koren, Tomer, Mokhtari, Aryan
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
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)

Nearly Optimal Sample Complexity for Learning with Label Proportions
by: Busa-Fekete, Robert, et al.
Published: (2025)

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

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

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

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

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
by: Jiang, Ruichen, et al.
Published: (2024)

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

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

Learning Mixtures of Experts with EM: A Mirror Descent Perspective
by: Fruytier, Quentin, et al.
Published: (2024)

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

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

Online Learning-guided Learning Rate Adaptation via Gradient Alignment
by: Jiang, Ruichen, et al.
Published: (2025)

Adaptive Optimization via Momentum on Variance-Normalized Gradients
by: Patitucci, Francisco, et al.
Published: (2026)

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

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

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
by: Jiang, Ruichen, et al.
Published: (2024)

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

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

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

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

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)

Curriculum Learning-Guided Progressive Distillation in Large Language Models
by: Cao, Jincheng, et al.
Published: (2026)

Stochastic Newton Proximal Extragradient Method
by: Jiang, Ruichen, et al.
Published: (2024)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
by: Patitucci, Francisco, et al.
Published: (2025)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
by: Jiang, Ruichen, et al.
Published: (2026)

Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networks
by: Collins, Liam, et al.
Published: (2023)

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

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

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

Provable Meta-Learning with Low-Rank Adaptations
by: Block, Jacob L., et al.
Published: (2024)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
by: Jiang, Ruichen, et al.
Published: (2022)

Machine Unlearning under Overparameterization
by: Block, Jacob L., et al.
Published: (2025)

Temper-Then-Tilt: Principled Unlearning for Generative Models through Tempering and Classifier Guidance
by: Block, Jacob L., et al.
Published: (2026)

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

Private Online Learning via Lazy Algorithms
by: Asi, Hilal, et al.
Published: (2024)

In-Context Learning with Transformers: Softmax Attention Adapts to Function Lipschitzness
by: Collins, Liam, et al.
Published: (2024)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2025)