Skip to content
conftrace_

lower bound

248 papers

LB

Papers

A Unified Framework for Alternating Offline Model Training and Policy Learning NeurIPS 2022 Computational-Statistical Gap in Reinforcement Learning COLT 2022 Constants Matter: The Performance Gains of Active Learning ICML 2022 Coordinated Attacks against Contextual Bandits: Fundamental Limits and Defense Mechanisms ICML 2022 Dimensionality and Coordination in Voting: The Distortion of STV AAAI 2022 Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression NeurIPS 2022 Lower Bounds on Randomly Preconditioned Lasso via Robust Sparse Designs NeurIPS 2022 Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variance COLT 2022 Mismatched No More: Joint Model-Policy Optimization for Model-Based RL NeurIPS 2022 Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals COLT 2022 Negative curvature obstructs acceleration for strongly geodesically convex optimization, even with exact first-order oracles COLT 2022 New Lower Bounds for Private Estimation and a Generalized Fingerprinting Lemma NeurIPS 2022 On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization AISTATS 2022 Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise COLT 2022 Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models COLT 2022 Pareto Optimal Model Selection in Linear Bandits AISTATS 2022 Private optimization in the interpolation regime: faster rates and hardness results ICML 2022 Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity NeurIPS 2022 Sketching Algorithms and Lower Bounds for Ridge Regression ICML 2022 Sub-exponential time Sum-of-Squares lower bounds for Principal Components Analysis NeurIPS 2022 The Price of Tolerance in Distribution Testing COLT 2022 The Query Complexity of Local Search and Brouwer in Rounds COLT 2022 The query complexity of sampling from strongly log-concave distributions in one dimension COLT 2022 Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes NeurIPS 2022 Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality ICLR 2022