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

Danny Karmon

dblp:173/5016 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 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
Language models and text generation · 34% Knowledge representation and reasoning · 23% Multi-agent systems · 23%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Human-computer interaction and pervasive computing
1 paper
Health and well-being technologies · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
ReCogLab: a framework testing relational reasoning & cognitive hypotheses on LLMs · ICLR 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
relational reasoning
0.912025
ReCogLab: a framework testing relational reasoning & cognitive hypotheses on LLMs · ICLR 2025
Computational finance and economics
online advertising
0.412020
The Automated Copywriter: Algorithmic Rephrasing of Health-Related Advertisements to Improve their Performance · WWW 2020
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.312018
LaVAN: Localized and Visible Adversarial Noise · ICML 2018
Machine learning › Trustworthy machine learning
robustness
0.312018
LaVAN: Localized and Visible Adversarial Noise · ICML 2018
Natural language and speech › Language models and text generation
LLM agents
0.312025
Evaluating Generalization Capabilities of LLM-Based Agents in Mixed-Motive Scenarios Using Concordia · NeurIPS 2025
Health and well-being technologies › behavior change
behavior change intervention
0.112020
The Automated Copywriter: Algorithmic Rephrasing of Health-Related Advertisements to Improve their Performance · WWW 2020
Computer vision › Image recognition and object detection
image classification
0.112018
LaVAN: Localized and Visible Adversarial Noise · ICML 2018

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

algorithmic rephrasing · 1.3zero-shot evaluation · 0.9natural language multi-agent simulation · 0.9generative benchmark construction · 0.9transferability · 0.3adversarial noise generation · 0.3
YearPublicationVenuePosition
2025 ReCogLab: a framework testing relational reasoning & cognitive hypotheses on LLMs
abstract
A fundamental part of human cognition is the ability to not only recall previous memories, but also reason across them to draw conclusions. In cognitive science and psychology, this is termed relational reasoning and a number of effects and biases have been observed in human cognition. Designing experiments to measure these reasoning effects is effortful and does not transfer easily to analyzing language model reasoning patterns. To make exploring language models on relational reasoning easier, we introduce ReCogLab – a generative framework for constructing reasoning examples. Unlike static datasets, our framework has a number of benefits that help us in our goal of flexible evaluation of LLMs. First, our framework allows us to control the difficulty and context-length of the problem, allowing us to scale with model capability and evaluate LLMs at a variety of scales. Second, the ability to change the configuration of a dataset dynamically allows us to probe models on different aspects and capabilities. Finally, the flexibility of our approach enables the recreation of classic cognitive science experiments and the systematic study of relational reasoning biases in language models. We demonstrate several such experiments and present our findings on a wide variety of open and closed-source language models. We release all data and code at https://github.com/google-deepmind/recoglab.
Henry Prior, Gargi Balasubramaniam, Rivka Moroshko, Amir Zait, Ilia Labzovsky, Danny Karmon, Ishita Dasgupta 0001, Kimberly L. Stachenfeld, Kenneth Marino
ICLR7
2025 Evaluating Generalization Capabilities of LLM-Based Agents in Mixed-Motive Scenarios Using Concordia
abstract
Large Language Model (LLM) agents have demonstrated impressive capabilities for social interaction and are increasingly being deployed in situations where they might engage with both human and artificial agents. These interactions represent a critical frontier for LLM-based agents, yet existing evaluation methods fail to measure how well these capabilities generalize to novel social situations. In this paper, we introduce a method for evaluating the ability of LLM-based agents to cooperate in zero-shot, mixed-motive environments using Concordia, a natural language multi-agent simulation environment. Our method measures general cooperative intelligence by testing an agent's ability to identify and exploit opportunities for mutual gain across diverse partners and contexts. We present empirical results from the NeurIPS 2024 Concordia Contest, where agents were evaluated on their ability to achieve mutual gains across a suite of diverse scenarios ranging from negotiation to collective action problems. Our findings reveal significant gaps between current agent capabilities and the robust generalization required for reliable cooperation, particularly in scenarios demanding persuasion and norm enforcement.
Chandler Smith, Marwa Abdulhai, Manfred Diaz, Marko Tesic, Rakshit S. Trivedi, Alexander Vezhnevets, Lewis Hammond, Jesse Clifton, Minsuk Chang, Edgar A. Duéñez-Guzmán, John P. Agapiou, Jayd Matyas, Danny Karmon, Beining Zhang, Jim Dilkes, Akash Kundu, Emanuel Tewolde, Jebish Purbey, Ram Mohan Rao Kadiyala, Siddhant Gupta, Aliaksei Korshuk, Buyantuev Alexander, Ilya Makarov, Rolando Fernandez, Zhihan Wang, Caroline Wang, Jiaxun Cui, Lingyun Xiao, Yoonchang Sung, Muhammad Arrasy Rahman, Peter Stone 0001, Yipeng Kang, Hyeonggeun Yun, Ananya, Taehun Cha, Elizaveta Tennant, Olivia Macmillan-Scott, Marta Segura, Diana Riazi, Fuyang Cui, Sriram Ganapathi, Toryn Q. Klassen, Nico Schiavone, Mogtaba Alim, Sheila A. McIlraith, Manuel Ríos, Oswaldo Peña, Manuela Chacon-Chamorro, Rubén Manrique, Luis Felipe Giraldo, Nicanor Quijano, Fangwei Zhong, Wenming Tu, Zhaowei Zhang 0001, Zixia Jia, Zilong Zheng, Chichen Lin, Weijian Fan, Chenao Liu, Sneheel Sarangi, Shuqing Shi, Yali Du 0001, Avinaash Anand Kulandaivel, Yang Liu 0266, Ruiyang Wu 0007, Chetan Talele, Sunjia Lu, Gema Parreno, Shamika Dhuri, Bain McHale, Tim Baarslag, Dylan Hadfield-Menell, Natasha Jaques, José Hernández-Orallo, Joel Z. Leibo
NeurIPS13
2021 Algorithmic copywriting: automated generation of health-related advertisements to improve their performance
Brit Youngmann, Elad Yom-Tov, Ran Gilad-Bachrach, Danny Karmon
Inf. Retr. J.4
2020 The Automated Copywriter: Algorithmic Rephrasing of Health-Related Advertisements to Improve their Performance
abstract
Search advertising is one of the most commonly-used methods of advertising. Past work has shown that search advertising can be employed to improve health by eliciting positive behavioral change. However, writing effective advertisements requires expertise and (possible expensive) experimentation, both of which may not be available to public health authorities wishing to elicit such behavioral changes, especially when dealing with a public health crises such as epidemic outbreaks.
Brit Youngmann, Elad Yom-Tov, Ran Gilad-Bachrach, Danny Karmon
WWW4
2018 LaVAN: Localized and Visible Adversarial Noise
abstract
Most works on adversarial examples for deep-learning based image classifiers use noise that, while small, covers the entire image. We explore the case where the noise is allowed to be visible but confined to a small, localized patch of the image, without covering any of the main object(s) in the image. We show that it is possible to generate localized adversarial noises that cover only 2% of the pixels in the image, none of them over the main object, and that are transferable across images and locations, and successfully fool a state-of-the-art Inception v3 model with very high success rates.
Danny Karmon, Daniel Zoran, Yoav Goldberg
ICML1