SOTAVerified

Generalization Bounds

Papers

Showing 401425 of 686 papers

TitleStatusHype
Generalization bounds for graph convolutional neural networks via Rademacher complexityCode0
A PAC-Bayes Analysis of Adversarial RobustnessCode0
Approximation and Learning with Deep Convolutional Models: a Kernel PerspectiveCode0
On the Sample Complexity of Stability Constrained Imitation Learning0
SWAD: Domain Generalization by Seeking Flat MinimaCode1
A General Framework for the Practical Disintegration of PAC-Bayesian BoundsCode0
Lexicographically Fair Learning: Algorithms and Generalization0
Generalization Bounds for Meta-Learning via PAC-Bayes and Uniform StabilityCode0
Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks0
Dimension Free Generalization Bounds for Non Linear Metric Learning0
Generalization Bounds for Noisy Iterative Algorithms Using Properties of Additive Noise Channels0
Information-Theoretic Generalization Bounds for Stochastic Gradient Descent0
Robustness to Augmentations as a Generalization metricCode0
Heating up decision boundaries: isocapacitory saturation, adversarial scenarios and generalization bounds0
Sharper Generalization Bounds for Learning with Gradient-dominated Objective Functions0
Effective Distributed Learning with Random Features: Improved Bounds and Algorithms0
Beyond GNNs: A Sample Efficient Architecture for Graph Problems0
f-Domain-Adversarial Learning: Theory and Algorithms for Unsupervised Domain Adaptation with Neural Networks0
Lipschitz-Bounded Equilibrium Networks0
Learning Better Structured Representations Using Low-rank Adaptive Label Smoothing0
Estimating Lipschitz constants of monotone deep equilibrium models0
Stability analysis of SGD through the normalized loss function0
Robustness, Privacy, and Generalization of Adversarial TrainingCode0
A Tight Lower Bound for Uniformly Stable Algorithms0
Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-TuningCode1
Show:102550
← PrevPage 17 of 28Next →

No leaderboard results yet.