Demo Data from VLDB 2026 / reviewers in the wild / expert
Jack D. Kendall
dblp:228/0498
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-1806-5844ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 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 |
Generative modeling · 77% Image recognition and object detection · 23% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Emerging computing paradigms · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › energy-based model
energy-based learning |
0.7 | 1 | 2023 | Energy-based learning algorithms for analog computing: a comparative study · NeurIPS 2023 |
Emerging computing paradigms
analog computing |
0.7 | 1 | 2023 | Energy-based learning algorithms for analog computing: a comparative study · NeurIPS 2023 |
Computer vision › Image recognition and object detection
image classification |
0.2 | 1 | 2023 | Energy-based learning algorithms for analog computing: a comparative study · NeurIPS 2023 |
Methods — techniques the papers use, named apart from their topics
equilibrium propagation · 1.3coupled learning · 1.3contrastive learning · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Energy-based learning algorithms for analog computing: a comparative studyabstractEnergy-based learning algorithms have recently gained a surge of interest due to their compatibility with analog (post-digital) hardware. Existing algorithms include contrastive learning (CL), equilibrium propagation (EP) and coupled learning (CpL), all consisting in contrasting two states, and differing in the type of perturbation used to obtain the second state from the first one. However, these algorithms have never been explicitly compared on equal footing with same models and datasets, making it difficult to assess their scalability and decide which one to select in practice. In this work, we carry out a comparison of seven learning algorithms, namely CL and different variants of EP and CpL depending on the signs of the perturbations. Specifically, using these learning algorithms, we train deep convolutional Hopfield networks (DCHNs) on five vision tasks (MNIST, F-MNIST, SVHN, CIFAR-10 and CIFAR-100). We find that, while all algorithms yield comparable performance on MNIST, important differences in performance arise as the difficulty of the task increases. Our key findings reveal that negative perturbations are better than positive ones, and highlight the centered variant of EP (which uses two perturbations of opposite sign) as the best-performing algorithm. We also endorse these findings with theoretical arguments. Additionally, we establish new SOTA results with DCHNs on all five datasets, both in performance and speed. In particular, our DCHN simulations are 13.5 times faster with respect to Laborieux et al. (2021), which we achieve thanks to the use of a novel energy minimisation algorithm based on asynchronous updates, combined with reduced precision (16 bits). Benjamin Scellier, Maxence Ernoult, Jack D. Kendall, Suhas Kumar |
NeurIPS | 3 |
| 2018 | Memristive nanowires exhibit small-world connectivity
Ross D. Pantone, Jack D. Kendall, Juan C. Nino |
Neural Networks | 2 |
| 2018 | Evaluation of the computational capabilities of a memristive random network (MN3) under the context of reservoir computing
Laura E. Suárez, Jack D. Kendall, Juan C. Nino |
Neural Networks | 2 |