Co-occurring keywords · papers mentioning both
Papers
A constrained risk inequality for general losses
AISTATS 2021
An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap
NeurIPS 2021
Approximate optimization of convex functions with outlier noise
NeurIPS 2021
Average-Case Communication Complexity of Statistical Problems
COLT 2021
Differentially Private Assouad, Fano, and Le Cam
ALT 2021
Differentially Private Correlation Clustering
ICML 2021
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
ICML 2021
Exponential Weights Algorithms for Selective Learning
COLT 2021
From Local Pseudorandom Generators to Hardness of Learning
COLT 2021
Improved Mutual Information Estimation
AAAI 2021
Lazy OCO: Online Convex Optimization on a Switching Budget
COLT 2021
LB-DESPOT: Efficient Online POMDP Planning Considering Lower Bound in Action Selection (Student Abstract)
AAAI 2021
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks
NeurIPS 2021
Lower Bounds on Cross-Entropy Loss in the Presence of Test-time Adversaries
ICML 2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness
NeurIPS 2021
New Bounds For Distributed Mean Estimation and Variance Reduction
ICLR 2021
On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization
ICML 2021
On the High Accuracy Limitation of Adaptive Property Estimation
AISTATS 2021
On the Minimal Error of Empirical Risk Minimization
COLT 2021
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
COLT 2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model
COLT 2021
Towards Tight Bounds on the Sample Complexity of Average-reward MDPs
ICML 2021
Towards Tight Communication Lower Bounds for Distributed Optimisation
NeurIPS 2021
Unitary Branching Programs: Learnability and Lower Bounds
ICML 2021
An approximate KLD based experimental design for models with intractable likelihoods
AISTATS 2020