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.

Daniel Paleka

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

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

Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Security and privacy · 1 · 1 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
Trustworthy machine learning · 45% Language models and text generation · 41% Learning theory · 14%
Network and information security
4 papers
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
evaluation of language models
0.912025
Consistency Checks for Language Model Forecasters · ICLR 2025
Machine learning › Trustworthy machine learning
interpretability
0.812024
Refusal in Language Models Is Mediated by a Single Direction · NeurIPS 2024
Machine learning › Trustworthy machine learning › AI safety
safety alignment
0.812024
Refusal in Language Models Is Mediated by a Single Direction · NeurIPS 2024
Security and privacy of machine learning › adversarial defense
defense evaluation
0.812024
Dataset and Lessons Learned from the 2024 SaTML LLM Capture-the-Flag Competition · NeurIPS 2024
Security and privacy of machine learning
large language model security
0.812024
Dataset and Lessons Learned from the 2024 SaTML LLM Capture-the-Flag Competition · NeurIPS 2024
Security and privacy of machine learning
model stealing
0.812024
Stealing part of a production language model · ICML 2024
Security and privacy of machine learning
poisoning attack
0.812024
Poisoning Web-Scale Training Datasets is Practical · SP 2024
Security and privacy of machine learning
prompt injection
0.812024
Dataset and Lessons Learned from the 2024 SaTML LLM Capture-the-Flag Competition · NeurIPS 2024
Security and privacy of machine learning › poisoning attack
training data poisoning
0.812024
Poisoning Web-Scale Training Datasets is Practical · SP 2024
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.712023
A law of adversarial risk, interpolation, and label noise · ICLR 2023
Security and privacy of machine learning › adversarial attack
jailbreak attack
0.212024
Refusal in Language Models Is Mediated by a Single Direction · NeurIPS 2024

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

trust assumption exploitation · 1.5rank-one weight edit · 1.5mechanistic analysis · 1.5dataset crawling exploitation · 1.5black-box query attacks · 1.5activation steering · 1.5proper scoring rules · 0.9consistency check · 0.9capture-the-flag competition · 0.8
YearPublicationVenuePosition
2025 Consistency Checks for Language Model Forecasters
abstract
Forecasting is a task that is difficult to evaluate: the ground truth can only be known in the future. Recent work showing LLM forecasters rapidly approaching human-level performance begs the question: how can we benchmark and evaluate these forecasters *instantaneously*? Following the consistency check framework, we measure the performance of forecasters in terms of the consistency of their predictions on different logically-related questions. We propose a new, general consistency metric based on *arbitrage*: for example, if a forecasting AI illogically predicts that both the Democratic and Republican parties have 60\% probability of winning the 2024 US presidential election, an arbitrageur could trade against the forecaster's predictions and make a profit. We build an automated evaluation system that generates a set of base questions, instantiates consistency checks from these questions, elicits the predictions of the forecaster, and measures the consistency of the predictions. We then build a standard, proper-scoring-rule forecasting benchmark, and show that our (instantaneous) consistency metrics correlate strongly with LLM forecasters' ground truth Brier scores (which are only known in the future). We also release a consistency benchmark that resolves in 2028, providing a long-term evaluation tool for forecasting.
Daniel Paleka, Abhimanyu Pallavi Sudhir, Alejandro Alvarez, Vineeth Bhat, Adam Shen, Evan Wang, Florian Tramèr
ICLR1
2024 Stealing part of a production language model
abstract
We introduce the first model-stealing attack that extracts precise, nontrivial information from black-box production language models like OpenAI's ChatGPT or Google's PaLM-2. Specifically, our attack recovers the embedding projection layer (up to symmetries) of a transformer model, given typical API access. For under $20 USD, our attack extracts the entire projection matrix of OpenAI's Ada and Babbage language models. We thereby confirm, for the first time, that these black-box models have a hidden dimension of 1024 and 2048, respectively. We also recover the exact hidden dimension size of the GPT-3.5-turbo model, and estimate it would cost under \\$2,000 in queries to recover the entire projection matrix. We conclude with potential defenses and mitigations, and discuss the implications of possible future work that could extend our attack.
Nicholas Carlini, Daniel Paleka, Krishnamurthy Dvijotham, Thomas Steinke 0002, Jonathan Hayase, A. Feder Cooper, Katherine Lee, Matthew Jagielski, Milad Nasr, Arthur Conmy, Eric Wallace, David Rolnick, Florian Tramèr
ICML2
2024 Refusal in Language Models Is Mediated by a Single Direction
abstract
Conversational large language models are fine-tuned for both instruction-following and safety, resulting in models that obey benign requests but refuse harmful ones. While this refusal behavior is widespread across chat models, its underlying mechanisms remain poorly understood. In this work, we show that refusal is mediated by a one-dimensional subspace, across 13 popular open-source chat models up to 72B parameters in size. Specifically, for each model, we find a single direction such that erasing this direction from the model's residual stream activations prevents it from refusing harmful instructions, while adding this direction elicits refusal on even harmless instructions. Leveraging this insight, we propose a novel white-box jailbreak method that surgically disables a model's ability to refuse, with minimal effect on other capabilities. This interpretable rank-one weight edit results in an effective jailbreak technique that is simpler and more efficient than fine-tuning. Finally, we mechanistically analyze how adversarial suffixes suppress propagation of the refusal-mediating direction. Our findings underscore the brittleness of current safety fine-tuning methods. More broadly, our work showcases how an understanding of model internals can be leveraged to develop practical methods for controlling model behavior.
Andy Arditi, Oscar Obeso, Aaquib Syed, Daniel Paleka, Nina Panickssery, Wes Gurnee, Neel Nanda
NeurIPS4
2024 Dataset and Lessons Learned from the 2024 SaTML LLM Capture-the-Flag Competition
abstract
Large language model systems face significant security risks from maliciously crafted messages that aim to overwrite the system's original instructions or leak private data. To study this problem, we organized a capture-the-flag competition at IEEE SaTML 2024, where the flag is a secret string in the LLM system prompt. The competition was organized in two phases. In the first phase, teams developed defenses to prevent the model from leaking the secret. During the second phase, teams were challenged to extract the secrets hidden for defenses proposed by the other teams. This report summarizes the main insights from the competition. Notably, we found that all defenses were bypassed at least once, highlighting the difficulty of designing a successful defense and the necessity for additional research to protect LLM systems. To foster future research in this direction, we compiled a dataset with over 137k multi-turn attack chats and open-sourced the platform.
Edoardo Debenedetti, Javier Rando, Daniel Paleka, Silaghi Fineas Florin, Dragos Albastroiu, Niv Cohen, Yuval Lemberg, Reshmi Ghosh, Rui Wen 0002, Ahmed Salem 0001, Giovanni Cherubin, Santiago Zanella-Béguelin, Robin Schmid, Victor Klemm, Takahiro Miki, Stefan Kraft, Mario Fritz, Florian Tramèr, Sahar Abdelnabi, Lea Schönherr
NeurIPS3
2024 Poisoning Web-Scale Training Datasets is Practical
abstract
Deep learning models are often trained on distributed, web-scale datasets crawled from the internet. In this paper, we introduce two new dataset poisoning attacks that intentionally introduce malicious examples to a model’s performance. Our attacks are immediately practical and could, today, poison 10 popular datasets. Our first attack, split-view poisoning, exploits the mutable nature of internet content to ensure a dataset annotator’s initial view of the dataset differs from the view downloaded by subsequent clients. By exploiting specific invalid trust assumptions, we show how we could have poisoned 0.01% of the LAION-400M or COYO-700M datasets for just $60 USD. Our second attack, frontrunning poisoning, targets web-scale datasets that periodically snapshot crowd-sourced content—such as Wikipedia—where an attacker only needs a time-limited window to inject malicious examples. In light of both attacks, we notify the maintainers of each affected dataset and recommended several low-overhead defenses.
Nicholas Carlini, Matthew Jagielski, Christopher A. Choquette-Choo, Daniel Paleka, Will Pearce, Hyrum S. Anderson, Andreas Terzis, Kurt Thomas, Florian Tramèr
SP4
2023 A law of adversarial risk, interpolation, and label noise
Daniel Paleka, Amartya Sanyal
ICLR1