Co-occurring keywords · papers mentioning both
Papers
Domain Adaptation: A Small Sample Statistical Approach
AISTATS 2012
Generalization Bounds for Domain Adaptation
NeurIPS 2012
Generalization Bounds for Online Learning Algorithms with Pairwise Loss Functions
COLT 2012
Learning Multiple Tasks using Shared Hypotheses
NeurIPS 2012
Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison
NeurIPS 2012
On Ranking and Generalization Bounds
JMLR 2012
PAC-Bayes Bounds with Data Dependent Priors
JMLR 2012
Regularization Techniques for Learning with Matrices
JMLR 2012
Selective Labeling via Error Bound Minimization
NeurIPS 2012
Spectral Learning of General Weighted Automata via Constrained Matrix Completion
NeurIPS 2012
Structured Sparsity and Generalization
JMLR 2012
Generalization Bound for Infinitely Divisible Empirical Process
AISTATS 2011
Generalization Bounds and Consistency for Latent Structural Probit and Ramp Loss
NeurIPS 2011
Improved Loss Bounds For Multiple Kernel Learning
AISTATS 2011
The Impact of Unlabeled Patterns in Rademacher Complexity Theory for Kernel Classifiers
NeurIPS 2011
The Sample Complexity of Dictionary Learning
COLT 2011
The Sample Complexity of Dictionary Learning
JMLR 2011
Unifying Framework for Fast Learning Rate of Non-Sparse Multiple Kernel Learning
NeurIPS 2011
Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and Stationary β-Mixing Processes
JMLR 2010
Co-regularization Based Semi-supervised Domain Adaptation
NeurIPS 2010
Empirical Bernstein Boosting
AISTATS 2010
Finite-sample Analysis of Bellman Residual Minimization
ACML 2010
Learning Bounds for Importance Weighting
NeurIPS 2010
PAC-Bayesian Analysis of Co-clustering and Beyond
JMLR 2010
Permutation Complexity Bound on Out-Sample Error
NeurIPS 2010