Co-occurring keywords · papers mentioning both
Papers
Sharper Generalization Bounds for Clustering
ICML 2021
Suboptimal coverings for continuous spaces of control tasks
L4DC 2021
Is Long Horizon RL More Difficult Than Short Horizon RL?
NeurIPS 2020
Maximum-and-Concatenation Networks
ICML 2020
PAC-Bayes Learning Bounds for Sample-Dependent Priors
NeurIPS 2020
Sparse Kernel Regression with Coefficient-based ℓ_q-regularization
JMLR 2019
Theoretical Analysis of Adversarial Learning: A Minimax Approach
NeurIPS 2019
Minimax Statistical Learning with Wasserstein distances
NeurIPS 2018
Multi-Armed Bandits with Metric Movement Costs
NeurIPS 2017
Covering Number for Efficient Heuristic-based POMDP Planning
ICML 2014
Distributed Learning, Communication Complexity and Privacy
COLT 2012
L1 Covering Numbers for Uniformly Bounded Convex Functions
COLT 2012
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
NeurIPS 2010
What makes some POMDP problems easy to approximate?
NeurIPS 2007
Stability of K-Means Clustering
NeurIPS 2006
Covering Number Bounds of Certain Regularized Linear Function Classes
JMLR 2002
Data-dependent margin-based generalization bounds for classification
JMLR 2002
On the Size of Convex Hulls of Small Sets
JMLR 2001
Regularized Principal Manifolds
JMLR 2001