lower bound

A Tight Lower Bound and Efficient Reduction for Swap Regret NeurIPS 2020 Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound IJCAI 2020 Formal Limitations on the Measurement of Mutual Information AISTATS 2020 How Good is SGD with Random Shuffling? COLT 2020 How to Trap a Gradient Flow COLT 2020 HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-Based Inference AAAI 2020 Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning? ICLR 2020 Learning Sums of Independent Random Variables with Sparse Collective Support JMLR 2020 Lower Bounds and Faster Algorithms for Equality Constraints IJCAI 2020 Lower Bounds for Approximate Knowledge Compilation IJCAI 2020 Lower Bounds for Parallel and Randomized Convex Optimization JMLR 2020 Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models JMLR 2020 Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems ICML 2020 Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals NeurIPS 2020 On the Power of Compressed Sensing with Generative Models ICML 2020 Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms NeurIPS 2020 Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations COLT 2020 Statistical-Query Lower Bounds via Functional Gradients NeurIPS 2020 Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent ICML 2020 The estimation error of general first order methods COLT 2020 The Gradient Complexity of Linear Regression COLT 2020 Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020 Clause Learning and New Bounds for Graph Coloring IJCAI 2019 CNN-Cert: An Efficient Framework for Certifying Robustness of Convolutional Neural Networks AAAI 2019 Complexity of Highly Parallel Non-Smooth Convex Optimization NeurIPS 2019