TUTA: Tree-based Transformers for Generally Structured Table Pre-training
Tables are widely used with various structures to organize and present data. Recent attempts on table understanding mainly focus on relational tables, yet overlook to other common table structures. In this paper, we propose TUTA, a unified pre-training architecture for understanding generally structured tables. Noticing that understanding a table requires spatial, hierarchical, and semantic information, we enhance transformers with three novel structure-aware mechanisms. First, we devise a unified tree-based structure, called a bi-dimensional coordinate tree, to describe both the spatial and hierarchical information of generally structured tables. Upon this, we propose tree-based attention and position embedding to better capture the spatial and hierarchical information. Moreover, we devise three progressive pre-training objectives to enable representations at the token, cell, and table levels. We pre-train TUTA on a wide range of unlabeled web and spreadsheet tables and fine-tune it on two critical tasks in the field of table structure understanding: cell type classification and table type classification. Experiments show that TUTA is highly effective, achieving state-of-the-art on five widely-studied datasets.
Code (1)
Similar Papers 제목 키워드 기반
Inferring Substitutable and Complementary Products with Knowledge-Aware Path Reasoning based on Dynamic Policy Network
Inferring the substitutable and complementary products for a given product is an essential and fundamental concern for the recommender system. To achieve this, existing approaches take advantage of the knowledge graphs t…
Decision MakingKnowledge GraphsRecommendation SystemsLattice operations for the stable set in substitutable matching markets via re-equilibration dynamics
We compute the lattice operations for the (pairwise) stable set in two-sided matching markets where only substitutability on agents' choice functions is imposed. To do this, we use Tarski operators defined on the lattice…
Characterizing Intrinsic Compositionality in Transformers with Tree Projections
When trained on language data, do transformers learn some arbitrary computation that utilizes the full capacity of the architecture or do they learn a simpler, tree-like computation, hypothesized to underlie compositiona…
SentenceSubstitutability in Favor Exchange
I introduce a favor exchange model where favors are substitutable and study bilateral enforcement of cooperation. Without substitutability, the value of a relationship does not depend on the rest of the network, and in e…
ST-Raptor: LLM-Powered Semi-Structured Table Question Answering
Semi-structured tables, widely used in real-world applications (e.g., financial reports, medical records, transactional orders), often involve flexible and complex layouts (e.g., hierarchical headers and merged cells). T…
Question Answering