Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

D. Staudt

dblp:334/6485 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-5139-815XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 75% Generative modeling · 25%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
biologically plausible learning
0.712023
Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neurons · ICML 2023
Machine learning › Deep learning architectures and training › neural network training › local learning
contrastive hebbian learning
0.712023
Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neurons · ICML 2023
Machine learning › Generative modeling › energy-based model
energy-based learning
0.712023
Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neurons · ICML 2023
Machine learning › Deep learning architectures and training › biologically plausible learning
equilibrium propagation
0.712023
Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neurons · ICML 2023

Methods — techniques the papers use, named apart from their topics

dual propagation · 0.7compartmental neuron model · 0.7
YearPublicationVenuePosition
2023 Dual Propagation: Accelerating Contrastive Hebbian Learning with Dyadic Neurons
abstract
Activity difference based learning algorithms—such as contrastive Hebbian learning and equilibrium propagation—have been proposed as biologically plausible alternatives to error back-propagation. However, on traditional digital chips these algorithms suffer from having to solve a costly inference problem twice, making these approaches more than two orders of magnitude slower than back-propagation. In the analog realm equilibrium propagation may be promising for fast and energy efficient learning, but states still need to be inferred and stored twice. Inspired by lifted neural networks and compartmental neuron models we propose a simple energy based compartmental neuron model, termed dual propagation, in which each neuron is a dyad with two intrinsic states. At inference time these intrinsic states encode the error/activity duality through their difference and their mean respectively. The advantage of this method is that only a single inference phase is needed and that inference can be solved in layerwise closed-form. Experimentally we show on common computer vision datasets, including Imagenet32x32, that dual propagation performs equivalently to back-propagation both in terms of accuracy and runtime.
Rasmus Kjær Høier, D. Staudt, Christopher Zach
ICML2
2022 Effortless Training of Joint Energy-Based Models with Sliced Score Matching
abstract
Standard discriminative classifiers can be upgraded to joint energy-based models (JEMs) by combining the classification loss with a log-evidence loss. Hence, such models intrinsically allow detection of out-of-distribution (OOD) samples, and empirically also provide better calibrated posteriors, i.e. prediction uncertainties. However, the training procedure suggested for JEMs (using stochastic gradient Langevin dynamics—or SGLD— to maximize the evidence) is reported to be brittle. In this work we propose to utilize score matching—in particular sliced score matching—to obtain a stable training method for JEMs. We observe empirically that the combination of score matching with the standard classification loss leads to improved OOD detection and better calibrated classifiers for otherwise identical DNN architectures. Additionally, we also analyze the impact of replacing the regular soft-max layer for classification with a gated soft-max one in order to improve the intrinsic transformation invariance and generalization ability.1
Xixi Liu 0001, D. Staudt, Che-Tsung Lin, Christopher Zach
ICPR2