LLMs can construct powerful representations and streamline sample-efficient supervised learning

Ilker Demirel, Larry Shi, Zeshan Hussain, David Sontag
3/12/2026
cs.AI

No official code found. Best implementation: demireal/LRRL (17 stars, last commit 2026-03-27).

Abstract

As real-world datasets become increasingly complex and heterogeneous, supervised learning is often bottlenecked by input representation design. Modeling multimodal data for downstream tasks, such as time-series, free text, and structured records, often requires non-trivial domain-specific engineering. We propose an agentic pipeline to streamline this process. First, an LLM analyzes a small but diverse subset of text-serialized input examples in-context to synthesize a global rubric, which acts as a programmatic specification for extracting and organizing evidence. This rubric is then used to transform naive text-serializations of inputs into a more standardized format for downstream models. We also describe local rubrics, which are task-conditioned summaries generated by an LLM. Across 15 clinical tasks from the EHRSHOT benchmark, our rubric-based approaches significantly outperform traditional count-feature models, naive text-serialization-based LLM baselines, and a clinical foundation model, which is pretrained on orders of magnitude more data. Beyond performance, rubrics offer several advantages for operational healthcare settings such as being easy to audit, cost-effectiveness to deploy at scale, and they can be converted to tabular representations that unlock a swath of machine learning techniques.

View on arXivView PDF

Code Implementations(1)

demireal/LRRLCommunity67%

Repository for the "LLMs can construct powerful representations and streamline sample-efficient supervised learning" paper

171Shell, PythonMar 12, 20266 months ago

Similar Papers

Cite this paper

@article{demirel2026llms,
  title  = {LLMs can construct powerful representations and streamline sample-efficient supervised learning},
  author = {Ilker Demirel and Larry Shi and Zeshan Hussain and David Sontag},
  year   = {2026},
  eprint = {2603.11679},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.11679v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.11679.svg)](https://codeofpaper.com/paper/2603.11679)

Discussion