Papers with Code 아카이브
Generalization Bounds
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
A path-norm toolkit for modern networks: consequences, promises and challenges
Sharp Generalization of Transductive Learning: A Transductive Local Rademacher Complexity Approach
Fantastic Generalization Measures are Nowhere to be Found
Learning to Warm-Start Fixed-Point Optimization Algorithms
Generalization Bounds: Perspectives from Information Theory and PAC-Bayes
Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming
Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Data
Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing
Classification with Deep Neural Networks and Logistic Loss
Learning Expressive Priors for Generalization and Uncertainty Estimation in Neural Networks
On the sample complexity of parameter estimation in logistic regression with normal design
Generalization Guarantees via Algorithm-dependent Rademacher Complexity
On Certified Generalization in Structured Prediction
A Unified Model and Dimension for Interactive Estimation
Improved Stability and Generalization Guarantees of the Decentralized SGD Algorithm
On Feature Diversity in Energy-based Models
Understanding Augmentation-based Self-Supervised Representation Learning via RKHS Approximation and Regression
Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
Hypothesis Transfer Learning with Surrogate Classification Losses: Generalization Bounds through Algorithmic Stability
Generalization Bounds for Magnitude-Based Pruning via Sparse Matrix Sketching
How Does Information Bottleneck Help Deep Learning?
Learning Capacity: A Measure of the Effective Dimensionality of a Model
Federated Variational Inference: Towards Improved Personalization and Generalization
Fast Convergence in Learning Two-Layer Neural Networks with Separable Data
Uniform-in-Time Wasserstein Stability Bounds for (Noisy) Stochastic Gradient Descent
A unified framework for information-theoretic generalization bounds
Generalization Bounds for Neural Belief Propagation Decoders
Double-Weighting for Covariate Shift Adaptation
Reinterpreting causal discovery as the task of predicting unobserved joint statistics
Towards Understanding Generalization of Macro-AUC in Multi-label Learning
The Ideal Continual Learner: An Agent That Never Forgets
AdapterGNN: Parameter-Efficient Fine-Tuning Improves Generalization in GNNs
Energy-guided Entropic Neural Optimal Transport
Reweighted Mixup for Subpopulation Shift
Algorithm-Dependent Bounds for Representation Learning of Multi-Source Domain Adaptation
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.