Talk compares tabular foundation models TabPFN, TabICR vs gradient boosting
saheedniyi_02 · x · 2026-11-20
Daniel Tobi gave a technical talk on tabular foundation models, covering TabPFN, TabICR, and Nvidia-Kumo architectures and benchmarking them against traditional gradient boosting algorithms — useful reference material for structured-data practitioners.
More from Research
- Matt Green muses: are n^25 galactic algorithms normal, or a glimpse of provable Algorithmica? — matthew_d_green · 2026-11-20
- MIT and NVIDIA's QDA uses agents to auto-design LLM quantization recipes, beating top public ones by up to 2.2 points — omarsar0 · 2026-11-20
- AI-powered forensic metascience: auditing 7 million papers, 500K files scanned, 100+ issues found — gleech · 2026-11-20
- Harmonic's Aristotle writes proven-correct fusion plasma controllers in C and Verilog in 4 hours — satnam6502 · 2026-11-20
- Interp4discovery workshop on interpretability for scientific discovery at NeurIPS, Dec 12 — begusgasper · 2026-11-20
- YC-backed Antinuous launches agent platform for running 100x more experiments at 1,000x lower cost — ycombinator · 2026-11-20