:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Li, Yi, Tai, Wai Ming
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	https://arxiv.org/abs/2502.18213
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Omnipredicting Single-Index Models with Multi-Index Models
by: Hu, Lunjia, et al.
Published: (2024)

Near-optimal Swap Regret Minimization for Convex Losses
by: Hu, Lunjia, et al.
Published: (2026)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
by: Amanatidis, Georgios, et al.
Published: (2021)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
by: Assadi, Sepehr, et al.
Published: (2023)

A Characterization of List Regression
by: Pabbaraju, Chirag, et al.
Published: (2024)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
by: Gayen, Sutanu, et al.
Published: (2024)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models
by: Darmasubramanian, Kailash Gopal, et al.
Published: (2025)

Near-Optimal Algorithms for Omniprediction
by: Okoroafor, Princewill, et al.
Published: (2025)

Transductive and Learning-Augmented Online Regression
by: Raman, Vinod, et al.
Published: (2025)

Outlier Robust Multivariate Polynomial Regression
by: Arora, Vipul, et al.
Published: (2024)

Coresets for Multiple $\ell_p$ Regression
by: Woodruff, David P., et al.
Published: (2024)

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2025)

Robust Sparse Regression with Non-Isotropic Designs
by: Liu, Chih-Hung, et al.
Published: (2024)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
by: Croquevielle, Luis Alberto, et al.
Published: (2026)

Faster and Space Efficient Indexing for Locality Sensitive Hashing
by: Verma, Bhisham Dev, et al.
Published: (2025)

Active Learning with Simple Questions
by: Kontonis, Vasilis, et al.
Published: (2024)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
by: Chenakkod, Shabarish, et al.
Published: (2024)

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression
by: Chowdhury, Agniva, et al.
Published: (2024)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
by: Tong, Guangmo, et al.
Published: (2024)

Actively Learning Halfspaces without Synthetic Data
by: Black, Hadley, et al.
Published: (2025)

A Competitive Algorithm for Agnostic Active Learning
by: Price, Eric, et al.
Published: (2023)

Approximation Algorithms for D-optimal Design
by: Singh, Mohit, et al.
Published: (2018)

Efficient Algorithms for Verifying Kruskal Rank in Sparse Linear Regression and Related Applications
by: Zhou, Fengqin
Published: (2025)

Robustly Learning Single-Index Models via Alignment Sharpness
by: Zarifis, Nikos, et al.
Published: (2024)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
by: Shakiba, Ali
Published: (2023)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
by: Blum, Avrim, et al.
Published: (2024)

OPTWIN: Drift identification with optimal sub-windows
by: Tosi, Mauro Dalle Lucca, et al.
Published: (2023)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
by: Garg, Sachin, et al.
Published: (2025)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025)

MNL-Bandit with Knapsacks: a near-optimal algorithm
by: Aznag, Abdellah, et al.
Published: (2021)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
by: Karpov, Nikolai, et al.
Published: (2025)

Unrolled denoising networks provably learn optimal Bayesian inference
by: Karan, Aayush, et al.
Published: (2024)

Testing Calibration in Nearly-Linear Time
by: Hu, Lunjia, et al.
Published: (2024)

Agnostic learning in (almost) optimal time via Gaussian surface area
by: Pesenti, Lucas, et al.
Published: (2026)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
by: He, Xi, et al.
Published: (2023)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
by: Lee, Russell, et al.
Published: (2022)

Polynomial-time derivation of optimal k-tree topology from Markov networks
by: Dastjerdi, Fereshteh R., et al.
Published: (2024)

Incremental Approximate Single-Source Shortest Paths with Predictions
by: McCauley, Samuel, et al.
Published: (2025)

Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
by: Li, Yi, et al.
Published: (2024)