Demo Data from EDBT 2026 / reviewers in the wild / expert
Denis Charles
dblp:80/3828
· DBLP profile ↗
4ranked-venue papers
0as first author
3since 2021 · last 2024
0009-0003-7921-3673ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Theory of computation · 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
2 papers |
Language models and text generation · 60% Trustworthy machine learning · 20% Transfer learning and domain adaptation · 20% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Learning and educational technologies · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model reasoning |
0.8 | 1 | 2024 | Evoke: Evoking Critical Thinking Abilities in LLMs via Reviewer-Author Prompt Editing · ICLR 2024 |
Natural language and speech › Language models and text generation › prompting
prompt engineering |
0.8 | 1 | 2024 | Evoke: Evoking Critical Thinking Abilities in LLMs via Reviewer-Author Prompt Editing · ICLR 2024 |
Machine learning › Transfer learning and domain adaptation › knowledge transfer
causal transfer |
0.5 | 1 | 2021 | Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction · WSDM 2021 |
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift |
0.5 | 1 | 2021 | Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction · WSDM 2021 |
Computational social science and digital humanities › marketing
advertising |
0.5 | 1 | 2021 | Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust Prediction · WSDM 2021 |
Learning and educational technologies
critical thinking |
0.2 | 1 | 2024 | Evoke: Evoking Critical Thinking Abilities in LLMs via Reviewer-Author Prompt Editing · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
reviewer-author feedback loop · 1.5data selection · 1.5random forest · 1.0counterfactual optimization · 1.0causal inference · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Evoke: Evoking Critical Thinking Abilities in LLMs via Reviewer-Author Prompt EditingabstractLarge language models (LLMs) have made impressive progress in natural language processing. These models rely on proper human instructions (or prompts) to generate suitable responses. However, the potential of LLMs are not fully harnessed by commonly-used prompting methods: many human-in-the-loop algorithms employ ad-hoc procedures for prompt selection; while auto prompt generation approaches are essentially searching all possible prompts randomly and inefficiently. We propose Evoke, an automatic prompt refinement framework. In Evoke, there are two instances of a same LLM: one as a reviewer (LLM-Reviewer), it scores the current prompt; the other as an author (LLM-Author), it edits the prompt by considering the edit history and the reviewer's feedback. Such an author-reviewer feedback loop ensures that the prompt is refined in each iteration. We further aggregate a data selection approach to Evoke, where only the hard samples are exposed to the LLM. The hard samples are more important because the LLM can develop deeper understanding of the tasks out of them, while the model may already know how to solve the easier cases. Experimental results show that Evoke significantly outperforms existing methods. For instance, in the challenging task of logical fallacy detection, Evoke scores above 80, while all other baseline methods struggle to reach 20. Simiao Zuo, Qiang Lou, Jian Jiao 0007, Denis Charles |
ICLR | 8 |
| 2023 | DeepTagger: Knowledge Enhanced Named Entity Recognition for Web-Based Ads QueriesabstractNamed entity recognition (NER) is a crucial task for online advertisement. State-of-the-art solutions leverage pre-trained language models for this task. However, three major challenges remain unresolved: web queries differ from natural language, on which pre-trained models are trained; web queries are short and lack contextual information; and labeled data for NER is scarce. We propose DeepTagger, a knowledge-enhanced NER model for web-based ads queries. The proposed knowledge enhancement framework leverages both model-free and model-based approaches. For model-free enhancement, we collect unlabeled web queries to augment domain knowledge; and we collect web search results to enrich the information of ads queries. We further leverage effective prompting methods to automatically generate labels using large language models such as ChatGPT. Additionally, we adopt a model-based knowledge enhancement method based on adversarial data augmentation. We employ a three-stage training framework to train DeepTagger models. Simiao Zuo, Qiang Lou, Jian Jiao 0007, Denis Charles |
CIKM | 6 |
| 2021 | Causal Transfer Random Forest: Combining Logged Data and Randomized Experiments for Robust PredictionabstractIt is often critical for prediction models to be robust to distributional shifts between training and testing data. From a causal perspective, the challenge is to distinguish the stable causal relationships from the unstable spurious correlations across shifts. We describe a causal transfer random forest (CTRF) that combines existing training data with a small amount of data from a randomized experiment to train a model which is robust to the feature shifts and therefore transfers to a new targeting distribution. Theoretically, we justify the robustness of the approach against feature shifts with the knowledge from causal learning. Empirically, we evaluate the CTRF using both synthetic data experiments and real-world experiments in the Bing Ads platform, including a click prediction task and in the context of an end-to-end counterfactual optimization system. The proposed CTRF produces robust predictions and outperforms most baseline methods compared in the presence of feature shifts. Shuxi Zeng, Murat Ali Bayir, Joseph J. Pfeiffer III, Denis Charles, Emre Kiciman |
WSDM | 4 |
| 2002 | On Higher Arthur-Merlin Classes
Jin-Yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta |
COCOON | 2 |