SOTAVerified

Generalization Bounds

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 451–500 of 686 papers

TitleStatusHype
Margin-Based Generalization Lower Bounds for Boosted Classifiers—0
Mass Volume Curves and Anomaly Ranking—0
Maximum Margin Multiclass Nearest Neighbors—0
Maximum Margin Multi-Label Structured Prediction—0
Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergence—0
Mean-field methods and algorithmic perspectives for high-dimensional machine learning—0
Memory Classifiers: Two-stage Classification for Robustness in Machine Learning—0
Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data—0
Minimax Statistical Learning with Wasserstein Distances—0
Minnorm training: an algorithm for training over-parameterized deep neural networks—0
Misclassification excess risk bounds for PAC-Bayesian classification via convexified loss—0
Multiaccurate Proxies for Downstream Fairness—0
Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithms—0
Multi-distance Support Matrix Machines—0
A Distributionally Robust Optimization Method for Adversarial Multiple Kernel Learning—0
Multi-task and Lifelong Learning of Kernels—0
Multi-Task Classification Hypothesis Space with Improved Generalization Bounds—0
Multi-View Majority Vote Learning Algorithms: Direct Minimization of PAC-Bayesian Bounds—0
Natural Analysts in Adaptive Data Analysis—0
Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions—0
Near-Tight Margin-Based Generalization Bounds for Support Vector Machines—0
Nested Barycentric Coordinate System as an Explicit Feature Map—0
Neural Abstract Reasoner—0
Neural Drift Estimation for Ergodic Diffusions: Non-parametric Analysis and Numerical Exploration—0
Neural Networks and Polynomial Regression. Demystifying the Overparametrization Phenomena—0
Neural Optimization Kernel: Towards Robust Deep Learning—0
NeurIPS 2020 Competition: Predicting Generalization in Deep Learning—0
Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization—0
Non-parametric Binary regression in metric spaces with KL loss—0
Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels—0
Nonparametric Hawkes Processes: Online Estimation and Generalization Bounds—0
Non-vacuous Generalization Bounds for Deep Neural Networks without any modification to the trained models—0
Norm-based Generalization Bounds for Compositionally Sparse Neural Networks—0
Nuclear Discrepancy for Active Learning—0
ON BREIMAN’S DILEMMA IN NEURAL NETWORKS: SUCCESS AND FAILURE OF NORMALIZED MARGINS—0
On Certified Generalization in Structured Prediction—0
On Combining Machine Learning with Decision Making—0
On Feature Diversity in Energy-based Models—0
On Generalization and Regularization via Wasserstein Distributionally Robust Optimization—0
On Generalization Bounds for Deep Compound Gaussian Neural Networks—0
On Generalization Bounds for Neural Networks with Low Rank Layers—0
On Generalization Bounds for Projective Clustering—0
On Generalization Bounds of a Family of Recurrent Neural Networks—0
On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning—0
On how to avoid exacerbating spurious correlations when models are overparameterized—0
On Leave-One-Out Conditional Mutual Information For Generalization—0
Online Optimization for Learning to Communicate over Time-Correlated Channels—0
Online-to-PAC Conversions: Generalization Bounds via Regret Analysis—0
Online-to-PAC generalization bounds under graph-mixing dependencies—0
On Localized Discrepancy for Domain Adaptation—0
Show:102550
← PrevPage 10 of 14Next →

No leaderboard results yet.