← Search

Tushar Khot

21 accepted papers

2025

DiscoveryBench: Towards Data-Driven Discovery with Large Language Models

ICLR 2025poster

Can the rapid advances in code generation, function calling, and data analysis using large language models (LLMs) help automate the search and verification of hypotheses purely from a set of provided datasets? To evaluate this question, we present DiscoveryBench, the first comprehensive benchmark th…

2025

Latent Factor Models Meets Instructions: Goal-conditioned Latent Factor Discovery without Task Supervision

NAACL 2025long

Instruction-following LLMs have recently allowed systems to discover hidden concepts from a collection of unstructured documents based on a natural language description of the purpose of the discovery (i.e., goal). Still, the quality of the discovered concepts remains mixed, as it depends heavily on…

2024

ADaPT: As-Needed Decomposition and Planning with Language Models

NAACL 2024findings

Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment. Recent works employ LLMs-as-agents in broadly two ways: iteratively determining the next action (iterative executors) or generating plans and executing s…

Cited by 92SourcePDFScholar
2024

AppWorld: A Controllable World of Apps and People for Benchmarking Interactive Coding Agents

ACL 2024long

Autonomous agents that address day-to-day digital tasks (e.g., ordering groceries for a household), must not only operate multiple apps (e.g., notes, messaging, shopping app) via APIs, but also generate rich code with complex control flow in an iterative manner based on their interaction with the en…

2024

Bias Runs Deep: Implicit Reasoning Biases in Persona-Assigned LLMs

ICLR 2024poster

Recent works have showcased the ability of large-scale language models (LLMs) to embody diverse personas in their responses, exemplified by prompts like ‘_You are Yoda. Explain the Theory of Relativity._’ While this ability allows personalization of LLMs and enables human behavior simulation, its ef…

2024

DiscoveryWorld: A Virtual Environment for Developing and Evaluating Automated Scientific Discovery Agents

NeurIPS 2024spotlight

Automated scientific discovery promises to accelerate progress across scientific domains, but evaluating an agent's capacity for end-to-end scientific reasoning is challenging as running real-world experiments is often prohibitively expensive or infeasible. In this work we introduce DiscoveryWorld,…

2024

OLMo: Accelerating the Science of Language Models

ACL 2024long

Language models (LMs) have become ubiquitous in both NLP research and in commercial product offerings. As their commercial importance has surged, the most powerful models have become closed off, gated behind proprietary interfaces, with important details of their training data, architectures, and de…

2024

SUPER: Evaluating Agents on Setting Up and Executing Tasks from Research Repositories

EMNLP 2024main

Given that Large Language Models (LLMs) have made significant progress in writing code, can they now be used to autonomously reproduce results from research repositories? Such a capability would be a boon to the research community, helping researchers validate, understand, and extend prior work. To…

2023

Complexity-Based Prompting for Multi-step Reasoning

ICLR 2023poster

We study the task of prompting large-scale language models to perform multi-step reasoning. Existing work shows that when prompted with a chain of thoughts (CoT), sequences of short sentences describing intermediate reasoning steps towards a final answer, large language models can generate new reaso…

Cited by 416SourcePDFScholar
2023

Decomposed Prompting: A Modular Approach for Solving Complex Tasks

ICLR 2023poster

Few-shot prompting is a surprisingly powerful way to use Large Language Models (LLMs) to solve various tasks. However, this approach struggles as the task complexity increases or when the individual reasoning steps of the task themselves are hard to learn, especially when embedded in more complex ta…

2023

How Far Can Camels Go? Exploring the State of Instruction Tuning on Open Resources

NeurIPS 2023spotlight

In this work we explore recent advances in instruction-tuning language models on a range of open instruction-following datasets. Despite recent claims that open models can be on par with state-of-the-art proprietary models, these claims are often accompanied by limited evaluation, making it difficul…

2023

Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions

ACL 2023long

Prompting-based large language models (LLMs) are surprisingly powerful at generating natural language reasoning steps or Chains-of-Thoughts (CoT) for multi-step question answering (QA). They struggle, however, when the necessary knowledge is either unavailable to the LLM or not up-to-date within its…

2023

Specializing Smaller Language Models towards Multi-Step Reasoning

ICML 2023oral

The surprising ability of Large Language Models (LLMs) to perform well on complex reasoning with only few-shot chain-of-thought prompts is believed to emerge only in very large-scale models. We show that such abilities can, in fact, be distilled down from GPT-3.5 (≥ 175B) to T5 variants (≤ 11B). We…

2023

The Tail Wagging the Dog: Dataset Construction Biases of Social Bias Benchmarks

ACL 2023short

How reliably can we trust the scores obtained from social bias benchmarks as faithful indicators of problematic social biases in a given model? In this work, we study this question by contrasting social biases with non-social biases that stem from choices made during dataset construction (which migh…

2022

Hey AI, Can You Solve Complex Tasks by Talking to Agents?

ACL 2022findings

Training giant models from scratch for each complex task is resource- and data-inefficient. To help develop models that can leverage existing systems, we propose a new challenge: Learning to solve complex tasks by communicating with existing agents (or models) in natural language. We design a synthe…

2022

Prompt Waywardness: The Curious Case of Discretized Interpretation of Continuous Prompts

NAACL 2022long

Fine-tuning continuous prompts for target tasks has recently emerged as a compact alternative to full model fine-tuning. Motivated by these promising results, we investigate the feasibility of extracting a discrete (textual) interpretation of continuous prompts that is faithful to the problem they s…

2022

Teaching Broad Reasoning Skills for Multi-Step QA by Generating Hard Contexts

EMNLP 2022main

Question-answering datasets require a broad set of reasoning skills. We show how to use question decompositions to teach language models these broad reasoning skills in a robust fashion. Specifically, we use widely available QDMR representations to programmatically create hard-to-cheat synthetic con…

2021

GooAQ: Open Question Answering with Diverse Answer Types

EMNLP 2021finding

While day-to-day questions come with a variety of answer types, the current question-answering (QA) literature has failed to adequately address the answer diversity of questions. To this end, we present GooAQ, a large-scale dataset with a variety of answer types. This dataset contains over 5 million…

2021

ReadOnce Transformers: Reusable Representations of Text for Transformers

ACL 2021long

We present ReadOnce Transformers, an approach to convert a transformer-based model into one that can build an information-capturing, task-independent, and compressed representation of text. The resulting representation is reusable across different examples and tasks, thereby requiring a document sha…

Cited by 4SourcePDFScholar
2021

Temporal Reasoning on Implicit Events from Distant Supervision

NAACL 2021long

We propose TRACIE, a novel temporal reasoning dataset that evaluates the degree to which systems understand implicit events—events that are not mentioned explicitly in natural language text but can be inferred from it. This introduces a new challenge in temporal reasoning research, where prior work…

Cited by 83SourcePDFScholar
2021

Text Modular Networks: Learning to Decompose Tasks in the Language of Existing Models

NAACL 2021long

We propose a general framework called Text Modular Networks(TMNs) for building interpretable systems that learn to solve complex tasks by decomposing them into simpler ones solvable by existing models. To ensure solvability of simpler tasks, TMNs learn the textual input-output behavior (i.e., langua…