conftrace_

information-theoretic lower bound

16 papers

Explore in graph

Co-occurring keywords

communication constraint (23) multi-armed bandit (1098) sample complexity (1169) minimax risk (30) pure exploration (50) lower bound (173) regret bound (1926) distributed learning (563) learning theory (519) combinatorial optimization (1039)

Papers

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability NIPS 2024
Pure Exploration in Bandits with Linear Constraints AISTATS 2024
Optimal Clustering with Bandit Feedback JMLR 2024
Clustering Items From Adaptively Collected Inconsistent Feedback AISTATS 2024
A Tighter Problem-Dependent Regret Bound for Risk-Sensitive Reinforcement Learning AISTATS 2023
Distributed Linear Bandits under Communication Constraints ICML 2023
Nested Elimination: A Simple Algorithm for Best-Item Identification From Choice-Based Feedback ICML 2023
Provably Efficient Offline Reinforcement Learning with Perturbed Data Sources ICML 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
On the inability of Gaussian process regression to optimally learn compositional functions NIPS 2022
Statistical and Computational Phase Transitions in Group Testing COLT 2022
The Complexity of Sparse Tensor PCA NIPS 2021
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019
On Learning Invariant Representations for Domain Adaptation ICML 2019
Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints COLT 2018
Information-theoretic lower bounds for distributed statistical estimation with communication constraints NIPS 2013