lower bound

A Guide to Learning Arithmetic Circuits COLT 2016 Algorithms and matching lower bounds for approximately-convex optimization NeurIPS 2016 Dimension-Free Iteration Complexity of Finite Sum Optimization Problems NeurIPS 2016 Local Minimax Complexity of Stochastic Convex Optimization NeurIPS 2016 Minimax Estimation of Maximum Mean Discrepancy with Radial Kernels NeurIPS 2016 Noisy Tensor Completion via the Sum-of-Squares Hierarchy COLT 2016 On Bayes Risk Lower Bounds JMLR 2016 On Lower and Upper Bounds in Smooth and Strongly Convex Optimization JMLR 2016 On the Iteration Complexity of Oblivious First-Order Optimization Algorithms ICML 2016 Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables COLT 2016 Refined Lower Bounds for Adversarial Bandits NeurIPS 2016 The Limits of Learning with Missing Data NeurIPS 2016 Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem COLT 2016 Variational Information Maximization for Feature Selection NeurIPS 2016 A Lower Bound for the Optimization of Finite Sums ICML 2015 Communication Complexity of Distributed Convex Learning and Optimization NeurIPS 2015 High Confidence Policy Improvement ICML 2015 Information-theoretic lower bounds for convex optimization with erroneous oracles NeurIPS 2015 Learning Causal Graphs with Small Interventions NeurIPS 2015 On Elicitation Complexity NeurIPS 2015 On the Complexity of Learning with Kernels COLT 2015 On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NeurIPS 2015 Regularization Path of Cross-Validation Error Lower Bounds NeurIPS 2015 Sum-of-Squares Lower Bounds for Sparse PCA NeurIPS 2015 Clamping Variables and Approximate Inference NeurIPS 2014