Papers with Code 아카이브
Generalization Bounds
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Dissecting Non-Vacuous Generalization Bounds based on the Mean-Field Approximation
Efron-Stein PAC-Bayesian Inequalities
On the Downstream Performance of Compressed Word Embeddings
Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design
Globally Convergent Newton Methods for Ill-conditioned Generalized Self-concordant Losses
Learning from weakly dependent data under Dobrushin's condition
Robust Regression for Safe Exploration in Control
Decoupling Gating from Linearity
Stable Rank Normalization for Improved Generalization in Neural Networks and GANs
Maximum Weighted Loss Discrepancy
Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks
Deterministic PAC-Bayesian generalization bounds for deep networks via generalizing noise-resilience
Generalization bounds for deep convolutional neural networks
An adaptive nearest neighbor rule for classification
Generalization Bounds in the Predict-then-Optimize Framework
An Algorithmic Framework for Fairness Elicitation
Dichotomize and Generalize: PAC-Bayesian Binary Activated Deep Neural Networks
The role of invariance in spectral complexity-based generalization bounds
Gradient Descent can Learn Less Over-parameterized Two-layer Neural Networks on Classification Problems
Stability and Generalization of Graph Convolutional Neural Networks
Stability and Optimization Error of Stochastic Gradient Descent for Pairwise Learning
PLUME: Polyhedral Learning Using Mixture of Experts
Bridging Theory and Algorithm for Domain Adaptation
A Generalization Bound for Online Variational Inference
An Exponential Efron-Stein Inequality for Lq Stable Learning Rules
Support and Invertibility in Domain-Invariant Representations
A Distributionally Robust Optimization Method for Adversarial Multiple Kernel Learning
Provable Guarantees for Gradient-Based Meta-Learning
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate
Uniform convergence may be unable to explain generalization in deep learning
Can SGD Learn Recurrent Neural Networks with Provable Generalization?
Generalization Error Bounds of Gradient Descent for Learning Over-parameterized Deep ReLU Networks
Generalization Bounds For Unsupervised and Semi-Supervised Learning With Autoencoders
Adversarial Networks and Autoencoders: The Primal-Dual Relationship and Generalization Bounds
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.