# Predictive AI

Predictive AI uses historical data, statistical analysis, and machine learning models to identify patterns and forecast future or unknown outcomes.

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

## LIFT: Latent Flow Matching for Probabilistic Cell Fate Dynamics with Single Cell Snapshots

DevFeed: [LIFT: Latent Flow Matching for Probabilistic Cell Fate Dynamics with Single Cell Snapshots](<https://devfeed.tech/articles/lift-latent-flow-matching-for-probabilistic-cell-fate-dynamics-with-single-cell-snapshots-145117.md>)

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

Author: Bowen Yang, Junda Ying, Yuxuan Wang, Peijie Zhou, Lei Zhang

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

Content type: article

Language: en

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

Topics: [VAE](<https://devfeed.tech/topics/vae.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decoder](<https://devfeed.tech/tags/decoder.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [error](<https://devfeed.tech/tags/error.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [fate](<https://devfeed.tech/tags/fate.md>), [flow](<https://devfeed.tech/tags/flow.md>), [flow-matching](<https://devfeed.tech/tags/flow-matching.md>), [framework](<https://devfeed.tech/tags/framework.md>), [future](<https://devfeed.tech/tags/future.md>), [generation](<https://devfeed.tech/tags/generation.md>), [inference](<https://devfeed.tech/tags/inference.md>), [learning](<https://devfeed.tech/tags/learning.md>), [monte-carlo](<https://devfeed.tech/tags/monte-carlo.md>), [one-to-many](<https://devfeed.tech/tags/one-to-many.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [single-cell](<https://devfeed.tech/tags/single-cell.md>)

### AI overview

LIFT models probabilistic cell fates from lineage-informed couplings, which connect cells through clonal ancestry without identifying unique source-to-descendant pairs. Variational inference represents alternative outcomes in a latent space, and a conditional prior allows sampling using only an initial cell state. Its Mean Flow decoder predicts the future state in a single evaluation per sample, supporting large-scale Monte Carlo prediction. The paper also analyzes conditional prediction error and reports experiments on synthetic and real datasets that recover population distributions and cell-fate probabilities.

### Source excerpt

arXiv:2611.25917v1 Announce Type: new Abstract: Lineage tracing links cell states through clonal ancestry, but does not generally identify unique source-descendant pairings. Learning from such data therefore requires a model of conditional outcomes, rather than only the terminal population distribution. We introduce LIFT, a latent flow framework for probabilistic cell-state generation from lineage-informed couplings. Variational inference encodes alternative outcomes in a latent space, while a conditional prior enables sampling from the initial state alone. A Mean Flow decoder predicts future cell state directly, requiring one decoder evaluation per sampling, which makes it convenient to predict cell fate through large scale Monte-Carlo sampling. This construction combines a representation of one-to-many relationships with efficient sampling and an analysis of conditional prediction error. Experiments on synthetic and real datasets demonstrate LIFT's ability to recover both population distribution and cell fate probabilities.

## Now You See Me Now You Don't: A Framework To Detect and Reduce Proxy Capacity

DevFeed: [Now You See Me Now You Don't: A Framework To Detect and Reduce Proxy Capacity](<https://devfeed.tech/articles/now-you-see-me-now-you-don-t-a-framework-to-detect-and-reduce-proxy-capacity-145044.md>)

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

Author: Nirek Sharma

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [application](<https://devfeed.tech/tags/application.md>), [capacity](<https://devfeed.tech/tags/capacity.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [disparate-impact](<https://devfeed.tech/tags/disparate-impact.md>), [domains](<https://devfeed.tech/tags/domains.md>), [fairness](<https://devfeed.tech/tags/fairness.md>), [feature](<https://devfeed.tech/tags/feature.md>), [features](<https://devfeed.tech/tags/features.md>), [framework](<https://devfeed.tech/tags/framework.md>), [frameworks](<https://devfeed.tech/tags/frameworks.md>), [groups](<https://devfeed.tech/tags/groups.md>), [learning](<https://devfeed.tech/tags/learning.md>), [lending](<https://devfeed.tech/tags/lending.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [methodology](<https://devfeed.tech/tags/methodology.md>), [proxy](<https://devfeed.tech/tags/proxy.md>), [reduce](<https://devfeed.tech/tags/reduce.md>)

### AI overview

The paper proposes a two-part framework for reducing disparate treatment risk while retaining useful predictive signal. Its quantitative proxy-capacity test checks whether feature values reveal membership in a demographic group; a preprocessing method then adjusts proxy features to reduce that capacity. Experiments on synthetic and public datasets reportedly show that adjusted features retain task-relevant signal and improve predictive performance compared with removing the features. The excerpt describes these findings but gives no implementation details or quantitative results.

### Source excerpt

arXiv:2611.25327v1 Announce Type: new Abstract: In regulated domains such as lending, the two most salient fairness concepts are disparate impact and disparate treatment: disparate impact is generally defined by differential rates of adverse outcomes between demographic groups, while disparate treatment is generally defined by the use of demographic information or proxies to issue decisions. There already exist established methods to quantitatively detect and mitigate disparate impact; however, there has been less research on doing the same for disparate treatment. From a practitioner's perspective, the manner in which a conditional independence test is formulated and operationalized to identify proxies is nuanced and underexplored. As Machine Learning (ML) systems increase in scope and application in regulated domains, practitioners need a defensible framework to identify proxies at scale. Current disparate treatment frameworks typically rely upon some combination of quantitative and qualitative review of models' inputs to identify proxies. Features that are identified as proxies are then typically removed from the model in practice, and predictive performance degrades in favor of fairness through unawareness. Here, we propose a two-part framework that reduces the disparate treatment risk of a feature and keeps the predictive performance that removal of the feature loses. First, we propose a quantitative test for proxy capacity that identifies whether some of a feature's values reveal membership in a particular demographic group. Second, we propose a pre-processing methodology that adjusts those proxy features to reduce their proxy capacity. We show empirically on synthetic and public datasets that this framework identifies features that proxy for demographic information and reduces their proxy capacity while the adjusted feature retains task-relevant signal (i.e. improves predictive performance versus removal).

## 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.

## Anticipating Future Build Results with BuildPredictor

DevFeed: [Anticipating Future Build Results with BuildPredictor](<https://devfeed.tech/articles/anticipating-future-build-results-with-buildpredictor-145187.md>)

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

Author: Christian Macho, Katharina Stengg

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

Content type: article

Language: en

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

Topics: [CI/CD](<https://devfeed.tech/topics/cicd.md>), [Continuous integration](<https://devfeed.tech/topics/continuous-integration.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [cost-optimization](<https://devfeed.tech/topics/cost-optimization.md>)

Tags: [build](<https://devfeed.tech/tags/build.md>), [changes](<https://devfeed.tech/tags/changes.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [continuous-integration](<https://devfeed.tech/tags/continuous-integration.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [interpretability](<https://devfeed.tech/tags/interpretability.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model](<https://devfeed.tech/tags/model.md>), [performance](<https://devfeed.tech/tags/performance.md>), [random](<https://devfeed.tech/tags/random.md>), [save](<https://devfeed.tech/tags/save.md>), [testing](<https://devfeed.tech/tags/testing.md>), [time](<https://devfeed.tech/tags/time.md>)

### AI overview

BuildPredictor uses a random forest to predict CI build outcomes from features including source and build code changes, code complexity changes, and historical build results, with the goal of avoiding unnecessary build runs. The abstract reports median MCC scores of 0.82 in an intra-project setting and 0.86 in a holistic setting. Historical build information was most important, but the model still achieved decent performance when those harder-to-interpret features were removed, improving interpretability. It also reportedly reached peak performance quickly over time. The abstract does not specify the evaluated projects or operational criteria for skipping builds.

### Source excerpt

arXiv:2611.26476v1 Announce Type: cross Abstract: Continuous Integration (CI) is a popular programming practice for the seamless integration of code changes into the code base. Using CI, developers benefit from automated assembling and testing of the code after each commit. However, while the frequent integration and building supports developers, it also comes at the high costs of wasting time and resources for minimal changes. In this work, we investigate the potential of reducing the drawbacks by anticipating the build outcome using machine learning techniques. In particular, we propose a random forest model with various features such as changes to the source and build code, and changes to the complexity of the code. We observe that our model shows a good performance in an intra-project and holistic setting yielding a median MCC of 0.82 and 0.86, respectively. We also found that the most important features of our model concern the historical build result information. Additionally, we investigated the development of the performance of our model over time and found that our model can quickly arrive at its peak performance. In an additional experiment, we removed the hard-to-interpret historical build information features and found that our model still yields decent performance while improving the interpretability of it. Summarizing, our model can help to avoid unnecessary build runs by anticipating the build result and thus, save resources.

## PriTabICL: Differentially Private Tabular In-Context Learning with Task-Aligned Cluster-Wise Synthesis

DevFeed: [PriTabICL: Differentially Private Tabular In-Context Learning with Task-Aligned Cluster-Wise Synthesis](<https://devfeed.tech/articles/pritabicl-differentially-private-tabular-in-context-learning-with-task-aligned-cluster-wise-synthesis-145006.md>)

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

Author: Syed Ahzaz Shah, Evan Bramblett, H\\'eber H. Arcolezi, Chen Gong, Qianqian Tong, Xiaochen Li

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

Content type: article

Language: en

Sources: [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: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Structured-data](<https://devfeed.tech/topics/structured-data.md>), [Open Source Models & Datasets](<https://devfeed.tech/topics/open-source-models-datasets.md>)

Tags: [clusters](<https://devfeed.tech/tags/clusters.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [differential-privacy](<https://devfeed.tech/tags/differential-privacy.md>), [feature](<https://devfeed.tech/tags/feature.md>), [in-context-learning](<https://devfeed.tech/tags/in-context-learning.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [real-world](<https://devfeed.tech/tags/real-world.md>), [synthesis](<https://devfeed.tech/tags/synthesis.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>)

### AI overview

PriTabICL aims to preserve prediction-relevant relationships in differentially private Tabular In-Context Learning demonstrations. It partitions records into differentially private clusters, synthesizes each cluster independently using a fixed feature-target workload, and routes each query to a cluster whose synthetic records supply demonstrations without additional privacy loss for the original records. The authors report experiments on four real-world datasets; PriTabICL-PrivSyn improves on global PrivSyn in 8 of 12 settings and outperforms existing private TabICL approaches in nearly all evaluated settings. These are abstract-level reported results; no metrics or detailed experimental conditions are supplied here.

### Source excerpt

arXiv:2611.25073v1 Announce Type: cross Abstract: Tabular in-context learning (TabICL) enables large language models (LLMs) to predict target records using a handful of labeled demonstrations in their prompts. However, these demonstrations often contain sensitive personal information. Differential privacy (DP) offers principled protection, but noise-based methods introduce substantial noise, distorting the feature-label relationships essential for accurate prediction, especially as data dimensionality grows. In this work, we study DP data synthesis for generating privacy-preserving TabICL demonstrations. We identify two limitations of directly applying general-purpose DP synthesis to entire datasets: modeling a global distribution can obscure local structure and minority patterns in heterogeneous data, while measuring broad attribute dependencies under a limited privacy budget can reduce the accuracy available for relationships most relevant to prediction. More broadly, global statistical fidelity may fail to preserve heterogeneous structures needed by downstream predictive and generative models. To address these challenges, we propose PriTabICL, a general framework compatible with existing DP synthesis algorithms. It partitions records into DP clusters and synthesizes each independently, using a fixed feature-target workload to prioritize prediction-relevant statistical relationships. At inference, each query is routed to a DP cluster, and demonstrations are sampled from its synthetic dataset without additional privacy loss for the original records. Experiments on four real-world datasets demonstrate the effectiveness of our methods across heterogeneous datasets. In particular, one of our instantiations, PriTabICL-PrivSyn, improves over global PrivSyn in 8 out of 12 settings and outperforms existing private TabICL approaches in nearly all evaluated settings. Open-source code is available.

## Pareto-Optimal and Strategyproof Data-Sharing Between Competitors

DevFeed: [Pareto-Optimal and Strategyproof Data-Sharing Between Competitors](<https://devfeed.tech/articles/pareto-optimal-and-strategyproof-data-sharing-between-competitors-145632.md>)

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

Author: Morgan Colin-Mourre, Felipe Garrido-Lucero, Patrick Loiseau

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Data Space](<https://devfeed.tech/topics/data-space.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [contracts](<https://devfeed.tech/tags/contracts.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-gt](<https://devfeed.tech/tags/cs-gt.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [market-share](<https://devfeed.tech/tags/market-share.md>), [model](<https://devfeed.tech/tags/model.md>), [models](<https://devfeed.tech/tags/models.md>), [pareto-optimality](<https://devfeed.tech/tags/pareto-optimality.md>), [precision](<https://devfeed.tech/tags/precision.md>), [sharing](<https://devfeed.tech/tags/sharing.md>)

### AI overview

The paper models firms' profits as depending on predictive-model precision, tied to each firm's data, and market share, tied to all firms' endowments. It characterizes Pareto-optimal sharing contracts as ones where at least one firm receives all other firms' data. In a proposed parametric family, relative market shares stay constant, removing the modeled competitive penalty from sharing and equalizing firms' gains against no sharing. One contract in the family is both Pareto-optimal and strategyproof against firms under-declaring their initial data. Tests on a real-world dataset report that this contract benefits firms especially when the machine-learning task is harder or firms' initial data endowments are more similar.

### Source excerpt

arXiv:2611.26108v1 Announce Type: new Abstract: We study data-sharing among firms competing in the same market through the quality of their predictive models. We model firms' profit through two main components, precision and market share, where the former depends on the firm's own number of datapoints and the latter depends on the endowments of all firms. We characterize Pareto-optimal contracts as those in which at least one firm receives all of the other firms' datapoints. We then propose a parametric family of data-sharing contracts and show that, under any of them, the relative market shares of all firms remain constant, eliminating the negative effect of sharing data with competitors and equalizing all firms' gains relative to the no-sharing scenario. We further show that one contract within this family satisfies both Pareto-optimality and strategyproofness against firms attempting to under-declare the size of their initial endowment. Finally, using a real-world dataset, we empirically test the gain in profit for all firms under the contract described above, and show that data-sharing is particularly beneficial when the machine learning task is harder or when firms' initial endowments are closer to homogeneous.

## MADJEPA: Enhanced Multi-Stage Joint-Embedding Predictive Architecture for Medical Anomaly Detection

DevFeed: [MADJEPA: Enhanced Multi-Stage Joint-Embedding Predictive Architecture for Medical Anomaly Detection](<https://devfeed.tech/articles/madjepa-enhanced-multi-stage-joint-embedding-predictive-architecture-for-medical-anomaly-detection-145021.md>)

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

Author: Ioana-Sabina Stoian, Florinel-Alin Croitoru, Vlad Hondru, Andreea Iuliana Ionescu, Andrei Paun, Radu Tudor Ionescu

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: [Medical imaging](<https://devfeed.tech/topics/medical-imaging.md>), [World models](<https://devfeed.tech/topics/world-models.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [anomaly-detection](<https://devfeed.tech/tags/anomaly-detection.md>), [architecture](<https://devfeed.tech/tags/architecture.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>), [eess-iv](<https://devfeed.tech/tags/eess-iv.md>), [medical](<https://devfeed.tech/tags/medical.md>), [self-supervised-learning](<https://devfeed.tech/tags/self-supervised-learning.md>), [training](<https://devfeed.tech/tags/training.md>), [world-models](<https://devfeed.tech/tags/world-models.md>)

### AI overview

MADJEPA uses a three-stage training pipeline to detect anomalies from healthy medical images without labeled abnormal data. First, I-JEPA learns representations of normal training images; target encoder distillation is intended to limit over-generalization to abnormal data; then pseudo-anomaly classification calibrates predictions by learning a tight boundary around the normal-data manifold. Across six datasets spanning MRI, OCT, X-ray and histopathology, the authors report competitive results and first place on three datasets. Ablations indicate that I-JEPA alone was insufficient for competitive performance. The abstract does not provide dataset-specific scores or further experimental details.

### Source excerpt

arXiv:2611.25194v1 Announce Type: cross Abstract: Anomaly detection in medical images is a complex task, requiring the development of a robust model using only healthy patient data. Without access to labeled data, modern approaches typically employ self-supervised learning to obtain a model of normality. Since world models promise to build strong internal representations of their environment, we consider them as suitable candidates for the medical anomaly detection environment, namely medical investigations of healthy patients. To this end, we propose MADJEPA, a medical anomaly detector based on an enhanced multi-stage joint-embedding predictive architecture (JEPA). We design a multi-stage training pipeline to produce a robust detector: (1) image-based JEPA (I-JEPA) training aims to learn a strong representation of normal training data; (2) target encoder distillation aims to modulate over-generalization of I-JEPA representations to abnormal data; (3) pseudo-anomaly classification aims to calibrate anomaly predictions by learning a tight boundary around the normal data manifold. To demonstrate our design, we carry out comprehensive experiments on six datasets covering various medical image domains (e.g.~MRI, OCT, X-ray, histopathology), comparing our MADJEPA with numerous state-of-the-art methods. The results show that our carefully designed world model, MADJEPA, attains competitive results, ranking first on three datasets. Our ablation studies further confirm the utility of each training stage, indicating that I-JEPA alone is not sufficient to obtain competitive results in medical anomaly detection. We publicly release our code at https://github.com/Sabina085/madjepa.

## Interpretable Prototype-Conditioned Adaptation for Weather Forecasting

DevFeed: [Interpretable Prototype-Conditioned Adaptation for Weather Forecasting](<https://devfeed.tech/articles/interpretable-prototype-conditioned-adaptation-for-weather-forecasting-145110.md>)

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

Author: Zhixuan Li, Hao Jiang, Chen Hui, Kai Geng, Weisi Lin

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [attention](<https://devfeed.tech/tags/attention.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data-driven](<https://devfeed.tech/tags/data-driven.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [models](<https://devfeed.tech/tags/models.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [prototype](<https://devfeed.tech/tags/prototype.md>), [weather](<https://devfeed.tech/tags/weather.md>), [weather-forecasting](<https://devfeed.tech/tags/weather-forecasting.md>)

### AI overview

ProtoCast makes local weather forecasts more interpretable by adapting features with group-specific prototype banks. It matches each variable group's historical features and temporal changes to prototypes using cross-variable forecast context, then applies sparse mixtures of prototype-specific low-rank operators to correct features for each group and location. A gated attention block exchanges corrected features across groups before prediction; each group's correction can be decomposed into prototype contributions. The forecaster and operators are trained jointly from scratch, with prototypes refit before each epoch and slot tracking preserving prototype-operator associations. Experiments on GlobalForecast and TyphoonTracking report improved forecasting accuracy. Prototype deletion tests connect local feature contributions with changes in prediction error.

### Source excerpt

arXiv:2611.25848v1 Announce Type: new Abstract: Data-driven weather forecasting requires distinguishing local states and their temporal evolution. However, learned patterns remain implicit in neural forecasters, making their influence difficult to interpret. Failing to distinguish local evolution can lead to similar forecasts for locations that develop differently, increasing prediction error. This motivates explicit references for distinguishing and interpreting local patterns. Prototypes provide explicit pattern references, but sample- or task-level conditioning leaves open how to adapt to distinct locations and variable groups. To deal with this problem, we design ProtoCast, which uses group-specific prototype banks to adapt local features while accounting for cross-variable dependencies. Specifically, (1) we combine each group's historical features and temporal change with forecast context from cross-variable attention for evolution-aware prototype matching. (2) Sparse mixtures of prototype-specific low-rank operators tailor corrections to each group and location. A gated attention block then exchanges the corrected features across groups before prediction. Each group's correction decomposes into explicit prototype contributions before this fusion. (3) We jointly train the forecasting network and operators from scratch and refit each group's prototypes before every training epoch. Slot tracking preserves prototype-operator associations, making each prototype's contribution to local corrections more interpretable. Experiments on GlobalForecast and TyphoonTracking show improved forecasting accuracy, while prototype deletion links local feature contributions to changes in prediction error. This work advances the development of more accurate and interpretable data-driven weather forecasting models. Project page: https://zhixuanli.github.io/projects/li2026protocast

## Element-Wise Femoral Stress Prediction: A Hybrid Graph Neural Network Surrogate for Finite Element Analysis

DevFeed: [Element-Wise Femoral Stress Prediction: A Hybrid Graph Neural Network Surrogate for Finite Element Analysis](<https://devfeed.tech/articles/element-wise-femoral-stress-prediction-a-hybrid-graph-neural-network-surrogate-for-finite-element-analysis-143502.md>)

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

Author: Sikha O K, Abdollah Moslemi, Elham Alizadeh, Ludovic Humbert, Miguel A. Gonzalez Ballester, Jerome Noailly

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

Content type: article

Language: en

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

Topics: [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [aggregation](<https://devfeed.tech/tags/aggregation.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [finite-element-analysis](<https://devfeed.tech/tags/finite-element-analysis.md>), [gnn](<https://devfeed.tech/tags/gnn.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hybrid-graph](<https://devfeed.tech/tags/hybrid-graph.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [mesh](<https://devfeed.tech/tags/mesh.md>), [model](<https://devfeed.tech/tags/model.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [performance](<https://devfeed.tech/tags/performance.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [residual](<https://devfeed.tech/tags/residual.md>), [risk-assessment](<https://devfeed.tech/tags/risk-assessment.md>), [sage](<https://devfeed.tech/tags/sage.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [stress](<https://devfeed.tech/tags/stress.md>), [structure](<https://devfeed.tech/tags/structure.md>)

### AI overview

The study proposes a graph neural network surrogate for predicting stress across femoral finite element meshes, aiming to reduce the computational burden of finite element analysis while retaining mesh structure that conventional machine learning may miss. Its GCN-SAGE-Residual architecture combines graph convolution, neighborhood aggregation, and residual learning. In a comparison of 14 models, it achieved the strongest reported performance (R² 0.8022; mean absolute error 2.879 MPa); an architectural ablation examined the contribution of its components. The abstract presents the approach as a computationally efficient alternative for orthopedic analysis and fracture risk assessment, but provides no further validation details here.

### Source excerpt

arXiv:2611.24274v1 Announce Type: new Abstract: Hip fractures represent a significant clinical challenge because they cause excess disability and mortality, and have a growing incidence in aging populations, as bone fragility increases. Although finite element analysis (FEA) provides biomechanical assessment of femoral strength, its clinical applicability is mainly limited by high computational cost. Conventional machine learning (ML) approaches have been explored as surrogate models for FEA; predictions are fast but fail to capture the spatial and topological structure of finite element meshes. To address these limitations, this study proposes a hybrid Graph Neural Network (GNN)-based framework for femoral stress prediction using graph-structured finite element modeling (FEM) data. The proposed GCN-SAGE-Residual architecture combines graph convolution, neighborhood aggregation, and residual learning to model spatial dependencies and stress propagation across mesh elements. We systematically evaluated 14 models in a primary comparison, spanning classical ML methods and baseline GNN architectures, complemented by a targeted architectural ablation that isolates the contribution of each component of the proposed design. Evaluation results demonstrate that the proposed hybrid architecture achieves the strongest predictive performance among all evaluated models. The proposed hybrid model achieves the best performance with an R^2 score of 0.8022 and mean absolute error of 2.879 MPa, highlighting the importance of incorporating mesh topology in biomechanical prediction tasks. The proposed framework provides a scalable and computationally efficient alternative for FEM-based orthopedic analyses and fracture risk assessment. The code is publicly available on GitHub.

## Predicting Process-Level Behavior: A Benchmarking Study

DevFeed: [Predicting Process-Level Behavior: A Benchmarking Study](<https://devfeed.tech/articles/predicting-process-level-behavior-a-benchmarking-study-142212.md>)

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

Author: Michael Grohs, Lukas Kirchdorfer, Jana-Rebecca Rehse

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

Content type: article

Language: en

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

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

Tags: [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [concurrent](<https://devfeed.tech/tags/concurrent.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [errors](<https://devfeed.tech/tags/errors.md>), [logs](<https://devfeed.tech/tags/logs.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [process](<https://devfeed.tech/tags/process.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [throughput](<https://devfeed.tech/tags/throughput.md>)

### AI overview

The study benchmarks two process-level prediction tasks--concurrent trace counts and average throughput time--across synthetic and real event logs. It compares statistical and machine-learning methods, foundation models, business process simulation, and trace-level predictive process monitoring (PPM) methods aggregated to the process level. Performance varies substantially across approaches. Aggregating trace-level predictions can compound errors and reduce process-level accuracy, suggesting that process-level prediction is a distinct task requiring dedicated research. The abstract does not identify a single best-performing approach.

### Source excerpt

arXiv:2611.24425v1 Announce Type: cross Abstract: Predictive process monitoring (PPM) typically forecasts the future of individual process instances, hence operating on trace level. Process managers, however, typically operate on process level, e.g., when assigning staff or calculating KPIs. The question is how well such process-level managerial decisions are supported by existing approaches, given that PPM research has so far not focused on process-level predictions. We answer this question through a comprehensive benchmarking study of two process-level prediction tasks: concurrent trace prediction and average throughput time prediction. Across synthetic and real-life event logs, we compare statistical and machine-learning-based methods, foundation models, business process simulation, and, importantly, established trace-level PPM approaches, aggregating their predictions to the process-level. We assess which modeling paradigms are most suitable for predicting process-level behavior and whether existing trace-level PPM can be effectively repurposed for this task. Our results show substantial variation in performance across approaches. Notably, aggregated trace-level predictions cause errors to compound on process-level, reducing accuracy and highlighting process-level prediction as a distinct predictive task that warrants dedicated research.

## Drift-Aware Explainable Prioritization for Windows PE Malware Forensic Triage with Semantic Consistency Checks

DevFeed: [Drift-Aware Explainable Prioritization for Windows PE Malware Forensic Triage with Semantic Consistency Checks](<https://devfeed.tech/articles/drift-aware-explainable-prioritization-for-windows-pe-malware-forensic-triage-with-semantic-consistency-checks-143153.md>)

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

Author: Mohammed A. Alharbi, Toqeer Ali Syed

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

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Windows](<https://devfeed.tech/topics/windows.md>)

Tags: [consistency](<https://devfeed.tech/tags/consistency.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [drift](<https://devfeed.tech/tags/drift.md>), [forensic](<https://devfeed.tech/tags/forensic.md>), [malware](<https://devfeed.tech/tags/malware.md>), [prioritization](<https://devfeed.tech/tags/prioritization.md>), [triage](<https://devfeed.tech/tags/triage.md>), [windows](<https://devfeed.tech/tags/windows.md>), [windows-pe](<https://devfeed.tech/tags/windows-pe.md>)

### AI overview

The framework prioritizes Windows PE malware for forensic review using a calibrated maliciousness score, explains each prediction with feature attribution, and checks whether the top attributed features align with documented MBC and MITRE ATT&CK behaviors when the available features permit interpretation. It uses only pre-extracted static features and does not execute malware. Conformal evaluation and statistical distribution tests flag potential drift; each file receives a single investigator-oriented triage output. The stated evaluation uses a time-ordered EMBER2024 split and family-disjoint BODMAS checks, comparing components with simple baselines across predictive performance, prioritization, explanation quality, and robustness over time. The supplied text describes the protocol but provides no results.

### Source excerpt

arXiv:2611.24474v1 Announce Type: new Abstract: Forensic investigators must decide which suspicious files to examine first. Machine-learning (ML) and deep-learning (DL) malware detectors usually return a bare score that neither explains why a file deserves attention nor signals when changing data make the model unreliable. We present a framework for Windows Portable Executable (PE) malware forensic triage that works only on pre-extracted static features and never executes malware. A calibrated maliciousness score sets each file's triage priority, and a per-sample feature attribution explains the prediction. A per-sample consistency score measures whether the top attributed features agree with documented behaviors from the Malware Behavior Catalog (MBC) and MITRE Adversarial Tactics, Techniques & Common Knowledge (ATT&CK), where the available features support such interpretation. Conformal evaluation and statistical distribution tests flag drift. Each file receives one investigator-oriented triage output. The evaluation protocol, specified before testing, uses a time-ordered split of EMBER2024 as the primary dataset and BODMAS for family disjoint checks, and compares every component with simple baselines on predictive performance, prioritization effectiveness, explanation quality and robustness over time.

## When Do Foundation Models Pay Off? A Break-Even Analysis of Pretrained Time Series Forecasters

DevFeed: [When Do Foundation Models Pay Off? A Break-Even Analysis of Pretrained Time Series Forecasters](<https://devfeed.tech/articles/when-do-foundation-models-pay-off-a-break-even-analysis-of-pretrained-time-series-forecasters-143286.md>)

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

Author: Nicholas Tan Jerome, Frank Simon

Published: 2026-11-19T05: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>), [Time Series](<https://devfeed.tech/topics/time-series.md>), [lora](<https://devfeed.tech/topics/lora.md>), [decision-making](<https://devfeed.tech/topics/decision-making.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [analysis](<https://devfeed.tech/tags/analysis.md>), [arima](<https://devfeed.tech/tags/arima.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decision](<https://devfeed.tech/tags/decision.md>), [ets](<https://devfeed.tech/tags/ets.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [fm](<https://devfeed.tech/tags/fm.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [foundation-model](<https://devfeed.tech/tags/foundation-model.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [gpu-infrastructure](<https://devfeed.tech/tags/gpu-infrastructure.md>), [history](<https://devfeed.tech/tags/history.md>), [models](<https://devfeed.tech/tags/models.md>), [series](<https://devfeed.tech/tags/series.md>), [time](<https://devfeed.tech/tags/time.md>), [time-series](<https://devfeed.tech/tags/time-series.md>)

### AI overview

Across 30 datasets, zero-shot and LoRA-tuned time-series foundation models beat classical baselines at every tested training fraction on 16 datasets, while classical methods reached break-even with as little as 21-6,324 samples on six others and 24-22,177 on eight. No classical method dominated. For datasets with fewer than 700 training points and non-negligible seasonality, the study recommends zero-shot forecasting and skipping fine-tuning: at under 20% of history, classical methods lost on four of ten such datasets and could not be fitted on six. LoRA rarely helped and degraded short-series performance by up to 52%. The proposed process checks dataset length and seasonality, then uses a brief 5-10% pilot when needed; at this benchmark scale, simple dataset features did not predict break-even outside the short-seasonal-series rule.

### Source excerpt

arXiv:2607.04919v2 Announce Type: replace Abstract: Deploying a time series foundation model (FM) requires GPU infrastructure and engineering overhead, with no guarantee of improvement over classical forecasting methods. We provide the first systematic break-even analysis of when this investment pays off. Across 30 benchmark datasets, we compare zero-shot and LoRA fine-tuned FMs (Chronos-Bolt, Moirai, Lag-Llama) against classical baselines (Naive, ETS, ARIMA, XGBoost) at six training set sizes from 2% to 100% of available data. FMs outperform classical methods at every evaluated training fraction on 16 of 30 datasets. On 6 datasets, classical methods surpass zero-shot FMs with at most 5% of the training data (21--6,324 samples); on the remaining 8, break-even ranges from 24 to 22,177 samples. No classical method dominates: ARIMA, Naive, ETS and XGBoost are each best on 6--11 datasets. One robust rule requires no model training: if n_train < 700 and seasonality is non-negligible, FM zero-shot is the right low-data choice -- below 20% of the history, classical methods either lose to it (4 of these 10 datasets) or cannot be fitted at all (6) -- and it stays best at full history on 6 of them; fine-tuning should be skipped. Contrary to common practice, LoRA fine-tuning rarely helps and degrades short series by up to 52%. We operationalise these findings as a two-step decision framework -- compute dataset length and seasonality strength, run a brief 5--10% pilot only if needed. Cheap dataset features do not predict the break-even category at this benchmark scale, so outside the rule a pilot remains necessary. Code and benchmark: https://github.com/nicolaisi/fm_breakeven.

## Can LLMs Understand What They Predict? Evaluating Latent Causal Structure Inference in Financial Markets

DevFeed: [Can LLMs Understand What They Predict? Evaluating Latent Causal Structure Inference in Financial Markets](<https://devfeed.tech/articles/can-llms-understand-what-they-predict-evaluating-latent-causal-structure-inference-in-financial-markets-143404.md>)

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

Author: Yixiang Zheng, Yuechen Jiang, Zhiwei Liu, Jimin Huang, Yuyan Wang, Sophia Ananiadou

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

Content type: news

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 observability](<https://devfeed.tech/topics/ai-observability.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [event](<https://devfeed.tech/tags/event.md>), [financial](<https://devfeed.tech/tags/financial.md>), [financial-markets](<https://devfeed.tech/tags/financial-markets.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [inference](<https://devfeed.tech/tags/inference.md>), [large-language-models-llms](<https://devfeed.tech/tags/large-language-models-llms.md>), [llms](<https://devfeed.tech/tags/llms.md>)

### AI overview

LUCID tests whether LLMs can infer latent market structures from event descriptions and historical financial observations, rather than merely predict outcomes. It evaluates model-generated event-induced causal graphs through reconstruction. Across six open-weight and proprietary LLMs, adding the generated graphs generally reduced reconstruction quality compared with using historical observations alone, though a few metrics improved. The results indicate that the evaluated models struggle to infer informative, event-specific market structures from observable evidence.

### Source excerpt

arXiv:2611.23533v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly evaluated through their ability to predict future outcomes, implicitly assuming that predictive success reflects an understanding of the underlying system. However, accurate predictions can often be achieved without recovering the latent mechanisms that generate observable outcomes. To examine this assumption, we introduce LUCID, a benchmark that evaluates whether models can infer latent market structures from event descriptions and historical financial observations. Models generate event-induced causal graphs representing inferred market structure and are evaluated through a reconstruction-based framework. Our evaluation of 6 open-weight and proprietary LLMs shows that adding their generated graphs generally reduces reconstruction quality compared with using historical observations alone, although a few metrics improve. These findings suggest that inferring informative, event-specific market structures from observable evidence remains challenging for the evaluated LLMs.

## TabBioMed: A Large-Scale Benchmark for Biomedical Tabular Learning

DevFeed: [TabBioMed: A Large-Scale Benchmark for Biomedical Tabular Learning](<https://devfeed.tech/articles/tabbiomed-a-large-scale-benchmark-for-biomedical-tabular-learning-143446.md>)

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

Author: Pau Mateo-Bernad\\'o, Saivenkata Nagavyjayanthi Polapragada, David Bonet, Pol Arbiol Rakuljic, Laia Mogas Pladevall, Mar\\c{c}al Comajoan Cara, Jesus Gonzalez-Ferrer, Jordi Abante, Daniel Mas Montserrat

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [Dataset development](<https://devfeed.tech/topics/dataset-development.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [architectures](<https://devfeed.tech/tags/architectures.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [biology](<https://devfeed.tech/tags/biology.md>), [biomedical](<https://devfeed.tech/tags/biomedical.md>), [budget](<https://devfeed.tech/tags/budget.md>), [choice](<https://devfeed.tech/tags/choice.md>), [classification](<https://devfeed.tech/tags/classification.md>), [code](<https://devfeed.tech/tags/code.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [context](<https://devfeed.tech/tags/context.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [drug-discovery](<https://devfeed.tech/tags/drug-discovery.md>), [electronic-health-records](<https://devfeed.tech/tags/electronic-health-records.md>), [large](<https://devfeed.tech/tags/large.md>), [learning](<https://devfeed.tech/tags/learning.md>), [scale](<https://devfeed.tech/tags/scale.md>)

### AI overview

TabBioMed benchmarks 23 models on 94 curated public biomedical tabular datasets across classification, regression, and multi-target tasks. Its standardized, dataset-aware preprocessing and evaluation framework covers data from areas including electronic health records, drug discovery, and multiple omics fields. Tabular foundation models lead in family-level predictive performance, but their advantage depends on the data and task regime: tree-based models and tuned multilayer perceptrons remain competitive and can perform better under inference-time or training-cost constraints. The benchmark includes curated datasets and splits, preprocessing code, baselines, and results to support reproducible comparisons and practical model selection.

### Source excerpt

arXiv:2611.23779v1 Announce Type: new Abstract: Recent advances in machine learning have accelerated biomedical prediction, but evaluation on structured biomedical data remains fragmented, especially for datasets with high dimensionality, large sample size, missingness, and class imbalance. We introduce TabBioMed, a large-scale benchmark of 94 curated public biomedical tabular datasets spanning electronic health records, drug discovery, genomics, transcriptomics, proteomics, metabolomics, single-cell omics, and systems biology. TabBioMed unifies these datasets through a standardized, dataset-aware preprocessing and evaluation framework, enabling reproducible comparison across classification, regression, and multi-target tasks. We benchmark 23 models across classical baselines, gradient-boosted trees, neural tabular architectures, and tabular foundation models. Foundation models deliver the strongest family-level predictive performance. However, their gains are regime-dependent: tree-based models and tuned multilayer perceptrons remain highly competitive, often dominating under inference-time or training-cost constraints. Overall, TabBioMed shows that biomedical tabular learning is strongly context-dependent, with optimal model choice depending on data regime, task type, and computational budget. We release TabBioMed with curated datasets and splits, preprocessing code, baselines, and results, providing a reproducible benchmark for practical model selection and future methods development in biomedical machine learning, available at https://github.com/AI-sandbox/TabBioMed.

## Targeted Synthetic Control Method

DevFeed: [Targeted Synthetic Control Method](<https://devfeed.tech/articles/targeted-synthetic-control-method-143229.md>)

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

Author: Yuxin Wang, Dennis Frauen, Emil Javurek, Konstantin Hess, Yuchen Ma, Stefan Feuerriegel

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [bias](<https://devfeed.tech/tags/bias.md>), [convex](<https://devfeed.tech/tags/convex.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [estimator](<https://devfeed.tech/tags/estimator.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [flexible](<https://devfeed.tech/tags/flexible.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [stable](<https://devfeed.tech/tags/stable.md>), [stage](<https://devfeed.tech/tags/stage.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [synthetic-control](<https://devfeed.tech/tags/synthetic-control.md>)

### AI overview

Targeted synthetic control (TSC) estimates a treated unit's counterfactual in panel data through a two-stage procedure: it starts with synthetic-control weights, then uses a one-dimensional targeted update in a weight-tilting submodel to calibrate them and reduce bias associated with pre-treatment fit. The resulting estimate is a convex combination of observed control outcomes, making the weights directly interpretable and avoiding unbounded counterfactual estimates that methods such as augmented SCM can produce. TSC can use arbitrary machine-learning models. The abstract reports improved estimation accuracy over state-of-the-art SCM baselines in synthetic and real-world experiments.

### Source excerpt

arXiv:2602.04611v4 Announce Type: replace-cross Abstract: The synthetic control method (SCM) estimates causal effects in panel data with a single-treated unit by constructing a counterfactual outcome as a weighted combination of untreated control units that matches the pre-treatment trajectory. In this paper, we introduce the targeted synthetic control (TSC) method, a new two-stage estimator that directly estimates the counterfactual outcome. Specifically, our TSC method (1) yields a targeted debiasing estimator, in the sense that the targeted updating refines the initial weights to produce more stable weights; and (2) ensures that the final counterfactual estimation is a convex combination of observed control outcomes to enable direct interpretation of the synthetic control weights. TSC is flexible and can be instantiated with arbitrary machine learning models. Methodologically, TSC starts from an initial set of synthetic-control weights via a one-dimensional targeted update through the weight-tilting submodel, which calibrates the weights to reduce bias of weights estimation arising from pre-treatment fit. Furthermore, TSC avoids key shortcomings of existing methods (e.g., the augmented SCM), which can produce unbounded counterfactual estimates. Across extensive synthetic and real-world experiments, TSC consistently improves estimation accuracy over state-of-the-art SCM baselines.

## Agent Verifiers in Counterfactual Analysis: A Pilot Study Benchmarking Agentic Heterogeneous Treatment Effects

DevFeed: [Agent Verifiers in Counterfactual Analysis: A Pilot Study Benchmarking Agentic Heterogeneous Treatment Effects](<https://devfeed.tech/articles/agent-verifiers-in-counterfactual-analysis-a-pilot-study-benchmarking-agentic-heterogeneous-treatment-effects-143419.md>)

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

Author: Satiyabooshan Murugaboopathy, Entejar Alam, Adel Daoud, Connor T. Jerzak

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

Content type: article

Language: en

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

Topics: [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [adapter](<https://devfeed.tech/tags/adapter.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [benefits](<https://devfeed.tech/tags/benefits.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [budget](<https://devfeed.tech/tags/budget.md>), [builds](<https://devfeed.tech/tags/builds.md>), [channel](<https://devfeed.tech/tags/channel.md>), [combined](<https://devfeed.tech/tags/combined.md>), [compare](<https://devfeed.tech/tags/compare.md>), [context](<https://devfeed.tech/tags/context.md>), [counterfactual-analysis](<https://devfeed.tech/tags/counterfactual-analysis.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [effect](<https://devfeed.tech/tags/effect.md>), [pilot](<https://devfeed.tech/tags/pilot.md>)

### AI overview

The pilot proposes a three-layer check for agent-generated covariates: filter retrieved material to pre-treatment dates, validate heterogeneity using rank-weighted average treatment effects (RATEs), and assess encoder leakage with time-vintaged encoders, future-fact probes, and weight perturbations. Across 11 datasets, a persistent, date-verified GrokBot workspace had higher mean RATE ratios in 6 datasets for text alone and 7 for combined features; paired tests found neither retrieval workflow universally dominant. Encoder choice also shifted heterogeneity signals on fixed text. Vintaged probes found no clear weight-leakage evidence, while adapter perturbations showed that memorized future facts persisted until noise degraded model output. The authors conclude temporal filtering alone is insufficient; provenance, out-of-sample signal, and encoder weights all need scrutiny.

### Source excerpt

arXiv:2611.23621v1 Announce Type: new Abstract: Agents can expand the covariate space of randomized experiments by retrieving fast-moving local context missed by slow-changing survey baseline covariates, helping characterize who benefits most from an intervention. Verifying such covariates is difficult: individual treatment effects are unobserved, retrieval leakage can pull post-treatment information into nominally pretreatment summaries, and encoder leakage can inject post-treatment pretraining knowledge into representations even after temporal filtering of inputs. Guided by a two-channel information bound separating summary provenance from encoder weights, we propose a three-layer benchmark protocol: (i) retrieval admissibility via pre-treatment date filtering; (ii) heterogeneity validation scored rank-weighted average treatment effects (RATEs); and (iii) encoder admissibility checked with chronologically vintaged encoders, future-fact probes, and weight perturbations. Across 11 datasets anchored by Uganda's Youth Opportunities Program, we compare session-isolated retrieval (sandboxed, bounded-budget agent runs per study) against a persistent workspace teammate (xAI's GrokBot) that builds one date-verified corpus per study while blinded to outcomes. The workspace teammate yields higher mean RATE ratios in 6/11 datasets for text alone and 7 for combined features, though paired tests show neither workflow universally dominates. Even on fixed retrieved text, encoder choice significantly shifts heterogeneity signal. Chronologically vintaged probes show no clear evidence of weight leakage, but single-record adapter perturbation analyses show that memorized future facts, once present, persist until injected noise degrades model output. Temporal filtering of retrieval is necessary but insufficient: verifying agent-generated covariates requires jointly examining source provenance, out-of-sample treatment-effect signal, and encoder weights.

## Dirichlet-Guided Group Forecasting for Alleviating Over-smoothing in Time Series Forecasting

DevFeed: [Dirichlet-Guided Group Forecasting for Alleviating Over-smoothing in Time Series Forecasting](<https://devfeed.tech/articles/dirichlet-guided-group-forecasting-for-alleviating-over-smoothing-in-time-series-forecasting-143272.md>)

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

Author: Xingyu Zhang, Jingyao Wang, Xin Yu, Zeen Song, Jianqi Zhang, Changwen Zheng, Wenwen Qiang

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

Content type: article

Language: en

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

Topics: [Time Series](<https://devfeed.tech/topics/time-series.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [based](<https://devfeed.tech/tags/based.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [changes](<https://devfeed.tech/tags/changes.md>), [compression](<https://devfeed.tech/tags/compression.md>), [consistency](<https://devfeed.tech/tags/consistency.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [diversity](<https://devfeed.tech/tags/diversity.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [framework](<https://devfeed.tech/tags/framework.md>), [future](<https://devfeed.tech/tags/future.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [modal](<https://devfeed.tech/tags/modal.md>), [models](<https://devfeed.tech/tags/models.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [over](<https://devfeed.tech/tags/over.md>), [series](<https://devfeed.tech/tags/series.md>), [time](<https://devfeed.tech/tags/time.md>), [time-series-forecasting](<https://devfeed.tech/tags/time-series-forecasting.md>)

### AI overview

The abstract attributes forecasting over-smoothing to plausible future dynamics being weakened or averaged under partial observation and single-realization supervision. It proposes Dirichlet-Guided Group Forecasting (DGF), which models multiple mode-conditioned predictive distributions and uncertainty over their selection probabilities. A Dirichlet-guided hierarchical sampling mechanism and reward-based optimization aim to make forecasts accurate, dynamically consistent, and distinct across modes. The abstract reports that experiments on real-world benchmarks reduced over-smoothing while improving accuracy, diversity, and dynamical consistency; it provides no benchmark-specific results in this excerpt.

### Source excerpt

arXiv:2606.10592v2 Announce Type: replace Abstract: Time series forecasting often suffers from over-smoothing, especially when future dynamics are multi-modal. Forecasts may follow the coarse trend of the observed future, but fail to preserve sharp changes, oscillations, turning points, and regime transitions that define plausible dynamic evolution. In this work, we revisit over-smoothing from the perspective of latent dynamical mode compression: under partial observation and single-realization supervision, multiple plausible future modes can be weakened, merged, or averaged during forecasting. Based on this view, we propose Dirichlet-Guided Group Forecasting (DGF), a mode-preserving forecasting framework that explicitly models multiple mode-conditioned predictive distributions and uncertainty over their selection probabilities. DGF uses a Dirichlet-guided hierarchical sampling mechanism and reward-based optimization to encourage forecasts that are accurate, dynamically consistent, and mode-distinct. Extensive experiments on real-world forecasting benchmarks show that DGF reduces over-smoothing while improving forecasting accuracy, diversity, and dynamical consistency. Our code is publicly available at https://github.com/Zh-XY22/DGF

## From Arraignment to Resolution: Transformer Models of Court Cases

DevFeed: [From Arraignment to Resolution: Transformer Models of Court Cases](<https://devfeed.tech/articles/from-arraignment-to-resolution-transformer-models-of-court-cases-143402.md>)

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

Author: Kory Rosen, Aron Culotta

Published: 2026-11-19T05: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>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Time Series](<https://devfeed.tech/topics/time-series.md>), [Data analysis](<https://devfeed.tech/topics/data-analysis.md>)

Tags: [cases](<https://devfeed.tech/tags/cases.md>), [court](<https://devfeed.tech/tags/court.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-cy](<https://devfeed.tech/tags/cs-cy.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [transformer](<https://devfeed.tech/tags/transformer.md>), [transformer-models](<https://devfeed.tech/tags/transformer-models.md>)

### AI overview

The paper models court cases as event sequences to forecast the next proceeding, such as charges accepted, bond set, or a plea deal. Its transformer combines clerk-note text with structured information about defendants, prior charges, and courtroom. On thousands of cases from publicly available records in one mid-sized U.S. city, it reached 0.57 micro-F1 on a 20-class multilabel task, outperforming several baselines and performing comparably to a GRU with the same inputs. The authors present the model as a way to support oversight and help observers identify emerging issues in that jurisdiction; the excerpt does not establish performance or applicability elsewhere.

### Source excerpt

arXiv:2611.23518v1 Announce Type: cross Abstract: The criminal legal system is composed of many complex decision points, such as which charges are pursued, how bond is determined, plea deal negotiations, and sentencing. Given the profound impact of such decisions, there is a growing need to increase the transparency within this system. While prior machine learning approaches have focused on modeling single decisions (e.g., recidivism), this paper proposes a transformer-based time series model to forecast the outcome of the next proceeding in a case (e.g., charges accepted, bond set, plea deal made, etc.). By modeling a case as an event sequence, we enable a more nuanced analysis to support better oversight and understanding of decision making. We conduct an empirical analysis of thousands of cases using a newly constructed dataset derived from publicly available court records of a mid-sized U.S. city. We fit models that combine textual data from clerk notes with structured information about the defendant, prior charges, and courtroom. Our transformer model achieves $.57$ micro-F1 on a 20-class multi-label task, a significant improvement over several baselines and comparable to a GRU trained on the same input. We demonstrate how the model can be used to provide insights into decision-making and help court observers identify emerging issues within the jurisdiction studied.

## Building Predictive AI Models When Synthetic Data Is All You Have

DevFeed: [Building Predictive AI Models When Synthetic Data Is All You Have](<https://devfeed.tech/articles/building-predictive-ai-models-when-synthetic-data-is-all-you-have-144066.md>)

Original publisher: [Read original article](<https://engineering.salesforce.com/building-predictive-ai-models-when-synthetic-data-is-all-you-have/>)

Author: Taniya Ghosh

Published: 2026-11-19T00:59:15Z

Content type: article

Language: en

Sources: [Salesforce](<https://devfeed.tech/sources/salesforce-engineering-blog.md>)

Topics: [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Advanced AI workflows](<https://devfeed.tech/topics/advanced-ai-workflows.md>), [data-engineering](<https://devfeed.tech/topics/data-engineering.md>), [AI Models](<https://devfeed.tech/topics/ai-models.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Open Source Models & Datasets](<https://devfeed.tech/topics/open-source-models-datasets.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [customer-data](<https://devfeed.tech/tags/customer-data.md>), [data](<https://devfeed.tech/tags/data.md>), [data-360](<https://devfeed.tech/tags/data-360.md>), [predictive-ai](<https://devfeed.tech/tags/predictive-ai.md>), [synthetic-data](<https://devfeed.tech/tags/synthetic-data.md>), [training-data](<https://devfeed.tech/tags/training-data.md>)

### AI overview

Salesforce's team built reusable IT service management prediction templates before real customer incidents were available for training. Product-manager scenarios, varied within guardrails and expanded with open-source LLMs, supplied synthetic data for testing. To avoid being misled by aggregate accuracy on rare SLA breaches, the team checked whether scores changed as expected when one risk factor changed and whether the top three predictors made sense to service managers; these scenario tests did not establish production accuracy. Data 360 transforms customer incident histories into training data, Einstein on Data 360 trains an XGBoost model, and a scoring transform writes predictions for display on incident records. Templates carry the data contract and model structure, while each customer's history supplies its own learned parameters. The excerpt says training requires about 400 completed incidents and scoring runs in scheduled batches about hourly; thin or poor-quality histories may reduce reliability, and immediate scoring remained a need. At interview time, the team had received no reports of the anticipated challenges becoming production problems and was awaiting more user反馈.

### Source excerpt

In our Engineering Energizers Q&A series, we highlight the engineering minds driving innovation across Salesforce. Today, we spotlight Taniya Ghosh, Senior Manager of Software Engineering, whose team faced a brutal engineering contradiction: build predictive AI models that warn of escalating incidents before they had real customer incidents to learn from. Synthetic training data gave them [...] The post Building Predictive AI Models When Synthetic Data Is All You Have appeared first on Salesforce Engineering Blog.

## Feature Selection for Tabular Foundation Models: Exploring Feature Utility in Low-Data Molecular Prediction

DevFeed: [Feature Selection for Tabular Foundation Models: Exploring Feature Utility in Low-Data Molecular Prediction](<https://devfeed.tech/articles/feature-selection-for-tabular-foundation-models-exploring-feature-utility-in-low-data-molecular-prediction-141605.md>)

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

Author: Yiqi Yao, Miquel Duran-Frigola

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data-provenance](<https://devfeed.tech/tags/data-provenance.md>), [feature-selection](<https://devfeed.tech/tags/feature-selection.md>), [few-shot](<https://devfeed.tech/tags/few-shot.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [mol](<https://devfeed.tech/tags/mol.md>), [tabpfn](<https://devfeed.tech/tags/tabpfn.md>)

### AI overview

In few-shot molecular property prediction with TabPFN, broad RDKit descriptor and fingerprint families provide a strong default across 77 FS-Mol development tasks and 157 held-out ChEMBL assays. Rank-averaging TabPFN with support-fitted fingerprint forests outperforms either model alone, while learned weighting of family predictions adds gains at a larger prediction budget. A utility-trained selector produces a traceable 16-column input from 238 source-assay predictors: it beats the baseline but trails wider representations and equal-width structural SVD coordinates. On Therapeutics Data Commons ADME/Tox assays, endpoint-matched assay predictions improve a compact RDKit baseline; a provenance audit finds most audited query molecules already in predictor training sources. The study also tests selected outputs through paired removal and replacement, assessing each alongside the other inputs.

### Source excerpt

arXiv:2609.30789v4 Announce Type: replace Abstract: Choosing features is difficult with few labeled molecules, even for a tabular foundation model that learns in context. We study this problem with TabPFN for low-data molecular property prediction, separating input width, feature meaning, and predictive usefulness while keeping contexts, query molecules, and predictor settings matched. On ADME/Tox assays from Therapeutics Data Commons, endpoint-matched assay predictions improve a compact RDKit descriptor baseline, and a provenance audit shows that most audited query molecules already occur in the predictors' training sources. Across 77 FS-Mol development tasks and 157 held-out test assays drawn from ChEMBL, broad RDKit descriptor and fingerprint families provide a strong default, rank-averaging TabPFN with support-fitted fingerprint forests improves upon both models, and learned weighting of family predictions adds further gains at a larger prediction budget. A utility-trained selector builds a traceable 16-column input from 238 sourceassay predictors, improving upon the baseline while trailing wider representations and equalwidth structural SVD coordinates. Named outputs identify what each feature predicts and where it comes from. Their usefulness for a new assay is assessed alongside the other input features, and paired removal and replacement tests measure what each selected output contributes. Together, these studies offer a protocol for evaluating feature selection, representation choice, and data provenance with a fixed tabular foundation model for few-shot molecular property prediction.

## High-Dimensional Black-Box Optimization via Guidance Sampling of Diffusion Models

DevFeed: [High-Dimensional Black-Box Optimization via Guidance Sampling of Diffusion Models](<https://devfeed.tech/articles/high-dimensional-black-box-optimization-via-guidance-sampling-of-diffusion-models-140097.md>)

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

Author: Xiaoyan Hu, Rohit Sonker, Jalal Butt, Jiayu Chen, Egemen Kolemen, Jeff Schneider

Published: 2026-11-18T05: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: [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [diffusers](<https://devfeed.tech/topics/diffusers.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [bayesian](<https://devfeed.tech/tags/bayesian.md>), [black-box](<https://devfeed.tech/tags/black-box.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [evaluations](<https://devfeed.tech/tags/evaluations.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [exploitation](<https://devfeed.tech/tags/exploitation.md>), [exploration](<https://devfeed.tech/tags/exploration.md>), [framework](<https://devfeed.tech/tags/framework.md>), [gaussian](<https://devfeed.tech/tags/gaussian.md>), [generation](<https://devfeed.tech/tags/generation.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [guidance](<https://devfeed.tech/tags/guidance.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [sampling](<https://devfeed.tech/tags/sampling.md>)

### AI overview

BReaD uses diffusion-model guidance to optimize black-box rewards when evaluations are limited, without requiring a labeled pretraining dataset or access to reward gradients. It fits a Gaussian process surrogate to queried labels from generated samples, then uses Upper Confidence Bound signals to balance exploration and exploitation. The abstract reports a theoretical analysis of the total-variation distance between generated and target distributions, and numerical experiments on scientific discovery and image generation that show effectiveness in low-data scenarios.

### Source excerpt

arXiv:2611.22965v1 Announce Type: cross Abstract: Many real-world optimization problems involve optimizing black-box objectives for which only a limited number of evaluations are available. Bayesian optimization (BO) is a powerful framework for such problems, but its effectiveness often deteriorates in high-dimensional spaces. Recent work leverages diffusion models for black-box optimization, often through pre-training a reward-conditioned score network to steer generation towards high-reward samples. Alternatively, gradient-based guidance methods assume access to a differentiable reward function from which guidance gradients are queried. However, these approaches either require large amounts of labeled data for offline training or access to exact reward gradients, limiting their applicability in black-box settings. We propose BReaD (Black-box Reward-guided Sampling of Diffusion Model), a guidance sampling framework for optimizing black-box rewards without assuming access to a labeled dataset or reward gradients. The proposed method uses a Gaussian process (GP) as a differentiable surrogate for the unknown objective and actively queries labels for the generated samples. We provide a theoretical analysis of the total-variation distance between the generated distribution and the target distribution. Using Upper Confidence Bound (UCB) as guidance signals, our method balances exploration and exploitation during generation and enables the discovery of high-reward regions in the data space. Numerical experiments on scientific discovery and image generation tasks demonstrate that our framework can effectively optimize black-box rewards in low-data scenarios.

## Learning Calibrated and Samplable Predictive Distributions of Surface-Ocean $\\Delta p$CO$\_2$ Using Tabular Diffusion Models

DevFeed: [Learning Calibrated and Samplable Predictive Distributions of Surface-Ocean $\\Delta p$CO$\_2$ Using Tabular Diffusion Models](<https://devfeed.tech/articles/learning-calibrated-and-samplable-predictive-distributions-of-surface-ocean-delta-p-co-2-using-tabular-diffusion-models-141674.md>)

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

Author: Gabriele Accarino, Mohammad M. Amirian, Thea H. Heimdal, Amanda R. Fay, Galen A. McKinley, Viviana Acquaviva

Published: 2026-11-18T05: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>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Calibrated uncertainty](<https://devfeed.tech/topics/calibrated-uncertainty.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>)

Tags: [conditional](<https://devfeed.tech/tags/conditional.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diffusion](<https://devfeed.tech/tags/diffusion.md>), [diffusion-models](<https://devfeed.tech/tags/diffusion-models.md>), [distributions](<https://devfeed.tech/tags/distributions.md>), [generative](<https://devfeed.tech/tags/generative.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model](<https://devfeed.tech/tags/model.md>), [ocean](<https://devfeed.tech/tags/ocean.md>), [physics-ao-ph](<https://devfeed.tech/tags/physics-ao-ph.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [probabilistic](<https://devfeed.tech/tags/probabilistic.md>), [spatial](<https://devfeed.tech/tags/spatial.md>), [temporal](<https://devfeed.tech/tags/temporal.md>), [uncertainty](<https://devfeed.tech/tags/uncertainty.md>), [uncertainty-quantification](<https://devfeed.tech/tags/uncertainty-quantification.md>), [xgboost](<https://devfeed.tech/tags/xgboost.md>)

### AI overview

Treeffuser estimates a conditional predictive distribution for sea-air ΔpCO₂ from 13 environmental, spatial and temporal predictors, providing observation-level uncertainty for sparse ocean measurements. On a held-out SOCAT test set, it had the best continuous ranked probability score among the evaluated uncertainty methods (8.229 μatm) and coverage closest to nominal 68% and 95% levels (0.686 and 0.930). Its point-prediction skill was comparable to deterministic XGBoost, with RMSE 18.4 versus 17.7 μatm and R² 0.77 versus 0.79. The abstract says generated samples may support probabilistic analyses; spatially coherent field reconstruction remains future work requiring cross-grid-cell dependence modeling and evaluation on spatially held-out data.

### Source excerpt

arXiv:2611.21769v1 Announce Type: new Abstract: The ocean absorbs almost 30% of anthropogenic CO$_2$ emissions, but quantifying this sink requires estimating surface-ocean CO$_2$ from observations that are sparse in space and time. Most existing machine-learning estimates of this field are deterministic, giving a single value per grid point, with uncertainty approximated post hoc via residuals, ensembles, or prescribed distributions. We instead learn a conditional predictive distribution for each observation: using Treeffuser, a conditional diffusion model with gradient-boosted-tree score functions, we estimate the full predictive distribution of $\Delta p$CO$_2$ (the sea-air $p$CO$_2$ difference) from 13 environmental, spatial, and temporal predictors. On a held-out SOCAT test set, Treeffuser attains the lowest continuous ranked probability score among the uncertainty-quantification methods evaluated (8.229 $\mu$atm) and the coverage closest to the nominal 68% / 95% levels (0.686 / 0.930), while retaining point-prediction skill comparable to a deterministic XGBoost baseline (RMSE 18.4 vs. 17.7 $\mu$atm; $R^2$ 0.77 vs. 0.79). These results show that conditional diffusion can provide well-calibrated, observation-level uncertainties while largely preserving point-prediction skill. Because Treeffuser is generative, its samples can support probabilistic analyses of $\Delta p$CO$_2$; extending this to spatially coherent field reconstruction will require modeling dependence across grid cells and evaluation on spatially held-out data.

## An AI-Based OSSE Framework to Evaluate Learned Physical Consistency: A Multi-Model Study Using FourCastNet, Aurora, Prithvi WxC, and GraphCast

DevFeed: [An AI-Based OSSE Framework to Evaluate Learned Physical Consistency: A Multi-Model Study Using FourCastNet, Aurora, Prithvi WxC, and GraphCast](<https://devfeed.tech/articles/an-ai-based-osse-framework-to-evaluate-learned-physical-consistency-a-multi-model-study-using-fourcastnet-aurora-prithvi-wxc-and-graphcast-141721.md>)

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

Author: Yash Diggikar, Milton Halem, Aishwarya Raman

Published: 2026-11-18T05: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>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [after](<https://devfeed.tech/tags/after.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-models](<https://devfeed.tech/tags/ai-models.md>), [all](<https://devfeed.tech/tags/all.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [can](<https://devfeed.tech/tags/can.md>), [capture](<https://devfeed.tech/tags/capture.md>), [central](<https://devfeed.tech/tags/central.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [consistency](<https://devfeed.tech/tags/consistency.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [example](<https://devfeed.tech/tags/example.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [framework](<https://devfeed.tech/tags/framework.md>), [model](<https://devfeed.tech/tags/model.md>), [study](<https://devfeed.tech/tags/study.md>), [using](<https://devfeed.tech/tags/using.md>)

### AI overview

The framework tests whether four AI weather models reproduce atmospheric responses to inserted observations in OSSE-style forecasts. FourCastNet V2, GraphCast, Aurora, and Prithvi WxC were run autoregressively for 60 days with a 30-day spin-up; ERA5 temperature or wind fields were then inserted, and responses were assessed over a 30-day assimilation cycle. Models respond differently to the same insertions: Aurora and Prithvi WxC show the strongest impacts, while GraphCast is weakest. Three of the four capture the temperature-to-geopotential-height response, and the two foundation models retain a positive tropical 500-hPa zonal-wind response to temperature insertion. Results can also vary among insertion experiments within an architecture. In GraphCast's full 37-level setup, temperature insertion triggers runaway feedback near the upper levels; the abstract reports this can be corrected by excluding levels at or below 100 hPa.

### Source excerpt

arXiv:2611.22024v1 Announce Type: new Abstract: Observing System Simulation Experiments (OSSEs) are a central methodology for evaluating future atmospheric observing systems. We present the first AI-based OSSE framework to test whether different AI weather models can reproduce comparable physical impact from new observations that traditional physics based models generate. We evaluate four distinct architectural AI models on the Charney conjecture that incomplete historical observations can infer the present state of the atmospheric. We considner- FourCastNet V2, GraphCast, Aurora and Prithvi WxC and integrate each autoregressively over a 60-day forecast horizon. After a 30-day spin-up, we insert ERA5 temperature fields to infer winds and related atmospheric fields. Similar OSSE experiments are conducted for wind insertion. We measure the performance of each model's response to observational information on a 30-day data assimilation cycle forecast with and without data insertion. Distinct architectural AI weather models respond differently to the same OSSE observations. Foundation models (i.e. Prithvi WxC and Aurora), produce the strongest impact. For example, while GraphCast is the weakest, all three of the four models capture the temperature-to-geopotential height response. The two foundational models retain a positive, non-trivial, tropical zonal wind at 500 hPa response to temperature insertion. Various data insertion experiments can vary significantly even within a given architecture. We identify an architecture-specific numerical instability in GraphCast's full 37-level configuration that produces a runaway feedback concentrated at the uppermost levels with ERA5 temperature insertion correctable by excluding levels at or below 100 hPa.

## One pool, many targets: a conservation layer and what archival data can identify

DevFeed: [One pool, many targets: a conservation layer and what archival data can identify](<https://devfeed.tech/articles/one-pool-many-targets-a-conservation-layer-and-what-archival-data-can-identify-141614.md>)

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

Author: Zahra Khodagholi, Niloofar Yousefi

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

Content type: article

Language: en

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

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [Data analysis](<https://devfeed.tech/topics/data-analysis.md>)

Tags: [approximation](<https://devfeed.tech/tags/approximation.md>), [bootstrap](<https://devfeed.tech/tags/bootstrap.md>), [competition](<https://devfeed.tech/tags/competition.md>), [compression](<https://devfeed.tech/tags/compression.md>), [constraint](<https://devfeed.tech/tags/constraint.md>), [context](<https://devfeed.tech/tags/context.md>), [contribution](<https://devfeed.tech/tags/contribution.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [faster](<https://devfeed.tech/tags/faster.md>), [independent](<https://devfeed.tech/tags/independent.md>), [invariance](<https://devfeed.tech/tags/invariance.md>), [layer](<https://devfeed.tech/tags/layer.md>), [permutation](<https://devfeed.tech/tags/permutation.md>), [pool](<https://devfeed.tech/tags/pool.md>), [rank](<https://devfeed.tech/tags/rank.md>), [scalar](<https://devfeed.tech/tags/scalar.md>), [unique](<https://devfeed.tech/tags/unique.md>)

### AI overview

The paper proposes a differentiable equilibrium layer that enforces conservation of a finite guide-loaded RISC pool through a scalar equation with a unique positive root and exact implicit gradients. Its analysis shows that, within one construct at one dose, fractional-occupancy rankings cannot distinguish equilibrium from independent scoring, leaving dose and cross-context comparisons as tests. In archival off-target data, corrected affinities associate weakly with measured repression, but paired permutation and construct-cluster bootstrap analyses do not establish added predictive value for coupling; the reported surviving difference is 0.0026 and favors independent scoring. Dose fits are heterogeneous and often violate the model's superlinear exponent constraint, so they do not identify the competition parameter. Saturable competitor-set compression preserves both accuracy targets on held-out guide families but is not faster at the measured size.

### Source excerpt

arXiv:2610.00445v2 Announce Type: replace Abstract: Pairwise guide-transcript scores do not enforce conservation of a finite guide-loaded RISC pool when they are interpreted independently as occupancies. We formulate a differentiable scalar equilibrium layer: one conservation equation with a unique positive root and exact implicit gradients. It yields a redistribution theorem, a qualified high-resource limit, an analysis of the retrieval approximation, and a conditional rank-invariance result: within one construct at one dose, rankings by fractional occupancy cannot distinguish equilibrium from independent scoring. We therefore audit the two experiments that proposition leaves open, dose and cross-context, on archival off-target data. Corrected thermodynamic affinities associate weakly with measured repression in the direction a working predictor requires, but a paired permutation test and a construct-cluster bootstrap do not establish added predictive value from the coupling: what survives their differing permutation-null baselines is 0.0026, which is 2.55 paired-null standard deviations from that baseline (p=0.010) and favours independent scoring. The dose fits are heterogeneous and frequently violate the model-implied exponent constraint, which is superlinear rather than sublinear, so these data do not identify the competition parameter. A saturable compression of the competitor set holds both accuracy targets on held-out guide families but is not faster at the size measured. The contribution is a reusable conservation operator and the experimental information needed to test it. Code, result files and the data manifest: https://github.com/shadi97kh/One-Pool-Many-Targets

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