# AI Foundation Models

AI foundation models are models trained on vast or broad datasets with substantial computing resources, then adapted or fine-tuned for a wide range of downstream tasks.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## TabPFN: One Model to Rule Them All?

DevFeed: [TabPFN: One Model to Rule Them All?](<https://devfeed.tech/articles/tabpfn-one-model-to-rule-them-all-144854.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2505.20003>)

Author: Qiong Zhang, Yan Shuo Tan, Qinglong Tian, Pengfei Li

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Data science and engineering](<https://devfeed.tech/topics/data-science-and-engineering.md>), [model architecture](<https://devfeed.tech/topics/model-architecture.md>)

Tags: [application](<https://devfeed.tech/tags/application.md>), [bayesian-inference](<https://devfeed.tech/tags/bayesian-inference.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deep-learning](<https://devfeed.tech/tags/deep-learning.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [learning](<https://devfeed.tech/tags/learning.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [stat-me](<https://devfeed.tech/tags/stat-me.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [tabpfn](<https://devfeed.tech/tags/tabpfn.md>), [tabular-data](<https://devfeed.tech/tags/tabular-data.md>)

### AI overview

The paper interprets TabPFN, a transformer for tabular regression and classification, as approximate Bayesian inference and examines its potential relevance to statistics. The authors report that out-of-the-box TabPFN sometimes outperforms specialized state-of-the-art methods in semi-supervised parameter estimation, prediction under covariate shift, and heterogeneous treatment effect estimation. They suggest one explanation is its ability to adapt to both nonparametric and parametric structure; in some experiments, it outperforms LASSO even when LASSO's assumptions are correctly specified. The evidence provided is an abstract, so it does not detail experimental setups or results.

### Source excerpt

arXiv:2505.20003v3 Announce Type: replace Abstract: Hollmann et al. (Nature 637 (2025) 319-326) recently introduced TabPFN, a transformer-based deep learning model for regression and classification on tabular data, which they claim "outperforms all previous methods on datasets with up to 10,000 samples by a wide margin, using substantially less training time." Furthermore, they have called TabPFN a "foundation model" for tabular data, as it can support "data generation, density estimation, learning reusable embeddings and fine-tuning". In this paper, we provide a tailored explanation of how TabPFN works for a statistics audience, by emphasizing its interpretation as approximate Bayesian inference. We then explore the significance of TabPFN to the field of statistics: We show that an out-of-the-box application of TabPFN can sometimes outperform specialized state-of-the-art methods for semi-supervised parameter estimation, prediction under covariate shift, and heterogeneous treatment effect estimation. As a partial explanation for the predictive effectiveness of TabPFN, we show that it can simultaneously adapt to both nonparametric structure and parametric structure, for instance, sometimes outperforming LASSO even when assumptions are correctly specified. All experiments can be reproduced using the code provided at https://github.com/qinglong-tian/tabpfn_study (https://github.com/qinglong-tian/tabpfn_study).

## VoxForge: A Unified Foundation Model for Dense 3D Features Across MRI, CT and PET

DevFeed: [VoxForge: A Unified Foundation Model for Dense 3D Features Across MRI, CT and PET](<https://devfeed.tech/articles/voxforge-a-unified-foundation-model-for-dense-3d-features-across-mri-ct-and-pet-145039.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25309>)

Author: Rushil Anirudh, Jayaraman J. Thiagarajan

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>)

Tags: [3d](<https://devfeed.tech/tags/3d.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [article](<https://devfeed.tech/tags/article.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distillation](<https://devfeed.tech/tags/distillation.md>), [encoder](<https://devfeed.tech/tags/encoder.md>), [features](<https://devfeed.tech/tags/features.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [generalist](<https://devfeed.tech/tags/generalist.md>), [global](<https://devfeed.tech/tags/global.md>), [matching](<https://devfeed.tech/tags/matching.md>), [medical](<https://devfeed.tech/tags/medical.md>), [models](<https://devfeed.tech/tags/models.md>), [pet](<https://devfeed.tech/tags/pet.md>), [tasks](<https://devfeed.tech/tags/tasks.md>), [test](<https://devfeed.tech/tags/test.md>), [top](<https://devfeed.tech/tags/top.md>), [volumes](<https://devfeed.tech/tags/volumes.md>), [wide](<https://devfeed.tech/tags/wide.md>)

### AI overview

VoxForge is a single 3D encoder trained on permissively licensed MRI and CT volumes using 3D architecture advances, self-distillation, and cross-modal curricula. Evaluated with its features frozen, it achieves the best or tied-best average rank in every task group across segmentation, classification, and registration, including on PET, a modality absent from training. The abstract reports performance on localized and global tasks at the level of state-of-the-art specialists and says it matches top-performing models on TotalSegmentator CT using one tenth as many labels. The supplied text is an abstract, so it does not provide implementation details or per-task results.

### Source excerpt

arXiv:2611.25309v1 Announce Type: cross Abstract: A unified 3D medical foundation model promises reusable, frozen features that serve a wide variety of tasks such as segmentation, classification and registration on MRI, CT and PET as well as specialist models do. Generalist models still need separate backbones for localized and global tasks, specialist models are confined to a single modality, with the concern that spanning modalities under-emphasizes fine anatomy, and both typically rely on end-to-end fine-tuning to be competitive. We present VoxForge, a single encoder that integrates recent advances in 3D architecture, self-distillation and cross-modal curricula to learn transferable features from permissively licensed MRI and CT volumes. We evaluate it strictly frozen, the test a reusable foundation model must pass, against state-of-the-art generalist and specialist models on segmentation, classification and registration across MRI and CT, and on PET, which it never sees. VoxForge has the best or tied-best average rank in every task group, serves localized and global tasks across modalities at the level of state-of-the-art specialists, and is extremely label-efficient, matching top-performing models on TotalSegmentator CT with a tenth of the labels.

## GroundAnything: Reconciling Parallel Decoding with Precise Visual Grounding at Flash Speed

DevFeed: [GroundAnything: Reconciling Parallel Decoding with Precise Visual Grounding at Flash Speed](<https://devfeed.tech/articles/groundanything-reconciling-parallel-decoding-with-precise-visual-grounding-at-flash-speed-144950.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.39600>)

Author: Qize Yu, Lianrui Fan, Bowen Ping, Xini Ding, Zetian Song, Junbo Niu, Kaixuan Wang, Tianxing Chen, Yue Chen, Minghua He, Yuran Wang, Jie Huang, Haojun Zhang, Min Chen, Hao Li, Wenxuan Song, Ruihai Wu,

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Decoding](<https://devfeed.tech/topics/decoding.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [grpo](<https://devfeed.tech/topics/grpo.md>), [post-training](<https://devfeed.tech/topics/post-training.md>), [AI Infrastructure](<https://devfeed.tech/topics/ai-infrastructure.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [also](<https://devfeed.tech/tags/also.md>), [ar](<https://devfeed.tech/tags/ar.md>), [art](<https://devfeed.tech/tags/art.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [astra](<https://devfeed.tech/tags/astra.md>), [autoregressive](<https://devfeed.tech/tags/autoregressive.md>), [based](<https://devfeed.tech/tags/based.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [coco](<https://devfeed.tech/tags/coco.md>), [combines](<https://devfeed.tech/tags/combines.md>), [conversion](<https://devfeed.tech/tags/conversion.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [data](<https://devfeed.tech/tags/data.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [flash](<https://devfeed.tech/tags/flash.md>), [grounding](<https://devfeed.tech/tags/grounding.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [speed](<https://devfeed.tech/tags/speed.md>), [with](<https://devfeed.tech/tags/with.md>)

### AI overview

GroundAnything is a 4B-parameter visual grounding model that uses blockwise diffusion denoising to generate and refine spatial hypotheses in parallel, addressing the sequential latency of autoregressive decoding. Its training combines public-data and dedicated-data-engine pretraining, conversion from autoregressive models with joint objectives, supervised fine-tuning, and GRPO reinforcement post-training. Across 30 benchmarks, its autoregressive variant scores 72.42%, compared with 71.35% for GPT-6 Astra among similarly sized models. With entropy-guided decoding, GroundAnything averages 61.75%, versus 53.32% for the fast MTP-based LocateAnything. An optional self-speculative mode reports a 4.51x speedup over the autoregressive counterpart, with a 0.74-point drop in COCO F1mIoU. The excerpt also says inference optimizations yield practical speedups, without detailing them.

### Source excerpt

arXiv:2609.39600v3 Announce Type: replace-cross Abstract: Autoregressive (AR) grounding models serialize spatial predictions, introducing sequential latency and imposing a causal order on output tokens. We view grounding as visual evidence extraction: objects, locations, and spatial relations are jointly constrained by the image and query, yet their dependencies do not imply an intrinsic left-to-right generation order. This distinction makes bidirectional diffusion a natural fit, allowing spatial hypotheses to emerge in parallel and be jointly refined through iterative denoising. We introduce GroundAnything, a 4B-parameter grounding foundation model that reconciles fast parallel decoding with precise localization through blockwise denoising. Training combines grounding pretraining from public datasets and dedicated data engines, direct AR-to-diffusion conversion with joint AR and diffusion objectives, supervised fine-tuning, and GRPO-based reinforcement post-training. Across 30 grounding benchmarks, our autoregressive variant, GroundAnything-VLM, establishes a new overall state of the art among similarly sized models at 72.42%, remaining competitive with GPT-6 Astra (71.35%). With entropy-guided decoding, GroundAnything also surpasses the prior state of the art at this scale, averaging 61.75% versus 53.32% for the fast MTP-based LocateAnything model. We further explore decoding strategies, showing that an optional self-speculative mode achieves a 4.51$\times$ speedup over the AR counterpart with a 0.74 percentage-point drop in COCO F1mIoU. Infrastructure experiments show that progressive inference optimizations translate parallel decoding into practical speedups. These gains support efficient visual grounding in latency-sensitive real-world systems.

## Interference Bounds and Merge-Aware Training Dynamics for Composable Fine-Tuned Models

DevFeed: [Interference Bounds and Merge-Aware Training Dynamics for Composable Fine-Tuned Models](<https://devfeed.tech/articles/interference-bounds-and-merge-aware-training-dynamics-for-composable-fine-tuned-models-145056.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25430>)

Author: Alireza Moayedikia

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [LLM Techniques](<https://devfeed.tech/topics/llm-techniques.md>), [Enhancing AI model performance](<https://devfeed.tech/topics/enhancing-ai-model-performance.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [composability](<https://devfeed.tech/tags/composability.md>), [control](<https://devfeed.tech/tags/control.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [fine](<https://devfeed.tech/tags/fine.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [functional](<https://devfeed.tech/tags/functional.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [merge](<https://devfeed.tech/tags/merge.md>), [metric](<https://devfeed.tech/tags/metric.md>), [model](<https://devfeed.tech/tags/model.md>), [models](<https://devfeed.tech/tags/models.md>), [rank](<https://devfeed.tech/tags/rank.md>), [study](<https://devfeed.tech/tags/study.md>), [training](<https://devfeed.tech/tags/training.md>), [transformer](<https://devfeed.tech/tags/transformer.md>)

### AI overview

The paper bounds the excess loss from merging fine-tuned task updates using an interference functional that captures cross-task curvature overlap and signed update alignment. In the quadratic regime, this functional equals excess loss and measures alignment in the curvature metric. A curvature-guided regularizer bounds displacement in the base curvature metric during training; under a Loewner comparison with task curvatures, it also bounds the curvature component of interference inversely with penalty strength. It does not similarly reduce the first-order term, which arises because regularized solutions are not stationary for the task loss. Experiments confirm the bounds in an exact non-quadratic model, where the first-order term dominates under strong penalties and the curvature-guided penalty performs slightly better than an isotropic one. In a three-seed transformer study, interference is rank-correlated with merge degradation, but no more than Euclidean displacement.

### Source excerpt

arXiv:2611.25430v1 Announce Type: new Abstract: Combining fine-tuned models by composing their parameter updates has become a standard alternative to multi-task training. We formalize composability as a property of a collection of task vectors and prove that the excess loss of the merged model is controlled by an interference functional of the cross-task curvature overlap and the signed alignment of the updates. In the quadratic regime this functional equals the excess loss, giving a criterion that is necessary as well as sufficient and that measures the angle between task vectors in the curvature metric rather than the Euclidean one. Fine-tuning under a curvature-guided regularizer -- constructed from curvature statistics of the kind memory-efficient optimizers maintain -- keeps displacement in the base curvature metric below a ceiling set by the penalty coefficient at every iterate, at the standard $O(1/\sqrt{T})$ non-convex rate. Under a single Loewner comparison between the base statistic and the task curvatures, this control converts into a ceiling on the interference functional, inversely proportional to the penalty coefficient, so that the curvature term of the bound is controlled during training. A first-order term, present because regularized solutions are not stationary for the task loss, is not reduced in the same way. Experiments on an exact non-quadratic model confirm the budget and the ceiling, show the first-order term dominating for strong penalties, and find the curvature-guided penalty slightly better than an isotropic one. In a three-seed transformer study the functional is rank-correlated with merging degradation, but no more strongly than the Euclidean displacement norm.

## Bio-PM-Guided Synthetic IMU Generation

DevFeed: [Bio-PM-Guided Synthetic IMU Generation](<https://devfeed.tech/articles/bio-pm-guided-synthetic-imu-generation-145200.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26607>)

Author: Deepali Singh, Deepesh Parpani, Aviral Gupta

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Occam's razor machine learning](<https://devfeed.tech/topics/occam-s-razor-machine-learning.md>)

Tags: [autoregressive](<https://devfeed.tech/tags/autoregressive.md>), [classification](<https://devfeed.tech/tags/classification.md>), [classifier](<https://devfeed.tech/tags/classifier.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [decoder](<https://devfeed.tech/tags/decoder.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [encoder](<https://devfeed.tech/tags/encoder.md>), [f1](<https://devfeed.tech/tags/f1.md>), [feature](<https://devfeed.tech/tags/feature.md>), [generation](<https://devfeed.tech/tags/generation.md>), [gravity](<https://devfeed.tech/tags/gravity.md>), [imu](<https://devfeed.tech/tags/imu.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [metrics](<https://devfeed.tech/tags/metrics.md>), [models](<https://devfeed.tech/tags/models.md>), [raw](<https://devfeed.tech/tags/raw.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>)

### AI overview

The study generates synthetic IMU data in Bio-PM's representation space rather than directly as raw signals. It encodes 10-second windows with a frozen Bio-PM encoder and trains class-conditional autoregressive transformer and diffusion decoders; a PatchDecoder provides approximate waveform reconstruction. The diffusion model reaches 0.68 macro-F1 when trained on synthetic tokens and tested on real data. On WISDM across 51 subjects, combining synthetic-token augmentation with a 320-dimensional gravity-aware representation raises leave-one-subject-out macro-F1 from 0.729 to 0.809, with statistically significant gains concentrated in the hardest activity classes.

### Source excerpt

arXiv:2611.26607v1 Announce Type: new Abstract: Collecting and labeling inertial measurement unit (IMU) data for human activity recognition (HAR) is expensive, and models trained on one group of subjects often fail to generalize to unseen individuals. Even with balanced data, classifiers struggle to distinguish dynamically similar activity classes and benefit from targeted augmentation. We explore whether synthetic IMU data generated in the representation space of a pretrained biosignal encoder, Bio-PM \cite{b1}, can serve as a practical augmentation source. Rather than synthesizing raw signals, we leverage Bio-PM's frozen encoder to convert 10-second IMU windows into token embedding sequences and train class-conditional decoders in this space: (1) an autoregressive transformer decoder that predicts tokens sequentially, and (2) a diffusion decoder that learns the token distribution through a denoising objective. We analyze generation realism through distributional metrics and embedding-space visualizations, evaluate downstream utility through leave-one-subject-out HAR classification, and present a PatchDecoder for approximate raw waveform reconstruction. Our diffusion decoder achieves a Train-on-Synthetic-Test-on-Real (TSTR) macro-F1 of 0.68, demonstrating that generated tokens are realistic enough to train a classifier that transfers to real data. Combining synthetic-token augmentation with a 320-dimensional gravity-aware feature representation raises LOSO macro-F1 from 0.729 to 0.809 over a real-only baseline across 51 subjects on the WISDM benchmark, with statistically significant gains concentrated in the most challenging activity classes. These results demonstrate that high-fidelity generation in a pretrained encoder's representation space is achievable and practically useful for cross-subject HAR augmentation.

## A General Harness for Protein Foundation Model Fitness Prediction

DevFeed: [A General Harness for Protein Foundation Model Fitness Prediction](<https://devfeed.tech/articles/a-general-harness-for-protein-foundation-model-fitness-prediction-145382.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.34654>)

Author: Yang Tan, Qijia Tian, Gangyu Sun, Bozitao Zhong, Mingchen Li, Yuanxi Yu, Nanqing Dong, Liang Hong

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [correlation](<https://devfeed.tech/tags/correlation.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [fitness](<https://devfeed.tech/tags/fitness.md>), [foundation](<https://devfeed.tech/tags/foundation.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [function](<https://devfeed.tech/tags/function.md>), [general](<https://devfeed.tech/tags/general.md>), [harness](<https://devfeed.tech/tags/harness.md>), [model](<https://devfeed.tech/tags/model.md>), [model-agnostic](<https://devfeed.tech/tags/model-agnostic.md>), [models](<https://devfeed.tech/tags/models.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [mutation](<https://devfeed.tech/tags/mutation.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [protein](<https://devfeed.tech/tags/protein.md>), [q-bio-qm](<https://devfeed.tech/tags/q-bio-qm.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [score](<https://devfeed.tech/tags/score.md>)

### AI overview

VenusREM-Harness (VRH) improves protein fitness predictions by combining frozen protein foundation model scores with family-specific multiple sequence alignment evidence, weighted by model uncertainty, then correcting and shrinking scores using structural confidence and solvent exposure. It is model-agnostic and training-free. Across 1,211 assays and 3.1 million variants, all 71 tested configurations improved Spearman correlation on ProteinGym, VenusMutHub, and VenusViroHub, with an average gain of 0.073 and broad gains across five metrics. The VRH-based VenusREM2 ranked highest across the reported function, taxon, MSA-depth, and mutation-depth categories, scoring 0.556 average Spearman on ProteinGym, 0.038 above the prior best.

### Source excerpt

arXiv:2609.34654v2 Announce Type: replace Abstract: Accurate fitness prediction is central to protein engineering and understanding sequence-function relationships. With advances in deep learning, protein foundation models (PFMs) have become widely used for this task. Recent analyses, however, show that these models share preferences reflecting their training corpora, while unreliable inputs can further distort fitness predictions. Family-specific evolutionary evidence and structural context can help address these limitations by providing complementary constraints on model scores, motivating VenusREM-Harness (VRH), a general, model-agnostic, training-free Retrieval-Enhanced Mutation harness. It fuses frozen model scores with multiple sequence alignment (MSA) evidence according to model uncertainty, then applies gated background correction and score shrinkage based on structural confidence and solvent exposure. Across 1,211 assays and 3.1 million measured variants from ProteinGym, VenusMutHub, and the newly curated viral benchmark VenusViroHub, all 71 configurations improve Spearman correlation on all 3 benchmarks by 0.073 on average, with broad gains across 5 metrics. Extended analyses relate retrieval gains to model-MSA preference differences, assess domain-level gains and immune-escape cases, and quantify computational speedups. Built with VRH, VenusREM2 is the first to rank highest in all function, taxon, MSA-depth, and mutation-depth categories, with a ProteinGym Average Spearman of 0.556, 0.038 above the prior best.

## Erasing the Wrong Thing: Conditional Attribute Leakage and Concept Erasure in Shared Foundation-Model Embeddings

DevFeed: [Erasing the Wrong Thing: Conditional Attribute Leakage and Concept Erasure in Shared Foundation-Model Embeddings](<https://devfeed.tech/articles/erasing-the-wrong-thing-conditional-attribute-leakage-and-concept-erasure-in-shared-foundation-model-embeddings-145084.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25640>)

Author: Haijun He, Fei Li, Donghong Ji, Junjun He

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [ai security](<https://devfeed.tech/topics/ai-security.md>), [Image processing](<https://devfeed.tech/topics/image-processing.md>)

Tags: [association](<https://devfeed.tech/tags/association.md>), [attack](<https://devfeed.tech/tags/attack.md>), [biomedical](<https://devfeed.tech/tags/biomedical.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diagnosis](<https://devfeed.tech/tags/diagnosis.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [linear](<https://devfeed.tech/tags/linear.md>), [model](<https://devfeed.tech/tags/model.md>), [strata](<https://devfeed.tech/tags/strata.md>), [utility](<https://devfeed.tech/tags/utility.md>)

### AI overview

Population-level concept erasure can leave sensitive attributes detectable within task groups when task and sensitive labels are associated. The authors prove that global and task-conditional linear guardedness cannot both preserve a nonzero linear task signal under this association. They introduce TC-LEACE, which enforces linear guardedness within each task stratum. Across four vision models and 85 CelebA attribute pairs, conditional leakage persisted after LEACE, with the gap between marginal and conditional audits growing with association strength; a pre-erasure-statistics estimate tracked observed utility costs. In chest-radiograph experiments using three models, chest-tube status remained detectable within diagnosis strata after LEACE, even though a marginal attack performed worse than a diagnosis-only reference. TC-LEACE recovered most of LEACE's linear task-utility loss while keeping conditional leakage within a prespecified margin of LEACE's.

### Source excerpt

arXiv:2611.25640v1 Announce Type: cross Abstract: Medical-image embeddings are increasingly shared in place of raw images for authorized downstream tasks, yet they may reveal sensitive attributes. Standard concept-erasure methods target population-level guardedness. However, we prove that, when binary task and sensitive labels are associated, global and task-conditional linear guardedness cannot both hold while a nonzero linear task signal is preserved, so global erasure must either eliminate that signal or retain task-conditional linear leakage. We further show how global erasure affects linear readers' discrimination between positive and negative samples with different sensitive attributes, deriving an approximate closed-form prediction of its utility cost from pre-erasure statistics. Motivated by this conflict, we introduce Task-Conditional LEACE (TC-LEACE), a closed-form variant of LEACE that enforces linear guardedness within each task stratum of its fitting data. We evaluate four vision foundation models on 85 CelebA attribute pairs spanning a broad range of associations. After LEACE, conditional leakage persists across all four encoders, the discrepancy between marginal and conditional audits increases with association strength, and predicted utility costs track observed losses. We then examine hospital chest radiographs using three foundation models, including two biomedical models, in which chest-tube status is strongly associated with diagnosis. Although a marginal attack on LEACE-erased embeddings underperforms a diagnosis-only reference, chest-tube status remains detectable within diagnosis strata. TC-LEACE recovers most of LEACE's linear task-utility loss while keeping task-conditional leakage within a prespecified margin of LEACE's.

## Antom 3-in-1 Transformer: A Payment Foundation Model

DevFeed: [Antom 3-in-1 Transformer: A Payment Foundation Model](<https://devfeed.tech/articles/antom-3-in-1-transformer-a-payment-foundation-model-145051.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25403>)

Author: Weiyu Han, Haoyu Jiang, Jie Sheng, Youxi Pan, Xianglong Liu, Zeqi Ren, Dongquan Yi, Yinhao Liu, Ruobing Zuo, Ze Zhao, Huilin He, Nairong Zhang, Xinyi He, Xiao Tan, Jun Wang, Pan Fang, Wei Zeng, Jianan

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [graph](<https://devfeed.tech/tags/graph.md>), [model](<https://devfeed.tech/tags/model.md>), [online](<https://devfeed.tech/tags/online.md>), [payment](<https://devfeed.tech/tags/payment.md>), [pretraining](<https://devfeed.tech/tags/pretraining.md>), [risk](<https://devfeed.tech/tags/risk.md>), [sequence](<https://devfeed.tech/tags/sequence.md>), [transformer](<https://devfeed.tech/tags/transformer.md>)

### AI overview

Antom 3-in-1 Transformer combines sequence, tabular, and graph representations to detect payment risk. The approximately 7B-parameter model, with about 1.7B activated per task route, is pretrained mainly on Ant International internal payment data to learn reusable behavioral and relational representations. In reported experiments, pretraining raised a target business metric 34.5% over the same architecture trained from scratch; with 25% of training labels, it exceeded the full-label scratch baseline on Average Precision and Recall@0.5% across merchant domains. A four-month online experiment on Ant International's billion-scale platform reported a 37.88% lower overall loss rate than XGB-Online.

### Source excerpt

arXiv:2611.25403v1 Announce Type: new Abstract: We report the development of Antom 3-in-1 Transformer, a payment foundation model that integrates sequence, tabular, and graph representations for payment risk detection. The model contains approximately 7B parameters, with approximately 1.7B activated per task route. Antom 3-in-1 Transformer is pretrained to learn reusable behavioral and relational representations, primarily on Ant International's internal payment data. In a cross-business transfer experiment, pretraining improves the target business metric by 34.5% over the same architecture trained from scratch. With only 25% of the training labels, the pretrained model outperforms the full-label scratch baseline in Average Precision (AP) and Recall@0.5% on different merchant domains. In a four-month online experiment on Ant International's billion-scale payment platform, the model reduced the overall loss rate by 37.88% relative to XGB-Online.

## Kandinsky 6.0 Video: Foundation Models for Synchronized Video and Audio Generation

DevFeed: [Kandinsky 6.0 Video: Foundation Models for Synchronized Video and Audio Generation](<https://devfeed.tech/articles/kandinsky-6-0-video-foundation-models-for-synchronized-video-and-audio-generation-144957.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.05608>)

Author: Team Kandinsky, Julia Agafonova, Bulat Akhmatov, Mikhail Aksyutin, Grigorii Alekseenko, Anastasia Aliaskina, Olga Androsova, Vladimir Arkhipkin, Anna Averchenkova, Alexander Belykh, Serafima Bocharova

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [multimodal-ai](<https://devfeed.tech/topics/multimodal-ai.md>), [Generative AI](<https://devfeed.tech/topics/generative-ai.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [diffusers](<https://devfeed.tech/topics/diffusers.md>)

Tags: [architecture](<https://devfeed.tech/tags/architecture.md>), [attention](<https://devfeed.tech/tags/attention.md>), [audio](<https://devfeed.tech/tags/audio.md>), [audio-video](<https://devfeed.tech/tags/audio-video.md>), [code](<https://devfeed.tech/tags/code.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-mm](<https://devfeed.tech/tags/cs-mm.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [distillation](<https://devfeed.tech/tags/distillation.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [foundation](<https://devfeed.tech/tags/foundation.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [generate](<https://devfeed.tech/tags/generate.md>), [generation](<https://devfeed.tech/tags/generation.md>), [image](<https://devfeed.tech/tags/image.md>), [integration](<https://devfeed.tech/tags/integration.md>), [kandinsky](<https://devfeed.tech/tags/kandinsky.md>), [kandinsky-6-0-video](<https://devfeed.tech/tags/kandinsky-6-0-video.md>), [models](<https://devfeed.tech/tags/models.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

Kandinsky 6.0 Video offers 3B-parameter Lite and 29B-parameter Pro diffusion models for text- or image-conditioned generation of five-second clips with synchronized 44 kHz audio and lip-sync; built-in super-resolution targets Full HD. Its dual-stream CrossDiT links a pretrained video stream and a newly trained audio stream with bidirectional cross-attention. Training progresses from audio-only pretraining to joint paired audio-video training, followed by supervised fine-tuning, reinforcement-learning post-training, and distillation. In side-by-side human evaluation, Pro outperformed Kandinsky 5.0 Video Pro and was competitive with leading models; the authors report better speech quality than LTX 2.5 and Seedance 2.0. Code, checkpoints, and diffusers integration are released under the MIT license.

### Source excerpt

arXiv:2610.05608v2 Announce Type: replace-cross Abstract: We present Kandinsky 6.0 Video, a family of foundation diffusion models for synchronized text-to-audio-video generation, comprising Kandinsky 6.0 Video Lite (3B parameters) and Kandinsky 6.0 Video Pro (29B parameters). Both models generate 5-second video clips with synchronized 44 kHz audio, including lip-sync, in text-to-audio-video (T2AV) and image-to-audio-video (I2AV) modes; a built-in super-resolution model raises the output resolution to Full-HD (1920x1080). Building on the video generation capabilities of Kandinsky 5.0, Kandinsky 6.0 Video employs a dual-stream CrossDiT architecture that connects a pretrained video stream and a newly trained audio stream through bidirectional cross-attention for temporal and semantic alignment. Our continuous pretraining strategy first trains the audio stream from scratch on large-scale audio corpora and then trains both streams jointly on paired audio-video data while preserving unimodal fidelity; pretraining is followed by supervised fine-tuning, reinforcement-learning-based post-training, and distillation. In side-by-side human evaluation, Kandinsky 6.0 Video Pro clearly outperforms its predecessor, Kandinsky 5.0 Video Pro, and remains competitive with leading audio-video generation models, outperforming LTX 2.5 and Seedance 2.0 in speech quality. To accelerate open research and deployment in multimedia generation, we release the code, model checkpoints, and diffusers integration under the MIT license.

## FG-GraphBench: Benchmarking and Enhancing Fine-Grained Visual Understanding with Multimodal Scene Graphs

DevFeed: [FG-GraphBench: Benchmarking and Enhancing Fine-Grained Visual Understanding with Multimodal Scene Graphs](<https://devfeed.tech/articles/fg-graphbench-benchmarking-and-enhancing-fine-grained-visual-understanding-with-multimodal-scene-graphs-145052.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25408>)

Author: Sicheng Liu, Xunkai Li, Ziyu Han, Xingnan Zhang, Ru Zhang, Rong-Hua Li

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [fine](<https://devfeed.tech/tags/fine.md>), [generation](<https://devfeed.tech/tags/generation.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [image](<https://devfeed.tech/tags/image.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [models](<https://devfeed.tech/tags/models.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [qa](<https://devfeed.tech/tags/qa.md>), [stage](<https://devfeed.tech/tags/stage.md>), [tokens](<https://devfeed.tech/tags/tokens.md>)

### AI overview

The paper introduces FG-GraphBench, a benchmark for fine-grained visual understanding with tasks in visual question answering, image captioning, and image description. Its two-stage construction pipeline discovers and grounds small visual entities and their relationships in multimodal scene graphs. The authors also propose FiGRA, which uses a two-stage training strategy to encode multimodal entity and relation features as continuous graph tokens and integrate them into MLLMs. The abstract reports that FiGRA outperforms strong baselines across all three benchmark tasks, and that preserving fine-grained entity and relation information matters for visual understanding.

### Source excerpt

arXiv:2611.25408v1 Announce Type: new Abstract: Fine-grained visual understanding requires multimodal large language models (MLLMs) to recognize small visual entities and understand their relationships. Scene graphs offer a natural way to represent this information, organizing visual entities as nodes and their relationships as edges. However, we identify two challenges: existing scene graph benchmarks provide insufficient coverage of fine-grained entities and the relationships among them, and existing methods for fine-grained visual understanding have yet to effectively leverage such graph-structured information in MLLMs. To address these challenges, we introduce Fine-Grained Multimodal Scene Graph Benchmark (FG-GraphBench) and FiGRA. FG-GraphBench is a benchmark comprising three complementary tasks: fine-grained visual question answering (FG-QA), image captioning (FG-Caption), and image description generation (FG-Description). We develop a two-stage construction pipeline that discovers and grounds fine-grained entities and establishes their relations to construct the fine-grained multimodal scene graphs (MSGs) in FG-GraphBench. Building on these MSGs, we propose FiGRA, a Fine-grained Graph Representation Augmentation method for MLLMs. FiGRA adopts a two-stage training strategy. It encodes multimodal entity and relation features as continuous graph tokens, and integrates them into the MLLM. Experiments show that FiGRA significantly outperforms strong baselines across three tasks of FG-GraphBench. Further analyses confirm the effectiveness of FG-GraphBench and highlight the importance of preserving fine-grained entity and relation information for visual understanding.

## Prior-Amortized In-Context Bayesian Inference for Generalized Linear Mixed-Effects Models

DevFeed: [Prior-Amortized In-Context Bayesian Inference for Generalized Linear Mixed-Effects Models](<https://devfeed.tech/articles/prior-amortized-in-context-bayesian-inference-for-generalized-linear-mixed-effects-models-144931.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.24422>)

Author: Alex Kipnis, Marcel Binz, Eric Schulz

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Open Source Models & Datasets](<https://devfeed.tech/topics/open-source-models-datasets.md>)

Tags: [bayesian](<https://devfeed.tech/tags/bayesian.md>), [bayesian-inference](<https://devfeed.tech/tags/bayesian-inference.md>), [calibrated-uncertainty](<https://devfeed.tech/tags/calibrated-uncertainty.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [flow](<https://devfeed.tech/tags/flow.md>), [markov-chain-monte-carlo](<https://devfeed.tech/tags/markov-chain-monte-carlo.md>), [mcmc](<https://devfeed.tech/tags/mcmc.md>), [metropolis](<https://devfeed.tech/tags/metropolis.md>), [model-comparison](<https://devfeed.tech/tags/model-comparison.md>), [neural](<https://devfeed.tech/tags/neural.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [open-weights](<https://devfeed.tech/tags/open-weights.md>), [out-of-sample](<https://devfeed.tech/tags/out-of-sample.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [time](<https://devfeed.tech/tags/time.md>), [transformers](<https://devfeed.tech/tags/transformers.md>)

### AI overview

MetaBeta uses a pretrained amortized model for Bayesian inference in generalized linear mixed-effects models (GLMMs), taking the full prior and model specification as test-time context. It combines set transformers and conditional neural spline flows trained on simulated continuous, binary, and count data; Independence Metropolis-Hastings refinement against the unnormalized posterior is reported to yield tuning-free, asymptotically correct inference. As an alternative, MetaBeta warm-starts NUTS, with nearly identical inference reported 3.5-13 times faster than cold-started NUTS and over 98% fewer divergent transitions. The abstract reports agreement with NUTS on benchmarks and real datasets, including challenging misspecification and data-poor settings. A real-data prior-sensitivity analysis with model comparison reportedly took seconds with MetaBeta versus 14-18 core-hours with NUTS. These are claims from the supplied abstract; it does not provide methodological details or independent evaluation.

### Source excerpt

arXiv:2609.24422v3 Announce Type: replace Abstract: Hierarchical data is ubiquitous in the empirical sciences and most commonly analyzed with generalized linear mixed-effects models (GLMMs). Bayesian inference for GLMMs yields calibrated uncertainty estimates but requires Markov Chain Monte Carlo (MCMC). The gold-standard No-U-Turn Sampler (NUTS) is slow and must restart from scratch for every new dataset, model and prior specification. We introduce MetaBeta, a pretrained amortized model for in-context Bayesian inference over GLMMs. The full prior and model specification are supplied as context at test time, and the model returns an asymptotically exact posterior at the speed of a forward pass. Two set transformers and two conditional neural spline flows mirror the GLMM's hierarchical structure and are trained jointly on millions of realistic simulated datasets with continuous, binary and count outcomes. The flow posterior is refined by Independence Metropolis-Hastings against the unnormalized posterior. This yields tuning-free asymptotically correct inference. Alternatively, MetaBeta can warm-start NUTS. This gives nearly identical inference 3.5-13x faster than cold-started NUTS and removes over 98% of NUTS' divergent transitions. On controlled benchmarks with ground-truth parameters, MetaBeta matches NUTS in parameter recovery, posterior calibration and out-of-sample prediction. On real datasets with unknown parameters, priors and model structure, its posteriors closely agree with those of NUTS. Furthermore, it remains faithful where amortized models typically struggle: under misspecified likelihoods, misspecified priors, out-of-distribution predictors, collinear designs and data-poor regimes. On real data, a full prior sensitivity analysis including model comparison takes a few seconds with MetaBeta against 14-18 core-hours for NUTS, tracing its posteriors throughout. Our model is open-source and open-weights.

## From field-scale to large-scale spectral libraries: Tabular foundation models in soil spectroscopy

DevFeed: [From field-scale to large-scale spectral libraries: Tabular foundation models in soil spectroscopy](<https://devfeed.tech/articles/from-field-scale-to-large-scale-spectral-libraries-tabular-foundation-models-in-soil-spectroscopy-144915.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.00608>)

Author: Viacheslav Barkov, Jonas Schmidinger, Robin Gebbers, Martin Atzmueller

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Model Development](<https://devfeed.tech/topics/model-development.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Big data infrastructure](<https://devfeed.tech/topics/big-data-infrastructure.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [chemometrics](<https://devfeed.tech/tags/chemometrics.md>), [cnn](<https://devfeed.tech/tags/cnn.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [digital](<https://devfeed.tech/tags/digital.md>), [evidence-based](<https://devfeed.tech/tags/evidence-based.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [global](<https://devfeed.tech/tags/global.md>), [in-context-learning](<https://devfeed.tech/tags/in-context-learning.md>), [large](<https://devfeed.tech/tags/large.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model-selection](<https://devfeed.tech/tags/model-selection.md>), [performance](<https://devfeed.tech/tags/performance.md>), [principal-component-analysis](<https://devfeed.tech/tags/principal-component-analysis.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [regression](<https://devfeed.tech/tags/regression.md>), [spectroscopy](<https://devfeed.tech/tags/spectroscopy.md>), [tabpfn](<https://devfeed.tech/tags/tabpfn.md>)

### AI overview

Across 85 soil property prediction tasks spanning field-scale mapping and a global spectral library, TabPFN performed best overall among the compared models. It outperformed classical baselines even when applied directly to full spectra, so dimensionality reduction was not required for strong results. PLS latent variables improved performance for all models; combined with TabPFN, they reduced RMSE versus the strongest classical baseline on 44 of 46 large-scale library tasks, with a median reduction of 14%. The abstract reports results for vis-NIR and MIR spectroscopy and datasets including tens of thousands of samples.

### Source excerpt

arXiv:2608.00608v2 Announce Type: replace Abstract: Visible and near-infrared (vis-NIR) and mid-infrared (MIR) spectroscopy enable rapid, cost-effective prediction of soil properties. Yet, translating high-dimensional, highly collinear spectra into accurate soil property predictions remains challenging, particularly when employing machine learning. We systematically investigated regression models and dimensionality reduction approaches for spectroscopic modeling across 85 soil property prediction tasks from open benchmark datasets in pedometrics, spanning field-scale digital soil mapping and a global soil spectral library. We compared an in-context learning tabular foundation model (TabPFN), a convolutional neural network (CNN), rule-based regression (Cubist), Random Forest, and partial least squares regression (PLSR) using full spectra as well as features derived from principal component analysis (PCA) and partial least squares (PLS) latent variables. TabPFN consistently delivered the best overall performance across spectral regions, properties, and scales, including large spectral library tasks with tens of thousands of soil samples. Notably, TabPFN applied directly to full spectra already surpassed all classical baselines, showing that explicit dimensionality reduction is not strictly required for strong performance. Further improvements were achieved through PLS, which proved to be an effective dimensionality reduction strategy for all models. Combining PLS latent variables with TabPFN yielded the best predictions overall, lowering the root mean squared error (RMSE) relative to the strongest classical baseline on 44 of the 46 large-scale spectral library tasks, by a median of 14%. Our findings provide evidence-based guidance for spectroscopic calibration model selection across operational scales, demonstrating that the long-standing advantages of PLSR and modern tabular foundation models complement each other in chemometrics.

## Long-Range Video Presentation Attack Detection: A Three-Class Benchmark Across 1-100 m and Two Sensor Types

DevFeed: [Long-Range Video Presentation Attack Detection: A Three-Class Benchmark Across 1-100 m and Two Sensor Types](<https://devfeed.tech/articles/long-range-video-presentation-attack-detection-a-three-class-benchmark-across-1-100-m-and-two-sensor-types-145009.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25108>)

Author: Lambert Igene, Mohammad Zahir Uddin Chowdhury, Afzal Hossain, Sandip Purnapatra, Peter Johnson, Stephanie Schuckers

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [Video Analytics](<https://devfeed.tech/topics/video-analytics.md>)

Tags: [attack](<https://devfeed.tech/tags/attack.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [class](<https://devfeed.tech/tags/class.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [detection](<https://devfeed.tech/tags/detection.md>), [efficientnet](<https://devfeed.tech/tags/efficientnet.md>), [presentation](<https://devfeed.tech/tags/presentation.md>), [range](<https://devfeed.tech/tags/range.md>), [sensor](<https://devfeed.tech/tags/sensor.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

The benchmark evaluates video-based presentation attack detection across 1-100 m, using 374,000+ frames from 261 identities captured indoors and outdoors with a DSLR and a mobile sensor. It labels clips as live, spoof, or props (occlusions) and compares MobileNetV3, MobileNet, EfficientNet, and ResNet-50. The DSLR maintains near-perfect spoof classification across distances, while mobile performance drops sharply beyond 50 m; MobileNetV3 classifies props at 55% at 75 m. EfficientNet reports the best overall result: 98.48% accuracy and 2.01% ACER. Tests on unseen attack datasets report 89-94% accuracy. The abstract identifies distance and sensor resolution as important difficulty factors; it says the dataset is planned for public release under an End-User License Agreement.

### Source excerpt

arXiv:2611.25108v1 Announce Type: new Abstract: Face presentation attack detection (PAD) systems deployed in border control and airport surveillance are constrained by a critical assumption: subjects are captured at close range, typically under one meter. No existing benchmark systematically addresses multi-distance capture, diverse environmental conditions, and concurrent spoofing and occlusion-based attacks, leaving deployed models underprepared for real-world scenarios. We introduce a video-based PAD dataset of 374,000+ frames from 261 unique identities collected across five standoff distances (1 m-100 m) under indoor and outdoor conditions using a DSLR camera (C) and a mobile sensor (M), with three-class labels: live, spoof, and props (occlusions); models are trained and evaluated on video clips rather than single frames. We fine-tune and benchmark four CNN architectures: MobileNetV3, MobileNet, EfficientNet, and ResNet-50. The higher-resolution DSLR maintains near-perfect spoof classification rate across all distances, while the lower-resolution mobile sensor degrades sharply beyond 50 m, with props classification rate dropping to 55% at 75 m for MobileNetV3. EfficientNet achieves the best overall performance (98.48% accuracy, ACER 2.01%). Generalization tests on unseen attack datasets yield 89-94% accuracy, validating cross-domain robustness. These results establish capture distance and sensor resolution as critical but underexplored axes of PAD difficulty. The dataset will be publicly released under an End-User License Agreement to support reproducible long-range PAD research.

## Rate-distortion Assessment for Hierarchical Content Summarization

DevFeed: [Rate-distortion Assessment for Hierarchical Content Summarization](<https://devfeed.tech/articles/rate-distortion-assessment-for-hierarchical-content-summarization-145014.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25151>)

Author: Yunye Gong, Indranil Sur, Jared Claypoole, Pritish Sahu, Ajay Divakaran

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [ai evaluation](<https://devfeed.tech/topics/ai-evaluation.md>), [Retrieval Augmented Generation (RAG)](<https://devfeed.tech/topics/retrieval-augmented-generation-rag.md>), [Enhancing AI model performance](<https://devfeed.tech/topics/enhancing-ai-model-performance.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>)

Tags: [assessment](<https://devfeed.tech/tags/assessment.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [budget](<https://devfeed.tech/tags/budget.md>), [compression](<https://devfeed.tech/tags/compression.md>), [content](<https://devfeed.tech/tags/content.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [design](<https://devfeed.tech/tags/design.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [framework](<https://devfeed.tech/tags/framework.md>), [generation](<https://devfeed.tech/tags/generation.md>), [generative](<https://devfeed.tech/tags/generative.md>), [generative-models](<https://devfeed.tech/tags/generative-models.md>), [guidance](<https://devfeed.tech/tags/guidance.md>), [hierarchy](<https://devfeed.tech/tags/hierarchy.md>), [information](<https://devfeed.tech/tags/information.md>), [insights](<https://devfeed.tech/tags/insights.md>), [language](<https://devfeed.tech/tags/language.md>), [language-models](<https://devfeed.tech/tags/language-models.md>)

### AI overview

The paper frames hierarchical summarization as information encoding and proposes extracting a source's semantic hierarchy to measure the trade-off between compression rate and information distortion. This enables model comparisons at a chosen rate budget. The authors report experiments on long-context question-answering summaries using state-of-the-art large language models, aimed at assessing efficiency and comprehension, and say that using the hierarchy to guide retrieval-augmented generation improves rate-distortion characteristics over current baselines. The supplied text gives no quantitative results or details of the baselines.

### Source excerpt

arXiv:2611.25151v1 Announce Type: new Abstract: Powerful generative models including large language and vision models have demonstrated success across a wide range of content generation, editing and manipulation tasks via end-to-end prompt-based generation. However, current assessment of the quality of generative content manipulation remains subjective, limiting scientific understanding of model capabilities. Inspired by rate-distortion theory from Shannon information compression theory, in this work we formalize hierarchical content summarization as an information encoding problem. We design a principled framework to extract the semantic hierarchy of the source content to support quantitative characterization of the rate-distortion trade-off between compression efficiency (rate) against information loss (distortion) during generative content manipulation, which allows us to benchmark various models with respect to performance conditional on rate budget of interest. We demonstrate the use of the framework with empirical experiments on content summarization for long-context question-answering with state-of-the-art large language models, offering new insights into their efficiency and comprehension capabilities. We further demonstrate the use of the semantic hierarchy as guidance for performing effective retrieval augmented generation, showing improved rate-distortion characteristics against current baselines.

## From Sequence Uncertainty to Phenotype Hypotheses: Uncertainty-Conditioned Inference over Biomedical Knowledge Graphs

DevFeed: [From Sequence Uncertainty to Phenotype Hypotheses: Uncertainty-Conditioned Inference over Biomedical Knowledge Graphs](<https://devfeed.tech/articles/from-sequence-uncertainty-to-phenotype-hypotheses-uncertainty-conditioned-inference-over-biomedical-knowledge-graphs-145053.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25422>)

Author: Huixin Zhan, Jason H. Moore

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [база знаний](<https://devfeed.tech/topics/tag-c51cc4bf76e5.md>), [Inference](<https://devfeed.tech/topics/inference.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [biomedical](<https://devfeed.tech/tags/biomedical.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [energy](<https://devfeed.tech/tags/energy.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [framework](<https://devfeed.tech/tags/framework.md>), [hypothesis](<https://devfeed.tech/tags/hypothesis.md>), [inference](<https://devfeed.tech/tags/inference.md>), [knowledge-graphs](<https://devfeed.tech/tags/knowledge-graphs.md>), [masks](<https://devfeed.tech/tags/masks.md>), [probability](<https://devfeed.tech/tags/probability.md>), [q-bio-gn](<https://devfeed.tech/tags/q-bio-gn.md>), [query](<https://devfeed.tech/tags/query.md>), [recall](<https://devfeed.tech/tags/recall.md>), [recovery](<https://devfeed.tech/tags/recovery.md>), [sequence](<https://devfeed.tech/tags/sequence.md>), [supervision](<https://devfeed.tech/tags/supervision.md>), [support](<https://devfeed.tech/tags/support.md>), [temperature](<https://devfeed.tech/tags/temperature.md>), [uncertainty](<https://devfeed.tech/tags/uncertainty.md>)

### AI overview

The framework turns genomic sequence predictions and calibrated uncertainty into probabilities over graph-supported phenotype hypotheses, without patient-level phenotype supervision. It scores admissible gene-disease-phenotype paths with a learned energy, uses query uncertainty to set the target temperature, and aggregates path probabilities while preserving traceable support. On AlzKB and Hetionet, phenotype entropy tracked upstream uncertainty (Spearman 0.951 and 0.878). Uncertainty-dependent temperature training improved held-out recall@10 over a comparable constant temperature. In gene hold-out, recall@10 exceeded trained DistMult on 24 of 30 graph masks (0.183 vs. 0.123), but the difference was driven mainly by three genes with many variants and was not established for all genes.

### Source excerpt

arXiv:2611.25422v1 Announce Type: new Abstract: Genomic foundation models provide variant-level evidence, but connecting that evidence to phenotype hypotheses requires accounting for uncertainty throughout structured reasoning. We introduce an uncertainty-conditioned path-energy framework that converts sequence predictions and calibrated predictive uncertainty into explicit distributions over graph-supported phenotype hypotheses, without patient-level phenotype supervision. An interpretable learned energy scores admissible gene--disease--phenotype routes, query uncertainty controls the target temperature, and path probabilities are aggregated into phenotype hypotheses. This formulation makes evidence quality an explicit determinant of hypothesis breadth while retaining traceable multi-path support. Exact normalization over enumerable candidate sets provides a reference for evaluating a Hastings-corrected learned revision operator. On AlzKB and Hetionet, phenotype-level entropy tracks upstream uncertainty, with Spearman correlations of 0.951 and 0.878, respectively; ablations identify the contribution of uncertainty conditioning. In masked-edge recovery, the model exceeds chance and degree-matched probability-permutation controls. Training the energy under the uncertainty-dependent temperature yields higher held-out recall@10 than training under a constant temperature of comparable magnitude. Under gene hold-out, recall@10 exceeds that of a trained DistMult embedding on 24 of 30 graph masks (0.183 versus 0.123); this difference is attributable mainly to three genes with many variants and is not established for all genes. These results establish an uncertainty-aware interface from genomic predictions to graph-supported phenotype hypotheses that combines interpretable probability allocation with held-out association recovery of explicitly stated scope.

## Multi-institutional grading of Barrett's esophagus dysplasia without stain normalization using a pathology foundation model and multiple instance learning

DevFeed: [Multi-institutional grading of Barrett's esophagus dysplasia without stain normalization using a pathology foundation model and multiple instance learning](<https://devfeed.tech/articles/multi-institutional-grading-of-barrett-s-esophagus-dysplasia-without-stain-normalization-using-a-pathology-foundation-model-and-multiple-instance-learning-145686.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26562>)

Author: Amirali Khosravi, Jaidip M. Jagtap, D. Chamil Codipilly, Catherine E. Hagen, Jason T. Lewis, Rickey E. Carter, Shahriar Faghani, Vani J. A. Konda, Fouad Otaki, Shajan Peter, Nicholas Shaheen, Sachin W

Published: 2026-11-20T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>)

Tags: [based](<https://devfeed.tech/tags/based.md>), [classification](<https://devfeed.tech/tags/classification.md>), [classifiers](<https://devfeed.tech/tags/classifiers.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [deep-learning](<https://devfeed.tech/tags/deep-learning.md>), [diagnostic](<https://devfeed.tech/tags/diagnostic.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [institutions](<https://devfeed.tech/tags/institutions.md>), [learning](<https://devfeed.tech/tags/learning.md>), [patch](<https://devfeed.tech/tags/patch.md>), [performance](<https://devfeed.tech/tags/performance.md>), [study](<https://devfeed.tech/tags/study.md>)

### AI overview

In a retrospective study of 969 H&E whole-slide images from four institutions, a foundation-model system graded Barrett's esophagus as non-dysplastic, low-grade, or high-grade dysplasia. Expert-annotated patch classifiers first identified relevant regions; attribute-aware multiple instance learning then produced slide-level classifications. On a held-out set of 130 slides, macro-averaged AUC was 0.96 (95% CI 0.93-0.98). For binary dysplasia detection, sensitivity was 98% and specificity 81%; no high-grade case was labeled non-dysplastic. Performance was consistent across institutions without stain normalization, suggesting the approach may reduce site-specific preprocessing needs. These are retrospective diagnostic-accuracy results, not evidence of clinical outcome benefit.

### Source excerpt

arXiv:2611.26562v1 Announce Type: cross Abstract: Barrett's esophagus dysplasia grading suffers substantial inter-observer variability, particularly for low-grade dysplasia, complicating clinical decision-making. We conducted a retrospective multi-institutional diagnostic accuracy study of a foundation model-based deep learning system for dysplasia grading, using 969 H\&E-stained whole slide images from four institutions. Patch-level classifiers trained on expert annotations identified diagnostically relevant regions, followed by attribute-aware multiple instance learning for slide-level classification as non-dysplastic Barrett's esophagus (NDBE), low-grade dysplasia, or high-grade dysplasia. On a held-out test set (n = 130), macro-averaged AUC was 0.96 (95\% CI 0.93--0.98). For binary dysplasia detection, sensitivity was 98\% (80/82) and specificity 81\% (39/48), with a negative likelihood ratio of 0.030 and quadratic-weighted \kap{} of 0.83 against expert consensus. No high-grade dysplasia case was misclassified as NDBE. Performance was consistent across institutions without stain normalization, indicating that stain-robust foundation-model representations may remove the site-specific preprocessing that has constrained prior systems to institution-specific deployment.

## C-LiTE: A Lightweight Foundation Model for Cellular feature learning in Histopathology

DevFeed: [C-LiTE: A Lightweight Foundation Model for Cellular feature learning in Histopathology](<https://devfeed.tech/articles/c-lite-a-lightweight-foundation-model-for-cellular-feature-learning-in-histopathology-145653.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26316>)

Author: Esha Sadia Nasir, Jiaqi Lv, Gozde N. Gunesli, Shan E Ahmed Raza

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>), [Dataset development](<https://devfeed.tech/topics/dataset-development.md>), [image recognition](<https://devfeed.tech/topics/image-recognition.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>)

Tags: [cellular](<https://devfeed.tech/tags/cellular.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [embedding](<https://devfeed.tech/tags/embedding.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [f1](<https://devfeed.tech/tags/f1.md>), [features](<https://devfeed.tech/tags/features.md>), [fewer](<https://devfeed.tech/tags/fewer.md>), [figure](<https://devfeed.tech/tags/figure.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [native](<https://devfeed.tech/tags/native.md>), [public](<https://devfeed.tech/tags/public.md>), [representation-learning](<https://devfeed.tech/tags/representation-learning.md>), [token](<https://devfeed.tech/tags/token.md>), [training-dataset](<https://devfeed.tech/tags/training-dataset.md>), [transformation](<https://devfeed.tech/tags/transformation.md>), [type](<https://devfeed.tech/tags/type.md>), [vit](<https://devfeed.tech/tags/vit.md>)

### AI overview

C-LiTE is a 22-million-parameter model for learning cellular features from H&E histopathology images. It processes 64x64-pixel cell-centred crops at native resolution, using 4x4-pixel patches to form a 16x16 token grid without upsampling; its patch embedding is initialized by adapting weights from a pre-trained ViT-5-S with a pseudoinverse-based transformation. The model is pre-trained on 60 million TCGA cell crops balanced across 19 cancer types and 16 tissue types. Across seven public datasets for mitotic figure recognition, nucleus and cell-type classification, and immune-cell phenotyping, frozen-feature evaluation yields mean macro-F1 0.670, close to CytoFormer's 0.682 with about 30 times fewer parameters. These findings are limited to the reported evaluation setting.

### Source excerpt

arXiv:2611.26316v1 Announce Type: cross Abstract: Characterising individual cells is fundamental to computational pathology, as cellular morphology informs tasks such as tumour grading, mitotic assessment and immune profiling. However, most pathology foundation models are trained on tissue patches and capture cellular features only implicitly, while existing cell-level models are either restricted to specific cell populations or rely on computationally expensive architectures with hundreds of millions of parameters. Applying ViTs directly to small cellular crops also presents an architectural challenge: upsampling increases computational cost without adding morphological information and may introduce interpolation artefacts. To address these limitations, we introduce C-LiTE, a lightweight foundation model for cellular representation learning in H&E-stained histopathology, with only 22 million parameters. C-LiTE employs a native-resolution tokenisation strategy tailored to cellular inputs, processing 64 x 64 px cell-centred crops using a 4 x 4 patch embedding to produce a 16 x 16 token grid without image upsampling. To transfer visual knowledge from large-scale pre-training, we adapt the patch embedding weights of a pre-trained ViT-5-S using a pseudoinverse-based transformation, enabling weight initialisation at the finer patch resolution. We further assemble a pre-training dataset of 60 million cell-centred crops from TCGA, balanced across 19 cancer types and 16 tissue types. To our knowledge, this represents the largest public dataset for self-supervised pre-training on H&E images at the cellular level. We evaluate C-LiTE on seven public datasets spanning mitotic figure recognition, nucleus and cell-type classification, and immune cell phenotyping. Under frozen-feature evaluation, C-LiTE achieves a mean macro-F1 of 0.670, approaching CytoFormer (0.682) with approximately 30x fewer parameters.

## FlexTSF: A Flexible Forecasting Model for Time Series with Variable Regularities

DevFeed: [FlexTSF: A Flexible Forecasting Model for Time Series with Variable Regularities](<https://devfeed.tech/articles/flextsf-a-flexible-forecasting-model-for-time-series-with-variable-regularities-144849.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2410.23160>)

Author: Jingge Xiao, Yile Chen, Gao Cong, Wolfgang Nejdl, Simon Gottschalk

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Time Series](<https://devfeed.tech/topics/time-series.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [attention](<https://devfeed.tech/tags/attention.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [domains](<https://devfeed.tech/tags/domains.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [ivp](<https://devfeed.tech/tags/ivp.md>), [missing-values](<https://devfeed.tech/tags/missing-values.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [time-series](<https://devfeed.tech/tags/time-series.md>), [transformer](<https://devfeed.tech/tags/transformer.md>), [zero-shot](<https://devfeed.tech/tags/zero-shot.md>)

### AI overview

FlexTSF targets forecasting across time series with uneven sampling, variable lengths, and missing values. Its continuous-time IVP Patcher handles these irregularities, while a decoder-only Transformer uses normalized timestamps, domain-specific statistical descriptors, and specialized causal self-attention to adapt across domains. The abstract reports experiments on 16 datasets, with FlexTSF outperforming existing models in classic forecasting, zero-shot generalization, and low-resource fine-tuning; it provides no detailed metrics or comparison breakdown.

### Source excerpt

arXiv:2410.23160v3 Announce Type: replace Abstract: Generalizing across time series with irregular temporal structures poses a persistent challenge for universal time series forecasting models. Existing approaches often assume regular sampling or depend heavily on imputation, which limits their applicability in real-world scenarios where irregularities are prevalent due to diverse sensing devices and recording practices. To address this gap, we propose FlexTSF, a flexible and domain-adaptive forecasting model specifically designed for time series with variable temporal regularities. At its foundation lies the IVP Patcher, a continuous-time patching module leveraging Initial Value Problems (IVPs) to inherently handle uneven sampling intervals, variable sequence lengths, and missing values. Built upon a decoder-only Transformer architecture, FlexTSF integrates normalized timestamp inputs and domain-specific statistical descriptors through a specialized causal self-attention mechanism, enabling adaptability across domains. Extensive experiments on 16 datasets demonstrate FlexTSF's effectiveness, significantly outperforming existing models in classic forecasting scenarios, zero-shot generalization, and low-resource fine-tuning conditions.

## Parameter-Efficient Adaptation of Self-supervised Vision Backbones Survives Distribution Shift in Radar Micro-Doppler HAR

DevFeed: [Parameter-Efficient Adaptation of Self-supervised Vision Backbones Survives Distribution Shift in Radar Micro-Doppler HAR](<https://devfeed.tech/articles/parameter-efficient-adaptation-of-self-supervised-vision-backbones-survives-distribution-shift-in-radar-micro-doppler-har-145113.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25874>)

Author: Keryan Chelouche (ETIS UMR 8051, CY Cergy Paris Universit\\'e, ENSEA, CNRS, Cergy, France, Fondation L\\'eonie Chaptal, Sarcelles, France), Petr Dobias (ETIS UMR 8051, CY Cergy Paris Universit\\'e, ENSEA

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [peft](<https://devfeed.tech/topics/peft.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>)

Tags: [adapter](<https://devfeed.tech/tags/adapter.md>), [application](<https://devfeed.tech/tags/application.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [doppler](<https://devfeed.tech/tags/doppler.md>), [few-shot](<https://devfeed.tech/tags/few-shot.md>), [fewer](<https://devfeed.tech/tags/fewer.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [foundation](<https://devfeed.tech/tags/foundation.md>), [image](<https://devfeed.tech/tags/image.md>), [improvements](<https://devfeed.tech/tags/improvements.md>), [layer](<https://devfeed.tech/tags/layer.md>), [orientation](<https://devfeed.tech/tags/orientation.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [peft](<https://devfeed.tech/tags/peft.md>), [pretraining](<https://devfeed.tech/tags/pretraining.md>), [probing](<https://devfeed.tech/tags/probing.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [radar](<https://devfeed.tech/tags/radar.md>), [shift](<https://devfeed.tech/tags/shift.md>), [vision](<https://devfeed.tech/tags/vision.md>)

### AI overview

In the reported radar micro-Doppler HAR evaluations, parameter-efficient fine-tuning (PEFT) avoided two failures seen with alternatives: full fine-tuning hurt cross-dataset transfer, while frozen features under-adapted across orientations. DINOv3 adapted with PiSSA ranked first among PEFT methods in every tested setting. Its Small variant matched the prior Base-size PEFT state of the art in in-distribution accuracy with 4.5 times fewer total parameters and only 3% trainable; it also beat a size-matched baseline across evaluated settings, with transfer gains of 2.1, 6.6, and 8.9 percentage points as shift severity increased. Ablations credited gains to both pretraining and adapter design, with pretraining contributing most under compound shift.

### Source excerpt

arXiv:2611.25874v1 Announce Type: new Abstract: Micro-Doppler radar enables contactless, privacy-preserving human activity recognition (HAR), but deployment robustness remains underexplored. We compared full fine-tuning, frozen probing, and parameter-efficient fine-tuning (PEFT) using subject-disjoint in-distribution cross-validation and few-shot cross-age, cross-orientation, and cross-dataset transfer. Full fine-tuning suffered negative cross-dataset transfer, while frozen features under-adapted on cross-orientation. Only PEFT avoided both failures. We paired DINOv3 with all-layer principal-singular-direction adaptation (PiSSA), to our knowledge the first application of a self-supervised image foundation backbone to radar micro-Doppler HAR. DINOv3-PiSSA ranked first among PEFT methods in every evaluated setting. Under our protocol, its Small variant matched the in-distribution accuracy of the prior Base-size PEFT state of the art using 4.5x fewer total parameters, with only 3% trainable. It surpassed a size-matched variant of that baseline in every evaluated setting, with transfer gains increasing with shift severity: 2.1, 6.6, and 8.9 percentage points, respectively. Ablations attributed improvements to both pretraining and adapter recipe, with the pretraining contributing most under compound shift. Code and protocol are available at https://github.com/KeryanChelouche/udoppler-ssl.

## Reinforcement-Aligned Probabilistic Weather Forecasting with Discrete Tokens

DevFeed: [Reinforcement-Aligned Probabilistic Weather Forecasting with Discrete Tokens](<https://devfeed.tech/articles/reinforcement-aligned-probabilistic-weather-forecasting-with-discrete-tokens-145071.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.25570>)

Author: Jinhan Li, Zhisheng Chen, Yuxuan Li, Yuan Gao, Fan Xu, Hao Wu, Jinlong Du, Kun Wang

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Climate / Weather / Ocean Modeling](<https://devfeed.tech/topics/climate-weather-ocean-modeling.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [grpo](<https://devfeed.tech/topics/grpo.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [autoregressive](<https://devfeed.tech/tags/autoregressive.md>), [caching](<https://devfeed.tech/tags/caching.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [group-relative-policy-optimization](<https://devfeed.tech/tags/group-relative-policy-optimization.md>), [grpo](<https://devfeed.tech/tags/grpo.md>), [ocean](<https://devfeed.tech/tags/ocean.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [reward](<https://devfeed.tech/tags/reward.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [scale](<https://devfeed.tech/tags/scale.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [skill](<https://devfeed.tech/tags/skill.md>), [temperature](<https://devfeed.tech/tags/temperature.md>), [tokens](<https://devfeed.tech/tags/tokens.md>), [transformer](<https://devfeed.tech/tags/transformer.md>), [weather](<https://devfeed.tech/tags/weather.md>), [weather-forecasting](<https://devfeed.tech/tags/weather-forecasting.md>)

### AI overview

WeatherCraft uses coarse-to-fine discrete weather tokens and a Transformer that predicts tokens in parallel within each scale to generate probabilistic medium-range forecasts. Exact token log-probabilities let Group Relative Policy Optimization optimize downstream rewards without differentiating through evaluators or coupled models. On ERA5, its eight-member ensemble mean reduced day-15 normalized RMSE by 17.6% versus the strongest evaluated deterministic baseline; with KV caching, inference was about 18x faster than GenCast. The abstract reports improved ensemble skill from direct fair-CRPS adaptation and better forecasts of persistent land-temperature and coupled ocean-temperature extremes from reward-based post-training. These are abstract-level results; details of evaluation and broader performance are not provided.

### Source excerpt

arXiv:2611.25570v1 Announce Type: new Abstract: Global medium-range weather forecasting must not only generate ensembles efficiently to characterize uncertainty in future states, but also serve downstream applications such as extreme-event warnings and cross-sphere coupled simulations. We introduce WeatherCraft, a framework that unifies probabilistic generation and reinforcement learning alignment through discrete weather tokens, bringing the GPT-style pretraining--post-training paradigm to global medium-range weather forecasting. A multiscale tokenizer represents atmospheric states as a coarse-to-fine token hierarchy, while a Transformer models causal dependencies across time and scale and predicts tokens within each scale in parallel. Direct sampling generates diverse ensembles, and exact token log-probabilities enable Group Relative Policy Optimization (GRPO) to maximize downstream task rewards without differentiating through evaluators or coupled models. On the ERA5 benchmark, WeatherCraft's eight-member ensemble mean reduces day-15 normalized RMSE by 17.6% relative to the strongest evaluated deterministic baseline and, with KV caching, achieves an approximately $18\times$ inference speedup over GenCast. Direct fair-CRPS adaptation improves ensemble probabilistic skill, while reward-based post-training improves forecasts of persistent land temperature extremes and coupled ocean heat extremes. This work establishes discrete autoregressive modeling as a general foundation for scalable, task-alignable Earth system foundation models.

## GroundingPI: A Grounding Foundation Model towards Physical Intelligence with Visual Primitives

DevFeed: [GroundingPI: A Grounding Foundation Model towards Physical Intelligence with Visual Primitives](<https://devfeed.tech/articles/groundingpi-a-grounding-foundation-model-towards-physical-intelligence-with-visual-primitives-144951.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.39601>)

Author: Qize Yu, Lianrui Fan, Boyu Chen, Jiaqi Liang, Xini Ding, Yue Chen, Zetian Song, Yuran Wang, Yi Zou, Kaixuan Wang, Tianxing Chen, Wenxuan Song, Bohan Zhou, Mingleyang Li, Siqiao Huang, Yuqi Ye, Caigao

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Physical AI](<https://devfeed.tech/topics/physical-ai.md>), [Robot Manipulation](<https://devfeed.tech/topics/robot-manipulation.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [grpo](<https://devfeed.tech/topics/grpo.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [scaling laws](<https://devfeed.tech/topics/scaling-laws.md>)

Tags: [autonomous-driving](<https://devfeed.tech/tags/autonomous-driving.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ro](<https://devfeed.tech/tags/cs-ro.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [grounding](<https://devfeed.tech/tags/grounding.md>), [grpo](<https://devfeed.tech/tags/grpo.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [ocr](<https://devfeed.tech/tags/ocr.md>), [pretraining](<https://devfeed.tech/tags/pretraining.md>), [robotic-manipulation](<https://devfeed.tech/tags/robotic-manipulation.md>)

### AI overview

GroundingPI is a 4B model that represents points and boxes as quantized coordinates in a shared vocabulary, trained with multimodal and spatial pretraining, supervised fine-tuning, and GRPO reinforcement learning. The abstract reports an average of 73.68% across 34 grounding benchmarks, ahead of the larger GPT-6 Astra at 71.54%. As a visual backbone, it outperformed evaluated alternatives in all four out-of-distribution settings across RoboTwin 2.0 and RoboCasa-GR1, with gains up to 24.8%; on RoboCasa-GR1, using 50% of demonstrations beat baselines using 75%. Its mean open-loop L2 error on nuScenes was 0.296 m. The authors report that greater pretraining scale improved grounding and manipulation, dense grounding benefited both, and OCR may aid perceptual learning.

### Source excerpt

arXiv:2609.39601v3 Announce Type: replace-cross Abstract: Precise grounding matters. It specifies which object is the target and where that object is, even in clutter and for tiny objects, and it has to be fast enough for closed-loop control. Yet vision-language-action (VLA) and world-action models (WAMs) take perception from general-purpose vision-language and video-generation backbones, which still fail in these settings. We introduce GroundingPI, a 4B grounding foundation model that generates points and boxes as quantized coordinates in a shared vocabulary. Training combines multimodal and spatial pretraining, supervised fine-tuning, and reinforcement learning with GRPO, using supervision from public datasets and dedicated data engines. Against 44 baselines across 34 grounding benchmarks spanning 11 perceptual capabilities, GroundingPI establishes a new state of the art, averaging 73.68%, above the larger GPT-6 Astra (71.54%). As a downstream visual backbone, GroundingPI improves performance on robotic manipulation and autonomous driving. Across RoboTwin 2.0 and RoboCasa-GR1, it outperforms all evaluated backbones in all four out-of-distribution settings, with relative gains of up to 24.8% over the strongest baseline. On RoboCasa-GR1, GroundingPI trained with 50% of the demonstrations outperforms those baselines trained with 75%. Its mean open-loop L2 error on nuScenes is 0.296 m. We systematically analyze GroundingPI's pretraining in scale and data composition. Grounding quality and downstream manipulation improve with pretraining scale, with generalization tracking perceptual gains most closely. Analyzing the data recipe across these 11 perceptual capabilities shows dense grounding's substantial benefits for both, and OCR's potential as a catalyst for perceptual learning. These results support grounding as a perceptual foundation, and dedicated perceptual pretraining as a promising direction for foundation models of physical intelligence.

## Xaurora: Generative Weather Forecasting with Denoising Stochastic Interpolants from a Foundation Model Prior

DevFeed: [Xaurora: Generative Weather Forecasting with Denoising Stochastic Interpolants from a Foundation Model Prior](<https://devfeed.tech/articles/xaurora-generative-weather-forecasting-with-denoising-stochastic-interpolants-from-a-foundation-model-prior-144958.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.06509>)

Author: Eliot Walt, Miltiadis Kofinas, Nikolaj M\\"ucke, Efstratios Gavves, Dim Coumou

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Climate / Weather / Ocean Modeling](<https://devfeed.tech/topics/climate-weather-ocean-modeling.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Training AI Models](<https://devfeed.tech/topics/training-ai-models.md>)

Tags: [buffer](<https://devfeed.tech/tags/buffer.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [extreme-weather](<https://devfeed.tech/tags/extreme-weather.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [generative](<https://devfeed.tech/tags/generative.md>), [global](<https://devfeed.tech/tags/global.md>), [has](<https://devfeed.tech/tags/has.md>), [large](<https://devfeed.tech/tags/large.md>), [novel](<https://devfeed.tech/tags/novel.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [physics-ao-ph](<https://devfeed.tech/tags/physics-ao-ph.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>), [range](<https://devfeed.tech/tags/range.md>), [sample](<https://devfeed.tech/tags/sample.md>), [sde](<https://devfeed.tech/tags/sde.md>), [skill](<https://devfeed.tech/tags/skill.md>), [small](<https://devfeed.tech/tags/small.md>), [train](<https://devfeed.tech/tags/train.md>), [uncertainty-quantification](<https://devfeed.tech/tags/uncertainty-quantification.md>), [weather](<https://devfeed.tech/tags/weather.md>), [weather-forecasting](<https://devfeed.tech/tags/weather-forecasting.md>)

### AI overview

Xaurora extends the pretrained Aurora weather foundation model into a stochastic ensemble forecaster, addressing deterministic forecasts' limits for uncertainty estimates and the cost of training a model from scratch. It is finetuned from Aurora's small version using Denoising Stochastic Interpolants and a replay buffer for Stochastic Differential Equation rollouts, which the abstract says enables probabilistic trajectory training. The authors report that Xaurora approaches state of the art on global ensemble metrics, is competitive with Aurora's large version, and produces skilful 15-day forecasts in seven minutes. The abstract characterizes the method as parameter- and sample-efficient; it provides no further evaluation details here.

### Source excerpt

arXiv:2610.06509v2 Announce Type: replace Abstract: Deep learning has revolutionised weather forecasting in recent years, especially through atmospheric foundation models, which offer competitive skill for a fraction of the computational costs of classic physics-based models. However, most existing foundation models are deterministic, limiting the generation of large ensembles for accurate uncertainty quantification, extreme weather risk assessment, and long-range weather forecasting. Furthermore, these models incur a large, often prohibitive, computational overhead to train from scratch. To address these shortcomings, we turn a pretrained deterministic prior model, namely the Aurora foundation model, into a generative ensemble-prediction model. To that end, we introduce a novel generative method, Denoising Stochastic Interpolants, combined with a replay buffer for Stochastic Differential Equation (SDE) rollout, enabling probabilistic training of SDE trajectories. Our stochastic foundation model, Xaurora, is finetuned from the small Aurora version, yet it approaches the state-of-the-art on global ensemble metrics and is competitive with the large version of Aurora. Our method is parameter and sample efficient, and generates skilful 15-day forecasts in 7 minutes. Our results demonstrate that deterministic foundation models can be efficiently extended into even stronger stochastic models.

## A new algorithmic approach for finding flat minima: critically damped Polyak stepsizes

DevFeed: [A new algorithmic approach for finding flat minima: critically damped Polyak stepsizes](<https://devfeed.tech/articles/a-new-algorithmic-approach-for-finding-flat-minima-critically-damped-polyak-stepsizes-145186.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.26475>)

Author: Francesco Caporali, Jason M. Altschuler, Boris Hanin

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [cdp](<https://devfeed.tech/tags/cdp.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [flat](<https://devfeed.tech/tags/flat.md>), [gradient-descent](<https://devfeed.tech/tags/gradient-descent.md>), [guarantees](<https://devfeed.tech/tags/guarantees.md>), [learning](<https://devfeed.tech/tags/learning.md>), [llms](<https://devfeed.tech/tags/llms.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [networks](<https://devfeed.tech/tags/networks.md>), [neural-networks](<https://devfeed.tech/tags/neural-networks.md>), [objectives](<https://devfeed.tech/tags/objectives.md>), [sam](<https://devfeed.tech/tags/sam.md>), [student](<https://devfeed.tech/tags/student.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

The proposed critically damped Polyak (CDP) stepsize multiplies the classical Polyak rule by 4 and a mild damping factor. The authors say the factor produces leading-order equioscillations around the minimizer manifold, while damping drives convergence toward it. For locally quadratic Morse-Bott objectives, they establish uniform-in-time guarantees for sharpness and loss reduction. At low loss, projected iterates follow gradient descent on log top-eigenvalue sharpness along the minimizer manifold to leading order. Unlike normalized gradient descent, CDP step lengths shrink with distance to that manifold, allowing convergence to an interpolating solution that locally minimizes sharpness at finite learning rate. Experiments report flattening similar to SAM, including in nonlinear teacher-student networks and pretrained-LLM fine-tuning; these settings extend beyond the stated theory.

### Source excerpt

arXiv:2611.26475v1 Announce Type: new Abstract: We present a new adaptive stepsize rule that biases gradient descent toward flatter minima in both theory and practice, and establish the first uniform-in-time guarantees for both sharpness and loss reduction for a broad class of locally quadratic objectives. Our critically damped Polyak (CDP) stepsizes multiply the classical Polyak rule by $4$ and a mild damping factor. The factor $4$ is critical in that it produces equioscillations around the manifold of minimizers $\mathcal{M}$ to leading order. Damping provably drives convergence to $\mathcal{M}$. CDP thus operates at the edge of stability by adapting its stepsizes to local curvature. Once the loss is small, its projected iterates follow gradient descent on $\log{\lambda_1(\nabla^2 \mathcal{L})}$ along $\mathcal{M}$ to leading order, paralleling the flatness bias of normalized gradient descent (Arora et al., 2022). Unlike normalized gradient descent, CDP step lengths shrink with the distance to $\mathcal{M}$, enabling convergence to an interpolating solution that locally minimizes sharpness at finite learning rate. We establish our theory for a broad class of non-negative losses with locally quadratic Morse-Bott structure near $\mathcal{M}$, capturing regular interpolation regimes in smooth overparameterized neural networks. Empirically, CDP stepsizes produce a flattening effect similar to that of Sharpness-Aware Minimization (SAM, Foret et al., 2021), reducing sharpness even in settings beyond our theory, including nonlinear teacher-student networks and fine-tuning of pre-trained LLMs.

## Why a Computer Scientist Thinks Superintelligence Won't Happen

DevFeed: [Why a Computer Scientist Thinks Superintelligence Won't Happen](<https://devfeed.tech/articles/why-a-computer-scientist-thinks-superintelligence-won-t-happen-145256.md>)

Original publisher: [Read original article](<https://spectrum.ieee.org/ai-superintelligence-debate>)

Author: Cal Newport

Published: 2026-11-19T12:00:03Z

Content type: opinion

Language: en

Sources: [IEEE Spectrum](<https://devfeed.tech/sources/ieee-spectrum.md>)

Topics: [superintelligence](<https://devfeed.tech/topics/superintelligence.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [ai alignment](<https://devfeed.tech/topics/ai-alignment.md>), [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [agentic workflows](<https://devfeed.tech/topics/agentic-workflows.md>), [computational complexity](<https://devfeed.tech/topics/computational-complexity.md>), [AI Engineering](<https://devfeed.tech/topics/ai-engineering.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>)

Tags: [agi](<https://devfeed.tech/tags/agi.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-companies](<https://devfeed.tech/tags/ai-companies.md>), [alignment](<https://devfeed.tech/tags/alignment.md>), [anthropic](<https://devfeed.tech/tags/anthropic.md>), [anthropic-ceo-dario-amodei](<https://devfeed.tech/tags/anthropic-ceo-dario-amodei.md>), [artificial-general-intelligence](<https://devfeed.tech/tags/artificial-general-intelligence.md>), [asi](<https://devfeed.tech/tags/asi.md>), [autonomous](<https://devfeed.tech/tags/autonomous.md>), [capabilities](<https://devfeed.tech/tags/capabilities.md>), [computer](<https://devfeed.tech/tags/computer.md>), [control](<https://devfeed.tech/tags/control.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [engineers](<https://devfeed.tech/tags/engineers.md>), [extinction](<https://devfeed.tech/tags/extinction.md>), [large-language-models](<https://devfeed.tech/tags/large-language-models.md>), [openai](<https://devfeed.tech/tags/openai.md>), [recursive-self-improvement](<https://devfeed.tech/tags/recursive-self-improvement.md>), [rsi](<https://devfeed.tech/tags/rsi.md>), [science](<https://devfeed.tech/tags/science.md>), [singularity](<https://devfeed.tech/tags/singularity.md>), [superintelligence](<https://devfeed.tech/tags/superintelligence.md>)

### AI overview

The author argues that recursive self-improvement leading to superintelligence remains highly speculative: post-training depends on suitable feedback data, major AI advances require substantial scientific work, and compute is finite. Computer science also shows that some problems are unsolvable or practically intractable, while AI progress remains uneven across tasks. The article attributes reported hacking incidents to long-running agents that let LLM outputs guide actions with few constraints, and contrasts these with task-specific systems such as AlphaFold and autonomous driving. It warns that pursuing self-improving systems may still increase risks by making AI harder to understand and control, and calls for more independent scrutiny.

### Source excerpt

Many people were caught off guard this past summer when employees of one of the world's leading AI companies began casually debating whether their products would lead to human extinction. It started when Anthropic researcher Jacob Coxon announced his resignation, warning that his employer and OpenAI were "racing straight to self-improving superintelligence and gambling with our lives." Evan Hubinger, Anthropic's head of alignment science, replied, "Jacob is correct here--we really do earnestly believe AI could kill all humans!" And Anthropic CEO Dario Amodei subsequently told CNN, "I agree with Jacob much more than I disagree with him." These concerns stem from a belief that has circulated in futurist circles for many decades: Once engineers design an AI system capable of improving itself, it will trigger an accelerating cycle of autonomous upgrades known as recursive self-improvement (RSI). The result will be artificial superintelligence (ASI), a system with cognitive capabilities so vastly exceeding those of humans that it will easily evade our control and perhaps even wipe out our species. Artificial superintelligence is, it should be noted, a far more ambitious goal than artificial general intelligence (AGI), which generally refers to AI that can match human capabilities across a broad range of cognitive tasks. These ideas have prompted varied reactions. Some argue that the concept of ASI is being used for marketing or to instigate regulation that will help the incumbent labs squash new competitors. Others focus on the plausibility of such systems killing us all, debating the finer points of specific scenarios such as AI-engineered superviruses. Still others claim that aligning ASI to human interests is feasible and so we should rush ahead to usher in this digital utopia. Amid these conversations, one question has received comparatively little attention: From an engineering perspective, is superintelligence even possible? The answer is important because it can he

[Next page](<https://devfeed.tech/topics/ai-foundation-models.md?cursor=WyIyMDI2LTExLTE5VDEyOjAwOjAzKzAwOjAwIiwgIjM1OTg3NDYyLTM4ODMtNGRhZi1iNDlkLWYxODI4YTUzMDg2MiJd>)