arXiv:2606. 28916v1 Announce Type: cross Abstract: We introduce GRAB, a constructor-encoder-bridge pipeline for table question answering.
By Simone Varriale, Tamara Cucumides, Floris Geerts, Paolo Papotti
Prior-data fitted networks (PFNs) show that pretraining on large populations of synthetic tasks can enable generalization to unseen datasets with little or no downstream fine-tuning. This paradigm is...
The paper investigates whether prior‑data‑fitted networks (PFNs) can be extended to graph‑based relational models. The authors pretrain a message‑passing foundation model, Griffin, on large synthetic relational databases and evaluate its frozen encoder on 16 real‑world relational classification tasks. A curriculum that starts with schema‑guided synthetic data and then uses schema‑agnostic data yields the best in‑context performance, outperforming real‑data‑only pretraining and other mixtures.
By Mohammad Sadeq Abolhasani, Viswanath Ganapathy
arXiv:2606. 30336v1 Announce Type: new Abstract: We introduce FlexTab, a flexible encoder-decoder architecture for in-context learning on tabular data that pairs a single, task-agnostic encoder with a suite of task-specific decoders.
By Marek Polewczyk, Maximilian Schambach, Marco Spinaci, Sam Thelin, Johannes H\"ohne
We introduce FlexTab, a flexible encoder-decoder architecture for in-context learning on tabular data that pairs a single, task-agnostic encoder with a suite of task-specific decoders. Unlike existing tabular in-context learners, which entangle feature representations with a specific prediction target, our design produces \textit{target-agnostic} row embeddings that can be leveraged across a wide range of downstream tasks within a table-native in-context learning setup.
CONSISTRE is a consistency‑aware framework for document‑level relation extraction that tackles contradictions in large language model predictions. It offers two tracks: an inference‑time track that refines black‑box LLM outputs through constraint‑aware prompting, verification, and self‑reflection, and a training‑time track that distills consistency knowledge into smaller open‑source models via supervised fine‑tuning and reinforcement learning. Experiments on DocRED show both tracks outperform baselines, with the inference‑time track matching competitive F1 scores and the training‑time track narrowing the performance gap to proprietary LLMs while reducing inference cost.
By Mingxuan Sun