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

Teng-Yun Hsiao

dblp:374/8692 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 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
Representation and self-supervised learning · 67% Language models and text generation · 18% Deep learning architectures and training · 16%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
associative memory
1.622025
In-Context Learning as Conditioned Associative Memory Retrieval · ICML 2025
Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models · ICML 2024
Machine learning › Representation and self-supervised learning › associative memory
modern hopfield model
1.622025
In-Context Learning as Conditioned Associative Memory Retrieval · ICML 2025
Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models · ICML 2024
Natural language and speech › Language models and text generation
in-context learning
0.912025
In-Context Learning as Conditioned Associative Memory Retrieval · ICML 2025

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

energy landscape analysis · 0.9bayesian model averaging · 0.9separation loss · 0.8kernelization · 0.8energy minimization · 0.8
YearPublicationVenuePosition
2025 In-Context Learning as Conditioned Associative Memory Retrieval
abstract
We provide an exactly solvable example for interpreting In-Context Learning (ICL) with one-layer attention models as conditional retrieval of dense associative memory models. Our main contribution is to interpret ICL as memory reshaping in the modern Hopfield model from a conditional memory set (in-context examples). Specifically, we show that the in-context sequential examples induce an effective reshaping of the energy landscape of a Hopfield model. We integrate this in-context memory reshaping phenomenon into the existing Bayesian model averaging view of ICL [Zhang et al., AISTATS 2025] via the established equivalence between the modern Hopfield model and transformer attention. Under this unique perspective, we not only characterize how in-context examples shape predictions in the Gaussian linear regression case, but also recover the known $\epsilon$-stability generalization bound of the ICL for the one-layer attention model. We also give explanations for three key behaviors of ICL and validate them through experiments.
Teng-Yun Hsiao, Jerry Yao-Chieh Hu, Han Liu 0001
ICML2
2024 Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models
abstract
We propose a two-stage optimization formulation for the memory retrieval dynamics of modern Hopfield models, termed $\mathtt{U\text{-}Hop}$. Our key contribution is a learnable feature map $\Phi$ which transforms the Hopfield energy function into a kernel space. This transformation ensures convergence between the local minima of energy and the fixed points of retrieval dynamics within the kernel space. Consequently, the kernel norm induced by $\Phi$ serves as a novel similarity measure. It utilizes the stored memory patterns as learning data to enhance memory capacity across all modern Hopfield models. Specifically, we accomplish this by constructing a separation loss $\mathcal{L}_\Phi$ that separates the local minima of kernelized energy by separating stored memory patterns in kernel space. Methodologically, $\mathtt{U\text{-}Hop}$ memory retrieval process consists of: **(Stage I:)** minimizing separation loss for a more uniformed memory (local minimum) distribution, followed by **(Stage II:)** standard Hopfield energy minimization for memory retrieval. This results in significant reduction of possible meta-stable states in the Hopfield energy function, thus preventing memory confusion. Empirically, with real-world datasets, we demonstrate that $\mathtt{U\text{-}Hop}$ outperforms all existing modern Hopfield models and SOTA similarity measures, achieving a substantial margin in both associative memory retrieval and deep learning tasks. Code is available at [GitHub](https://github.com/MAGICS-LAB/UHop); future updates are on [arXiv](https://arxiv.org/abs/2404.03827).
Dennis Wu, Jerry Yao-Chieh Hu, Teng-Yun Hsiao, Han Liu 0001
ICML3