Demo Data from VLDB 2026 / reviewers in the wild / expert
J. Patrick Connor
dblp:346/0947
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
langevin dynamics |
0.6 | 1 | 2022 | Natural gradient enables fast sampling in spiking neural networks · NeurIPS 2022 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
metropolis-hastings |
0.6 | 1 | 2022 | Natural gradient enables fast sampling in spiking neural networks · NeurIPS 2022 |
Machine learning › Probabilistic and Bayesian machine learning › sampling
sampling-based inference |
0.6 | 1 | 2022 | Natural gradient enables fast sampling in spiking neural networks · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
spiking neural network · 0.6population geometry · 0.6natural gradient · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Natural gradient enables fast sampling in spiking neural networksabstractFor animals to navigate an uncertain world, their brains need to estimate uncertainty at the timescales of sensations and actions. Sampling-based algorithms afford a theoretically-grounded framework for probabilistic inference in neural circuits, but it remains unknown how one can implement fast sampling algorithms in biologically-plausible spiking networks. Here, we propose to leverage the population geometry, controlled by the neural code and the neural dynamics, to implement fast samplers in spiking neural networks. We first show that two classes of spiking samplers---efficient balanced spiking networks that simulate Langevin sampling, and networks with probabilistic spike rules that implement Metropolis-Hastings sampling---can be unified within a common framework. We then show that careful choice of population geometry, corresponding to the natural space of parameters, enables rapid inference of parameters drawn from strongly-correlated high-dimensional distributions in both networks. Our results suggest design principles for algorithms for sampling-based probabilistic inference in spiking neural networks, yielding potential inspiration for neuromorphic computing and testable predictions for neurobiology. Paul Masset, Jacob A. Zavatone-Veth, J. Patrick Connor, Venkatesh Murthy, Cengiz Pehlevan |
NeurIPS | 3 |