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

Deepak Pandita

dblp:200/1520 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1Applied, 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 · 62% Multi-agent systems · 26% Trustworthy machine learning · 13%
Software engineering, system software, and programming languages
3 papers
Empirical software engineering · 72% Program synthesis and code generation · 28%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
in-context learning
1.722025
ARTICLE: Annotator Reliability Through In-Context Learning (Student Abstract) · AAAI 2025
ARTICLE: Annotator Reliability Through In-Context Learning · AAAI 2025
Natural language and speech › Language models and text generation
self-consistency
1.722025
ARTICLE: Annotator Reliability Through In-Context Learning (Student Abstract) · AAAI 2025
ARTICLE: Annotator Reliability Through In-Context Learning · AAAI 2025
Empirical software engineering › data annotation
annotation agreement
1.722025
ARTICLE: Annotator Reliability Through In-Context Learning (Student Abstract) · AAAI 2025
ARTICLE: Annotator Reliability Through In-Context Learning · AAAI 2025
Empirical software engineering
data annotation
1.722025
ARTICLE: Annotator Reliability Through In-Context Learning (Student Abstract) · AAAI 2025
ARTICLE: Annotator Reliability Through In-Context Learning · AAAI 2025
Program synthesis and code generation › code generation with language models
in-context learning
1.722025
ARTICLE: Annotator Reliability Through In-Context Learning (Student Abstract) · AAAI 2025
ARTICLE: Annotator Reliability Through In-Context Learning · AAAI 2025
Knowledge, reasoning and agents › Multi-agent systems › agentic AI
agentic workflow
1.012026
ProRefine: Inference-Time Prompt Refinement with Textual Feedback (Student Abstract) · AAAI 2026
Machine learning › Trustworthy machine learning
annotator disagreement
1.012026
Forest vs Tree: The (N, K) Trade-off in Reproducible ML Evaluation · AAAI 2026
Knowledge, reasoning and agents › Multi-agent systems › multi-agent collaboration
LLM-based multi-agent collaboration
1.012026
ProRefine: Inference-Time Prompt Refinement with Textual Feedback (Student Abstract) · AAAI 2026
Natural language and speech › Language models and text generation › prompting › prompt engineering
prompt optimization
1.012026
ProRefine: Inference-Time Prompt Refinement with Textual Feedback (Student Abstract) · AAAI 2026
Empirical software engineering
reproducibility
1.012026
Forest vs Tree: The (N, K) Trade-off in Reproducible ML Evaluation · AAAI 2026
Natural language and speech › Language models and text generation
mathematical reasoning
0.312026
ProRefine: Inference-Time Prompt Refinement with Textual Feedback (Student Abstract) · AAAI 2026

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

self-consistency · 3.5in-context learning · 3.5statistical analysis · 3.0simulation · 3.0textual feedback · 1.0chain-of-thought · 1.0
YearPublicationVenuePosition
2026 Forest vs Tree: The (N, K) Trade-off in Reproducible ML Evaluation
abstract
Reproducibility is a cornerstone of scientific validation and of the authority it confers on its results. Reproducibility in machine learning evaluations leads to greater trust, confidence, and value. However, the ground truth responses used in machine learning often necessarily come from humans, among whom disagreement is prevalent, and surprisingly little research has studied the impact of effectively ignoring disagreement in these responses, as is typically the case. One reason for the lack of research is that budgets for collecting human-annotated evaluation data are limited, and obtaining more samples from multiple raters for each example greatly increases the per-item annotation costs. We investigate the trade-off between the number of items (N) and the number of responses per item (K) needed for reliable machine learning evaluation. We analyze a diverse collection of categorical datasets for which multiple annotations per item exist, and simulated distributions fit to these datasets, to determine the optimal (N, K) configuration, given a fixed budget (N x K), for collecting evaluation data and reliably comparing the performance of machine learning models. Our findings show, first, that accounting for human disagreement may come with N x K at no more than 1000 (and often much lower) for every dataset tested on at least one metric. Moreover, this minimal N x K almost always occurred for K > 10. Furthermore, the nature of the tradeoff between K and N, or if one even existed, depends on the evaluation metric, with metrics that are more sensitive to the full distribution of responses performing better at higher levels of K. Our methods can be used to help ML practitioners get more effective test data by finding the optimal metrics and number of items and annotations per item to collect to get the most reliability for their budget.
Deepak Pandita, Flip Korn, Christopher A. Welty, Christopher Homan
AAAI1
2026 ProRefine: Inference-Time Prompt Refinement with Textual Feedback (Student Abstract)
abstract
Agentic workflows, where multiple AI agents collaborate to accomplish complex tasks like reasoning or planning, play a substantial role in many cutting-edge commercial applications. These workflows depend critically on the prompts used to provide the roles models play in such workflows. Poorly designed prompts that fail even slightly to guide individual agents can lead to sub-optimal performance that may snowball within a system of agents, limiting their reliability and scalability. To address this important problem of inference-time prompt optimization, we introduce ProRefine, an innovative inference-time optimization method that uses an agentic loop of LLMs to generate and apply textual feedback. ProRefine dynamically refines prompts for multi-step reasoning tasks without additional training or ground truth labels. Evaluated on five benchmark mathematical reasoning datasets, ProRefine significantly surpasses zero-shot Chain-of-Thought baselines by 3 to 37 percentage points. This approach not only boosts accuracy but also allows smaller models to approach the performance of their larger counterparts. This highlights its potential for building cost-effective and powerful hybrid AI systems, thereby democratizing access to high-performing AI.
Deepak Pandita, Tharindu Cyril Weerasooriya, Ankit Shah 0001, Isabelle Diana May-Xin Ng, Christopher Homan, Wei Wei 0019
AAAI1
2025 ARTICLE: Annotator Reliability Through In-Context Learning
abstract
Ensuring annotator quality in training and evaluation data is a key piece of machine learning in NLP. Tasks such as sentiment analysis and offensive speech detection are intrinsically subjective, creating a challenging scenario for traditional quality assessment approaches because it is hard to distinguish disagreement due to poor work from that due to differences of opinions between sincere annotators. With the goal of increasing diverse perspectives in annotation while ensuring consistency, we propose ARTICLE, an in-context learning (ICL) framework to estimate annotation quality through self-consistency. We evaluate this framework on two offensive speech datasets using multiple LLMs and compare its performance with traditional methods. Our findings indicate that ARTICLE can be used as a robust method for identifying reliable annotators, hence improving data quality.
Sujan Dutta, Deepak Pandita, Tharindu Cyril Weerasooriya, Marcos Zampieri, Christopher Homan, Ashiqur R. KhudaBukhsh
AAAI2
2025 ARTICLE: Annotator Reliability Through In-Context Learning (Student Abstract)
abstract
Ensuring annotator quality in training and evaluation data is a key piece of machine learning in NLP. Tasks such as sentiment analysis and offensive speech detection are intrinsically subjective, creating a challenging scenario for traditional quality assessment approaches because it is hard to distinguish disagreement due to poor work from that due to differences of opinions between sincere annotators. With the goal of increasing diverse perspectives in annotation while ensuring consistency, we propose ARTICLE, an in-context learning (ICL) framework to estimate annotation quality through self-consistency. We evaluate this framework on two offensive speech datasets using multiple LLMs and compare its performance with traditional methods. Our findings indicate that ARTICLE can be used as a robust method for identifying reliable annotators, hence improving data quality.
Sujan Dutta, Deepak Pandita, Tharindu Cyril Weerasooriya, Marcos Zampieri, Christopher Homan, Ashiqur R. KhudaBukhsh
AAAI2
2018 Does Reciprocal Gratefulness in Twitter Predict Neighborhood Safety?: Comparing 911 Calls Where Users Reside or Use Social Media
Ann Marie White, Linxiao Bai, Christopher Homan, Melanie Funchess, Catherine Cerulli, Amen Ptah, Deepak Pandita, Henry A. Kautz
ICWSM7