Papers with Code 아카이브
Generalization Bounds
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Uncertainty Calibration for Counterfactual Propensity Estimation in Recommendation
Lower Generalization Bounds for GD and SGD in Smooth Stochastic Convex Optimization
Fair Off-Policy Learning from Observational Data
Practicality of generalization guarantees for unsupervised domain adaptation with neural networks
Light Unbalanced Optimal Transport
Data-dependent Generalization Bounds via Variable-Size Compressibility
Provable Pathways: Learning Multiple Tasks over Multiple Paths
Transformed Low-Rank Parameterization Can Help Robust Generalization for Tensor Neural Networks
Generalization Error Bounds for Noisy, Iterative Algorithms via Maximal Leakage
Generalization Bounds for Set-to-Set Matching with Negative Sampling
Generalization Analysis for Contrastive Representation Learning
Generalization Bounds for Adversarial Contrastive Learning
Stability-based Generalization Analysis for Mixtures of Pointwise and Pairwise Learning
PAC-Bayesian Generalization Bounds for Adversarial Generative Models
PerAda: Parameter-Efficient Federated Learning Personalization with Generalization Guarantees
Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion
Information Theoretic Lower Bounds for Information Theoretic Upper Bounds
A unified recipe for deriving (time-uniform) PAC-Bayes bounds
Generalization Bounds with Data-dependent Fractal Dimensions
Tighter Information-Theoretic Generalization Bounds from Supersamples
Learning Against Distributional Uncertainty: On the Trade-off Between Robustness and Specificity
Norm-based Generalization Bounds for Compositionally Sparse Neural Networks
Out-of-distributional risk bounds for neural operators with applications to the Helmholtz equation
Algorithmic Stability of Heavy-Tailed SGD with General Loss Functions
Separate And Diffuse: Using a Pretrained Diffusion Model for Improving Source Separation
Transformers as Algorithms: Generalization and Stability in In-context Learning
Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization
Generalization Bounds for Few-Shot Transfer Learning with Pretrained Classifiers
PAC-Bayesian Treatment Allocation Under Budget Constraints
Generalization Bounds for Inductive Matrix Completion in Low-noise Settings
Non-IID Transfer Learning on Graphs
On Generalization and Regularization via Wasserstein Distributionally Robust Optimization
Hedging Complexity in Generalization via a Parametric Distributionally Robust Optimization Framework
PAC-Bayes Compression Bounds So Tight That They Can Explain Generalization
Two Facets of SDE Under an Information-Theoretic Lens: Generalization of SGD via Training Trajectories and via Terminal States
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.