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

Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries ICML 2021
On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization ICML 2021
Approximate optimization of convex functions with outlier noise NIPS 2021
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NIPS 2021
On the High Accuracy Limitation of Adaptive Property Estimation AISTATS 2021
A constrained risk inequality for general losses AISTATS 2021
Differentially Private Correlation Clustering ICML 2021
LB-DESPOT: Efficient Online POMDP Planning Considering Lower Bound in Action Selection (Student Abstract) AAAI 2021
An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap NIPS 2021
Towards Tight Communication Lower Bounds for Distributed Optimisation NIPS 2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness NIPS 2021
Improved Mutual Information Estimation AAAI 2021
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL ICML 2021
Differentially Private Assouad, Fano, and Le Cam ALT 2021
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication COLT 2021
From Local Pseudorandom Generators to Hardness of Learning COLT 2021
Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models JMLR 2020
Learning Sums of Independent Random Variables with Sparse Collective Support JMLR 2020
Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems ICML 2020
Lower Bounds for Approximate Knowledge Compilation IJCAI 2020
On the Power of Compressed Sensing with Generative Models ICML 2020
An approximate KLD based experimental design for models with intractable likelihoods AISTATS 2020
Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020
A Tight Lower Bound and Efficient Reduction for Swap Regret NIPS 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020