paper-with-me

홈 › Papers

TuneTables: Context Optimization for Scalable Prior-Data Fitted Networks

2024-02-17 · Benjamin Feuer, Robin Tibor Schirrmeister, Valeriia Cherepanova, Chinmay Hegde, Frank Hutter, Micah Goldblum, Niv Cohen, Colin White

While tabular classification has traditionally relied on from-scratch training, a recent breakthrough called prior-data fitted networks (PFNs) challenges this approach. Similar to large language models, PFNs make use of pretraining and in-context learning to achieve strong performance on new tasks in a single forward pass. However, current PFNs have limitations that prohibit their widespread adoption. Notably, TabPFN achieves very strong performance on small tabular datasets but is not designed to make predictions for datasets of size larger than 1000. In this work, we overcome these limitations and substantially improve the performance of PFNs via context optimization. We introduce TuneTables, a parameter-efficient fine-tuning strategy for PFNs that compresses large datasets into a smaller learned context. We conduct extensive experiments on 19 algorithms over 98 datasets and find that TuneTables achieves the best performance on average, outperforming boosted trees such as CatBoost, while optimizing fewer than 5% of TabPFN's parameters. Furthermore, we show that TuneTables can be used as an interpretability tool and can even be used to mitigate biases by optimizing a fairness objective. We open-source our code and raw results at https://github.com/penfever/TuneTables.

📄 PDF Abstract BibTeX arXiv:2402.11137

Code (2)

penfever/tabpfn-pt 공식 구현 pytorch
penfever/tunetables 공식 구현 pytorch

Tasks

FairnessIn-Context Learningparameter-efficient fine-tuningtabular-classification

Methods 이 논문이 사용한 방법론

TABPFN We present TabPFN, a trained Transformer that can do supervised classification for small tabular datasets in less than a second, needs no hyperparameter tuning and is competitive…

Similar Papers 제목 키워드 기반

FORGE: Fragment-Oriented Ranking and Generation for Context-Aware Molecular Optimization

2026-05-11 · Qingchuan Zhang, He Cao, Hao Li, Yanjun Shao 외 arxiv

Molecular optimization seeks to improve a molecule through small structural edits while preserving similarity to the starting compound. Recent language-model approaches typically treat this task as prompt-conditioned seq…

SynthICL: Scalable In-context Imitation Learning with Synthetic Data

2026-06-06 · Cheng Qian, Ruomeng Fan, Yifei Ren, Yilong Wang 외 arxiv

In-context imitation learning (ICIL) enables robots to learn new tasks from a small number of demonstrations by conditioning a pre-trained policy on task-specific examples, without retraining at test time. Despite this p…

BERT-DST: Scalable End-to-End Dialogue State Tracking with Bidirectional Encoder Representations from Transformer

2019-07-05 · Guan-Lin Chao, Ian Lane

An important yet rarely tackled problem in dialogue state tracking (DST) is scalability for dynamic ontology (e.g., movie, restaurant) and unseen slot values. We focus on a specific condition, where the ontology is unkno…

Dialogue State Tracking

SHINE: A Scalable In-Context Hypernetwork for Mapping Context to LoRA in a Single Pass

2026-02-06 · Yewei Liu, Xiyuan Wang, Yansheng Mao, Yoav Gelbery 외 arxiv

We propose SHINE (Scalable Hyper In-context NEtwork), a scalable hypernetwork that can map diverse meaningful contexts into high-quality LoRA adapters for large language models (LLMs). By reusing the frozen LLM's own par…

Question Answering

Local Patches Meet Global Context: Scalable 3D Diffusion Priors for Computed Tomography Reconstruction

2025-12-20 · Taewon Yang, Jason Hu, Jeffrey A. Fessler, Liyue Shen arxiv

Diffusion models learn strong image priors that can be leveraged to solve inverse problems like medical image reconstruction. However, for real-world applications such as 3D Computed Tomography (CT) imaging, directly tra…

Image Reconstruction3D ReconstructionImage Generation3D Generation