PhD Candidate · Computer Science
Rajarshi Haldar
University of Illinois Urbana-Champaign
I study whether language models can be trusted to judge other language models.
About
Hi, I am a PhD candidate in Computer Science at the University of Illinois Urbana-Champaign, advised by Prof. Julia Hockenmaier (opens in a new tab) in the Hockenmaier Lab (opens in a new tab). My work asks what a language model represents while it grades another model, and whether the score it gives can be trusted.
LLM judges can assign different ratings to identical responses, making a single benchmark score an unstable measurement. I first studied that problem from the outside, then turned to the models' internal activations with sparse autoencoders. I found that it is possible to track human expert annotations with only a few dozen features, as simple probes fitted to those features predict human ratings better than the judge's own output does. Therefore, the LLM judges contain more information about the quality of an item than their outputs can communicate.
I also study how language models represent source code. In my work on code search and code summarization, I ask which features models use when they try to understand the logic of a function. During research internships at IBM Research I worked on event extraction and schema induction, and that work led to three granted US patents.
Before Illinois, I got my B.Tech. in Computer Science and Engineering from the Indian Institute of Technology Kharagpur.
Research Interests
The questions below run from the score a judge gives to the structure a model recovers from text.
-
Can an LLM judge be trusted?
I measure self-inconsistency in LLM-as-a-judge frameworks and ask what unreliable scores mean for benchmarks built on top of them.
-
What does an evaluator represent internally?
I use sparse autoencoders and probing to isolate features that track generation quality, then test whether a rating is faithful to what the model represents in its residual activations.
-
What does a model notice in source code?
I study semantic code search, code summarization, and the features models capture while they match natural language to the logic of a function.
-
How can structure be recovered from text?
I use event schema induction, event extraction, and knowledge graphs to recover structure from unstructured text so it can be searched, compared, and reasoned over.
Publications
Selected work on LLM evaluation, code intelligence, and structured knowledge. The full and continuously updated lists are on Google Scholar (opens in a new tab), DBLP (opens in a new tab), and the ACL Anthology (opens in a new tab).
-
Consistently Good vs. Occasionally Great: A Rubric for Open-Ended Feedback Quality from Humans and Machines
Preprint, arXiv:2608.21850
-
Rating Roulette: Self-Inconsistency in LLM-As-A-Judge Frameworks
Findings of the Association for Computational Linguistics: EMNLP 2025
The same judge scores identical inputs differently from one run to the next, with Krippendorff's alpha as low as 0.27.
-
Analyzing the Performance of Large Language Models on Code Summarization
Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING)
Code summarization scores can follow token overlap in function names more closely than the structure of the code itself.
-
A Multi-Perspective Architecture for Semantic Code Search
58th Annual Meeting of the Association for Computational Linguistics (ACL)
A multi-perspective architecture lifted MRR on semantic code search by 28% over a code-token baseline.
-
Deep Learning Driven Venue Recommender for Event-Based Social Networks
IEEE Transactions on Knowledge and Data Engineering, 32(11)
-
A Validated Scoring Rubric for Explain-in-Plain-English Questions
51st ACM Technical Symposium on Computer Science Education (SIGCSE)
-
Cluster Aware Mobility Encounter Dataset Enlargement
15th International Wireless Communications & Mobile Computing Conference (IWCMC)
-
CL Scholar: The ACL Anthology Knowledge Graph Miner
2018 Conference of the North American Chapter of the ACL: Demonstrations (NAACL-HLT)
Patents
Granted US patents from internships at IBM Research, on event extraction, schema induction, and code search. All are assigned to International Business Machines Corporation.
-
Unsupervised Event Extraction
-
Graph-Based Event Schema Induction for Information Retrieval
-
Multi-Perspective, Multi-Task Neural Network Model for Matching Text to Program Code
Experience and Education
Research across language models, code understanding, and applied NLP.
-
PhD Candidate and Graduate Research Assistant
University of Illinois Urbana-Champaign · Urbana, IL
Advised by Prof. Julia Hockenmaier
- Probes beat the judges' own scores on 7 of 8 criteria when fitted to sparse autoencoder features (in review).
- Showed LLM judges rescore identical inputs inconsistently, with Krippendorff's alpha as low as 0.27 (EMNLP 2025).
- Traced LLM code-summarization scores to token overlap in function names, not code structure (LREC-COLING 2024).
- Introduced a multi-perspective code-search architecture, lifting MRR 28% over a code-token baseline (ACL 2020).
- Built the dataset, training, and evaluation pipelines in PyTorch and Hugging Face Transformers.
-
Digital Intern
Schlumberger · Menlo Park, CA
Software Technology Innovation Center (STIC)
- Built a knowledge-graph embedding model that learns from limited labeled data via labeling functions and Snorkel AI.
- Shipped a query-answering model on those embeddings that replaced the team's system at lower latency and overhead.
-
Graduate Research Intern
IBM Research · Yorktown Heights, NY
- Led an automated tech-support agent that resolved IT queries by extracting events from unstructured incident text.
- Raised retrieval MRR from 0.468 to 0.538 by inducing schemas over 802K technical documents.
-
B.Tech. in Computer Science and Engineering
Indian Institute of Technology Kharagpur · Kharagpur, India
- Undergraduate research on knowledge graphs over the ACL Anthology (NAACL-HLT 2018 demo) and on venue recommendation for event-based social networks (IEEE TKDE).
Teaching
-
Teaching Assistant, CS 447 — Natural Language Processing
University of Illinois Urbana-Champaign · Urbana, IL
- Designed a Google Colab coding assignment on machine translation and wrote its auto-grader on Gradescope.
- Held office hours twice a week and answered student questions on Campuswire.
-
Teaching Assistant, CS 416 — Data Visualization
University of Illinois Urbana-Champaign · Urbana, IL
- Graded a midterm and a final project in which students built dashboards in Tableau and D3.js.
- Held weekly office hours and answered student questions on Campuswire.
Honors and Service
-
Member, Tau Beta Pi (opens in a new tab), the national engineering honor society (Illinois Alpha Chapter (opens in a new tab), University of Illinois Urbana-Champaign)
-
Reviewer, ACL Rolling Review (four cycles: EMNLP 2024, NAACL 2025, ACL 2025, EMNLP 2025)
Get in touch
Happy to chat about LLM evaluation, interpretability, code intelligence, or anything adjacent.