Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.11137 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913555170721792 |
|---|---|
| author | Feuer, Benjamin Schirrmeister, Robin Tibor Cherepanova, Valeriia Hegde, Chinmay Hutter, Frank Goldblum, Micah Cohen, Niv White, Colin |
| author_facet | Feuer, Benjamin Schirrmeister, Robin Tibor Cherepanova, Valeriia Hegde, Chinmay Hutter, Frank Goldblum, Micah Cohen, Niv White, Colin |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11137 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | TuneTables: Context Optimization for Scalable Prior-Data Fitted Networks Feuer, Benjamin Schirrmeister, Robin Tibor Cherepanova, Valeriia Hegde, Chinmay Hutter, Frank Goldblum, Micah Cohen, Niv White, Colin Machine Learning 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. |
| title | TuneTables: Context Optimization for Scalable Prior-Data Fitted Networks |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2402.11137 |