Co-occurring keywords · papers mentioning both
Papers
Data-Dependent Stability of Stochastic Gradient Descent
ICML 2018
Finite Sample Analysis of LSTD with Random Projections and Eligibility Traces
IJCAI 2018
Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints
COLT 2018
Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data
NeurIPS 2018
Learning To Learn Around A Common Mean
NeurIPS 2018
On Similarity Prediction and Pairwise Clustering
ALT 2018
Orthogonality-Promoting Distance Metric Learning: Convex Relaxation and Theoretical Analysis
ICML 2018
Parallelizing Stochastic Gradient Descent for Least Squares Regression: Mini-batching, Averaging, and Model Misspecification
JMLR 2018
Sensitivity and Generalization in Neural Networks: an Empirical Study
ICLR 2018
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds
NeurIPS 2018
The committee machine: Computational to statistical gaps in learning a two-layers neural network
NeurIPS 2018
Training Neural Networks Using Features Replay
NeurIPS 2018
Understanding Weight Normalized Deep Neural Networks with Rectified Linear Units
NeurIPS 2018
When do random forests fail?
NeurIPS 2018
Algorithmic Stability and Hypothesis Complexity
ICML 2017
A Sample Complexity Measure with Applications to Learning Optimal Auctions
NeurIPS 2017
A Second-order Look at Stability and Generalization
COLT 2017
Breaking the Curse of Dimensionality with Convex Neural Networks
JMLR 2017
Convexified Convolutional Neural Networks
ICML 2017
Distributed Semi-supervised Learning with Kernel Ridge Regression
JMLR 2017
Generalization Error of Invariant Classifiers
AISTATS 2017
Improving the Generalization Performance of Multi-class SVM via Angular Regularization
IJCAI 2017
Information-theoretic analysis of generalization capability of learning algorithms
NeurIPS 2017
Learning Latent Space Models with Angular Constraints
ICML 2017
Learning Low-Dimensional Metrics
NeurIPS 2017