Skip to main content
Search

# In-Context Learning

35 related articles

Subscribe to updates
  1. arXiv

    A frozen tabular foundation model as candidate generator: propeller-compatible stern designs rise from 1.4% to 99.3%

    Engineering design often has only 10 to 1,000 evaluated designs because simulations and experiments are costly. GenPFN trains no new generator: a frozen TabPFN classifier reads labeled designs, candidates are interpolated between desired designs and updated with classifier gradients and Gaussian noise, and every candidate is evaluated by the problem's own constraints and objectives. Across fourteen engineering problems, GenPFN v1 has higher class satisfaction and lower realism distance than the tested CTGAN, TVAE and TabDDPM; in the stern case, 993 of 1,000 candidates passed geometric checks and met the propeller-placement area requirement, versus 28 of 2,000 random context designs.

  2. arXiv

    Physics fields learn in context: PhysICL predicts on new meshes without weight updates

    An engineering design study holds only tens to hundreds of simulations, each on its own mesh, and conventional surrogates are retrained for every study. PhysICL is pretrained once on a procedural prior, then treats a few labeled simulations as context and predicts fields, with quantiles, directly at each query's own unstructured-mesh nodes in one forward pass, with no weight update. On five PLAID datasets unseen in pretraining its field error falls as context grows and drops below the nearest context simulation; on AhmedML surfaces its peak GPU memory stays at 4.27 GiB.

  3. arXiv

    TabOmics reads every feature in one pass with 7.3M parameters: mean AUROC 0.943 across 46 wide omics tasks, and one member matches a model 30 times larger

    TabOmics is an open tabular foundation model with 7.3M parameters, pretrained only on synthetic tables, that processes all features retained after preprocessing jointly in a single forward pass instead of subsampling or compressing them. Across 46 classification tasks from three high-dimensional, low-sample-size benchmarks, the eight-member TabOmics v2.5 reaches a mean AUROC of 0.943, above 0.942 for eight-member TabPFN-3.5; the single-member version reaches 0.941 with no significant paired difference, at roughly five times the runtime per forward pass.

  4. arXiv

    A trained experiment-design policy learns to take advice at deployment: Imbue turns expert priors and past experiments into droppable input tokens

    Imbue lets an already-trained Bayesian experimental design policy take in external knowledge available only at deployment without retraining: user-specified priors and observations from previous instances of the experiment are encoded as extra input tokens, processed in-context with the accumulated observations by a shared Transformer, and a reliability filter scores each token against those observations and excludes inconsistent ones. Across four benchmarks it accelerates early-stage information acquisition when the external knowledge is reliable and stays close to the no-external baseline when it is not.

  5. arXiv

    Power-system dynamic simulation gets a fast stand-in: fine-tuned Chronos-2 beats a traditional AI model on error and runs 563 times faster

    The pretrained time-series foundation model Chronos-2 was tested as a surrogate for power-system dynamic simulation. On 1,800 load-disturbance samples from an IEEE 9-bus system, retrieval-augmented in-context learning beat random reference selection, and fine-tuned Chronos-2 had lower errors than a traditional spatiotemporal graph neural network baseline on the 178 held-out samples, with power-balance regularization improving every reported metric except voltage-angle MAE. Its 35.5 ms inference was 563 times faster than the 20 s ANDES simulation.

  6. arXiv

    Cancer outcome models stop splitting by ancestry: DA-ICL models the genetic continuum and tops mean AUROC in 10 of 18 TCGA tasks

    Omics-based cancer outcome prediction usually assigns samples to discrete ancestry groups and fits a separate model within each group, yet accuracy falls continuously with genetic distance from the training set. DA-ICL treats ancestry as a continuous variable, projects genotypes into a low-dimensional space with principal component analysis, builds a context from nearby samples at each ancestry point, and lets a pretrained tabular foundation model predict at inference time, with distribution-aware context enhancement adding distant but distributionally similar samples. Across 18 tasks spanning three TCGA cancer types, three omics modalities and two clinical endpoints, DA-ICL reaches the highest mean AUROC on 10 tasks for African-ancestry samples, with gains that vary by task.

  7. bioRxiv

    Cellular perturbation prediction drops explicit variable values: RELAY reads shared-variable relations and reaches 0.495 PDCorr on PBMC-3D

    Cellular responses to perturbation depend on several experimental variables at once, including perturbation identity, cell type, donor and dose, so each measured population occupies one coordinate of a multidimensional condition space. Earlier methods conditioned on explicit representations of those variable values and struggled when a value was absent from training. RELAY instead infers a target from measured control–perturbed pairs that share some variables with it, receiving only which variables are shared and never their values; across chemical, genetic and cytokine perturbation data it beats STACK, scGen and TabPFN on unseen variable values and supervised methods on unseen combinations, reaching 0.495 PDCorr on PBMC-3D against 0.225 for the strongest supervised baseline, STATE.

  8. bioRxiv

    CellScribe folds cell identity and state into one generative interface: 0.223 macro-F1 across 309 held-out types, ahead of a frozen-embedding probe

    Single-cell annotation has long treated cell identity (lineage) and state (active transcriptional programs) with separate tools, while fixed-output classifiers can only return predefined types. CellScribe feeds frozen single-cell foundation-model embeddings into a pretrained language model through AdaLN adapters, so one shared model generates either an ontology-grounded cell type or a meta-program profile with activity scores under task-specific prompts. On the 309-type, 4.44M-cell study-holdout split of CELLxGENE, the full pipeline reaches 0.223 macro-F1 and 0.484 weighted-F1, above the 0.194 and 0.366 of a supervised probe on frozen scFoundation embeddings; on malignant cells from held-out 3CA studies it reaches 0.344 hallmark accuracy against the probe's 0.227.

  9. GrnPFN learns from simulated gene networks: it predicts transcriptional interactions before any combination is measured

    Combinatorial perturbation screens grow quadratically in pairs, so most combinations are never measured, yet combined transcriptional responses often depart from the sum of the two single effects. GrnPFN is pretrained on simulated screens generated from random gene-regulatory networks to predict that nonadditive residual directly, then incorporates measured pairs through in-context learning without retraining. Across five single-cell screens, with no measured pairs in the target screen it reached a pooled cosine similarity 0.049 higher than gradient boosting trained on other screens (97.5% CI, 0.038–0.060); as measured pairs accumulated, kernel ridge fitted to the same pairs caught up.

  10. NVIDIA's Kumo Relational predicts straight from relational databases, no training or table flattening required

    NVIDIA released Kumo Relational, a pre-trained relational foundation model that predicts directly on enterprise relational databases without task-specific training, feature engineering, or flattening tables into one wide row. Across 41 tasks on 15 databases it beats supervised relational deep learning models and expert-engineered gradient-boosted tree pipelines, and on the SAP SALT enterprise benchmark it exceeds AutoGluon ensembles by 8% in mean reciprocal rank. A prediction is stated as a declarative query, and the model answers it in a single forward pass using historical examples as context.