conftrace_

round complexity

6 papers

Explore in graph

Co-occurring keywords · papers mentioning both

multi-armed bandit (2) massively parallel computation (1) perturbation resilient instance (1) lewis weight (1) adaptive round (1) top-k identification (1) batched bandit (1) local relative smoothness (1) list-decodable code (1) strong learner (1)

Papers

Boosting with List-Decodable Codes COLT 2026 Computing Lewis weights to high precision using local relative smoothness COLT 2026 Massively Parallel k-Means Clustering for Perturbation Resilient Instances ICML 2022 Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021 Efficient Pure Exploration in Adaptive Round model NeurIPS 2019 Sorted Top-k in Rounds COLT 2019