Pith. sign in

REVIEW 3 cited by

TableLoRA: Low-rank Adaptation on Table Structure Understanding for Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.04396 v2 pith:AX5LOLOZ submitted 2025-03-06 cs.CL

TableLoRA: Low-rank Adaptation on Table Structure Understanding for Large Language Models

classification cs.CL
keywords tabletablelorallmsloratabularunderstandingdataexperiments
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Tabular data are crucial in many fields and their understanding by large language models (LLMs) under high parameter efficiency paradigm is important. However, directly applying parameter-efficient fine-tuning (PEFT) techniques to tabular tasks presents significant challenges, particularly in terms of better table serialization and the representation of two-dimensional structured information within a one-dimensional sequence. To address this, we propose TableLoRA, a module designed to improve LLMs' understanding of table structure during PEFT. It incorporates special tokens for serializing tables with special token encoder and uses 2D LoRA to encode low-rank information on cell positions. Experiments on four tabular-related datasets demonstrate that TableLoRA consistently outperforms vanilla LoRA and surpasses various table encoding methods tested in control experiments. These findings reveal that TableLoRA, as a table-specific LoRA, enhances the ability of LLMs to process tabular data effectively, especially in low-parameter settings, demonstrating its potential as a robust solution for handling table-related tasks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering

    cs.CL 2026-04 unverdicted novelty 6.0

    ASTRA builds adaptive semantic trees from tables and uses dual textual-symbolic reasoning to achieve SOTA performance on complex table question answering.

  2. Prompt Orchestration Markup Language

    cs.HC 2025-08 conditional novelty 6.0

    POML is a markup language that structures LLM prompts, embeds multimodal data, and decouples formatting via stylesheets, with case studies showing strong prompt format sensitivity.

  3. ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering

    cs.CL 2026-04 unverdicted novelty 5.0

    ASTRA rebuilds tables as adaptive Logical Semantic Trees and answers complex questions via dual tree-search and symbolic code execution, claiming SOTA on table QA benchmarks.