Papers with Code 아카이브
Generalization Bounds
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Stability and Generalization of Learning Algorithms that Converge to Global Optima
A PAC-Bayesian Analysis of Randomized Learning with Application to Stochastic Gradient Descent
Model-Powered Conditional Independence Test
Boosting the kernelized shapelets: Theory and algorithms for local features
A Nonlinear Kernel Support Matrix Machine for Matrix Learning
Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints
PAC-Bayes and Domain Adaptation
Data-dependent Generalization Bounds for Multi-class Classification
An a Priori Exponential Tail Bound for k-Folds Cross-Validation
Optimal Auctions through Deep Learning: Advances in Differentiable Economics
Group Invariance, Stability to Deformations, and Complexity of Deep Convolutional Representations
Nuclear Discrepancy for Active Learning
Learning from partial correction
Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions
Minimax Statistical Learning with Wasserstein Distances
The Landscape of Deep Learning Algorithms
Mass Volume Curves and Anomaly Ranking
Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data
On the benefits of output sparsity for multi-label classification
A Theory of Output-Side Unsupervised Domain Adaptation
Data-Dependent Stability of Stochastic Gradient Descent
Generalization Bounds for Weighted Automata
Kernel Ridge Regression via Partitioning
Distribution-dependent concentration inequalities for tighter generalization bounds
Estimating individual treatment effect: generalization bounds and algorithms
Multi-task and Lifelong Learning of Kernels
The Structured Weighted Violations Perceptron Algorithm
Loss factorization, weakly supervised learning and label noise robustness
Dimensionality-Dependent Generalization Bounds for $k$-Dimensional Coding Schemes
Foundations of Coupled Nonlinear Dimensionality Reduction
A study of the classification of low-dimensional data with supervised manifold learning
Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithms
On the accuracy of self-normalized log-linear models
Random Maxout Features
Deep Learning and the Information Bottleneck Principle
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.