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

Trenton Bricken

dblp:306/1383 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 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
4 papers
Representation and self-supervised learning · 34% Language models and text generation · 16% Knowledge representation and reasoning · 14%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model safety
0.812024
Many-shot Jailbreaking · NeurIPS 2024
Security and privacy of machine learning
adversarial attack
0.812024
Many-shot Jailbreaking · NeurIPS 2024
Security and privacy of machine learning › adversarial attack
jailbreak attack
0.812024
Many-shot Jailbreaking · NeurIPS 2024
Machine learning › Learning paradigms
continual learning
0.712023
Sparse Distributed Memory is a Continual Learner · ICLR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › cognitive modeling
memory models
0.712023
Sparse Distributed Memory is a Continual Learner · ICLR 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
Emergence of Sparse Representations from Noise · ICML 2023
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.712023
Emergence of Sparse Representations from Noise · ICML 2023
Machine learning › Representation and self-supervised learning › associative memory
sparse distributed memory
0.712023
Sparse Distributed Memory is a Continual Learner · ICLR 2023
Machine learning › Deep learning architectures and training
attention mechanism
0.512021
Attention Approximates Sparse Distributed Memory · NeurIPS 2021
Security and privacy of machine learning
prompt injection
0.212024
Many-shot Jailbreaking · NeurIPS 2024
Machine learning › Representation and self-supervised learning
associative memory
0.112021
Attention Approximates Sparse Distributed Memory · NeurIPS 2021

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

long-context prompting · 1.5in-context learning · 1.5sparse distributed memory · 1.2noisy training · 0.7implicit loss terms · 0.7transformer · 0.5
YearPublicationVenuePosition
2024 Many-shot Jailbreaking
abstract
We investigate a family of simple long-context attacks on large language models: prompting with hundreds of demonstrations of undesirable behavior. This attack is newly feasible with the larger context windows recently deployed by language model providers like Google DeepMind, OpenAI and Anthropic. We find that in diverse, realistic circumstances, the effectiveness of this attack follows a power law, up to hundreds of shots. We demonstrate the success of this attack on the most widely used state-of-the-art closed-weight models, and across various tasks. Our results suggest very long contexts present a rich new attack surface for LLMs.
Cem Anil, Esin Durmus, Nina Panickssery, Mrinank Sharma, Joe Benton, Sandipan Kundu, Joshua Batson, Meg Tong, Jesse Mu, Daniel Ford, Francesco Mosconi, Rajashree Agrawal, Rylan Schaeffer, Naomi Bashkansky, Samuel Svenningsen, Mike Lambert, Ansh Radhakrishnan, Carson Denison, Evan Hubinger, Yuntao Bai, Trenton Bricken, Timothy Maxwell, Nicholas Schiefer, James Sully, Alex Tamkin, Tamera Lanham, Karina Nguyen, Tomek Korbak, Jared Kaplan, Deep Ganguli, Samuel R. Bowman, Ethan Perez, Roger B. Grosse, David Duvenaud
NeurIPS21
2023 Sparse Distributed Memory is a Continual Learner
Trenton Bricken, Xander Davies, Dmitry Krotov, Gabriel Kreiman
ICLR1
2023 Emergence of Sparse Representations from Noise
abstract
A hallmark of biological neural networks, which distinguishes them from their artificial counterparts, is the high degree of sparsity in their activations. This discrepancy raises three questions our work helps to answer: (i) Why are biological networks so sparse? (ii) What are the benefits of this sparsity? (iii) How can these benefits be utilized by deep learning models? Our answers to all of these questions center around training networks to handle random noise. Surprisingly, we discover that noisy training introduces three implicit loss terms that result in sparsely firing neurons specializing to high variance features of the dataset. When trained to reconstruct noisy-CIFAR10, neurons learn biological receptive fields. More broadly, noisy training presents a new approach to potentially increase model interpretability with additional benefits to robustness and computational efficiency.
Trenton Bricken, Rylan Schaeffer, Bruno A. Olshausen, Gabriel Kreiman
ICML1
2021 Attention Approximates Sparse Distributed Memory
abstract
While Attention has come to be an important mechanism in deep learning, there remains limited intuition for why it works so well. Here, we show that Transformer Attention can be closely related under certain data conditions to Kanerva's Sparse Distributed Memory (SDM), a biologically plausible associative memory model. We confirm that these conditions are satisfied in pre-trained GPT2 Transformer models. We discuss the implications of the Attention-SDM map and provide new computational and biological interpretations of Attention.
Trenton Bricken, Cengiz Pehlevan
NeurIPS1