Self-Certifying Classification by Linearized Deep Assignment
Not on the map. Why?
Abstract (arXiv)
We propose a novel class of deep stochastic predictors for classifying metric data on graphs within the PAC-Bayes risk certification paradigm. Classifiers are realized as linearly parametrized deep assignment flows with random initial conditions. Building on the recent PAC-Bayes literature and data-dependent priors, this approach enables (i) to use risk bounds as training objectives for learning posterior distributions on the hypothesis space and (ii) to compute tight out-of-sample risk certificates of randomized classifiers more efficiently than related work. Comparison with empirical test set errors illustrates the performance and practicality of this self-certifying classification method.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 35 references that are in the map. First posted on arXiv 26 Jan 2022.
Builds on
12 of 35 references.
References · 12
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2016Wide Residual Networkscited by 3,057
- 2019A Primer on PAC-Bayesian Learningcited by 130
- 2020Tighter risk certificates for neural networkscited by 112
- 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
- 2016A Strongly Quasiconvex PAC-Bayesian Boundcited by 54
- 2016Image Labeling by Assignmentcited by 10
- 2020Assignment Flows for Data Labeling on Graphs: Convergence and Stabilitycited by 7
- 2019Continuous-Domain Assignment Flowscited by 4
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.