lower bound

Locally Private Gaussian Estimation NeurIPS 2019 Locally Private Learning without Interaction Requires Separation NeurIPS 2019 Lower Bounds for Locally Private Estimation via Communication Complexity COLT 2019 Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019 Lower Bounds for Smooth Nonconvex Finite-Sum Optimization ICML 2019 Margin-Based Generalization Lower Bounds for Boosted Classifiers NeurIPS 2019 On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NeurIPS 2019 Order Optimal One-Shot Distributed Learning NeurIPS 2019 Private Center Points and Learning of Halfspaces COLT 2019 Recurrent models and lower bounds for projective syntactic decoding NAACL 2019 Tight Dimension Independent Lower Bound on the Expected Convergence Rate for Diminishing Step Sizes in SGD NeurIPS 2019 Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel k-means Clustering ICML 2019 Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization NeurIPS 2018 Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon COLT 2018 Optimal Solution of the Generalized Dubins Interval Problem RSS 2018 Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering ICML 2018 Stochastic Anytime Search for Bounding Marginal MAP IJCAI 2018 Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials COLT 2018 Inapproximability of VC Dimension and Littlestone’s Dimension COLT 2017 Online Learning Without Prior Information COLT 2017 On the Complexity of Learning Neural Networks NeurIPS 2017 The Price of Selection in Differential Privacy COLT 2017 The Sample Complexity of Optimizing a Convex Function COLT 2017 The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime COLT 2017 Towards Lower Bounds on Number of Dimensions for Word Embeddings IJCNLP 2017