Thomas F. Burns

dblp:311/5096 · 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
2 papers
Graph learning · 36% Deep learning architectures and training · 32% Representation and self-supervised learning · 32%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph representation
0.812024
Semantically-correlated memories in a dense associative model · ICML 2024
Emerging computing paradigms › neuromorphic computing
associative memory
0.812024
Semantically-correlated memories in a dense associative model · ICML 2024
Emerging computing paradigms
neuromorphic computing
0.812024
Semantically-correlated memories in a dense associative model · ICML 2024
Machine learning › Representation and self-supervised learning
associative memory
0.712023
Simplicial Hopfield networks · ICLR 2023
Machine learning › Deep learning architectures and training › recurrent neural network
hopfield network
0.712023
Simplicial Hopfield networks · ICLR 2023

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

dense associative memory · 1.5anti-hebbian learning · 1.5
YearPublicationVenuePosition
2024 Semantically-correlated memories in a dense associative model
abstract
I introduce a novel associative memory model named *Correlated Dense Associative Memory* (CDAM), which integrates both auto- and hetero-association in a unified framework for continuous-valued memory patterns. Employing an arbitrary graph structure to semantically link memory patterns, CDAM is theoretically and numerically analysed, revealing four distinct dynamical modes: auto-association, narrow hetero-association, wide hetero-association, and neutral quiescence. Drawing inspiration from inhibitory modulation studies, I employ anti-Hebbian learning rules to control the range of hetero-association, extract multi-scale representations of community structures in graphs, and stabilise the recall of temporal sequences. Experimental demonstrations showcase CDAM's efficacy in handling real-world data, replicating a classical neuroscience experiment, performing image retrieval, and simulating arbitrary finite automata.
Thomas F. Burns
ICML1
2023 Simplicial Hopfield networks
Thomas F. Burns, Tomoki Fukai
ICLR1