Uploaded October 2025 | Updated September 2026, 3 days ago
Large language model (LLM)-based frameworks have achieved remarkable results on complex retrieval and reasoning tasks. However, many of these systems lack thoughtful design choices that balance both efficiency and accuracy. They often operate in an iterative, online, and isolated manner—overlooking relationships between data sources, opportunities for offline processing, and potential for reusability—which results in suboptimal performance. In this talk, I will present my recent work aimed at addressing these limitations across both retrieval and reasoning tasks. Besides enhancing efficiency, our methods also deliver significant improvements in accuracy.
We start by examining inefficiencies in current retrieval frameworks.
1. In part one, we highlight how agent-based querying methods such as ReAct, which iteratively search for relevant information, can be inefficient and miss crucial insights due to their inability to capture relationships across data sources. To overcome this, we propose alignment-oriented retrieval (peterbaile.github.io/arm/), a method that equips LLMs with a structured module to evaluate and exploit data joinability.
2. In part two, we show that current LLM-based online reranking techniques, while effective, often come with significant computational cost and latency for complex retrieval tasks. To tackle this, we introduce EnrichIndex (peterbaile.github.io/enrichindex/), a strategy that enriches the semantic representations of data items in an offline phase.
Finally, we look at reasoning inefficiencies.
3. In part three, we show that current LLMs typically treat each task in isolation, ignoring past interactions, which leads to repeated and re-executed reasoning. To address this, we introduce log-augmented generation (peterbaile.github.io/lag/), a framework that directly reuses prior computation and reasoning from past logs at inference time.
Peter Chen (peterbaile.github.io/) is a PhD student at MIT CSAIL who is fortunate to work with Michael Cafarella, Michael Stonebraker, Samuel Madden, Dan Roth, and Jacob Andreas. His research aims to blend the strengths of data systems and LLM paradigms. His work has appeared at ACL, EMNLP, VLDB, and OSDI, including an Outstanding Paper award at the ACL KnowledgeLM workshop. He is co-organizing the Table Representation Learning (TRL) workshop at NeurIPS 2025. He is also a Schwarzman College of Computing Future Research Cohort fellow, supported by the Croucher Scholarship and Google PhD fellowship in collaboration with MIT.
Large language model (LLM)-based frameworks have achieved remarkable results on complex retrieval and reasoning tasks. However, many of these systems lack thoughtful design choices that balance both efficiency and accuracy. They often operate in an iterative, online, and isolated manner—overlooking relationships between data sources, opportunities for offline processing, and potential for reusability—which results in suboptimal performance. In this talk, I will present my recent work aimed at addressing these limitations across both retrieval and reasoning tasks. Besides enhancing efficiency, our methods also deliver significant improvements in accuracy.
We start by examining inefficiencies in current retrieval frameworks.
1. In part one, we highlight how agent-based querying methods such as ReAct, which iteratively search for relevant information, can be inefficient and miss crucial insights due to their inability to capture relationships across data sources. To overcome this, we propose alignment-oriented retrieval (peterbaile.github.io/arm/), a method that equips LLMs with a structured module to evaluate and exploit data joinability.
2. In part two, we show that current LLM-based online reranking techniques, while effective, often come with significant computational cost and latency for complex retrieval tasks. To tackle this, we introduce EnrichIndex (peterbaile.github.io/enrichindex/), a strategy that enriches the semantic representations of data items in an offline phase.
Finally, we look at reasoning inefficiencies.
3. In part three, we show that current LLMs typically treat each task in isolation, ignoring past interactions, which leads to repeated and re-executed reasoning. To address this, we introduce log-augmented generation (peterbaile.github.io/lag/), a framework that directly reuses prior computation and reasoning from past logs at inference time.
Peter Chen (peterbaile.github.io/) is a PhD student at MIT CSAIL who is fortunate to work with Michael Cafarella, Michael Stonebraker, Samuel Madden, Dan Roth, and Jacob Andreas. His research aims to blend the strengths of data systems and LLM paradigms. His work has appeared at ACL, EMNLP, VLDB, and OSDI, including an Outstanding Paper award at the ACL KnowledgeLM workshop. He is co-organizing the Table Representation Learning (TRL) workshop at NeurIPS 2025. He is also a Schwarzman College of Computing Future Research Cohort fellow, supported by the Croucher Scholarship and Google PhD fellowship in collaboration with MIT.



![Language AI for RNA Virus and RNA Vaccine
Abstract:
Linguistics and biology are two sides of the same coin. This talk features several highly unexpected connections between them which yield efficient algorithms with substantial biological impacts. One such connection (Nature, 2023) is between messenger RNA (mRNA) vaccines and formal language theory. Although widely used in COVID, these vaccines still suffer from instability. But how to design more stable and efficient mRNAs? Here we show a surprising reduction of the mRNA design problem to the classical (1961) concept of “lattice parsing” in speech recognition, which enables efficient search in the exponentially large design space. Experiments on COVID and another virus show that our designs dramatically improves mRNA half-life, protein expression, and in vivo antibody response, compared to the standard method used by Pfizer and Moderna. Another connection (PNAS, 2021) is between COVID variants and multilingual parsing. Here we show that aligning and folding various coronavirus genomes (in order to find conserved structures for drug design) can be viewed as “synchronous parsing” for multiple languages. This enables efficient global prediction of COVID genome structure that matches experimental work.
[1] Nature paper: https://www.nature.com/articles/s41586-023-06127-z
[2] Nature news: https://www.nature.com/articles/d41586-023-01487-y (‘Remarkable’ AI tool designs mRNA vaccines that are more potent and stable)
[3] PNAS paper: https://www.pnas.org/doi/10.1073/pnas.2116269118
Bio:
Liang Huang (PhD, Penn, 2008) is a Professor of Computer Science at Oregon State University, and co-founder of Coderna.ai. Until recently, he was also a Distinguished Scientist at Baidu Research USA. He also worked at Google Research, USC, and City Univ. of New York. He was known for algorithms and theory in computational linguistics, where he received several best paper awards (ACL 2008 Best Paper Award, EMNLP 2016 Best Paper Honorable Mentions, NAACL 2022 Best Demo Paper Award) and delivered keynotes at ACL 2019 and CVPR 2021. But in recent years, he has shifted his attention to applying these natural language algorithms to computational biology, esp. RNA folding and RNA design, with the hope of fighting COVID. This line of linguistics-inspired biology work eventually led to PNAS (2021) and Nature (2023) papers, and is widely covered in the media. Language AI for RNA Virus and RNA Vaccine](https://i.ytimg.com/vi/B-fiTnUkq2A/mqdefault.jpg)





![From F to A on the N.Y. Regents Science Exams: An Overview of the Aristo Project | AI2
AI has achieved remarkable mastery over games such as Chess, Go, and Poker, and even Jeopardy!, but the rich variety of standardized exams has remained a landmark challenge. Even as recently as 2016, the best AI system could achieve merely 59.3% on an 8th Grade science exam.
This talk reports success on the Grade 8 New York Regents Science Exam, where for the first time a system scores more than 90% on the exams non-diagram, multiple choice (NDMC) questions. In addition, our Aristo system, building upon the success of recent language models, exceeded 83% on the corresponding Grade 12 Science Exam NDMC questions. The results, on unseen test questions, are robust across different test years and different variations of this kind of test. They demonstrate that modern Natural Language Processing (NLP) methods can result in mastery on this task. While not a full solution to general question-answering (the questions are limited to 8th Grade multiple-choice science) it represents a significant milestone for the field. [ Paper at AI Magazine 41 (4), Winter 2020, https://arxiv.org/pdf/1909.01958.pdf ] From F to A on the N.Y. Regents Science Exams: An Overview of the Aristo Project | AI2](https://i.ytimg.com/vi/CR3aICkhCJM/mqdefault.jpg)
