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

Daniel C. McNamee

dblp:304/8886 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0001-9928-4960ORCID · reported

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
4 papers
Representation and self-supervised learning · 33% Deep learning architectures and training · 30% Video understanding and tracking · 16%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
associative memory
1.622025
Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval · J. Mach. Learn. Res. 2025
Sparse and Structured Hopfield Networks · ICML 2024
Machine learning › Representation and self-supervised learning › associative memory
modern hopfield model
1.622025
Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval · J. Mach. Learn. Res. 2025
Sparse and Structured Hopfield Networks · ICML 2024
Machine learning › Generative modeling
energy-based model
0.912025
Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval · J. Mach. Learn. Res. 2025
Machine learning › Deep learning architectures and training › loss function design
fenchel-young losses
0.912025
Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval · J. Mach. Learn. Res. 2025
Computer vision › Video understanding and tracking
long video understanding
0.912025
∞-Video: A Training-Free Approach to Long Video Understanding via Continuous-Time Memory Consolidation · ICML 2025
Computer vision › Vision and language
video-language model
0.912025
∞-Video: A Training-Free Approach to Long Video Understanding via Continuous-Time Memory Consolidation · ICML 2025
Computer vision › Video understanding and tracking
video question answering
0.912025
∞-Video: A Training-Free Approach to Long Video Understanding via Continuous-Time Memory Consolidation · ICML 2025
Machine learning › Deep learning architectures and training
attention mechanism
0.812024
Sparse and Structured Hopfield Networks · ICML 2024
Machine learning › Deep learning architectures and training › recurrent neural network
hopfield network
0.812024
Sparse and Structured Hopfield Networks · ICML 2024
Machine learning › Deep learning architectures and training › recurrent neural network › hopfield network
sparse hopfield networks
0.812024
Sparse and Structured Hopfield Networks · ICML 2024
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
hierarchical planning
0.212016
Efficient state-space modularization for planning: theory, behavioral and neural signatures · NIPS 2016
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.212016
Efficient state-space modularization for planning: theory, behavioral and neural signatures · NIPS 2016
Machine learning › Representation and self-supervised learning › representation learning › compositional representation › compositional representation learning
modular representation
0.212016
Efficient state-space modularization for planning: theory, behavioral and neural signatures · NIPS 2016

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

fenchel-young losses · 1.6SparseMAP · 1.6tsallis entropy · 0.9memory consolidation · 0.9convex analysis · 0.9continuous-time attention · 0.9structured prediction · 0.8information-theoretic description length · 0.2
YearPublicationVenuePosition
2026 Brain-inspired representations of urban space
abstract
Geography and neuroscience share a core interest in understanding human behaviour in spatial environments. Yet, interdisciplinary collaboration is often limited by differences in methodology and epistemological assumptions. To help bridge this divide, we introduce a translational link between cognitive models of spatial processing in neuroscience and representations of geographic space. Building on long-standing theories that the brain predicts possible futures, the predictive map hypothesis suggests that locations in space are encoded according to their association with possible locations in the future. Here, we adapt a formal instantiation of this idea, the successor representation (SR), to urban space resulting in the geographic successor representation (gSR). We show that this cognitive model of geographic representation produces compelling unique features of urban space while remaining closely aligned with brain mechanisms of spatial processing. We outline several promising directions for extending this work, and propose that the gSR and its variants may provide spatial representations capable of supporting deeper integration between geographic and neuroscientific research.
Ed Manley, Daniel C. McNamee
Int. J. Geogr. Inf. Sci.2
2025 ∞-Video: A Training-Free Approach to Long Video Understanding via Continuous-Time Memory Consolidation
abstract
Current video-language models struggle with long-video understanding due to limited context lengths and reliance on sparse frame subsampling, which often leads to information loss. In this paper, we introduce $\infty$-Video, which is able to process arbitrarily long videos through a continuous-time long-term memory (LTM) consolidation mechanism. Our framework augments video Q-formers by making them able to process unbounded video contexts efficiently and without requiring additional training. Through continuous attention, our approach dynamically allocates higher granularity to the most relevant video segments, forming "sticky" memories which evolve over time. Experiments with Video-LLaMA and VideoChat2 demonstrate improved performance in video question-answering tasks, showcasing the potential of continuous-time LTM mechanisms to enable scalable and training-free comprehension of long videos.
Saul José Rodrigues dos Santos, António Farinhas, Daniel C. McNamee, André F. T. Martins
ICML3
2025 Hopfield-Fenchel-Young Networks: A Unified Framework for Associative Memory Retrieval
abstract
Associative memory models, such as Hopfield networks and their modern variants, have garnered renewed interest due to advancements in memory capacity and connections with self-attention in transformers. In this work, we introduce a unified framework-Hopfield-Fenchel-Young networks-which generalizes these models to a broader family of energy functions. Our energies are formulated as the difference between two Fenchel-Young losses: one, parameterized by a generalized entropy, defines the Hopfield scoring mechanism, while the other applies a post-transformation to the Hopfield output. By utilizing Tsallis and norm entropies, we derive end-to-end differentiable update rules that enable sparse transformations, uncovering new connections between loss margins, sparsity, and exact retrieval of single memory patterns. We further extend this framework to structured Hopfield networks using the SparseMAP transformation, allowing the retrieval of pattern associations rather than a single pattern. Our framework unifies and extends traditional and modern Hopfield networks and provides an energy minimization perspective for widely used post-transformations like $\ell_2$-normalization and layer normalization-all through suitable choices of Fenchel-Young losses and by using convex analysis as a building block. Finally, we validate our Hopfield-Fenchel-Young networks on diverse memory recall tasks, including free and sequential recall. Experiments on simulated data, image retrieval, multiple instance learning, and text rationalization demonstrate the effectiveness of our approach.
Saul José Rodrigues dos Santos, Vlad Niculae, Daniel C. McNamee, André F. T. Martins
J. Mach. Learn. Res.3
2024 Sparse and Structured Hopfield Networks
abstract
Modern Hopfield networks have enjoyed recent interest due to their connection to attention in transformers. Our paper provides a unified framework for sparse Hopfield networks by establishing a link with Fenchel-Young losses. The result is a new family of Hopfield-Fenchel-Young energies whose update rules are end-to-end differentiable sparse transformations. We reveal a connection between loss margins, sparsity, and exact memory retrieval. We further extend this framework to structured Hopfield networks via the SparseMAP transformation, which can retrieve pattern associations instead of a single pattern. Experiments on multiple instance learning and text rationalization demonstrate the usefulness of our approach.
Saul José Rodrigues dos Santos, Vlad Niculae, Daniel C. McNamee, André F. T. Martins
ICML3
2016 Efficient state-space modularization for planning: theory, behavioral and neural signatures
abstract
Even in state-spaces of modest size, planning is plagued by the “curse of dimensionality”. This problem is particularly acute in human and animal cognition given the limited capacity of working memory, and the time pressures under which planning often occurs in the natural environment. Hierarchically organized modular representations have long been suggested to underlie the capacity of biological systems to efficiently and flexibly plan in complex environments. However, the principles underlying efficient modularization remain obscure, making it difficult to identify its behavioral and neural signatures. Here, we develop a normative theory of efficient state-space representations which partitions an environment into distinct modules by minimizing the average (information theoretic) description length of planning within the environment, thereby optimally trading off the complexity of planning across and within modules. We show that such optimal representations provide a unifying account for a diverse range of hitherto unrelated phenomena at multiple levels of behavior and neural representation.
Daniel C. McNamee, Daniel M. Wolpert, Máté Lengyel
NIPS1
2013 Evidence for Model-based Computations in the Human Amygdala during Pavlovian Conditioning
abstract
Contemporary computational accounts of instrumental conditioning have emphasized a role for a model-based system in which values are computed with reference to a rich model of the structure of the world, and a model-free system in which values are updated without encoding such structure. Much less studied is the possibility of a similar distinction operating at the level of Pavlovian conditioning. In the present study, we scanned human participants while they participated in a Pavlovian conditioning task with a simple structure while measuring activity in the human amygdala using a high-resolution fMRI protocol. After fitting a model-based algorithm and a variety of model-free algorithms to the fMRI data, we found evidence for the superiority of a model-based algorithm in accounting for activity in the amygdala compared to the model-free counterparts. These findings support an important role for model-based algorithms in describing the processes underpinning Pavlovian conditioning, as well as providing evidence of a role for the human amygdala in model-based inference.
Charlotte Prévost, Daniel C. McNamee, Ryan K. Jessup, Peter Bossaerts, John P. O'Doherty
PLoS Comput. Biol.2