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.

Umais Zahid

dblp:342/2688 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
Probabilistic and Bayesian machine learning · 50% Generative modeling · 25% Representation and self-supervised learning · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
amortized inference
0.812024
Sample as you Infer: Predictive Coding with Langevin Dynamics · ICML 2024
Machine learning › Representation and self-supervised learning › computational neuroscience › neural coding
predictive coding
0.812024
Sample as you Infer: Predictive Coding with Langevin Dynamics · ICML 2024
Machine learning › Generative modeling
variational autoencoder
0.812024
Sample as you Infer: Predictive Coding with Langevin Dynamics · ICML 2024
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.812024
Sample as you Infer: Predictive Coding with Langevin Dynamics · ICML 2024

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

stochastic gradient descent · 0.8preconditioning · 0.8langevin dynamics · 0.8
YearPublicationVenuePosition
2024 Sample as you Infer: Predictive Coding with Langevin Dynamics
abstract
We present Langevin Predictive Coding (LPC), a novel algorithm for deep generative model learning that builds upon the predictive coding framework of computational neuroscience. By injecting Gaussian noise into the predictive coding inference procedure and incorporating an encoder network initialization, we reframe the approach as an amortized Langevin sampling method for optimizing a tight variational lower bound. To increase robustness to sampling step size, we present a lightweight preconditioning technique inspired by Riemannian Langevin methods and adaptive SGD. We compare LPC against VAEs by training generative models on benchmark datasets; our experiments demonstrate superior sample quality and faster convergence for LPC in a fraction of SGD training iterations, while matching or exceeding VAE performance across key metrics like FID, diversity and coverage.
Umais Zahid, Qinghai Guo, Zafeirios Fountas
ICML1
2023 Predictive Coding as a Neuromorphic Alternative to Backpropagation: A Critical Evaluation
abstract
Backpropagation has rapidly become the workhorse credit assignment algorithm for modern deep learning methods. Recently, modified forms of predictive coding (PC), an algorithm with origins in computational neuroscience, have been shown to result in approximately or exactly equal parameter updates to those under backpropagation. Due to this connection, it has been suggested that PC can act as an alternative to backpropagation with desirable properties that may facilitate implementation in neuromorphic systems. Here, we explore these claims using the different contemporary PC variants proposed in the literature. We obtain time complexity bounds for these PC variants, which we show are lower bounded by backpropagation. We also present key properties of these variants that have implications for neurobiological plausibility and their interpretations, particularly from the perspective of standard PC as a variational Bayes algorithm for latent probabilistic models. Our findings shed new light on the connection between the two learning frameworks and suggest that in its current forms, PC may have more limited potential as a direct replacement of backpropagation than previously envisioned.
Umais Zahid, Qinghai Guo, Zafeirios Fountas
Neural Comput.1