Papers with Code 아카이브
Generalization Bounds
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Neural Networks and Polynomial Regression. Demystifying the Overparametrization Phenomena
On the generalization of bayesian deep nets for multi-class classification
De-randomized PAC-Bayes Margin Bounds: Applications to Non-convex and Non-smooth Predictors
Improving Generalization by Controlling Label-Noise Information in Neural Network Weights
Learning Fair Scoring Functions: Bipartite Ranking under ROC-based Fairness Constraints
On generalization in moment-based domain adaptation
Generalization and Representational Limits of Graph Neural Networks
Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimization
PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees
Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Loss
Nested Barycentric Coordinate System as an Explicit Feature Map
Apportioned Margin Approach for Cost Sensitive Large Margin Classifiers
Linear predictor on linearly-generated data with missing values: non consistency and solutions
Generalization Bounds and Representation Learning for Estimation of Potential Outcomes and Causal Effects
Learning Overlapping Representations for the Estimation of Individualized Treatment Effects
Relative Flatness and Generalization
PAC Confidence Sets for Deep Neural Networks via Calibrated Prediction
Risk Bounds for Low Cost Bipartite Ranking
Simplified and Unified Analysis of Various Learning Problems by Reduction to Multiple-Instance Learning
Coarse-Refinement Dilemma: On Generalization Bounds for Data Clustering
Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates
Learning-Based Low-Rank Approximations
On Generalization Bounds of a Family of Recurrent Neural Networks
Diametrical Risk Minimization: Theory and Computations
Global Capacity Measures for Deep ReLU Networks via Path Sampling
Sharper bounds for uniformly stable algorithms
Improved Generalization Bounds of Group Invariant / Equivariant Deep Networks via Quotient Feature Spaces
Generalization Bounds for Neural Networks via Approximate Description Length
Improved Sample Complexities for Deep Networks and Robust Classification via an All-Layer Margin
Algorithm-Dependent Generalization Bounds for Overparameterized Deep Residual Networks
Characterizing Membership Privacy in Stochastic Gradient Langevin Dynamics
A Rademacher Complexity Based Method fo rControlling Power and Confidence Level in Adaptive Statistical Analysis
Generalization Bounds for Convolutional Neural Networks
Partial differential equation regularization for supervised machine learning
Margin-Based Generalization Lower Bounds for Boosted Classifiers
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.