<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>In-Context Learning on Koby Bibas</title><link>https://kobybibas.github.io/tags/in-context-learning/</link><description>Recent content in In-Context Learning on Koby Bibas</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Sun, 12 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://kobybibas.github.io/tags/in-context-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>[Summary] Tabular Foundation Models: From TabPFN to TabFM</title><link>https://kobybibas.github.io/posts/20260712_tabular_foundation_models/summary/</link><pubDate>Sun, 12 Jul 2026 00:00:00 +0000</pubDate><guid>https://kobybibas.github.io/posts/20260712_tabular_foundation_models/summary/</guid><description>TL;DR Decision tree models have dominated machine learning for tabular data, and previous attempts to apply transformers to tabular data ended with no success. Recently, a new paradigm has emerged: train a large transformer model on synthetic datasets, then apply in-context learning to a new dataset to predict the entire test set labels. Multiple recent papers (TabPFN, TabICL, TabFM) show this approach outperforms tuned decision-tree models. However, per-prediction inference is actually slower than trees.</description></item></channel></rss>