Image de couverture de livre

The SMART approach to instance-optimal online learning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Banerjee, Siddhartha, Bhatt, Alankrita, Yu, Christina Lee
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning multivariate Gaussians with imperfect advice
par: Bhattacharyya, Arnab, et autres
Publié: (2024)

Entropy Coding of Unordered Data Structures
par: Kunze, Julius, et autres
Publié: (2024)

Learning DNF through Generalized Fourier Representations
par: Heidari, Mohsen, et autres
Publié: (2025)

Testing with Non-identically Distributed Samples
par: Garg, Shivam, et autres
Publié: (2023)

Subsampling Suffices for Adaptive Data Analysis
par: Blanc, Guy
Publié: (2023)

Learning Partitions with Optimal Query and Round Complexities
par: Black, Hadley, et autres
Publié: (2025)

A Framework for Searching in Graphs in the Presence of Errors
par: Dereniowski, Dariusz, et autres
Publié: (2018)

Smoothed Score Queries and the Complexity of Sampling
par: Liu, Jingbo
Publié: (2026)

Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs
par: Black, Hadley, et autres
Publié: (2025)

Sample-Optimal Private Regression in Polynomial Time
par: Anderson, Prashanti, et autres
Publié: (2025)

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm
par: Chen, Jiale, et autres
Publié: (2025)

An optimal tradeoff between entanglement and copy complexity for state tomography
par: Chen, Sitan, et autres
Publié: (2024)

BalLOT: Balanced $k$-means clustering with optimal transport
par: Luo, Wenyan, et autres
Publié: (2025)

Water-Filling is Universally Minimax Optimal
par: Banerjee, Siddhartha, et autres
Publié: (2026)

The Information Theory of Similarity
par: Phadke, Nikit
Publié: (2025)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
par: Basiri, Salar, et autres
Publié: (2022)

Distribution Learnability and Robustness
par: Ben-David, Shai, et autres
Publié: (2024)

A Distribution Testing Approach to Clustering Distributions
par: Kumar, Gunjan, et autres
Publié: (2025)

Random Subgraph Detection Using Queries
par: Huleihel, Wasim, et autres
Publié: (2021)

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
par: Matsumoto, Namiko, et autres
Publié: (2025)

Planted Bipartite Graph Detection
par: Rotenberg, Asaf, et autres
Publié: (2023)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
par: Diakonikolas, Ilias, et autres
Publié: (2025)

On the Statistical Complexity of Sample Amplification
par: Axelrod, Brian, et autres
Publié: (2022)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
par: Li, Gen, et autres
Publié: (2023)

SpecTr: Fast Speculative Decoding via Optimal Transport
par: Sun, Ziteng, et autres
Publié: (2023)

Worst-case optimal adaptive alphabetic prefix-free coding
par: Gagie, Travis
Publié: (2021)

Simple algorithms to test and learn local Hamiltonians
par: Gutiérrez, Francisco Escudero
Publié: (2024)

On Unbiased Low-Rank Approximation with Minimum Distortion
par: Barnes, Leighton Pate, et autres
Publié: (2025)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
par: Saha, Barna, et autres
Publié: (2024)

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

Improved classical shadows from local symmetries in the Schur basis
par: Grier, Daniel, et autres
Publié: (2024)

Block Verification Accelerates Speculative Decoding
par: Sun, Ziteng, et autres
Publié: (2024)

Online Distribution Learning with Local Private Constraints
par: Sima, Jin, et autres
Publié: (2024)

Private Mean Estimation with Person-Level Differential Privacy
par: Agarwal, Sushant, et autres
Publié: (2024)

Optimal high-precision shadow estimation
par: Chen, Sitan, et autres
Publié: (2024)

Agnostic Private Density Estimation for GMMs via List Global Stability
par: Afzali, Mohammad, et autres
Publié: (2024)

On the sample complexity of purity and inner product estimation
par: Gong, Weiyuan, et autres
Publié: (2024)

Best Agent Identification for General Game Playing
par: Stephenson, Matthew, et autres
Publié: (2025)

Mean estimation in the add-remove model of differential privacy
par: Kulesza, Alex, et autres
Publié: (2023)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
par: Afzali, Mohammad, et autres
Publié: (2023)