Co-occurring keywords · papers mentioning both
Papers
Rademacher Complexity Bounds for a Penalized Multi-class Semi-supervised Algorithm (Extended Abstract)
IJCAI 2018
SGD Learns Over-parameterized Networks that Provably Generalize on Linearly Separable Data
ICLR 2018
Stability and Generalization of Learning Algorithms that Converge to Global Optima
ICML 2018
Stochastic Composite Mirror Descent: Optimal Bounds with High Probabilities
NeurIPS 2018
Stronger Generalization Bounds for Deep Nets via a Compression Approach
ICML 2018
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds
NeurIPS 2018
The Generalization Error of Dictionary Learning with Moreau Envelopes
ICML 2018
The Limits of Post-Selection Generalization
NeurIPS 2018
To Understand Deep Learning We Need to Understand Kernel Learning
ICML 2018
Understanding Generalization and Optimization Performance of Deep CNNs
ICML 2018
A PAC-Bayesian Analysis of Randomized Learning with Application to Stochastic Gradient Descent
NeurIPS 2017
Breaking the Curse of Dimensionality with Convex Neural Networks
JMLR 2017
Efficient Kernel Selection via Spectral Analysis
IJCAI 2017
Estimating individual treatment effect: generalization bounds and algorithms
ICML 2017
Exploring Generalization in Deep Learning
NeurIPS 2017
Generalization Properties of Learning with Random Features
NeurIPS 2017
Learning Low-Dimensional Metrics
NeurIPS 2017
Multi-Positive and Unlabeled Learning
IJCAI 2017
Multi-task Learning with Labeled and Unlabeled Tasks
ICML 2017
Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions
NeurIPS 2017
Nearly optimal classification for semimetrics
JMLR 2017
Spectrally-normalized margin bounds for neural networks
NeurIPS 2017
A Consistent Regularization Approach for Structured Prediction
NeurIPS 2016
Error Analysis of Generalized Nyström Kernel Regression
NeurIPS 2016
Learnability of Non-I.I.D.
ACML 2016