No article text was recorded for this version.
sample complexity gap (polylogarithmic optimality gap)
Version 1 of 128 papers29 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Variance-dependent best arm identification
- Blog: Fast exact recovery of noisy matrix from few entries: the infinity norm approach
- Blog: Sorted Top-k in Rounds
- Blog: The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime
- Blog: One-Step Estimator for Permuted Sparse Recovery
- Blog: The Sample Complexity of Best-k Items Selection from Pairwise Comparisons
- Blog: Fixed Confidence Best Arm Identification in the Bayesian Setting
- Blog: The power of convex relaxation: near-optimal matrix completion
- Blog: Efficient Density Estimation via Piecewise Polynomial Approximation
- Blog: A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
- Blog: The sample complexity of ERMs in stochastic convex optimization
- Blog: Quantum approximation I. Embeddings of finite-dimensional Lp spaces
- Blog: Settling the query complexity of non-adaptive junta testing
- Blog: Near-optimal linear decision trees for k-SUM and related problems
- Blog: On the Role of Total Variation in Compressed Sensing
- Blog: Near-Polynomially Competitive Active Logistic Regression
- Blog: Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
- Blog: Nearly-Tight Bounds for Testing Histogram Distributions
- Blog: PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits
- Blog: Consistent Procedures for Cluster Tree Estimation and Pruning
- Blog: The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
- Blog: On Agnostic PAC Learning in the Small Error Regime
- Blog: Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
- Blog: Near Optimal Non-asymptotic Sample Complexity of 1-Identification
- Blog: Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering
- Blog: Improved Pure Exploration in Linear Bandits with No-Regret Learning
- Blog: Maximum Selection and Ranking under Noisy Comparisons
- Blog: Tight cell probe bounds for succinct Boolean matrix-vector multiplication
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_sample_complexity_gap_polylogarithmic_op_b547f2f2,
title = {sample complexity gap (polylogarithmic optimality gap)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sample-complexity-gap-polylogarithmic-optimality-gap/rdr_b547f2f2ac3842a58d59b967266c87fa},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_sample_complexity_gap_polylogarithmic_op_b547f2f2_v1,
title = {sample complexity gap (polylogarithmic optimality gap)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/sample-complexity-gap-polylogarithmic-optimality-gap/rdr_b547f2f2ac3842a58d59b967266c87fa/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}