Co-occurring keywords · papers mentioning both
Papers
Decoupled Variational Gaussian Inference
NeurIPS 2014
Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression
COLT 2014
Low Rank Approximation Lower Bounds in Row-Update Streams
NeurIPS 2014
On the Information Theoretic Limits of Learning Ising Models
NeurIPS 2014
Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers
NeurIPS 2014
The limits of squared Euclidean distance regularization
NeurIPS 2014
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection
COLT 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
NeurIPS 2013
Information-theoretic lower bounds for distributed statistical estimation with communication constraints
NeurIPS 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization
COLT 2013
Open Problem: Lower bounds for Boosting with Hadamard Matrices
COLT 2013
Safe Policy Iteration
ICML 2013
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions
COLT 2012
Computational Bounds on Statistical Query Learning
COLT 2012
Query Complexity of Derivative-Free Optimization
NeurIPS 2012
Lower Bounds for Passive and Active Learning
NeurIPS 2011
Minimax Localization of Structural Information in Large Noisy Matrices
NeurIPS 2011
Randomized Algorithms for Comparison-based Search
NeurIPS 2011
Lower Bounds on Rate of Convergence of Cutting Plane Methods
NeurIPS 2010
Information-theoretic lower bounds on the oracle complexity of convex optimization
NeurIPS 2009
Near-optimal Regret Bounds for Reinforcement Learning
NeurIPS 2008
Learning a Hidden Hypergraph
JMLR 2006
Lower Bounds and Aggregation in Density Estimation
JMLR 2006