conftrace_

lower bound

173 papers

Explore in graph

Also known as

LB

Co-occurring keywords

sample complexity (1169) convex optimization (1321) learning theory (519) differential privacy (1016) statistical query (50) multi-armed bandit (1098) regret bound (1926) computational complexity (399) query complexity (183) oracle complexity (65)

Papers

Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes NIPS 2022
Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity NIPS 2022
Dimensionality and Coordination in Voting: The Distortion of STV AAAI 2022
Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis NIPS 2022
Constants Matter: The Performance Gains of Active Learning ICML 2022
Sketching Algorithms and Lower Bounds for Ridge Regression ICML 2022
A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022
New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma NIPS 2022
A Unified Framework for Alternating Offline Model Training and Policy Learning NIPS 2022
Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs NIPS 2022
Negative curvature obstructs acceleration for strongly geodesically convex optimization, even with exact first-order oracles COLT 2022
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization AISTATS 2022
Almost Optimal Universal Lower Bound for Learning Causal DAGs with Atomic Interventions AISTATS 2022
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals COLT 2022
The Price of Tolerance in Distribution Testing COLT 2022
Coordinated Attacks against Contextual Bandits: Fundamental Limits and Defense Mechanisms ICML 2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise COLT 2022
Private optimization in the interpolation regime: faster rates and hardness results ICML 2022
Pareto Optimal Model Selection in Linear Bandits AISTATS 2022
Mismatched No More: Joint Model-Policy Optimization for Model-Based RL NIPS 2022
Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression NIPS 2022
Computational-Statistical Gap in Reinforcement Learning COLT 2022
A constrained risk inequality for general losses AISTATS 2021
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NIPS 2021
Approximate optimization of convex functions with outlier noise NIPS 2021