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

Maximilian Li

dblp:388/7830 · DBLP profile ↗
← Back
2ranked-venue papers
1as 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 · 1 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
Trustworthy machine learning · 53% Language models and text generation · 47%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 5 heaviest of 5, 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.912025
Endless Jailbreaks with Bijection Learning · ICLR 2025
Security and privacy of machine learning
adversarial attack
0.912025
Endless Jailbreaks with Bijection Learning · ICLR 2025
Security and privacy of machine learning › adversarial attack
jailbreak attack
0.912025
Endless Jailbreaks with Bijection Learning · ICLR 2025
Machine learning › Trustworthy machine learning
interpretability
0.812024
Optimal ablation for interpretability · NeurIPS 2024
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
circuit discovery
0.212024
Optimal ablation for interpretability · NeurIPS 2024

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

in-context learning · 1.7bijection learning · 1.7optimal ablation · 0.8ablation · 0.8
YearPublicationVenuePosition
2025 Endless Jailbreaks with Bijection Learning
abstract
Despite extensive safety measures, LLMs are vulnerable to adversarial inputs, or jailbreaks, which can elicit unsafe behaviors. In this work, we introduce bijection learning, a powerful attack algorithm which automatically fuzzes LLMs for safety vulnerabilities using randomly-generated encodings whose complexity can be tightly controlled. We leverage in-context learning to teach models bijective encodings, pass encoded queries to the model to bypass built-in safety mechanisms, and finally decode responses back into English. Our attack is extremely effective on a wide range of frontier language models. By controlling complexity parameters such as number of key-value mappings in the encodings, we find a close relationship between the capability level of the attacked LLM and the average complexity of the most effective bijection attacks. Our work highlights that new vulnerabilities in frontier models can emerge with scale: more capable models are more severely jailbroken by bijection attacks.
Brian R. Y. Huang, Maximilian Li, Leonard Tang
ICLR2
2024 Optimal ablation for interpretability
abstract
Interpretability studies often involve tracing the flow of information through machine learning models to identify specific model components that perform relevant computations for tasks of interest. Prior work quantifies the importance of a model component on a particular task by measuring the impact of performing ablation on that component, or simulating model inference with the component disabled. We propose a new method, optimal ablation (OA), and show that OA-based component importance has theoretical and empirical advantages over measuring importance via other ablation methods. We also show that OA-based component importance can benefit several downstream interpretability tasks, including circuit discovery, localization of factual recall, and latent prediction.
Maximilian Li, Lucas Janson
NeurIPS1