SOTAVerified

Generalization Bounds

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 426–450 of 686 papers

TitleStatusHype
Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks—0
Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channels—0
Information-Theoretic Generalization Bounds for Stochastic Gradient Descent—0
Robustness to Augmentations as a Generalization metricCode0
Heating up decision boundaries: isocapacitory saturation, adversarial scenarios and generalization bounds—0
Stability analysis of SGD through the normalized loss function—0
Lipschitz-Bounded Equilibrium Networks—0
Learning Better Structured Representations Using Low-rank Adaptive Label Smoothing—0
f-Domain-Adversarial Learning: Theory and Algorithms for Unsupervised Domain Adaptation with Neural Networks—0
Beyond GNNs: A Sample Efficient Architecture for Graph Problems—0
Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions—0
Estimating Lipschitz constants of monotone deep equilibrium models—0
Effective Distributed Learning with Random Features: Improved Bounds and Algorithms—0
Robustness, Privacy, and Generalization of Adversarial TrainingCode0
A Tight Lower Bound for Uniformly Stable Algorithms—0
A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks—0
NeurIPS 2020 Competition: Predicting Generalization in Deep Learning—0
Generalization bounds for deep learning—0
A PAC-Bayesian Perspective on Structured Prediction with Implicit Loss EmbeddingsCode0
Adapting Neural Architectures Between DomainsCode0
Sharper Generalization Bounds for Pairwise Learning—0
Conditioning and Processing: Techniques to Improve Information-Theoretic Generalization Bounds—0
Instance-based Generalization in Reinforcement Learning—0
Importance Weight Estimation and Generalization in Domain Adaptation under Label ShiftCode0
Neural Abstract Reasoner—0
Show:102550
← PrevPage 18 of 28Next →

No leaderboard results yet.