# Feature Engineering

Feature engineering is the process of transforming, selecting, and creating data features for machine learning models.

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

## LightGBM vs. a Four-Week Average for Forecasting Bike-Share Rentals

DevFeed: [LightGBM vs. a Four-Week Average for Forecasting Bike-Share Rentals](<https://devfeed.tech/articles/lightgbm-vs-a-four-week-average-for-forecasting-bike-share-rentals-146443.md>)

Original publisher: [Read original article](<https://towardsdatascience.com/lightgbm-vs-a-four-week-average-for-forecasting-bike-share-rentals/>)

Author: Nahid Ahmadvand

Published: 2026-11-20T16:30:00Z

Content type: article

Language: en

Sources: [Towards Data Science](<https://devfeed.tech/sources/towards-data-science.md>)

Topics: [Time Series](<https://devfeed.tech/topics/time-series.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Data Quality](<https://devfeed.tech/topics/data-quality.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [bike-share](<https://devfeed.tech/tags/bike-share.md>), [editor-s-picks](<https://devfeed.tech/tags/editor-s-picks.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [lightgbm](<https://devfeed.tech/tags/lightgbm.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [python](<https://devfeed.tech/tags/python.md>), [time-series-forecasting](<https://devfeed.tech/tags/time-series-forecasting.md>)

### AI overview

In a 48-hour-ahead Capital Bikeshare forecasting experiment, a four-week seasonal average proved difficult to beat during development: LightGBM's MAE was 49.025 versus 49.856, and paired tests did not establish a difference. On 30 later November-December forecast paths, the selected LightGBM pipeline with lagged weather had 19.6% lower MAE than the baseline, though the author did not test that difference for statistical significance and cannot identify what caused the change. The workflow reconstructed 159 missing development hours as zeros after hourly sums matched daily totals, while distinguishing recorded rentals from actual demand; it excluded nonexistent daylight-saving hours from scoring and constrained features to information available at midnight. Future observed weather sharply reduced error but was unavailable at forecast time. LightGBM relied heavily on weekly summaries, and it struggled during Hurricane Sandy. Empirical prediction intervals came close to target coverage during development but fell short in the later period. The experiment did not compare foundation models.

### Source excerpt

A 48-hour Capital Bikeshare experiment pits XGBoost, Ridge, SARIMA, and Prophet against simple baselines, with care for missing hours and leakage. The post LightGBM vs. a Four-Week Average for Forecasting Bike-Share Rentals appeared first on Towards Data Science.

## On the Impact of Feature Reduction Techniques on Adversarial Attacks

DevFeed: [On the Impact of Feature Reduction Techniques on Adversarial Attacks](<https://devfeed.tech/articles/on-the-impact-of-feature-reduction-techniques-on-adversarial-attacks-145002.md>)

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

Author: Mohammad Meymani, Roozbeh Razavi-Far

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: [Adversarial attacks](<https://devfeed.tech/topics/adversarial-attacks.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [ai security](<https://devfeed.tech/topics/ai-security.md>)

Tags: [adversarial](<https://devfeed.tech/tags/adversarial.md>), [adversarial-machine-learning](<https://devfeed.tech/tags/adversarial-machine-learning.md>), [apt](<https://devfeed.tech/tags/apt.md>), [attacks](<https://devfeed.tech/tags/attacks.md>), [backdoor](<https://devfeed.tech/tags/backdoor.md>), [classifiers](<https://devfeed.tech/tags/classifiers.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [defense](<https://devfeed.tech/tags/defense.md>), [effect](<https://devfeed.tech/tags/effect.md>), [f1](<https://devfeed.tech/tags/f1.md>), [feature](<https://devfeed.tech/tags/feature.md>), [features](<https://devfeed.tech/tags/features.md>), [impact](<https://devfeed.tech/tags/impact.md>), [improvements](<https://devfeed.tech/tags/improvements.md>), [information](<https://devfeed.tech/tags/information.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [machine-learning-models](<https://devfeed.tech/tags/machine-learning-models.md>), [metrics](<https://devfeed.tech/tags/metrics.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [techniques](<https://devfeed.tech/tags/techniques.md>)

### AI overview

On the APT dataset, permutation importance ranking and univariate mutual information generally yielded the most consistent robustness improvements across the evaluated classifiers and attacks. The study compares PCA, permutation importance ranking, recursive feature elimination, and univariate mutual information across SVM, decision tree, random forest, MLP, and k-nearest neighbors models, under poisoning, backdoor, and universal adversarial perturbation attacks. It evaluates accuracy, F1-score, and mitigation score; the abstract says results for the other reduction methods vary by classifier and attack scenario.

### Source excerpt

arXiv:2611.25004v1 Announce Type: new Abstract: Adversarial attacks have posed significant threats to machine learning models by exploiting their inherent vulnerabilities. Researchers have established an interdisciplinary field called adversarial machine learning to explore these vulnerabilities and develop corresponding defense strategies. Feature reduction strategies are used to decrease the dimensionality of the data in order to reduce training time, avoid the curse of dimensionality, prevent overfitting, and mitigate redundant features. However, their effect on adversarial robustness across different classifiers and attack scenarios remains insufficiently explored. This study aims to analyze the effect of feature reduction techniques on the adversarial robustness of a diverse set of machine learning models under poisoning, backdoor, and universal adversarial perturbation attacks on the APT dataset. These models include support vector machine, decision tree, random forest, multi-layer perceptron, and k-nearest neighbors. The attained results are compared with scenarios where different feature reduction techniques are applied, including principal component analysis, permutation importance ranking, recursive feature elimination, and univariate mutual information. Metrics such as accuracy, F1-score, and mitigation score are employed to evaluate the effect of these techniques on adversarial robustness. The results demonstrate that permutation importance ranking and univariate mutual information generally provide the most consistent robustness improvements, while other methods exhibit more variable effects depending on the classifier and attack scenario.

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

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

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

Author: Rushil Anirudh, Jayaraman J. Thiagarajan

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

Content type: article

Language: en

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

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

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

### AI overview

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

### Source excerpt

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

## Bio-PM-Guided Synthetic IMU Generation

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

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

Author: Deepali Singh, Deepesh Parpani, Aviral Gupta

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

Content type: article

Language: en

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

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

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

### AI overview

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

### Source excerpt

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

## Cost-Aware Agentic Feature Optimization System for Fleet-Scale Ranking Models

DevFeed: [Cost-Aware Agentic Feature Optimization System for Fleet-Scale Ranking Models](<https://devfeed.tech/articles/cost-aware-agentic-feature-optimization-system-for-fleet-scale-ranking-models-145193.md>)

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

Author: Chang Yang, Yao Xuan, Wendan Yan, Nhat Le, Jiang Liu, Longhao Jin, Zhen Peggy Yao, Alireza Vahdatpour, Djordje Gligorijevic

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: [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [AI Agent](<https://devfeed.tech/topics/ai-agent.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [agentic](<https://devfeed.tech/tags/agentic.md>), [asynchronous](<https://devfeed.tech/tags/asynchronous.md>), [blending](<https://devfeed.tech/tags/blending.md>), [budget](<https://devfeed.tech/tags/budget.md>), [candidate](<https://devfeed.tech/tags/candidate.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ir](<https://devfeed.tech/tags/cs-ir.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [feature](<https://devfeed.tech/tags/feature.md>), [feature-selection](<https://devfeed.tech/tags/feature-selection.md>), [features](<https://devfeed.tech/tags/features.md>), [fleet](<https://devfeed.tech/tags/fleet.md>), [large](<https://devfeed.tech/tags/large.md>), [llm](<https://devfeed.tech/tags/llm.md>), [models](<https://devfeed.tech/tags/models.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [ranking-models](<https://devfeed.tech/tags/ranking-models.md>), [scale](<https://devfeed.tech/tags/scale.md>), [system](<https://devfeed.tech/tags/system.md>)

### AI overview

The system optimizes features across fleets of ranking models while respecting shared and per-model resource limits, including pipeline cost and serving throughput. LLM agents generate and shortlist cross features, while deterministic tools run and verify experiments. Several importance rankings are blended, using Pareto fronts for multi-task models; a Researcher agent then tunes selections through 10-25 asynchronous trials under resource caps, followed by trimming to meet pipeline budgets. Across production models, normalized entropy rose by 0.31% on average within each model's budget. Trimming reduced pipeline cost by 2.3% with no regression beyond measurement noise, and online A/B tests reported a 0.20% gain in a primary metric.

### Source excerpt

arXiv:2611.26531v1 Announce Type: cross Abstract: Large Web platforms operate large fleets of ranking models, each selecting features from a shared pool of tens of thousands. We present an end-to-end agentic system that optimizes features across the fleet under resource constraints shared across models and those set per model, such as feature pipeline cost and serving throughput (QPS), respectively. In this system, LLM agents propose hypotheses, and deterministic tools execute experiments and verify them. For each model, an LLM generates and shortlists cross features from a combinatorial candidate space, and all features are then ranked by several importance methods. Feature blending mixes these rankings into a single selection, using Pareto fronts across tasks for multi-task models. An LLM Researcher agent then tunes the feature selection in 10--25 asynchronous trials under resource caps, and a trimming step keeps the pipeline cost within budget. Across production models, the system improves normalized entropy by 0.31% on average within each model's budget, and the trimming step cuts pipeline cost by 2.3% with no regression beyond measurement noise. The optimized models were launched, and in online A/B tests they improved a primary online metric by 0.20%.

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

## Active Feature Acquisition by Distilling an Oracle Teacher

DevFeed: [Active Feature Acquisition by Distilling an Oracle Teacher](<https://devfeed.tech/articles/active-feature-acquisition-by-distilling-an-oracle-teacher-145198.md>)

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

Author: Yang Meng, Zixin Ding, Robert L. Grossman, Yuxin Chen

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: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>)

Tags: [acquisition](<https://devfeed.tech/tags/acquisition.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [budget](<https://devfeed.tech/tags/budget.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [delay](<https://devfeed.tech/tags/delay.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [diagnosis](<https://devfeed.tech/tags/diagnosis.md>), [distilling](<https://devfeed.tech/tags/distilling.md>), [effect](<https://devfeed.tech/tags/effect.md>), [error](<https://devfeed.tech/tags/error.md>), [existing](<https://devfeed.tech/tags/existing.md>), [feature](<https://devfeed.tech/tags/feature.md>), [features](<https://devfeed.tech/tags/features.md>), [imitation](<https://devfeed.tech/tags/imitation.md>), [learning](<https://devfeed.tech/tags/learning.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [medical](<https://devfeed.tech/tags/medical.md>), [medical-diagnosis](<https://devfeed.tech/tags/medical-diagnosis.md>), [multimodal](<https://devfeed.tech/tags/multimodal.md>), [oracle](<https://devfeed.tech/tags/oracle.md>)

### AI overview

OracleImitator trains a deployable active feature acquisition policy by imitating an explicit oracle ranking. During training, the label and unobserved feature values let the oracle rank candidate measurements by their effect on the downstream predictor's error; the policy learns from these rankings through soft-target imitation. The method is evaluated on multimodal medical diagnosis and AFABench, where it reportedly matches or outperforms existing methods across budgets and recovers 90% of the attainable accuracy gain at less than a quarter of the acquisition cost. The excerpt also says the explicit teacher makes it possible to measure how much of its ranking a policy can recover using only information visible at deployment.

### Source excerpt

arXiv:2611.26598v1 Announce Type: new Abstract: Acquiring every feature of an instance is often costly: a measurement can carry a monetary price, a time delay, or a privacy cost. Active Feature Acquisition (AFA) addresses this by learning a policy that decides, per instance, which features to acquire under a budget. Existing AFA methods train this policy by optimizing a self-constructed utility target rather than distilling an explicit teacher. We construct this teacher explicitly. At training time the label and the unobserved feature values are available, and together they determine the teacher in closed form: an oracle that ranks every candidate by its effect on the downstream predictor's error. OracleImitator distills this ranking into a deployable policy by soft-target imitation. Across multimodal medical diagnosis and the AFABench benchmark, OracleImitator matches or outperforms existing AFA methods across the budget range, recovering 90% of the attainable accuracy gain at under a quarter of the acquisition cost. Because the teacher is an explicit algorithmic object rather than an implicit optimization target, we can also measure directly how much of its ranking is recoverable by a policy restricted to what is visible at deployment.

## Explainable AI for Solar PV Power Forecasting: From Model Selection to Trustworthy, Reproducible Deployment

DevFeed: [Explainable AI for Solar PV Power Forecasting: From Model Selection to Trustworthy, Reproducible Deployment](<https://devfeed.tech/articles/explainable-ai-for-solar-pv-power-forecasting-from-model-selection-to-trustworthy-reproducible-deployment-145603.md>)

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

Author: Nuzhat Khan, Muhammad Paend Bakht, Ab Al-Hadi Ab Rahman, Fabiano Pallonetto, Amy Fahy, Mohamed Khalafalla Hassan, Paul Stynes, Muhammad Anique Aslam, Terence O Donnell, Mohammad Riadh

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>), [Advanced AI workflows](<https://devfeed.tech/topics/advanced-ai-workflows.md>), [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [tinyml](<https://devfeed.tech/topics/tinyml.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [climate](<https://devfeed.tech/tags/climate.md>), [cross-validation](<https://devfeed.tech/tags/cross-validation.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [deep](<https://devfeed.tech/tags/deep.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [edge](<https://devfeed.tech/tags/edge.md>), [explainable-ai](<https://devfeed.tech/tags/explainable-ai.md>), [feature](<https://devfeed.tech/tags/feature.md>), [features](<https://devfeed.tech/tags/features.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [foundation](<https://devfeed.tech/tags/foundation.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model-selection](<https://devfeed.tech/tags/model-selection.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [pv](<https://devfeed.tech/tags/pv.md>), [shap](<https://devfeed.tech/tags/shap.md>), [solar](<https://devfeed.tech/tags/solar.md>)

### AI overview

On a one-year test of an openly available 16.32 kWp solar plant in Porto, Portugal, forecasting one day ahead from a 4 km weather grid, the best models achieved 11.6% nRMSE--about half the error of smart persistence. Input-feature choice affected accuracy more than the choice among strong algorithms, and shuffled cross-validation was mildly optimistic. Conformal calibration raised coverage of nominal 80% prediction intervals from 64.5% to 81.7%. SHAP rankings were stable across retraining periods but shifted when correlated inputs were removed, so they describe model behavior rather than the plant itself. The paper presents a reproducible workflow combining automated model search and explainable AI; the supplied text is an abstract and does not provide implementation details.

### Source excerpt

arXiv:2611.25894v1 Announce Type: new Abstract: Machine learning (ML) is now a standard tool for forecasting the output of solar photovoltaic (PV) plants, yet published accuracy figures are often hard to compare and harder to trust. Many studies validate with random splits, report no reference forecast, and present feature attributions without saying what they can and cannot show. This paper reviews the main families of ML methods for PV power forecasting and resource assessment, from tree ensembles to deep and foundation models, and sets out a reproducible workflow that combines automated model search with explainable AI. The workflow is then tested on an openly available dataset: a 16.32 kWp plant in Porto, Portugal, forecast one day ahead from a 4 km numerical weather prediction grid. Over a full test year, the best models reach a normalised root mean square error (nRMSE) of 11.6% of installed capacity, about half the error of smart persistence. The choice of input features changed accuracy far more than the choice among strong algorithms, and shuffled cross-validation was mildly optimistic. After conformal calibration, the nominal 80% prediction intervals covered 81.7% of observations, against 64.5% before. SHAP rankings stayed stable when the model was retrained on different periods but shifted when correlated inputs were removed, so attributions should be read as properties of a model rather than of the plant. The paper closes with practical lessons and open problems, including deployment on edge hardware and the effect of a changing climate.

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

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

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

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

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

Content type: article

Language: en

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

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

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

### AI overview

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

### Source excerpt

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

## QUBO-based feature selection for MRI undersampling pattern design

DevFeed: [QUBO-based feature selection for MRI undersampling pattern design](<https://devfeed.tech/articles/qubo-based-feature-selection-for-mri-undersampling-pattern-design-145080.md>)

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

Author: Xiaoxin Huang, Masayuki Ohzeki

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

Content type: article

Language: en

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

Topics: [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [error](<https://devfeed.tech/tags/error.md>), [feature-selection](<https://devfeed.tech/tags/feature-selection.md>), [imaging](<https://devfeed.tech/tags/imaging.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [similarity](<https://devfeed.tech/tags/similarity.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

The study designs Cartesian MRI undersampling masks by treating each sampling line as a binary feature. It estimates mutual information and conditional mutual information from candidate masks and training evaluations, combines them with a sampling-count penalty in a QUBO, and uses simulated and quantum annealing to select a mask. In zero-filled Fourier undersampling simulations on fastMRI knee magnitude images with patient-disjoint splits, the selected masks achieved lower mean RMSE than four conventional methods at all six tested rates (15%-40%) and higher mean SSIM than univariate mutual-information ranking at every rate. These findings are limited to the reported simulation settings.

### Source excerpt

arXiv:2611.25625v1 Announce Type: new Abstract: We formulate undersampling mask design for Cartesian magnetic resonance imaging (MRI) as a feature subset selection problem. Each sampling line is represented by a binary feature indicating whether it is included in each candidate mask. Using candidate masks and their training-set evaluations, we estimate mutual information (MI) and conditional mutual information (CMI). These estimates and a sampling-count penalty define a quadratic unconstrained binary optimization (QUBO) model. The model is solved using simulated annealing and quantum annealing to determine a feature subset and its corresponding sampling mask. We assess the selected subsets on the test set through zero-filled reconstruction in Fourier undersampling simulations using fastMRI knee magnitude reference images, with patient-disjoint training and test sets. At all six tested target sampling rates from 15% to 40%, the resulting reconstructions have lower mean root mean square error than those obtained with four conventional sampling methods. They also have higher mean structural similarity than those obtained using univariate mutual-information ranking at all tested rates. These results support information-theoretic feature selection as an approach to MRI undersampling mask design under the tested zero-filled simulation settings.

## ShapleyPipe: A Game-Theoretic Approach to Data Preparation Pipeline Construction

DevFeed: [ShapleyPipe: A Game-Theoretic Approach to Data Preparation Pipeline Construction](<https://devfeed.tech/articles/shapleypipe-a-game-theoretic-approach-to-data-preparation-pipeline-construction-145728.md>)

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

Author: Jing Chang, Shuyuan Zheng, Jinbin Huang, Chang Liu, Jianbin Qin

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

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

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

Tags: [automated](<https://devfeed.tech/tags/automated.md>), [classification](<https://devfeed.tech/tags/classification.md>), [coherence](<https://devfeed.tech/tags/coherence.md>), [construction](<https://devfeed.tech/tags/construction.md>), [contribution](<https://devfeed.tech/tags/contribution.md>), [contributions](<https://devfeed.tech/tags/contributions.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [data-preparation](<https://devfeed.tech/tags/data-preparation.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [framework](<https://devfeed.tech/tags/framework.md>), [frontier](<https://devfeed.tech/tags/frontier.md>), [game](<https://devfeed.tech/tags/game.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [practical](<https://devfeed.tech/tags/practical.md>), [rank](<https://devfeed.tech/tags/rank.md>), [records](<https://devfeed.tech/tags/records.md>), [reduce](<https://devfeed.tech/tags/reduce.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [transformation](<https://devfeed.tech/tags/transformation.md>)

### AI overview

ShapleyPipe builds data preparation pipelines by estimating each operator's position-dependent contribution to downstream model utility. Its Pipeline Shapley value distinguishes repeated uses of the same operator type, and the framework selects and orders operators using those contributions. Hierarchical ShapleyPipe (H-SP) makes the approach more practical through representative selection based on a Category Coherence Assumption and adaptive early termination. Across 27 classification datasets, H-SP reports the highest average accuracy (0.847) and best average rank among evaluated practical methods, on the empirical accuracy-runtime Pareto frontier. On three datasets with up to 581K records, searching 10K subsamples with 16 workers averaged 891 seconds and accuracy of 0.705.

### Source excerpt

arXiv:2510.27168v2 Announce Type: replace Abstract: Data preparation is a critical yet highly time-consuming component of machine learning (ML) workflows and has a substantial impact on downstream model performance. Automated data preparation pipeline construction requires selecting appropriate operators, such as missing-value imputation, feature scaling, and feature transformation, and placing them at suitable pipeline positions. However, existing methods lack a principled and interpretable mechanism for understanding the marginal contribution of each operator at a specific position. To address this limitation, we study data preparation pipeline construction from a cooperative game-theoretic perspective. We formulate the task as a pipeline construction game, in which operators act as players that cooperatively improve downstream model utility. Based on this formulation, we propose the Pipeline Shapley value (PipeShapley), a contribution-attribution method that explicitly captures position-dependent contributions and distinguishes repeated occurrences of the same operator type. Building on PipeShapley, we introduce ShapleyPipe, an interpretable pipeline construction framework that selects and orders operators according to their position-aware contributions. To make PipeShapley practical, we develop Hierarchical ShapleyPipe (H-SP) based on a Category Coherence Assumption to exploit coherent contribution patterns, combining MAB-based representative selection with adaptive early termination. Experiments on 27 classification datasets show that H-SP achieves the highest average accuracy of 0.847 and the best average rank among the evaluated practical methods, while lying on the empirical accuracy--runtime Pareto frontier. On three datasets with up to 581K records, 10K-subsample search and 16-worker parallel execution reduce the average wall-clock time to 891 seconds while retaining the highest average accuracy of 0.705.

## A Lightweight Hybrid Approach for Milling Force Reconstruction from Internal Machine Signals

DevFeed: [A Lightweight Hybrid Approach for Milling Force Reconstruction from Internal Machine Signals](<https://devfeed.tech/articles/a-lightweight-hybrid-approach-for-milling-force-reconstruction-from-internal-machine-signals-145118.md>)

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

Author: Eric Hirsch, Christian Friedrich

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>)

Tags: [brownfield](<https://devfeed.tech/tags/brownfield.md>), [condition-monitoring](<https://devfeed.tech/tags/condition-monitoring.md>), [cost](<https://devfeed.tech/tags/cost.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [machining](<https://devfeed.tech/tags/machining.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [process-optimization](<https://devfeed.tech/tags/process-optimization.md>), [regression](<https://devfeed.tech/tags/regression.md>), [sensors](<https://devfeed.tech/tags/sensors.md>), [signal](<https://devfeed.tech/tags/signal.md>), [static](<https://devfeed.tech/tags/static.md>)

### AI overview

The method reconstructs milling-force behavior without adding sensors to existing machines: ridge regression predicts average force from internal machine signals and machining parameters, then uses that estimate to parameterize a static model over one spindle revolution. The model captures force distribution, load levels, and high-engagement angular regions, but not all dynamic effects. On one milling machine, across varied process conditions, tools, and two workpiece materials, test-set R² was 0.984 and 0.991 for average-force components and 0.962 and 0.982 for reconstructed force components relative to reconstructions based on measured force features. Dynamometer measurements are needed for development and validation.

### Source excerpt

arXiv:2611.25921v1 Announce Type: new Abstract: Data-driven monitoring based on milling force can enable advanced manufacturing services including process optimization and condition monitoring. However, industrial implementation is often hindered by costly and intrusive hardware and large training data requirements. This paper therefore presents a hybrid approach using machine-internal signals and machining metadata to enable force-based monitoring on brownfield machines without additional sensors. Commonly available machine signals have relatively low sampling rates and cannot directly represent high-frequency milling-force variations, especially at higher spindle speeds. Instead of learning the complete force signal, which would increase model complexity, data requirements, and overfitting risk, a supervised machine-learning model predicts only the average milling force from selected machine-signal features and machining parameters. This low-frequency estimation parameterizes a static milling force model that reconstructs the force behavior over one spindle revolution. Although the static model does not reproduce all dynamic effects, it captures the force distribution, load levels, and angular regions of highest tool engagement. The approach is evaluated on one milling machine across varying process parameters, engagement conditions, cutting tools, and two workpiece materials. Dynamometer measurements are required only for development and validation. Ridge regression achieves an $R^2$ of $0.984$ and $0.991$ for average-force prediction on the test data ($\bar{F}_x$ and $\bar{F}_y$). The reconstructed force behavior over one spindle revolution achieves an $R^2$ of $0.962$ and $0.982$ ($F_x$ and $F_y$) compared with the reconstruction based on measured force features. The method provides a cost and computationally efficient basis for process monitoring, tool condition assessment, and process optimization on existing machines.

## Auditing Learned Dynamics in Weather Models

DevFeed: [Auditing Learned Dynamics in Weather Models](<https://devfeed.tech/articles/auditing-learned-dynamics-in-weather-models-145011.md>)

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

Author: Skylar Gu, Christina Last

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

Content type: news

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>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [accessible](<https://devfeed.tech/tags/accessible.md>), [ai](<https://devfeed.tech/tags/ai.md>), [also](<https://devfeed.tech/tags/also.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [association](<https://devfeed.tech/tags/association.md>), [auditing](<https://devfeed.tech/tags/auditing.md>), [autoencoder](<https://devfeed.tech/tags/autoencoder.md>), [autoregressive](<https://devfeed.tech/tags/autoregressive.md>), [can](<https://devfeed.tech/tags/can.md>), [central](<https://devfeed.tech/tags/central.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deepmind](<https://devfeed.tech/tags/deepmind.md>), [error](<https://devfeed.tech/tags/error.md>), [event](<https://devfeed.tech/tags/event.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [fall](<https://devfeed.tech/tags/fall.md>), [feature](<https://devfeed.tech/tags/feature.md>), [features](<https://devfeed.tech/tags/features.md>), [models](<https://devfeed.tech/tags/models.md>), [weather](<https://devfeed.tech/tags/weather.md>)

### AI overview

Sparse autoencoder features in GraphCast can have causal effects even without conventional physical meaning, and physically associated features can be steered to alter forecast outcomes. Ablating a feature tied to the model's computational mesh increased global geopotential height error. Suppressing convection- and low-level-vorticity-associated features weakened predicted tropical-cyclone deepening; amplifying them reduced intensity error. Scaling convection features yielded a median 51% error reduction across seven storms. The abstract presents these features as experimental coordinates for auditing and intervening on learned weather dynamics; the evidence provided is an abstract, not the full paper.

### Source excerpt

arXiv:2611.25119v1 Announce Type: new Abstract: Learned weather models are experimentally accessible computational systems whose internal representations can be inspected and manipulated. Using sparse autoencoder features from GraphCast, DeepMind's autoregressive weather forecasting model, we test whether causal relevance requires physical semantics, a question that matters for auditing whether AI forecasters used in high-assurance settings rely on reliable mechanisms. We also look at whether physically associated latent directions can be steered to improve extreme-event forecasts, where interventions are applied to the model's internal activations during the rollout. We find that ablating a feature locked to GraphCast's computational mesh increases global geopotential height error despite lacking conventional physical semantics. Second, suppressing convection- and low-level-vorticity-associated features weakens predicted tropical-cyclone deepening (the fall in central pressure during intensification), while amplifying them reduces intensity error, with amplification of convection features through feature scaling achieving a median of 51\% error reduction over seven storms. Together, these results separate interpretable, physical association from causal utility and establish sparse features as experimental coordinates for auditing and intervening on learned weather dynamics.

## Lightweight Low-Frequency Non-Intrusive Load Monitoring via Karhunen-Lo\\\`eve Feature Distillation and Temporal Convolutional Networks

DevFeed: [Lightweight Low-Frequency Non-Intrusive Load Monitoring via Karhunen-Lo\\\`eve Feature Distillation and Temporal Convolutional Networks](<https://devfeed.tech/articles/lightweight-low-frequency-non-intrusive-load-monitoring-via-karhunen-lo-eve-feature-distillation-and-temporal-convolutional-networks-145089.md>)

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

Author: Sanka Peeris, Pandula Thennakoon, Praveen Sumanasekara, Roshan Godaliyadda, Parakrama Ekanayake, Janaka Ekanayake

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

Content type: article

Language: en

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

Topics: [Image processing](<https://devfeed.tech/topics/image-processing.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Post-training optimization](<https://devfeed.tech/topics/post-training-optimization.md>), [Time-sequences](<https://devfeed.tech/topics/time-sequences.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [data-augmentation](<https://devfeed.tech/tags/data-augmentation.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [disaggregation](<https://devfeed.tech/tags/disaggregation.md>), [edge](<https://devfeed.tech/tags/edge.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [energy](<https://devfeed.tech/tags/energy.md>), [features](<https://devfeed.tech/tags/features.md>), [filter](<https://devfeed.tech/tags/filter.md>), [framework](<https://devfeed.tech/tags/framework.md>), [grid](<https://devfeed.tech/tags/grid.md>), [lightweight](<https://devfeed.tech/tags/lightweight.md>), [load](<https://devfeed.tech/tags/load.md>), [models](<https://devfeed.tech/tags/models.md>), [monitoring](<https://devfeed.tech/tags/monitoring.md>), [network](<https://devfeed.tech/tags/network.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [smart](<https://devfeed.tech/tags/smart.md>), [smart-grid](<https://devfeed.tech/tags/smart-grid.md>), [solution](<https://devfeed.tech/tags/solution.md>), [temporal](<https://devfeed.tech/tags/temporal.md>)

### AI overview

The proposed edge-oriented NILM framework pairs activity-boundary-aware augmentation--which recombines complete or near-complete appliance activation segments without requiring new fully labeled household aggregates--with KLT-derived temporal features and a compact TCN. On UK-DALE and REDD at 10-second sampling with leave-one-house-out testing, it reports disaggregation accuracy comparable to or better than NILMFormer, BERT4NILM, BiLSTM, and BiGRU. It uses 31,009 parameters, the fewest among the five compared models, and takes 2.78 ms per 1,000 samples on one CPU thread, reported as 84-95% less time than the baselines.

### Source excerpt

arXiv:2611.25678v1 Announce Type: cross Abstract: Non-Intrusive Load Monitoring (NILM) is a critical enabler for demand-side management which allows for smart grid optimization. A deployment-ready NILM solution necessitates three key features: accurate disaggregation, low-frequency sampling, and low computational cost. This paper proposes a lightweight, edge-oriented NILM framework that combines activity-boundary-aware synthetic data augmentation with Karhunen-Lo\`eve Transform (KLT) feature extraction and a Temporal Convolutional Network (TCN). The augmentation stage extracts and recombines complete or near-complete appliance activation segments so that the model can be trained without new fully labeled household aggregates. The KLT filter bank extracts decorrelated, appliance-informed temporal features which are then fed into a compact TCN along with the original aggregate for energy disaggregation. Evaluations on two standard NILM datasets, UK-DALE and REDD, at 10-s sampling and with leave-one-house-out testing, demonstrate that the proposed architecture achieves comparable or superior disaggregation accuracy relative to NILMFormer, BERT4NILM, BiLSTM, and BiGRU. The computational footprint of the framework is 31,009 parameters, the fewest of the five models compared, and on a single CPU thread it needs 2.78 ms per 1000 samples, 84-95% less than the baselines. These results demonstrate a favorable accuracy-efficiency tradeoff for low-frequency smart-meter NILM.

## Sex Differences in the Detection of Parkinson's Disease from Speech

DevFeed: [Sex Differences in the Detection of Parkinson's Disease from Speech](<https://devfeed.tech/articles/sex-differences-in-the-detection-of-parkinson-s-disease-from-speech-143553.md>)

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

Author: Hiba Akhaddar, Peter Plantinga, Mirco Ravanelli, Tristan Glatard

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>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>)

Tags: [classifiers](<https://devfeed.tech/tags/classifiers.md>), [cs-cy](<https://devfeed.tech/tags/cs-cy.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [deep-learning](<https://devfeed.tech/tags/deep-learning.md>), [detection](<https://devfeed.tech/tags/detection.md>), [disease](<https://devfeed.tech/tags/disease.md>), [eess-as](<https://devfeed.tech/tags/eess-as.md>), [embeddings](<https://devfeed.tech/tags/embeddings.md>), [fail](<https://devfeed.tech/tags/fail.md>), [features](<https://devfeed.tech/tags/features.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [men](<https://devfeed.tech/tags/men.md>), [models](<https://devfeed.tech/tags/models.md>), [results](<https://devfeed.tech/tags/results.md>), [speech](<https://devfeed.tech/tags/speech.md>), [systems](<https://devfeed.tech/tags/systems.md>), [variable](<https://devfeed.tech/tags/variable.md>), [women](<https://devfeed.tech/tags/women.md>)

### AI overview

The study evaluates speech-based Parkinson's disease detection using embeddings from three pretrained speech models, handcrafted acoustic features and several classifiers. It tests balanced, sex-specific subsets from four sustained phonation datasets, controlling for sex and disease status and, where possible, age. In the larger dataset, female speakers were classified more accurately than male speakers. Models trained on one sex failed to generalize to the other, pointing to sex as an important variable in developing these detection systems. The supplied text is an abstract and does not provide further methodological detail or performance measures.

### Source excerpt

arXiv:2611.24741v1 Announce Type: cross Abstract: Parkinson's disease (PD) is the second most common neurodegenerative disease in the world, and 70\% to 75\% of PD patients suffer from speech disorders at some stage. Since PD affects men more frequently than women, previous publications tend to rely on unbalanced datasets that potentially introduce sex biases into trained models. This study investigates sex differences in PD detection from speech using deep learning and traditional machine learning approaches. We evaluated speech-based PD detection using embeddings from three pre-trained speech models, combined with handcrafted acoustic features and different classifiers. Sex-specific experiments were conducted on balanced subsets of four sustained phonation datasets, controlling for sex, disease status, and, where possible, age. All recordings were obtained during a sustained phonation task. Results show that female speakers were more accurately classified than male speakers in the larger dataset. Sex-specific results show that when the models are trained on one sex, they fail to generalize to the other one. Our results highlight the importance of including sex as a variable in the development of PD detection systems.

## When Features Beat Noise: A Noise-Driven Hypothesis Testing Method for Feature Selection

DevFeed: [When Features Beat Noise: A Noise-Driven Hypothesis Testing Method for Feature Selection](<https://devfeed.tech/articles/when-features-beat-noise-a-noise-driven-hypothesis-testing-method-for-feature-selection-143224.md>)

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

Author: Mousam Sinha, Tirtha Sarathi Ghosh, Koushik Biswas, Ridam Pal

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

Content type: article

Language: en

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

Topics: [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [bootstrap](<https://devfeed.tech/tags/bootstrap.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [feature-selection](<https://devfeed.tech/tags/feature-selection.md>), [hypothesis-testing](<https://devfeed.tech/tags/hypothesis-testing.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [noise](<https://devfeed.tech/tags/noise.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The proposed feature-selection method adds multiple random noise features, then tests each feature's importance against the maximum importance among the noise features using non-parametric bootstrap-based hypothesis testing. The authors position this as a statistically grounded stopping approach that addresses limitations they identify in methods such as Boruta and Recursive Feature Elimination. They report that controlled simulations and diverse real-world datasets showed better recovery of meaningful signals than Boruta, Model-X Knockoffs, RFE, LASSO, Elastic Net, and mRMR. The supplied text does not provide quantitative results or implementation details.

### Source excerpt

arXiv:2511.20851v4 Announce Type: replace-cross Abstract: Feature selection has remained a daunting challenge in machine learning and artificial intelligence, where increasingly complex, high-dimensional datasets demand principled strategies for isolating the most informative predictors. Despite widespread adoption, many established techniques such as Boruta, Recursive Feature Elimination and other wrapper based methods suffer from notable limitations; some incur substantial computational cost, while others offer no definite statistical driven stopping criteria or assess the significance of their importance scores. This paper proposes a novel feature selection method that addresses these limitations. Our approach introduces multiple random noise features and evaluates each feature's importance against the maximum importance value among these noise features incorporating a non-parametric bootstrap-based hypothesis testing framework to establish a solid theoretical foundation. We establish the conceptual soundness of our approach through statistical derivations that articulate the principles guiding the design of our algorithm. To assess reliability and practical utility, we validated the method on controlled simulations and diverse real-world datasets, where it consistently outperformed established feature-selection approaches including Boruta, Model-X Knockoffs, RFE, LASSO, Elastic Net, and mRMR in recovering meaningful signals. Hence, the method emerges as a robust algorithm for principled feature selection, enabling the distillation of informative predictors that support reliable inference, enhanced predictive performance, and efficient computation.

## CratesBump: A Version-Bump Dataset for the Rust Ecosystem

DevFeed: [CratesBump: A Version-Bump Dataset for the Rust Ecosystem](<https://devfeed.tech/articles/cratesbump-a-version-bump-dataset-for-the-rust-ecosystem-142191.md>)

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

Author: Muhammad Hassnain

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: [versioning](<https://devfeed.tech/topics/versioning.md>), [Rust](<https://devfeed.tech/topics/rust.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Data Quality](<https://devfeed.tech/topics/data-quality.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [cargo](<https://devfeed.tech/tags/cargo.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [ecosystem](<https://devfeed.tech/tags/ecosystem.md>), [pairs](<https://devfeed.tech/tags/pairs.md>), [release-cadence](<https://devfeed.tech/tags/release-cadence.md>), [repository](<https://devfeed.tech/tags/repository.md>), [rust](<https://devfeed.tech/tags/rust.md>), [version](<https://devfeed.tech/tags/version.md>)

### AI overview

CratesBump provides over two million consecutive release pairs from about 220,000 Rust crates, with 41 features spanning AST code diffs, dependency changes, complexity, release cadence, and GitHub activity. Each pair has two version-bump labels: the literal MAJOR.MINOR.PATCH interpretation and Cargo's rule that a 0.y bump is breaking. The accompanying semver-extract tool rebuilds the dataset using public crates.io data and the GitHub API. In held-out repository benchmarks, bump prediction was learnable but far from solved, with lower scores on later releases. The study also examines feature signals, whether declared dependency ranges shield dependents from pre-1.0 breaks, and a sample of releases where cargo-semver-checks found public API breaks in minor or patch releases. The dataset and tool are released under open licenses.

### Source excerpt

arXiv:2611.23664v1 Announce Type: new Abstract: We release CratesBump, the first public dataset for predicting version bumps in the Rust ecosystem, together with semver-extract, the tool that builds it. CratesBump is built from every crate on crates.io with at least two releases before 14 September 2026 (about 220,000 crates), giving over two million consecutive release pairs. Each pair has 41 features (code changes from AST diffs, dependency changes, complexity, release cadence, GitHub commit and issue activity), its source repository where listed, and two labels: the literal reading of MAJOR.MINOR.PATCH, and Cargo's rule, under which a 0.y bump is a breaking change. semver-extract regenerates the dataset from public crates.io data and the GitHub API. To illustrate its use we (i) benchmark bump predictors on held-out repositories, finding the task learnable but far from solved, with lower scores on later releases; (ii) measure which feature groups carry the signal; (iii) check, against declared dependency ranges, how often Cargo's rule shields dependents from pre-1.0 breaking releases; and (iv) audit a sample of releases with cargo-semver-checks, finding minor and patch releases that break the public API despite their version number. Dataset and tool are released under open licenses.

## Do 3D Point Representations Encode Architectural Functions? Probing Supervised and Pretrained Models on Urban Facades

DevFeed: [Do 3D Point Representations Encode Architectural Functions? Probing Supervised and Pretrained Models on Urban Facades](<https://devfeed.tech/articles/do-3d-point-representations-encode-architectural-functions-probing-supervised-and-pretrained-models-on-urban-facades-143438.md>)

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

Author: Abdiaziz Muse, Jiju Poovvancheri

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

Content type: article

Language: en

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

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [AI Models](<https://devfeed.tech/topics/ai-models.md>), [AI Foundation Models](<https://devfeed.tech/topics/ai-foundation-models.md>), [3D](<https://devfeed.tech/topics/3d.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>)

Tags: [3d](<https://devfeed.tech/tags/3d.md>), [building](<https://devfeed.tech/tags/building.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [elements](<https://devfeed.tech/tags/elements.md>), [features](<https://devfeed.tech/tags/features.md>), [fine-tuning](<https://devfeed.tech/tags/fine-tuning.md>), [function](<https://devfeed.tech/tags/function.md>), [functional](<https://devfeed.tech/tags/functional.md>), [functions](<https://devfeed.tech/tags/functions.md>), [lidar](<https://devfeed.tech/tags/lidar.md>), [linear](<https://devfeed.tech/tags/linear.md>), [models](<https://devfeed.tech/tags/models.md>), [point](<https://devfeed.tech/tags/point.md>), [pretraining](<https://devfeed.tech/tags/pretraining.md>), [transformers](<https://devfeed.tech/tags/transformers.md>)

### AI overview

On 22 mobile-LiDAR buildings labeled with 15 functional attributes per element, frozen self-supervised Utonia features reached 0.732 mAP on functionally ambiguous elements, compared with 0.610 for hand-crafted descriptors. Networks trained from scratch, including models up to 108M parameters, did not clearly surpass the descriptors. Random-weight controls scored 0.649 and 0.652; Utonia's reported pretraining gain was +0.080, with a 95% building interval of [+0.035, +0.124]. Pretrained features improved as labeled buildings increased, while descriptors and random features plateaued. Fine-tuning eroded the benefit in the tested configurations, suggesting that at this data scale function is better read from pretrained representations than learned from scratch.

### Source excerpt

arXiv:2611.23720v1 Announce Type: cross Abstract: Semantic labels say what a building element is, not what it does: two identical-looking windows on one facade may be operable or fixed, a column may carry load or only decorate. We ask whether 3D point representations encode such architectural function. On 22 mobile-LiDAR buildings with 15 functional attributes per element, we hold out entire buildings and compare hand-crafted descriptors, networks trained from scratch and frozen self-supervised point transformers. Descriptors and frozen features are read by the same linear layer. No network trained from scratch, from PointNet to a 108M-parameter PTv3, clearly exceeds the descriptors (0.610 mAP on functionally ambiguous elements), whereas frozen Utonia reaches 0.732. Random-weight controls of the same architectures (0.649 and 0.652) attribute the gain to pretraining (Utonia: +0.080, 95% building interval [+0.035, +0.124]). Pretrained features improve at every tested number of labelled buildings while descriptors and random features plateau, and, in the configurations we tested, fine-tuning erodes the benefit: at today's data scale, function is better read from pretrained representations than learned from scratch.

## Equivariant Modeling with Polynomial Features via Minimal Homogeneous Generators

DevFeed: [Equivariant Modeling with Polynomial Features via Minimal Homogeneous Generators](<https://devfeed.tech/articles/equivariant-modeling-with-polynomial-features-via-minimal-homogeneous-generators-143579.md>)

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

Author: Michael Liaofan Liu, Joe Kileel

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

Content type: article

Language: en

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

Topics: [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [machine learning overfitting](<https://devfeed.tech/topics/machine-learning-overfitting.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [application](<https://devfeed.tech/tags/application.md>), [architectures](<https://devfeed.tech/tags/architectures.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [feature](<https://devfeed.tech/tags/feature.md>), [features](<https://devfeed.tech/tags/features.md>), [framework](<https://devfeed.tech/tags/framework.md>), [functions](<https://devfeed.tech/tags/functions.md>), [generators](<https://devfeed.tech/tags/generators.md>), [input](<https://devfeed.tech/tags/input.md>), [invariant](<https://devfeed.tech/tags/invariant.md>), [layers](<https://devfeed.tech/tags/layers.md>), [learning](<https://devfeed.tech/tags/learning.md>), [linear](<https://devfeed.tech/tags/linear.md>), [linear-combination](<https://devfeed.tech/tags/linear-combination.md>), [minimal](<https://devfeed.tech/tags/minimal.md>), [model](<https://devfeed.tech/tags/model.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [models](<https://devfeed.tech/tags/models.md>), [module](<https://devfeed.tech/tags/module.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The framework models equivariant functions between finite-dimensional semisimple real group representations as linear combinations of equivariant polynomial features, with learnable functions of invariant polynomial features as coefficients. It uses minimal homogeneous generators of the invariant algebra and covariant module up to prescribed degrees. A Python package computes the features and fits models; feature computation requires explicit isotypic decompositions of the input and output representations and Clebsch-Gordan decompositions of tensor products of irreducible representations. The authors report computational speedups over alternative computational algebra methods and accurate scientific-modeling predictors with few trainable parameters, in both end-to-end prediction and as layers in larger architectures.

### Source excerpt

arXiv:2611.24896v1 Announce Type: new Abstract: We present a general framework for modeling and learning equivariant functions between finite dimensional semisimple real group representations, unifying constructions developed across many application areas. Our model is a linear combination of equivariant polynomial features whose coefficients are arbitrary learnable functions of invariant polynomial features. We take as features minimal homogeneous generators for the invariant algebra and the covariant module over the invariant algebra, up to prescribed degrees. We provide a Python package that automatically computes these features and fits the resulting models to training data. The algorithm for feature computation requires explicit isotypic decompositions of the input and output representations, along with explicit Clebsch-Gordan decompositions of the tensor product of irreducible representations, and achieves speedups over alternative methods in computational algebra. Numerical experiments in scientific modeling demonstrate the full learning pipeline and yield accurate predictors with few trainable parameters, using the model both for end-to-end prediction and within layers of larger architectures.

## Morpho-Spectral Projection Analysis (MSPA) for Plant Spectroscopy

DevFeed: [Morpho-Spectral Projection Analysis (MSPA) for Plant Spectroscopy](<https://devfeed.tech/articles/morpho-spectral-projection-analysis-mspa-for-plant-spectroscopy-143535.md>)

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

Author: Lucas Prado Osco, Marcelo Santos da Silva, Filipe Vieira Silva, Liang Zhao, Ana Paula Marques Ramos, Ednaldo Jose Ferreira, Roberto Dantas de Medeiros, Amaury Burlamaqui Bendahan, Lucio Andre de Castr

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>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>)

Tags: [classifiers](<https://devfeed.tech/tags/classifiers.md>), [covariance-shrinkage](<https://devfeed.tech/tags/covariance-shrinkage.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [github](<https://devfeed.tech/tags/github.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [open-source-code](<https://devfeed.tech/tags/open-source-code.md>), [plant](<https://devfeed.tech/tags/plant.md>), [projection](<https://devfeed.tech/tags/projection.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [spectroscopy](<https://devfeed.tech/tags/spectroscopy.md>), [tabpfn](<https://devfeed.tech/tags/tabpfn.md>)

### AI overview

MSPA preserves spectral order by combining continuum-removed absorption and red-edge measures, local 0th-, 1st- and 2nd-derivative eigenmodes across contiguous sub-windows, and Fisher-weighted canonical subspaces with covariance shrinkage. Evaluated on 8,963 spectra from five plant systems with six classical classifiers and four tabular foundation models, it compressed 1,580 bands by 96%. The abstract reports higher performance than the full spectrum in 92% of benchmarks and conventional reducers in 90% of model-crop evaluations; global mean macro-F1 rose from 0.7756 to 0.8520, with in-context inference accelerated by up to 126.5x. These are abstract-level reported results; no further evaluation details are supplied.

### Source excerpt

arXiv:2611.24599v1 Announce Type: new Abstract: Plant reflectance spectroscopy across the visible, near-infrared, and shortwave infrared domain encodes foliar biochemical and anatomical traits into contiguous spectral signatures with locally differentiable structure; however, extreme inter-band collinearity and unfavorable sample-to-feature ratios challenge predictive modeling. Conventional dimensionality reduction methods routinely adopted in spectroscopy, are column-permutation invariant: they treat adjacent wavelengths as unordered tabular columns and discard the sequential differential geometry of absorption features. Here, we propose Morpho-Spectral Projection Analysis (MSPA), a supervised dimensionality reduction operator that projects contiguous spectra into a compact morpho-spectral subspace through three complementary blocks: (i) additive continuum-removed absorption depth, area, and red-edge inflection kinematics; (ii) local multi-order singular eigenmodes (0th, 1st, and 2nd derivatives) partitioned across contiguous radiative sub-windows; and (iii) global Fisher-weighted canonical subspaces regularized via trace-normalized isotropic covariance shrinkage. We validated MSPA across 8,963 spectra spanning five plant systems, coupled with six classical machine learning classifiers and four Tabular Foundation Models (TabPFN v3, TabICL v2, TabDPT v1.2, and TabFM). Despite compressing the 1,580-band spectrum by 96%, MSPA outperformed the full spectrum in 92.0% of all benchmarks and conventional reducers in 90.0% of all model-crop evaluations, raising the global mean macro-F1 from 0.7756 (full spectrum) to 0.8520, accelerating in-context inference by up to 126.5x. Designed as a self-contained spectral projection operator, the MSPA method can be directly integrated into spectroscopy workflows via the open-source code available at GitHub: https://github.com/Lucas-Osco/mspa.

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

## TabDAG: Structured Evolutionary Search for Tabular Feature Engineering

DevFeed: [TabDAG: Structured Evolutionary Search for Tabular Feature Engineering](<https://devfeed.tech/articles/tabdag-structured-evolutionary-search-for-tabular-feature-engineering-141811.md>)

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

Author: Anastasia Volkova (FusionBrain Lab), Andrey Kuznetsov (FusionBrain Lab), Ivan Oseledets (AXXX), Valentin Khrulkov (FusionBrain Lab, AXXX)

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

Content type: article

Language: en

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

Topics: [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [Structured-data](<https://devfeed.tech/topics/structured-data.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ne](<https://devfeed.tech/tags/cs-ne.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [feature-engineering](<https://devfeed.tech/tags/feature-engineering.md>), [graph](<https://devfeed.tech/tags/graph.md>), [performance](<https://devfeed.tech/tags/performance.md>), [search](<https://devfeed.tech/tags/search.md>), [structured](<https://devfeed.tech/tags/structured.md>)

### AI overview

TabDAG searches for tabular features by evolving executable dependency graphs: nodes represent row-wise or data-fitted transformations, and structured, schema-constrained edits build compositions such as interactions, encodings, and clustering or neighborhood features. In experiments on ten regression and classification datasets and three model families, evolved features improve performance over raw inputs. TabDAG and TabDAG combined with OpenFE have the best mean ranks among compared methods, though pairwise rank differences between feature-engineering methods do not survive multiple-testing correction. With the search engine, model backbone, and candidate budget held fixed, constrained graph edits produce fewer failed evaluations than free-form Python or whole-graph JSON rewrites. Structural checks prevent invalid programs from reaching evaluation, but proposals may be rejected and valid graphs can still fail at runtime.

### Source excerpt

arXiv:2611.22828v1 Announce Type: cross Abstract: Feature engineering can improve tabular prediction, but useful transformations are compositional, data-dependent, and subject to leakage constraints. We present TabDAG, a framework that combines evolutionary search with a graph representation of feature-engineering programs. Nodes implement row-wise or data-fitted transformations; edges encode dependencies among raw variables, intermediate values, and final features. The representation supports interactions, statistical encodings, clustering- and neighborhood-based features, and multi-stage compositions in a single executable program. Mutations are structured edits constrained by a parent-specific schema and checked before evaluation. In our experiments, no structurally invalid program reached evaluation, although proposals could be rejected and valid graphs could still fail at runtime. Across ten regression and classification datasets and three tabular model families, evolved features improve predictive performance over raw inputs. TabDAG and its combination with OpenFE achieve the two best mean ranks among the compared methods; pairwise rank differences between feature-engineering methods do not survive multiple-testing correction. The LLM-based searches use the same backbone and candidate-evaluation budget. A controlled ablation compares free-form Python, whole-graph JSON, and constrained graph edits with the search engine, budget, and backbone held fixed. Constrained edits yield fewer failed evaluations than either rewrite baseline. The resulting graphs expose the transformations and dependencies selected by search, enabling feature-level analysis of the observed gains.

## Zero-Dimensional Attention Topology for Linguistic Acceptability

DevFeed: [Zero-Dimensional Attention Topology for Linguistic Acceptability](<https://devfeed.tech/articles/zero-dimensional-attention-topology-for-linguistic-acceptability-141765.md>)

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

Author: Saeed AlMarri (Khalifa University)

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

Content type: article

Language: en

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

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [bert](<https://devfeed.tech/topics/bert.md>), [Transformer](<https://devfeed.tech/topics/transformer.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Feature Engineering](<https://devfeed.tech/topics/feature-engineering.md>)

Tags: [attention](<https://devfeed.tech/tags/attention.md>), [bert](<https://devfeed.tech/tags/bert.md>), [classification](<https://devfeed.tech/tags/classification.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>), [persistent-homology](<https://devfeed.tech/tags/persistent-homology.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [topology](<https://devfeed.tech/tags/topology.md>)

### AI overview

The fixed H₀ attention representation did not show a predictive advantage over simpler attention statistics for linguistic acceptability. It summarizes minimum-spanning-tree merge values from 144 symmetrized BERT attention graphs into 1,440 features. In the retrospective evaluation, its out-of-domain Matthews correlation was 0.438, versus 0.508 for attention statistics and 0.545 for BERT. The analysis found that the representation retains token-count information while discarding some directional attention differences. The authors also report that uncertainty estimates from resampling BERT predictions depend on the sampling unit. Attention-feature scores are retained aggregate measurements, while BERT predictions were rescored and length controls refitted from accompanying records.

### Source excerpt

arXiv:2611.22312v1 Announce Type: cross Abstract: Topological summaries of Transformer attention provide sentence representations for linguistic acceptability classification. We examine a zero-dimensional persistent-homology ($H_0$) representation that summarizes minimum-spanning-tree merge values from 144 symmetrized BERT attention graphs into 1,440 features. The retrospective evaluation uses 8,517 downstream training sentences and 521 in-domain and 497 out-of-domain CoLA validation sentences after data-integrity filtering. The recorded out-of-domain Matthews correlation coefficients are 0.438 for the topological representation and 0.508 for attention statistics, compared with 0.545 for BERT. Attention-feature results are retained aggregate measurements; BERT predictions are rescored and length controls are refitted from the accompanying records. Analytical results show that the representation retains token-count information and discards a class of directional attention differences. Source resampling of BERT predictions also demonstrates the sensitivity of uncertainty estimates to the sampling unit. The reported results do not demonstrate a predictive advantage for this fixed topological representation over simpler attention summaries. They identify representation properties and evaluation controls relevant to subsequent studies of attention topology.

[Next page](<https://devfeed.tech/topics/feature-engineering.md?cursor=WyIyMDI2LTExLTE4VDA1OjAwOjAwKzAwOjAwIiwgIjI4Zjc5OWE0LTgyMjgtNDlkZi1iOWY2LTQwZmU3NTAxM2Y2MCJd>)