RUST-BENCH: Benchmarking LLM Reasoning on Unstructured Text within Structured Tables
Nikhil Abhyankar, Purvi Chaurasia, Sanchit Kabra, Ananya Srivastava, Vivek Gupta, Chandan K. Reddy
TL;DR
RUST-BENCH targets the gap in evaluating LLMs on real-world tabular data by combining long semi-structured tables with domain-specific content and multi-hop reasoning. It introduces a hybrid symbolic–semantic QA generation pipeline and validates data quality via human-in-the-loop, producing 7,966 questions over 2,031 tables from science and sports domains. Experiments show current LLMs struggle with scale, heterogeneity, and multi-hop inference, even with advanced prompting and table-reasoning baselines. The work establishes a challenging, extensible benchmark that enables diagnosing and advancing tabular reasoning for real-world applications.
Abstract
Existing tabular reasoning benchmarks mostly test models on small, uniform tables, underrepresenting the complexity of real-world data and giving an incomplete view of Large Language Models' (LLMs) reasoning abilities. Real tables are long, heterogeneous, and domain-specific, mixing structured fields with free text and requiring multi-hop reasoning across thousands of tokens. To address this gap, we introduce RUST-BENCH, a benchmark of 7966 questions from 2031 real-world tables spanning two domains: i) RB-Science (NSF grant records) and ii) RB-Sports (NBA statistics). Unlike prior work, RUST-BENCH evaluates LLMs jointly across scale, heterogeneity, domain specificity, and reasoning complexity. Experiments with open-source and proprietary models show that LLMs struggle with heterogeneous schemas and complex multi-hop inference, revealing persistent weaknesses in current architectures and prompting strategies. RUST-BENCH establishes a challenging new testbed for advancing tabular reasoning research.
