← Search

Mehran Kazemi

14 accepted papers

2025

BIG-Bench Extra Hard

ACL 2025long

Current benchmarks for large language model (LLM) reasoning predominantly focus on mathematical and coding abilities, leaving a gap in evaluating broader reasoning proficiencies. One particular exception is the BIG-Bench dataset, which has served as a crucial benchmark for evaluating the general rea…

2025

Generative Verifiers: Reward Modeling as Next-Token Prediction

ICLR 2025poster

Verifiers or reward models are often used to enhance the reasoning performance of large language models (LLMs). A common approach is the Best-of-N method, where N candidate solutions generated by the LLM are ranked by a verifier, and the best one is selected. While LLM-based verifiers are typically…

Cited by 107SourcePDFScholar
2025

GeoCoder: Solving Geometry Problems by Generating Modular Code through Vision-Language Models

NAACL 2025findings

Geometry problem-solving demands advanced reasoning abilities to process multimodal inputs and employ mathematical knowledge effectively. Vision-language models (VLMs) have made significant progress in various multimodal tasks. Yet, they still struggle with geometry problems and are significantly li…

Cited by 1SourcePDFScholar
2025

RADAR: Benchmarking Language Models on Imperfect Tabular Data

NeurIPS 2025poster

Language models (LMs) are increasingly being deployed to perform autonomous data analyses. However, their data awareness—the ability to recognize, reason over, and appropriately handle data artifacts such as missing values, outliers, and logical inconsistencies—remains underexplored. These artifacts…

Cited by 0SourcecodeScholar
2025

Smaller, Weaker, Yet Better: Training LLM Reasoners via Compute-Optimal Sampling

ICLR 2025poster

Training on high-quality synthetic data from strong language models (LMs) is a common strategy to improve the reasoning performance of LMs. In this work, we revisit whether this strategy is compute-optimal under a fixed inference budget (e.g., FLOPs). To do so, we investigate the trade-offs between…

Cited by 33SourcePDFScholar
2025

Test of Time: A Benchmark for Evaluating LLMs on Temporal Reasoning

ICLR 2025poster

Large language models (LLMs) have showcased remarkable reasoning capabilities, yet they remain susceptible to errors, particularly in temporal reasoning tasks involving complex temporal logic. Existing research has explored LLM performance on temporal reasoning using diverse datasets and benchmarks.…

Cited by 22SourcePDFScholar
2025

Transformers Struggle to Learn to Search

ICLR 2025poster

Search is an ability foundational in many important tasks, and recent studies have shown that large language models (LLMs) struggle to perform search robustly. It is unknown whether this inability is due to a lack of data, insufficient model parameters, or fundamental limitations of the transformer…

2024

ReMI: A Dataset for Reasoning with Multiple Images

NeurIPS 2024poster

With the continuous advancement of large language models (LLMs), it is essential to create new benchmarks to evaluate their expanding capabilities and identify areas for improvement. This work focuses on multi-image reasoning, an emerging capability in state-of-the-art LLMs. We introduce ReMI, a dat…

Cited by 12SourcePDFScholar
2024

TaskLAMA: Probing the Complex Task Understanding of Language Models

AAAI 2024technical

Structured Complex Task Decomposition (SCTD) is the problem of breaking down a complex real-world task (such as planning a wedding) into a directed acyclic graph over individual steps that contribute to achieving the task, with edges specifying temporal dependencies between steps. SCTD is an i…

Cited by 8SourcePDFScholar
2024

Understanding Transformer Reasoning Capabilities via Graph Algorithms

NeurIPS 2024poster

Which transformer scaling regimes are able to perfectly solve different classes of algorithmic problems? While tremendous empirical advances have been attained by transformer-based neural networks, a theoretical understanding of their algorithmic reasoning capabilities in realistic parameter regim…

Cited by 23SourcePDFScholar
2023

BoardgameQA: A Dataset for Natural Language Reasoning with Contradictory Information

NeurIPS 2023poster

Automated reasoning with unstructured natural text is a key requirement for many potential applications of NLP and for developing robust AI systems. Recently, Language Models (LMs) have demonstrated complex reasoning capacities even without any finetuning. However, existing evaluation for automated…

Cited by 39SourcePDFScholar
2023

LAMBADA: Backward Chaining for Automated Reasoning in Natural Language

ACL 2023long

Remarkable progress has been made on automated reasoning with natural text, by using Large Language Models (LLMs) and methods such as Chain-of-Thought prompting and Selection-Inference. These techniques search for proofs in the forward direction from axioms to the conclusion, which suffers from a co…

Cited by 86SourcePDFScholar
2023

Testing the General Deductive Reasoning Capacity of Large Language Models Using OOD Examples

NeurIPS 2023poster

Given the intractably large size of the space of proofs, any model that is capable of general deductive reasoning must generalize to proofs of greater complexity. Recent studies have shown that large language models (LLMs) possess some abstract deductive reasoning ability given chain-of-thought prom…

2023

Using Domain Knowledge to Guide Dialog Structure Induction via Neural Probabilistic Soft Logic

ACL 2023long

Dialog Structure Induction (DSI) is the task of inferring the latent dialog structure (i.e., a set of dialog states and their temporal transitions) of a given goal-oriented dialog. It is a critical component for modern dialog system design and discourse analysis. Existing DSI approaches are often pu…