# scikit-learn

scikit-learn is an open-source Python machine-learning library providing tools for predictive data analysis and algorithms for tasks such as classification, regression, clustering, and preprocessing.

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

## Gradient Boosting with Kolmogorov-Arnold Units for Interpretable Regression beyond Pairwise Interactions

DevFeed: [Gradient Boosting with Kolmogorov-Arnold Units for Interpretable Regression beyond Pairwise Interactions](<https://devfeed.tech/articles/gradient-boosting-with-kolmogorov-arnold-units-for-interpretable-regression-beyond-pairwise-interactions-145121.md>)

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

Author: Minjong Cheon, Hanseon Joo, Eunji Lee

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>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [catboost](<https://devfeed.tech/topics/catboost.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [black-box](<https://devfeed.tech/tags/black-box.md>), [boosting](<https://devfeed.tech/tags/boosting.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [functions](<https://devfeed.tech/tags/functions.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [gradient-boosting](<https://devfeed.tech/tags/gradient-boosting.md>), [hessian](<https://devfeed.tech/tags/hessian.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [learner](<https://devfeed.tech/tags/learner.md>), [lightgbm](<https://devfeed.tech/tags/lightgbm.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model](<https://devfeed.tech/tags/model.md>), [models](<https://devfeed.tech/tags/models.md>), [newton](<https://devfeed.tech/tags/newton.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [regression](<https://devfeed.tech/tags/regression.md>), [residual](<https://devfeed.tech/tags/residual.md>), [units](<https://devfeed.tech/tags/units.md>), [variance](<https://devfeed.tech/tags/variance.md>)

### AI overview

MJBoost extends interpretable boosting beyond pairwise interactions using weak learners of the form g(∑p φp(xp)), with penalized spline functions fitted by alternating penalized least squares. Its exact functional ANOVA decomposition separates main effects, pair effects, and a higher-order remainder; categorical and missing inputs enter the units directly. On synthetic targets with interaction orders three to six, test error was up to 13 times lower than EBM's, and estimated variance shares were within 0.04 of the true shares. Across 35 OpenML-CTR23 regression tasks, MJBoost had lower RMSE than EBM on 21 and higher RMSE on 2; main and pair effects explained a median 0.992 of model variance. With Newton steps, binary-classification log-loss was on par with EBM across 32 OpenML-CC18 tasks; on 11 multiclass tasks, mean log-loss was lower than EBM's on 8 and tuned LightGBM's on 7.

### Source excerpt

arXiv:2611.25942v1 Announce Type: new Abstract: Interpretable models for tabular regression, such as the explainable boosting machine (EBM), restrict a prediction to main effects and pairwise interactions so that every part of it can be plotted. When the target depends on three or more inputs jointly, this restriction costs accuracy, and a black-box model with post hoc explanations becomes the usual fallback. Here we present MJBoost, a gradient boosting method whose weak learner is a single Kolmogorov-Arnold unit $g(\sum_p \phi_p(x_p))$ with penalized spline inner and outer functions. Each unit is fitted in closed form by alternating penalized least squares, starting from principal Hessian directions of the residual, and categorical and missing inputs enter the units directly. Because a unit depends on each input only through one inner function, the fitted model has an exact functional ANOVA decomposition into main effects, pair effects and a higher-order remainder, which one-dimensional convolutions compute. On synthetic targets of interaction order three to six, the test error of MJBoost is up to 13 times lower than that of EBM, and its decomposition recovers the true variance share of every order to within 0.04. On the 35 regression tasks of the OpenML-CTR23 benchmark, it has a lower test RMSE than EBM on 21 tasks and a higher one on 2 (geometric-mean RMSE -29.1%). On these tasks the main and pair effects of the fitted model explain a median 0.992 of its variance, so the model reads as plots where the data allow, and the decomposition measures the higher-order part where they do not. With Newton steps the same algorithm classifies: on 32 binary tasks of OpenML-CC18 its test log-loss is on par with that of EBM, and on 11 multiclass tasks its mean log-loss is lower than that of EBM on 8 and than that of tuned LightGBM on 7.

## RF-Based Macronutrient Estimation in Liquid Foods via Composition-Aware Multi-Task Learning

DevFeed: [RF-Based Macronutrient Estimation in Liquid Foods via Composition-Aware Multi-Task Learning](<https://devfeed.tech/articles/rf-based-macronutrient-estimation-in-liquid-foods-via-composition-aware-multi-task-learning-137021.md>)

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

Author: Ishtiaque Ahmed Showmik, Kannan Athreya

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

Content type: article

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [fourier transform](<https://devfeed.tech/topics/fourier-transform.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [canonical](<https://devfeed.tech/tags/canonical.md>), [categories](<https://devfeed.tech/tags/categories.md>), [challenge](<https://devfeed.tech/tags/challenge.md>), [channel](<https://devfeed.tech/tags/channel.md>), [classes](<https://devfeed.tech/tags/classes.md>), [composition](<https://devfeed.tech/tags/composition.md>), [concatenation](<https://devfeed.tech/tags/concatenation.md>), [condition](<https://devfeed.tech/tags/condition.md>), [content](<https://devfeed.tech/tags/content.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [domain](<https://devfeed.tech/tags/domain.md>), [driver](<https://devfeed.tech/tags/driver.md>), [learning](<https://devfeed.tech/tags/learning.md>), [liquid](<https://devfeed.tech/tags/liquid.md>), [rf](<https://devfeed.tech/tags/rf.md>)

### AI overview

The study tests whether synchronous 2.4 GHz OFDM radio-frequency measurements can estimate carbohydrate, fat, and protein in liquid foods. Its Ingredient-Conditioned OFDM Transformer (ICOT) processes two-dimensional channel frequency response matrices, infers canonical ingredient categories, then uses those categories to condition macronutrient regression. Across 28,420 captures from 55 beverage classes, it reports mean absolute errors of 0.101 g/100 ml for in-distribution data and 0.485 g/100 ml for out-of-distribution data, described as comparable in magnitude to deviations in manufacturer-reported labels. The authors present this as an early step toward passive, label-free sensing in a liquid-contacting vessel; generalizing to novel formulations remains the primary open challenge.

### Source excerpt

arXiv:2611.19052v1 Announce Type: new Abstract: Current approaches to macronutrient estimation range from high-overhead laboratory analysis to user-dependent methods such as manual nutritional lookup, reading package labels, and vision-based image analysis. These approaches are often time-consuming, input-dependent, or sensitive to imaging and measurement conditions. In this work, we investigate synchronous 2.4 GHz OFDM radio-frequency (RF) measurements for estimating carbohydrate, fat, and protein content in liquid foods. Using a controlled sensing setup, we study how liquid composition shapes frequency-domain RF responses -- a first step toward a sensor integrated into a liquid-contacting vessel that estimates macronutrient content passively and label-free, and toward composition-aware RF food analysis beyond liquids. We propose the Ingredient-Conditioned OFDM Transformer (ICOT), a structure-aware multi-task Transformer that operates on two-dimensional OFDM channel frequency response matrices. ICOT infers canonical ingredient categories representing dielectric-driver composition and uses them to condition macronutrient regression through feature concatenation. On 28,420 captures spanning 55 beverage classes, ICOT achieves an in-distribution MAE of 0.101 g/100 ml and an out-of-distribution MAE of 0.485 g/100 ml -- comparable in magnitude to deviations present in manufacturer-reported labels -- though generalization to novel formulations remains the primary open challenge.

## A Scalable Multi Task Learning Framework for Modeling Demographic Disagreements in Annotation Tasks

DevFeed: [A Scalable Multi Task Learning Framework for Modeling Demographic Disagreements in Annotation Tasks](<https://devfeed.tech/articles/a-scalable-multi-task-learning-framework-for-modeling-demographic-disagreements-in-annotation-tasks-139172.md>)

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

Author: Soumyajit Gupta, Maria De-Arteaga, Matthew Lease

Published: 2026-11-17T05: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>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [annotation](<https://devfeed.tech/tags/annotation.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deployment](<https://devfeed.tech/tags/deployment.md>), [detection](<https://devfeed.tech/tags/detection.md>), [framework](<https://devfeed.tech/tags/framework.md>), [groups](<https://devfeed.tech/tags/groups.md>), [labeling](<https://devfeed.tech/tags/labeling.md>), [large](<https://devfeed.tech/tags/large.md>), [learning](<https://devfeed.tech/tags/learning.md>), [model](<https://devfeed.tech/tags/model.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [performance](<https://devfeed.tech/tags/performance.md>), [perspective](<https://devfeed.tech/tags/perspective.md>), [posts](<https://devfeed.tech/tags/posts.md>), [practical](<https://devfeed.tech/tags/practical.md>), [prioritization](<https://devfeed.tech/tags/prioritization.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [tasks](<https://devfeed.tech/tags/tasks.md>)

### AI overview

SAJ-MTL models demographic disagreement both across and within annotator groups, recognizing that a group's perspective may deserve greater weight when its members have an epistemic advantage or greater stake in the task. It uses conditional gradient routing to address sparse group-conditional labels and supports customized group weighting across tasks. The abstract reports improved group-level toxicity-detection performance through more context-aware handling of demographic-sensitive content. The method requires annotator group membership rather than more privacy-invasive individual-level details, and its authors describe the architecture as computationally efficient for large-scale deployment.

### Source excerpt

arXiv:2611.21458v1 Announce Type: cross Abstract: Annotators from different demographic backgrounds often disagree in systematic ways due to varying lived experiences, cultural contexts, and their relationship to the content. When such disagreement occurs, one group's perspective may sometimes warrant prioritization because they hold an epistemically advantaged standpoint or bear greater stake in the outcome. For example, when assessing toxicity of posts on social media, it may be important to prioritize a targeted group's viewpoint. We propose a Stakeholder-Aware Joint Multi-Task Learning (SAJ-MTL) framework to jointly model demographic disagreement both across- and within- annotator groups. The model uses conditional gradient routing to handle sparsity induced by group-conditional labeling, and parameterization supports customized weighting of groups in different task settings. SAJ-MTL improves group-level performance in toxicity detection through better context-aware understanding of demographic-sensitive content. Only annotator group-membership information is required, which is more practical than existing methods requiring more privacy-invasive individual-level annotator details. Our scalable architecture is also computationally efficient to support large-scale deployment.

## Quantifying the added value of human forecaster discussions for tropical cyclone intensity prediction

DevFeed: [Quantifying the added value of human forecaster discussions for tropical cyclone intensity prediction](<https://devfeed.tech/articles/quantifying-the-added-value-of-human-forecaster-discussions-for-tropical-cyclone-intensity-prediction-139201.md>)

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

Author: Ilia Azizi, Frederick Iat-Hin Tam, Marc-Olivier Boldi, Val\\'erie Chavez-Demoulin, Tom Beucler

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

Content type: article

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Natural language processing](<https://devfeed.tech/topics/nlp.md>)

Tags: [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [deep-learning](<https://devfeed.tech/tags/deep-learning.md>), [discussions](<https://devfeed.tech/tags/discussions.md>), [human-judgment](<https://devfeed.tech/tags/human-judgment.md>), [hurricane](<https://devfeed.tech/tags/hurricane.md>), [models](<https://devfeed.tech/tags/models.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [text](<https://devfeed.tech/tags/text.md>), [value](<https://devfeed.tech/tags/value.md>)

### AI overview

Across 637 Atlantic and eastern North Pacific tropical cyclones (2002-2023), National Hurricane Center discussion text alone provided value comparable to SHIPS predictors for 24-hour intensity forecasts. In an ensemble of five models, adding discussions to SHIPS reduced 2022-2023 24-hour maximum-wind mean absolute error from 9.89 to 8.90 kt; storm-level resampling gave a confidence interval excluding zero. ERA5 10-meter winds had a minor effect on wind-prediction error, and model rankings varied by variable, lead time, and method. Prediction-interval coverage fell below its 90% target during rapid intensification. Because the study is retrospective, uses reanalysis that differs from real-time analyses, and discussions arrive at least three hours after the other inputs' valid time, its results should not be interpreted operationally.

### Source excerpt

arXiv:2611.21602v1 Announce Type: new Abstract: The National Hurricane Center routinely releases Tropical Cyclone Discussions that offer insights into its tropical cyclone forecasts. This study examines the added value of these discussions for intensity forecasting beyond a set of numerical predictors. For 637 Atlantic and eastern North Pacific tropical cyclones from the 2002-2023 hurricane seasons, we analyze the discussion text and its combination with 13 hurricane environmental predictors from SHIPS and ERA5 10-meter wind fields, for forecasting intensity changes at lead times of 24 to 120 hours using three modeling methods. In one approach, an end-to-end deep learning framework for the text shows that the discussions alone offer comparable value for 24-hour intensity forecasts to the SHIPS predictors. Adding discussion information to the SHIPS predictors in an ensemble of five such models reduces the mean absolute error of 24-hour maximum sustained wind forecasts for 2022-2023 cyclones from 9.89 to 8.90 kt, with a confidence interval that excludes zero when whole storms are resampled. The ERA5 wind fields have a minor effect on mean absolute error in wind predictions, and model rankings differ across predicted variables, lead times and model types. We provide prediction intervals for these forecasts, whose coverage falls below the 90% target during rapid intensification. Analysis of the text shows that words related to intensity and intensity change (such as intensify, weaken, eyewall and category) are important for the model predictions. This retrospective study shows the added value of the forecasters' discussions and suggests that multi-modal learning can help understand the predictive contribution of expert human judgment. The reanalysis data differ from real-time analyses, and the discussions are issued at least three hours after the valid time of the other inputs, so these results should not be interpreted operationally.

## Reliable Mining of Heterogeneous AI Coding-Agent Data: Context-Aware Prediction and Resource-Aware Ranking

DevFeed: [Reliable Mining of Heterogeneous AI Coding-Agent Data: Context-Aware Prediction and Resource-Aware Ranking](<https://devfeed.tech/articles/reliable-mining-of-heterogeneous-ai-coding-agent-data-context-aware-prediction-and-resource-aware-ranking-138000.md>)

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

Author: Haoran Yu, Lifei Liu, Danping Zhang

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

Content type: article

Language: en

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

Topics: [Data analysis](<https://devfeed.tech/topics/data-analysis.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>), [Pull Request](<https://devfeed.tech/topics/pull-request.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [after](<https://devfeed.tech/tags/after.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-coding](<https://devfeed.tech/tags/ai-coding.md>), [ai-coding-agent](<https://devfeed.tech/tags/ai-coding-agent.md>), [ai-coding-agents](<https://devfeed.tech/tags/ai-coding-agents.md>), [aipw](<https://devfeed.tech/tags/aipw.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [association](<https://devfeed.tech/tags/association.md>), [coding](<https://devfeed.tech/tags/coding.md>), [coding-agent](<https://devfeed.tech/tags/coding-agent.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [data](<https://devfeed.tech/tags/data.md>), [mining](<https://devfeed.tech/tags/mining.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [ranking](<https://devfeed.tech/tags/ranking.md>), [resource](<https://devfeed.tech/tags/resource.md>)

### AI overview

Across 71,677 pull requests from six AI coding agents, pooling records can reverse observed relationships: PRs with a co-authorship trailer had a 55.6% merge rate versus 77.5% without, but excluding the dominant agent reversed the gap. Conditioning on source, environment, and workflow raised gradient-boosting merge-prediction AUC from 0.774 to 0.832, with gains in temporal and unseen-repository evaluations; adjusted analysis found no stable trailer association. A creation-time-only model performed less well, especially temporally. A separate retrospective analysis estimated a 12.3-point gain from resource-aware allocation at a 30% budget, just 0.5 points above risk ranking. This is decision support over observed metadata, not evidence that assigning human review causes better outcomes.

### Source excerpt

arXiv:2611.20297v1 Announce Type: new Abstract: Operational records from AI coding agents differ across agents, repositories, tasks, and workflows. We study 71,677 pull requests (PRs) from six agents and show that pooling these records can reverse descriptive and predictive conclusions. PRs carrying a co-authorship trailer have a 55.6% merge rate, compared with 77.5% without the trailer, but removing the dominant agent flips this -21.8 percentage-point gap to +23.7 points. We treat this Simpson-type reversal as a data-veracity problem and represent source, environment, and workflow context in a feature cascade. Gradient-boosting merge-prediction AUC increases from 0.774 to 0.832; the advantage persists under temporal evaluation (0.801) and unseen repositories (0.807). The co-authorship coefficient changes from -1.09 to +1.44 after conditioning, whereas repository-clustered AIPW intervals show no stable adjusted trailer association. A strict PR-creation-time model reaches 0.741 AUC in standard evaluation and 0.710 on unseen repositories, although its temporal AUC falls to 0.641. Finally, a separately cross-fitted analysis of an observed-mode functional estimates a +12.3-point doubly robust gain at a 30% allocation budget on the non-Codex population, only 0.5 points above risk ranking. This last result is retrospective decision support over metadata states, not a causal effect of assigning human review.

## Measuring Coherence in Predictive Models

DevFeed: [Measuring Coherence in Predictive Models](<https://devfeed.tech/articles/measuring-coherence-in-predictive-models-139025.md>)

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

Author: Jamie Reason, Vik Shirvaikar, Mark van der Wilk, Chris Holmes

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

Content type: article

Language: en

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

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

Tags: [acquisition](<https://devfeed.tech/tags/acquisition.md>), [bayesian](<https://devfeed.tech/tags/bayesian.md>), [coherence](<https://devfeed.tech/tags/coherence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [decision-making](<https://devfeed.tech/tags/decision-making.md>), [learning](<https://devfeed.tech/tags/learning.md>), [measuring](<https://devfeed.tech/tags/measuring.md>), [models](<https://devfeed.tech/tags/models.md>), [predictions](<https://devfeed.tech/tags/predictions.md>), [ratio](<https://devfeed.tech/tags/ratio.md>), [sequential-decision](<https://devfeed.tech/tags/sequential-decision.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [test](<https://devfeed.tech/tags/test.md>), [tools](<https://devfeed.tech/tags/tools.md>)

### AI overview

Sequential decision procedures depend on how a model updates as well as on its predictive accuracy, and the abstract argues that update coherence should be measured rather than assumed. The paper introduces an MMD-based incoherence ratio, computed from a procedure's own predictions and updates, plus an anytime-valid coherence test. In Bayesian experimental design, acquisition objectives equivalent under coherent models select different data under every approximate model studied; the ratio tracks the resulting distortion. A separate action coherence measure isolates incoherence that changes decisions, while the cost of disagreement depends primarily on predictive accuracy.

### Source excerpt

arXiv:2611.20325v1 Announce Type: cross Abstract: Many sequential decision-making procedures, such as active learning, implicitly assume that a model's current predictions agree with those it expects to make after updating on new data, a property we call coherence. Most models in use do not update by exact conditioning and are not guaranteed to be coherent, which can lead to worse decisions. Yet there is currently no general way to measure incoherence or to tell when it matters. We develop tools to measure incoherence and characterise when it affects decisions. We introduce the incoherence ratio, an MMD-based measure of how far any updating procedure departs from coherence, computed only from the procedure's own predictions and updates, and accompany it with an anytime-valid test of coherence. In Bayesian experimental design, acquisition objectives that are equivalent for coherent models choose different data under every approximate model we study, and the incoherence ratio tracks how far incoherence distorts them. We also introduce action coherence, which captures only the incoherence that changes a decision. What a resulting disagreement costs, however, is determined primarily by predictive accuracy. Sequential decisions depend on how a model updates as well as on what it predicts, so coherence, like accuracy, should be checked rather than assumed.

## On the Applicability of $p$-adic Numbers in Computational Modules for Neural Networks

DevFeed: [On the Applicability of $p$-adic Numbers in Computational Modules for Neural Networks](<https://devfeed.tech/articles/on-the-applicability-of-p-adic-numbers-in-computational-modules-for-neural-networks-139058.md>)

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

Author: Vladimir Evgrafov

Published: 2026-11-17T05: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>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [addition](<https://devfeed.tech/tags/addition.md>), [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [but](<https://devfeed.tech/tags/but.md>), [can](<https://devfeed.tech/tags/can.md>), [change](<https://devfeed.tech/tags/change.md>), [conversion](<https://devfeed.tech/tags/conversion.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [data](<https://devfeed.tech/tags/data.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [diabetes](<https://devfeed.tech/tags/diabetes.md>), [either](<https://devfeed.tech/tags/either.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [feature](<https://devfeed.tech/tags/feature.md>), [modules](<https://devfeed.tech/tags/modules.md>), [networks](<https://devfeed.tech/tags/networks.md>), [neural](<https://devfeed.tech/tags/neural.md>), [neural-networks](<https://devfeed.tech/tags/neural-networks.md>), [numbers](<https://devfeed.tech/tags/numbers.md>)

### AI overview

The tested p-adic conversion and reconstruction procedures did not preserve predictions in an otherwise unchanged machine-learning pipeline, even for one-feature linear regression on the scikit-learn Diabetes dataset. In pyAdic, reconstruction either returned no result or values differing from baseline; precision changes could alter the reconstructed value's magnitude and sign. SageMath conversions succeeded, but reconstructed predictions still differed. A digit-reversal representation also failed to preserve ordinary addition because of carry propagation. None of the test predictions was reconstructed correctly under the reported settings. The authors suggest investigating models defined directly over p-adic data and operations.

### Source excerpt

arXiv:2611.20467v1 Announce Type: new Abstract: The applicability of $p$-adic arithmetic as an intermediate computational module in an otherwise unchanged machine-learning pipeline is investigated. A one-feature linear regression on the scikit-learn Diabetes dataset serves as the test model. The fitted coefficients are represented in $\mathbb{Q}_p$, predictions are computed in that field, and rational reconstruction is applied to the outputs. In the pyAdic experiments, rational reconstruction either returns no result or produces values that differ from the baseline predictions; changing computational precision can change both the magnitude and sign of the reconstructed value. In SageMath, forward conversions succeed, but the reconstructed predictions differ from the baseline. An alternative representation based on digit reversal fails to preserve ordinary addition because of carry propagation. Under the tested settings, none of the test predictions is reconstructed correctly. These results show that the tested conversion and reconstruction procedures do not provide a compatible intermediate module even for linear regression. Models defined directly over $p$-adic data and operations offer a direction for further investigation.

## Cap-Aware Boosting for Green Day-Ahead Electricity Price Forecasting

DevFeed: [Cap-Aware Boosting for Green Day-Ahead Electricity Price Forecasting](<https://devfeed.tech/articles/cap-aware-boosting-for-green-day-ahead-electricity-price-forecasting-139132.md>)

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

Author: Shubham Pratap

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

Content type: article

Language: en

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

Topics: [Time Series](<https://devfeed.tech/topics/time-series.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [absolute](<https://devfeed.tech/tags/absolute.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [behavior](<https://devfeed.tech/tags/behavior.md>), [best](<https://devfeed.tech/tags/best.md>), [blending](<https://devfeed.tech/tags/blending.md>), [boosting](<https://devfeed.tech/tags/boosting.md>), [classification](<https://devfeed.tech/tags/classification.md>), [clock](<https://devfeed.tech/tags/clock.md>), [components](<https://devfeed.tech/tags/components.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [days](<https://devfeed.tech/tags/days.md>), [effectiveness](<https://devfeed.tech/tags/effectiveness.md>), [electricity](<https://devfeed.tech/tags/electricity.md>), [energy](<https://devfeed.tech/tags/energy.md>), [error](<https://devfeed.tech/tags/error.md>), [essential](<https://devfeed.tech/tags/essential.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [green](<https://devfeed.tech/tags/green.md>)

### AI overview

The LightGBM framework handles Indian GDAM's Rs 10,000/MWh price cap with a classifier for capped events and a log-space regressor for uncapped prices, blending their forecasts and providing nine quantiles for uncertainty. On 257 trading days from 1 January to 14 September 2026, it reports MAE 397.9 Rs/MWh and MAPE 9.57%, compared with MAE 583.3 for Chronos-2 and 589.1 for a previous-day-profile persistence baseline. Leak-safe variants add real-time market signals, unmatched sell volumes and solar-generation proxies. In later out-of-sample periods, the quantile-clock variant had MAE 789 over 25-28 October, while the enhanced capped-price model had MAE 716 across 21 evaluation days through 16 November.

### Source excerpt

arXiv:2611.21149v1 Announce Type: new Abstract: Accurate forecasting of Green Day-Ahead Market (GDAM) electricity prices is essential for market participants in the Indian power sector. We present a LightGBM-based forecasting framework for Indian Energy Exchange GDAM prices, which clear in 96 fifteen-minute intervals per day. The proposed system explicitly models price-cap behavior by separating capped-price events from normal market conditions. A classification head estimates the probability of the regulatory price cap (Rs 10,000/MWh), while a regression head predicts uncapped prices in logarithmic space. Final forecasts are obtained through probabilistic blending of these components and are accompanied by nine quantile forecasts for uncertainty estimation. Evaluated on 257 trading days between 1 January and 14 September 2026, the model achieves a mean absolute error (MAE) of 397.9 Rs/MWh and a mean absolute percentage error (MAPE) of 9.57%, substantially outperforming a Chronos-2 baseline (583.3 MAE) and a persistence baseline using the previous day's profile (589.1 MAE). We further introduce leak-safe variants that incorporate real-time market signals, unmatched sell volumes, and solar generation proxies. In a recent out-of-sample evaluation, the quantile-clock variant achieved the best short-term performance with an MAE of 789 Rs/MWh during 25-28 October, while the enhanced capped-price model achieved an MAE of 716 Rs/MWh across 21 evaluation days through 16 November. These results demonstrate the effectiveness of regime-aware probabilistic forecasting for high-volatility electricity markets.

## Serving Scikit-LLM Pipelines as REST APIs with FastAPI

DevFeed: [Serving Scikit-LLM Pipelines as REST APIs with FastAPI](<https://devfeed.tech/articles/serving-scikit-llm-pipelines-as-rest-apis-with-fastapi-135526.md>)

Original publisher: [Read original article](<https://machinelearningmastery.com/serving-scikit-llm-pipelines-as-rest-apis-with-fastapi/>)

Author: Iván Palomares Carrascosa

Published: 2026-11-16T11:00:00Z

Content type: tutorial

Language: en

Sources: [MachineLearningMastery.com](<https://devfeed.tech/sources/machinelearningmastery-com.md>)

Topics: [FastAPI](<https://devfeed.tech/topics/fastapi.md>), [text-classification](<https://devfeed.tech/topics/text-classification.md>), [REST API](<https://devfeed.tech/topics/rest-api.md>), [Ollama](<https://devfeed.tech/topics/ollama.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [apis](<https://devfeed.tech/tags/apis.md>), [classification](<https://devfeed.tech/tags/classification.md>), [fastapi](<https://devfeed.tech/tags/fastapi.md>), [language-models](<https://devfeed.tech/tags/language-models.md>), [llm](<https://devfeed.tech/tags/llm.md>), [local](<https://devfeed.tech/tags/local.md>), [ollama](<https://devfeed.tech/tags/ollama.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [pipelines](<https://devfeed.tech/tags/pipelines.md>), [rest](<https://devfeed.tech/tags/rest.md>), [rest-api](<https://devfeed.tech/tags/rest-api.md>), [rest-apis](<https://devfeed.tech/tags/rest-apis.md>), [serve](<https://devfeed.tech/tags/serve.md>), [serving](<https://devfeed.tech/tags/serving.md>), [text](<https://devfeed.tech/tags/text.md>), [text-classification](<https://devfeed.tech/tags/text-classification.md>), [zero-shot](<https://devfeed.tech/tags/zero-shot.md>)

### AI overview

The excerpt describes serving a Scikit-LLM zero-shot text classifier locally through FastAPI and Ollama. It configures a local Ollama model, builds a classifier with scikit-learn's fit/predict pattern, serializes it to a joblib file, then loads it in an asynchronous FastAPI app with a /predict endpoint that can accept multiple texts. The app is run with uvicorn and tested through FastAPI's interactive docs at /docs. The label set supplied during fit defines the only categories the classifier can return; the LLM's weights are not updated, so inputs are mapped into that closed set. The excerpt presents this as a simple one-stage pipeline and notes that Scikit-LLM can support larger pipelines with preprocessing.

### Source excerpt

In this article, you will learn how to serve a Scikit-LLM zero-shot text classification pipeline, powered by a local Ollama model, as a REST API...

## Domain Adaptation Based Pipeline for Character Classification and Handwritten Text Recognition

DevFeed: [Domain Adaptation Based Pipeline for Character Classification and Handwritten Text Recognition](<https://devfeed.tech/articles/domain-adaptation-based-pipeline-for-character-classification-and-handwritten-text-recognition-135846.md>)

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

Author: Florent Imbert, Simon Corbill\\'e, Hui Han, Elisa H. Barney Smith

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

Content type: article

Language: en

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

Topics: [text-classification](<https://devfeed.tech/topics/text-classification.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [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>), [distribution](<https://devfeed.tech/tags/distribution.md>), [domain](<https://devfeed.tech/tags/domain.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [recognition](<https://devfeed.tech/tags/recognition.md>)

### AI overview

The pipeline uses unlabeled target-domain data to adapt a model for character classification and handwritten text recognition when labeled target data is scarce. It first pretrains an expert model on source data, then performs unsupervised domain adaptation, and finally trains the expert on source data in the target style. The authors report that adaptation adds computation during training but not inference. Evaluations cover character classification and historical handwritten-line recognition: the method achieves 76.17% Macro F1 on Safran-MNIST-DLS (DAGECC Track 2), reported as a new state of the art, and competitive results on READ 2018 datasets without target labels.

### Source excerpt

arXiv:2611.17952v1 Announce Type: cross Abstract: Character classification and handwritten text recognition, particularly in specialized tasks, often suffer from limited labeled data, while a large amount of unlabeled data remains unused. To address this challenge, we propose a novel unsupervised domain adaptation-based pipeline to reduce the distribution gap between source and target domains. Our pipeline follows three main steps. In the first step, we pretrained an expert model on source data, to learn a strong general representation. In the second step, we perform unsupervised domain adaptation to leverage unlabeled target data, adapting the model to the specific characteristics of the target domain. In the third step, we trained the expert model on source data in the target style. By aligning the feature distributions between the source and target, our method enables the model to generalize effectively across diverse datasets. The unsupervised training increases the computation time only during training not in inference. We evaluate the pipeline on both character-level and historical handwritten line recognition tasks, demonstrating its flexibility. We establish a new state-of-the-art on the Safran-MNIST-DLS dataset defined in Track 2 of the DAGECC competition with 76.17% Macro F1-score and achieve competitive results on each of the specific datasets of READ 2018 without using the labels of the target data. Code is available at https://github.com/simon-corbi/DRANet-for-classification-and-htr

## Classification with Large-Step Gradient Descent: Unifying Self-Stabilization and Convergence Rates

DevFeed: [Classification with Large-Step Gradient Descent: Unifying Self-Stabilization and Convergence Rates](<https://devfeed.tech/articles/classification-with-large-step-gradient-descent-unifying-self-stabilization-and-convergence-rates-135774.md>)

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

Author: Salma Tarmoun, Lachlan Ewen MacDonald, Konstantinos Emmanouilidis, Ziqing Xu, Ren\\'e Vidal

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

Content type: article

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [alignment](<https://devfeed.tech/tags/alignment.md>), [bias](<https://devfeed.tech/tags/bias.md>), [classification](<https://devfeed.tech/tags/classification.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [gradient-descent](<https://devfeed.tech/tags/gradient-descent.md>), [linear](<https://devfeed.tech/tags/linear.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [margin](<https://devfeed.tech/tags/margin.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [neural-networks](<https://devfeed.tech/tags/neural-networks.md>), [stabilization](<https://devfeed.tech/tags/stabilization.md>)

### AI overview

For separable linear classification with logistic or cross-entropy loss, large-step gradient descent can oscillate even as it makes progress. The paper replaces the minimizer manifold used in prior least-squares analysis with a curvature-defined reference subspace: progress along directions of decreasing sharpness damps orthogonal oscillations. Under stated regularity conditions, verified for logistic and multiclass cross-entropy on symmetric data models, the authors derive explicit iterate bounds for unstable and stable regimes; the stable regime has three damping phases. They also identify a transient implicit bias: although the iterates asymptotically approach the max-margin direction, large steps can leave persistent orthogonal residuals and, in some geometries, amplify them, affecting finite-time alignment.

### Source excerpt

arXiv:2611.17459v1 Announce Type: new Abstract: Neural networks are often trained with gradient descent (GD) using step sizes that exceed classical stability thresholds, a regime where standard convergence theory no longer applies. Despite exhibiting non-monotonic loss and oscillatory dynamics, this regime frequently leads to faster convergence and better generalization. Existing theoretical perspectives offer complementary but incomplete insights: one identifies a self-stabilization mechanism that drives GD toward flat regions but does not yield convergence rates; another derives rigorous rates for specific losses but does not explain the underlying stabilization mechanism; and a third unifies these views for overparameterized least squares, but relies on the existence of a minimizer manifold, which is absent in classification settings. In this work, we extend this unified geometric perspective to exponential-tail losses, including logistic and cross-entropy losses in separable linear classification, where the loss infimum is not attained at any finite parameter. We identify a curvature-defined reference subspace that replaces the role of the minimizer manifold, yielding a coupled dynamical system in which orthogonal oscillations are damped by parallel progress along directions of decreasing sharpness. Under regularity conditions, which we verify for logistic and multiclass cross-entropy losses on symmetric data models, we derive explicit bounds for the iterates, not just the loss, covering both the unstable and stable regimes, and revealing a three-phase damping structure in the latter. Our analysis further uncovers a transient implicit bias induced by large step sizes: although GD converges asymptotically to the max-margin direction, large steps can leave persistent orthogonal residuals and, in certain geometries, amplify them, affecting finite-time alignment with the max-margin direction.

## Detection and Classification in Latent Spaces: High-Dimensional Analysis and Validation

DevFeed: [Detection and Classification in Latent Spaces: High-Dimensional Analysis and Validation](<https://devfeed.tech/articles/detection-and-classification-in-latent-spaces-high-dimensional-analysis-and-validation-135875.md>)

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

Author: Enis Chenchene, Anil S. Baslamisli, Paolo Braca

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

Content type: article

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>)

Tags: [audio](<https://devfeed.tech/tags/audio.md>), [binary-analysis](<https://devfeed.tech/tags/binary-analysis.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [decision-rules](<https://devfeed.tech/tags/decision-rules.md>), [detection](<https://devfeed.tech/tags/detection.md>), [dimension](<https://devfeed.tech/tags/dimension.md>), [error](<https://devfeed.tech/tags/error.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [foundation-models](<https://devfeed.tech/tags/foundation-models.md>), [linear](<https://devfeed.tech/tags/linear.md>), [models](<https://devfeed.tech/tags/models.md>), [modern](<https://devfeed.tech/tags/modern.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [performance](<https://devfeed.tech/tags/performance.md>), [predictions](<https://devfeed.tech/tags/predictions.md>), [probability](<https://devfeed.tech/tags/probability.md>), [results](<https://devfeed.tech/tags/results.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [validation](<https://devfeed.tech/tags/validation.md>)

### AI overview

The paper derives large-deviation predictions for false-alarm and miss-detection rates of linear and quadratic detectors on high-dimensional foundation-model representations, where latent dimension and training sample size grow proportionally. In a Neyman-Pearson setting, the framework can set a target false-alarm level and predict the associated miss-detection probability; its binary analysis also extends to multi-class classification. The reported error rates can vary non-monotonically with the shape parameter, showing double-descent and, in some regimes, multiple-descent. Experiments across vision, text, and audio datasets reportedly show close agreement between predictions and observed performance. The supplied text is an abstract and does not specify the detectors' formulas or experimental details.

### Source excerpt

arXiv:2611.18164v1 Announce Type: cross Abstract: Foundation models produce high-dimensional latent representations in which suitably designed statistical decision rules can be effective yet analytically tractable. We study such detectors in the high-dimensional regime, where latent dimension and training sample size grow proportionally. For linear and quadratic statistics, we derive explicit large-deviation characterizations of false-alarm and miss-detection performance under the Neyman-Pearson paradigm, and show how the binary analysis extends to multi-class classification. The resulting error probabilities and corresponding decay rates exhibit non-monotonic dependence on the shape parameter, including double-descent and, in some regimes, multiple-descent. Experiments on vision, text, and audio datasets using modern foundation models show close agreement between theoretical predictions and empirical performance. In particular, the proposed framework allows us to set a prescribed false-alarm level and accurately predict the corresponding miss-detection probability. Overall, our results provide a theoretically grounded and interpretable framework with competitive empirical performance across different modalities.

## Asymptotic Margins and Feature Confinement in Conic Classification Heads under Softmax Cross-Entropy

DevFeed: [Asymptotic Margins and Feature Confinement in Conic Classification Heads under Softmax Cross-Entropy](<https://devfeed.tech/articles/asymptotic-margins-and-feature-confinement-in-conic-classification-heads-under-softmax-cross-entropy-135911.md>)

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

Author: Omer Nezih Gerek

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

Content type: article

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [mlp](<https://devfeed.tech/topics/mlp.md>)

Tags: [bounded](<https://devfeed.tech/tags/bounded.md>), [cifar-10](<https://devfeed.tech/tags/cifar-10.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cross-entropy](<https://devfeed.tech/tags/cross-entropy.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [feature](<https://devfeed.tech/tags/feature.md>), [margins](<https://devfeed.tech/tags/margins.md>), [softmax](<https://devfeed.tech/tags/softmax.md>)

### AI overview

Bounded class regions do not necessarily keep learned features bounded under softmax cross-entropy. The paper defines an asymptotic margin, computable by a second-order cone program, to compare each class score's growth with competing scores. Positive margin means the class loss approaches zero only as features diverge; negative margin makes the loss coercive, with minimizers in an explicit ball. For scores combining a linear term and a Euclidean norm, class regions are bounded by a quadric of revolution whose eccentricity is the reciprocal of a learned ratio. The analysis extends to other norms, including polyhedral conic functions. In reported CIFAR-10 and CIFAR-100 experiments, all 1,210 cells across 67 trained conic heads had positive margins, while a prototype head kept nine of ten cells bounded.

### Source excerpt

arXiv:2611.18507v1 Announce Type: new Abstract: Classification heads built on conic functions give each class a bounded region of the feature space, and such regions are used to reject samples of unseen classes. We ask whether these regions also keep the features bounded when the head is trained with softmax cross-entropy. For a head whose class scores combine a linear term with a Euclidean norm, we first show that the region of each class is bounded by a quadric of revolution, whose eccentricity is the reciprocal of one learned ratio. We then attach to each class an asymptotic margin, which compares the growth of its score with the growth of all the other scores and can be computed by a second-order cone program. The loss of a class has infimum zero exactly when its margin is positive, and it then approaches zero only along diverging features. When the margin is negative, the loss is coercive and its minimizers lie in an explicit ball. Since softmax depends only on the differences between scores, a class with a bounded region can still have a positive margin, so bounded regions do not confine the features. The result extends to other norms, including the polyhedral conic functions. On CIFAR-10 and CIFAR-100, all 1210 cells of 67 trained conic heads have positive margins, whereas a prototype head keeps nine of its ten cells bounded, as the theory predicts.

## Linear Regression with Self-Selection Bias in Polynomial Time

DevFeed: [Linear Regression with Self-Selection Bias in Polynomial Time](<https://devfeed.tech/articles/linear-regression-with-self-selection-bias-in-polynomial-time-133194.md>)

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

Author: Felix Zhou

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

Content type: article

Language: en

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

Topics: [linear-regression](<https://devfeed.tech/topics/linear-regression.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [bias](<https://devfeed.tech/tags/bias.md>), [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [linear](<https://devfeed.tech/tags/linear.md>), [linear-regression](<https://devfeed.tech/tags/linear-regression.md>), [math-st](<https://devfeed.tech/tags/math-st.md>), [regression](<https://devfeed.tech/tags/regression.md>), [selection](<https://devfeed.tech/tags/selection.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [stat-th](<https://devfeed.tech/tags/stat-th.md>), [time](<https://devfeed.tech/tags/time.md>)

### AI overview

The paper presents a polynomial-time algorithm in n, k, and 1/ε for estimating k linear regressors under maximum self-selection, including the unknown-index variant and correlated noise between regressors. For max-affine regression, it reports the first polynomial-time algorithm, replacing earlier approaches with exponential dependence on k. The method uses degree-log(n) Hermite moments of covariates among observations with large responses: these approximately decompose into tensor powers of the regressors. An implicit tensor decomposition recovers directions parallel to the regressors, then a variant of ordinary least squares estimates the regressors. The supplied abstract does not give detailed assumptions or guarantees beyond these claims.

### Source excerpt

arXiv:2611.17228v1 Announce Type: cross Abstract: We revisit the problem of estimating $k$ linear regressors with self-selection bias in $n$ dimensions up to error $\varepsilon$ with the maximum self-selection criterion, as introduced by Cherapanamjeri, Daskalakis, Ilyas, and Zampetakis [CDIZ23, STOC]. Our main result is a $\mathrm{poly}(n,k,1/\varepsilon)$ time algorithm for the unknown-index variant of this problem, thereby improving upon the running times of the best known algorithms due to Gaitonde and Mossel [GM24] and Kalavasis, Mehrotra, and Zhou [KMZ26, COLT] with exponential dependence on $k$. Our algorithm succeeds in the presence of correlated noise between regressors, which captures the related setting of max-affine regression. Consequently, we also give the first polynomial-time algorithm for this problem, improving on the prior works of Ghosh, Pananjady, Guntuboyina, and Ramchandran [GPGR22, IEEE Transactions on Information Theory] and Gaitonde and Mossel [GM24] with exponential dependence on $k$. Prior works exhaustively search over a $k$-dimensional subspace spanned by the regressors, using conditional moments of the response to test candidates. In contrast, our algorithm is driven by an improved understanding of the moments of the covariates. We show that, restricting to observations with large response values, the degree-$(\log n)$ Hermite moment of the covariates approximately decomposes as a sum of tensor powers of the regressors. The first step of our algorithm can be viewed as a tensor decomposition algorithm for these implicitly represented high-order tensors, which outputs unit vectors parallel to the regressors. A secondary step based on a simple variant of ordinary least squares extracts estimates for the regressors given these unit vectors. We believe our analytic insight and algorithmic components may have applications to designing efficient algorithms for other latent-variable problems.

## Scentree: a framework for generating scenario trees for multistage stochastic programming

DevFeed: [Scentree: a framework for generating scenario trees for multistage stochastic programming](<https://devfeed.tech/articles/scentree-a-framework-for-generating-scenario-trees-for-multistage-stochastic-programming-131676.md>)

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

Author: Cristian Pach\\'on-Garc\\'ia, Albert Sol\\\`a Vilalta, F. -Javier Heredia

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

Content type: article

Language: en

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

Topics: [Data Science](<https://devfeed.tech/topics/data-science.md>), [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [automation](<https://devfeed.tech/tags/automation.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [data](<https://devfeed.tech/tags/data.md>), [dependencies](<https://devfeed.tech/tags/dependencies.md>), [design](<https://devfeed.tech/tags/design.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [forecasting](<https://devfeed.tech/tags/forecasting.md>), [framework](<https://devfeed.tech/tags/framework.md>), [generation](<https://devfeed.tech/tags/generation.md>), [learning](<https://devfeed.tech/tags/learning.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [model](<https://devfeed.tech/tags/model.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [models](<https://devfeed.tech/tags/models.md>), [modular](<https://devfeed.tech/tags/modular.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [package](<https://devfeed.tech/tags/package.md>), [parameter](<https://devfeed.tech/tags/parameter.md>), [probability](<https://devfeed.tech/tags/probability.md>), [programming](<https://devfeed.tech/tags/programming.md>), [stat-co](<https://devfeed.tech/tags/stat-co.md>), [trees](<https://devfeed.tech/tags/trees.md>)

### AI overview

Scentree is an open-source Python package that builds scenario trees for multistage stochastic programming from historical data or probability-distribution samples. It jointly models the stochastic processes with machine-learning and multivariate time-series methods, generates a scenario fan that captures dependencies, then reduces it to a representative tree. The package automates forecasting-model selection, parameter estimation, fan generation and tree construction, without assuming an underlying data distribution. Its modular design also allows external forecasts or partial workflow execution, and the framework can be applied to two-stage problems.

### Source excerpt

arXiv:2609.21495v2 Announce Type: replace-cross Abstract: We present scentree, an open-source Python package for constructing scenario trees for multistage stochastic programming models using either historical data or samples drawn from a probability distribution. It combines machine learning and multivariate time series models to obtain a scenario fan that captures dependencies in the stochastic processes. This scenario fan is subsequently reduced into a scenario tree that preserves representativeness of the stochastic process, providing a flexible and extensible framework for uncertainty modeling in stochastic programming problems. The framework can also be naturally applied to two-stage stochastic programming problems. Key contributions are the joint modeling of the stochastic process, preserving correlations between all random variables, and the automation of the complete workflow, including forecasting model selection, parameter estimation, scenario fan generation, and scenario tree construction. In addition, scentree does not assume any underlying data distribution, reducing the statistical expertise required to produce a scenario tree, and is modular by design, allowing external forecasts and other partial executions of the workflow.

## Robbing Peter to Pay Paul: Cross-Attribute Externalities of Fairness Interventions

DevFeed: [Robbing Peter to Pay Paul: Cross-Attribute Externalities of Fairness Interventions](<https://devfeed.tech/articles/robbing-peter-to-pay-paul-cross-attribute-externalities-of-fairness-interventions-132908.md>)

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

Author: Fernandes Machado Agathe, Jamotton Charlotte, Charpentier Arthur

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

Content type: article

Language: en

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

Topics: [responsible-ai](<https://devfeed.tech/topics/responsible-ai.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [classification](<https://devfeed.tech/tags/classification.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [fairness](<https://devfeed.tech/tags/fairness.md>), [gaussian](<https://devfeed.tech/tags/gaussian.md>), [model](<https://devfeed.tech/tags/model.md>), [regression](<https://devfeed.tech/tags/regression.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

Fairness interventions that reduce disparities for one sensitive attribute can increase disparities for another, including an attribute hidden from the practitioner. The paper models these cross-attribute externalities with Wasserstein barycentric disparities, tracking changes in marginal and joint fairness; it derives explicit trajectories in a jointly Gaussian model, conditions for target fairness to improve while another disparity grows, and sharp partial-identification bounds when an attribute is unavailable. In classification experiments, interventions increased unfairness for the hidden attribute in most scenarios across more than half the datasets considered. On ACSIncome regression data, correcting for race reduced sex disparities, while a subsequent age correction increased them.

### Source excerpt

arXiv:2611.14717v1 Announce Type: cross Abstract: Fairness interventions often targets disparities associated with a single sensitive attribute in binary classification tasks. However, when multiple sensitive attributes are associated with a data subject, improving fairness with respect to one attribute does not necessarily improve it across all attributes: it may exacerbate disparities associated with other sensitive attributes, including those that are unavailable to the practitioner. We refer to these unintended effects as cross-attribute externalities of fairness. We study how fairness with respect to one sensitive attribute varies when an initially unfair classification or regression model is corrected with respect to another attribute. We characterize these externalities using Wasserstein barycentric disparities and develop a distributional framework that captures changes in both marginal and joint fairness measures. This highlights a limitation of conventional fairness evaluation, in which the success of an intervention is assessed mainly for the attribute it targets. In a jointly Gaussian model, we derive explicit trajectories for marginal and joint disparities and identify conditions under which an intervention eliminates disparities with respect to its target attribute while increasing disparities associated with another attribute. We also derive sharp partial-identification bounds on the resulting externalities when a sensitive attribute is unavailable and extend our results to categorical sensitive attributes. We illustrate these externalities using classification and regression real-data: in the classification experiments, interventions increase unfairness with respect to the hidden attribute in the majority of scenarios across more than half of the datasets considered; in the regression experiments on the ACSIncome dataset, correcting for race reduces sex disparities, whereas subsequently correcting for age increases them.

## Quantifying structural stability of transparent models for general insurance pricing

DevFeed: [Quantifying structural stability of transparent models for general insurance pricing](<https://devfeed.tech/articles/quantifying-structural-stability-of-transparent-models-for-general-insurance-pricing-133203.md>)

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

Author: F\\'elix C\\^ot\\'e, Marie-Pier C\\^ot\\'e

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

Content type: article

Language: en

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

Topics: [AI Models](<https://devfeed.tech/topics/ai-models.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [decision-trees](<https://devfeed.tech/tags/decision-trees.md>), [functions](<https://devfeed.tech/tags/functions.md>), [insurance](<https://devfeed.tech/tags/insurance.md>), [linear](<https://devfeed.tech/tags/linear.md>), [machines](<https://devfeed.tech/tags/machines.md>), [pricing](<https://devfeed.tech/tags/pricing.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [transparent](<https://devfeed.tech/tags/transparent.md>), [xgboost](<https://devfeed.tech/tags/xgboost.md>)

### AI overview

The paper proposes the Mean Squared Shape function distance to measure structural stability in functionally transparent models, whose predictions decompose into univariate main effects and bivariate pairwise interactions. Across three public auto insurance datasets, generalised linear models with centred numerical covariates were stable, while explainable boosting machines (EBMs) balanced stability and performance. Sequential modelling and fixed hyperparameters substantially improved stability for both EBMs and XGBoost, with negligible performance impact. The evidence is limited to the abstract's summary of the benchmark.

### Source excerpt

arXiv:2611.17308v1 Announce Type: cross Abstract: The short duration of general insurance contracts leads to rapid distributional shifts in the data, warranting regular model updates. This process may yield a post-update model that differs considerably from the pre-update model in both predictions and structure. Structural stability is upstream of predictive stability, yet existing structural stability metrics are mostly restricted to simple decision trees. Thus, we first introduce the notion of functional transparency, characterising models with a prediction function that can be expressed as a sum of univariate functions for main effects and bivariate functions for pairwise interactions. Then, we propose the Mean Squared Shape function distance, a metric to quantify the structural stability of functionally transparent models, which are particularly relevant in actuarial science. Using three public auto insurance datasets, we present a benchmark study to demonstrate the usefulness of our metric in identifying a stable and accurate transparent model. Generalised linear models with centred numerical covariates are stable, and explainable boosting machines (EBMs) offer a compromise between stability and performance. We also find that stabilisation strategies, such as sequential modelling and fixed hyperparameters, can substantially improve stability for both EBM and XGBoost models, with negligible impact on performance.

## Dyship: Leveraging Acoustic Features For Speaker Relationship Classification From Dyadic Conversations

DevFeed: [Dyship: Leveraging Acoustic Features For Speaker Relationship Classification From Dyadic Conversations](<https://devfeed.tech/articles/dyship-leveraging-acoustic-features-for-speaker-relationship-classification-from-dyadic-conversations-128409.md>)

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

Author: Kieran Sturges, Thomas Thebaud, Yaohan Guan, Najim Dehak

Published: 2026-11-11T05: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>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [classification](<https://devfeed.tech/tags/classification.md>), [conversations](<https://devfeed.tech/tags/conversations.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [features](<https://devfeed.tech/tags/features.md>), [inference](<https://devfeed.tech/tags/inference.md>), [speaker](<https://devfeed.tech/tags/speaker.md>), [speech](<https://devfeed.tech/tags/speech.md>)

### AI overview

DyShip classifies familiarity and kinship between speakers from dyadic conversations in the Seamless Interaction corpus, with the best representation varying by task. Spectral features reached 87.81% accuracy for familiarity, while WavLM led kinship accuracy at 85.17%; x-vectors had a kinship AUC of 0.909. X-vectors and estimated articulatory movements were weaker for familiarity but performed well for kinship. Most classifiers exceeded previously reported human and audio-language-model scores on this dataset. The abstract reports results on one corpus and motivates further study of which conversational cues the different representations capture.

### Source excerpt

arXiv:2611.14241v1 Announce Type: cross Abstract: We introduce DyShip, a framework for classifying speaker familiarity and kinship from dyadic conversations in the Seamless Interaction corpus. We compare five speech representations: spectrograms, MFCCs, self-supervised WavLM representations, x-vectors, and estimated articulatory movements. Spectral features perform best for familiarity classification, reaching an accuracy of 87.81%, while WavLM achieves the highest kinship accuracy of 85.17%. X-vectors and articulatory features yield weaker results on familiarity classifiaction, but shine for kinship classification, with an AUC of 0.909 for x-vectors. Most classifiers exceed previously reported human and audio language model scores on the same dataset. These findings highlight the potential of conventional acoustic features for relationship inference and motivate further investigation of the conversational cues captured by different representations.

## Scikit-Learn Matched or Beat Jev's Calibration on BANKING77

DevFeed: [Scikit-Learn Matched or Beat Jev's Calibration on BANKING77](<https://devfeed.tech/articles/scikit-learn-matched-or-beat-jev-s-calibration-on-banking77-127371.md>)

Original publisher: [Read original article](<https://towardsdatascience.com/scikit-learn-matched-or-beat-jevs-calibration-on-banking77/>)

Author: Ankur Tomar

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

Content type: comparison

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>), [few-shot-learning](<https://devfeed.tech/topics/few-shot-learning.md>), [Open Source Models & Datasets](<https://devfeed.tech/topics/open-source-models-datasets.md>), [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [banking](<https://devfeed.tech/tags/banking.md>), [cascade](<https://devfeed.tech/tags/cascade.md>), [choice](<https://devfeed.tech/tags/choice.md>), [data](<https://devfeed.tech/tags/data.md>), [data-science](<https://devfeed.tech/tags/data-science.md>), [editor-s-picks](<https://devfeed.tech/tags/editor-s-picks.md>), [jev](<https://devfeed.tech/tags/jev.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llm-applications](<https://devfeed.tech/tags/llm-applications.md>), [model-calibration](<https://devfeed.tech/tags/model-calibration.md>), [scikit-learn](<https://devfeed.tech/tags/scikit-learn.md>)

### AI overview

On BANKING77, temperature-scaled logistic regression matched Jev's Choice calibration on a seven-intent slice (ECE 0.022 vs. 0.014; the paired comparison was inconclusive) and had lower ECE on all 77 intents (0.031 vs. Jev's 0.065). The open model required 10,003 labeled queries; Jev required no training and used up to three examples per intent. Both systems still auto-acted on out-of-schema queries because a forced-choice schema lacks a "none of these" path, and separately framed Choice/Noul questions could disagree at a shared threshold. Threshold performance varied sharply by backend, and even calibrated scores missed the target precision by 2.6 points in one test; the author recommends choosing thresholds with labeled data and providing an abstention route. Jev's Choice answers were well calibrated on the small slice, while its yes/no answers were underconfident on true cases. Findings are limited to one short-text banking dataset, small Jev samples, and test-set-selected cascade operating points; Jev's cascade behavior was not tested.

### Source excerpt

Jev needs no training and at most three examples per intent; the open rebuild needs labels. Both still fall into the none-of-the-above trap. The post Scikit-Learn Matched or Beat Jev's Calibration on BANKING77 appeared first on Towards Data Science.

## Dual-Granularity Learning for Regression with Continuous Noisy Labels

DevFeed: [Dual-Granularity Learning for Regression with Continuous Noisy Labels](<https://devfeed.tech/articles/dual-granularity-learning-for-regression-with-continuous-noisy-labels-125215.md>)

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

Author: Hui Guo, Boyu Wang, Grace Y. Yi

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

Content type: article

Language: en

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

Topics: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [metric learning](<https://devfeed.tech/topics/metric-learning.md>)

Tags: [binning](<https://devfeed.tech/tags/binning.md>), [classification](<https://devfeed.tech/tags/classification.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [framework](<https://devfeed.tech/tags/framework.md>), [learning](<https://devfeed.tech/tags/learning.md>), [noise](<https://devfeed.tech/tags/noise.md>), [order](<https://devfeed.tech/tags/order.md>), [proximity](<https://devfeed.tech/tags/proximity.md>), [regression](<https://devfeed.tech/tags/regression.md>), [robust](<https://devfeed.tech/tags/robust.md>), [robustness](<https://devfeed.tech/tags/robustness.md>)

### AI overview

GRAIN addresses continuous noisy regression by combining two forms of learning: instance-specific residual refinement, which targets small to moderate label deviations, and binning-based contrastive regularization, which uses ordinal structure when large corruptions make exact labels unreliable. A histogram-based bridge lets the structural guidance anchor residual learning while residual refinement corrects deviations that structure alone cannot resolve. The abstract reports improved robustness and generalization across diverse noise conditions, without giving specific datasets or quantitative results.

### Source excerpt

arXiv:2611.10550v1 Announce Type: new Abstract: Learning with noisy labels has been extensively studied for classification, yet its regression counterpart remains relatively underexplored. Unlike classification, regression involves continuous-valued targets where label noise exhibits heterogeneous magnitudes across instances, which poses conflicting requirements on the model: correcting small-to-moderate deviations requires sensitivity to label values for instance-level refinement, whereas large deviations caused by corrupted or outlying annotations render exact label values unreliable, necessitating reduced reliance on exact labels and instead leveraging ordinal structure among samples. These requirements call for methods that capture both global structure and sample-specific deviations in a unified manner. To this end, we propose GRAIN, a dual-granularity framework for robust noisy regression. At the fine-grained level, we derive an explicit residual learning mechanism from a robust loss formulation, introducing instance-specific auxiliary variables to decouple label noise from predictive signals. At the coarse-grained level, we introduce a binning-based contrastive regularization that enforces an order-preserving feature structure aligned with label proximity, addressing noise beyond the capacity of local residual refinement. The two levels are coupled via a histogram-based bridging mechanism that enables bidirectional information flow: coarse-grained structural guidance establishes a well-ordered feature space that anchors residual learning, while fine-grained residual refinement corrects instance-level deviations that structural regularization alone cannot resolve. Experimental results show that GRAIN consistently improves robustness and generalization under diverse noise conditions.

## Random Symbolic Boosting: A Geometric Approach to Symbolic Regression

DevFeed: [Random Symbolic Boosting: A Geometric Approach to Symbolic Regression](<https://devfeed.tech/articles/random-symbolic-boosting-a-geometric-approach-to-symbolic-regression-123300.md>)

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

Author: Jos\\'e R. Ortegaa, Jos\\'e Manuel Mu\\~noz Contreras, Leonardo Trujillo

Published: 2026-11-09T05: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: [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [boosting](<https://devfeed.tech/tags/boosting.md>), [classification](<https://devfeed.tech/tags/classification.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [error](<https://devfeed.tech/tags/error.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [interpretability](<https://devfeed.tech/tags/interpretability.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [models](<https://devfeed.tech/tags/models.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [random](<https://devfeed.tech/tags/random.md>), [reduction](<https://devfeed.tech/tags/reduction.md>), [regression](<https://devfeed.tech/tags/regression.md>), [scale](<https://devfeed.tech/tags/scale.md>), [semantics](<https://devfeed.tech/tags/semantics.md>), [spaces](<https://devfeed.tech/tags/spaces.md>), [standard](<https://devfeed.tech/tags/standard.md>), [symbolic-regression](<https://devfeed.tech/tags/symbolic-regression.md>), [syntax](<https://devfeed.tech/tags/syntax.md>)

### AI overview

Random Symbolic Boosting (RSB) builds explicit additive symbolic models by boosting over randomly generated syntax trees, avoiding generational evolution. It treats tree semantics as vectors and uses their linear independence in high-dimensional spaces. With Ordinary Least Squares, the process guarantees monotonically decreasing training error for regression and classification. An adaptive stopping rule uses the angle between prediction and target vectors; the abstract says it is scale-independent and needs no task-specific adjustment. On a standard symbolic-regression benchmark, RSB is reported at the Pareto-optimal balance of predictive accuracy and training time and ranked first on real-world datasets. It also achieved competitive results across 200 tabular classification problems.

### Source excerpt

arXiv:2611.08753v1 Announce Type: new Abstract: Symbolic models offer interpretability, but their construction through generational evolution can be computationally expensive. This article presents Random Symbolic Boosting (RSB), a method that constructs explicit additive symbolic models via boosting over populations of randomly generated syntax trees, eliminating the need for generational evolution. The idea combines two observations: high-dimensional spaces can be spanned by enough linearly independent vectors, and the semantics of syntax trees can be directly manipulated as such vectors. It is shown that, for Ordinary Least Squares, the boosting process guarantees a monotonic reduction of the training error for both regression and classification. Furthermore, an adaptive geometric early stopping mechanism is introduced. It is based on the angle between the prediction and target vectors, is independent of the problems scale, and requires no adjustments across tasks. Evaluated on a standard benchmark for symbolic regression, the method is located at the Pareto-optimal point between predictive accuracy and training time, ranking first on the real-world datasets. Additionally, it was tested on a large tabular classification benchmark with 200 problems, achieving competitive results.

## Reweighting for Transfer Classification: Exact Risk Conversion and Minimax Adaptation

DevFeed: [Reweighting for Transfer Classification: Exact Risk Conversion and Minimax Adaptation](<https://devfeed.tech/articles/reweighting-for-transfer-classification-exact-risk-conversion-and-minimax-adaptation-123320.md>)

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

Author: Aoran Chen, Yang Feng

Published: 2026-11-09T05: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>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [classification](<https://devfeed.tech/tags/classification.md>), [conversion](<https://devfeed.tech/tags/conversion.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [math-st](<https://devfeed.tech/tags/math-st.md>), [minimax](<https://devfeed.tech/tags/minimax.md>), [risk](<https://devfeed.tech/tags/risk.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [stat-th](<https://devfeed.tech/tags/stat-th.md>)

### AI overview

The paper derives a sharp conversion from mixture excess hinge risk to target excess risk for binary classification, based on density-weighted local votes, and combines it with a two-sample oracle inequality for weighted support vector machines; the result is explicit for Gaussian kernels. For a tilted-boundary class, the minimax rate depends on transferable source strength and tilt, separating source sampling uncertainty from uncertainty about the source-target relation. A target-checked Gaussian-SVM selector adapts to unknown parameters within a logarithmic factor in fixed dimension and retains a similarly qualified target-only rate against arbitrary independent sources under the stated model. In a separate smooth opposition class, Gaussian SVMs restricted to original labels and nonnegative weights can have exponentially higher minimax risk than unrestricted procedures when the target sample is no more than half the source sample, even with data-dependent weighting and tuning.

### Source excerpt

arXiv:2611.08876v1 Announce Type: cross Abstract: A source can make a training mixture easier to learn while making its accuracy less valuable for the target. We study how the training problem a source creates and the finite-sample error of learning it jointly determine target-risk guarantees under reweighting. For binary classification, for each pair of laws and each positive target weight, we derive the sharpest target excess hinge-risk bound implied by mixture excess alone, uniformly over clipped predictors. This exact conversion curve is determined by density-weighted local votes. A two-sample oracle inequality for weighted support vector machines supplies the mixture excess, and the composition becomes explicit for Gaussian kernels. On a tilted-boundary class, we establish the all-procedure minimax classification rate $[n+s_+^2/(m^{-1}+\tau^2)]^{-1}$ in the transferable strength $s_+$ and the tilt $\tau$, separating source sampling uncertainty ($m^{-1}$) from relation uncertainty ($\tau^2$). A target-checked Gaussian-SVM selector adapts to unknown $s_+$ and $\tau$ up to a logarithmic factor for fixed dimension, and retains the target-only rate up to the same factor against arbitrary independent sources under the stated target model. On a separate smooth opposition class, the minimax risk within the family of exact Gaussian SVMs fitted to the original labels with nonnegative weights is exponentially larger than the unrestricted minimax risk whenever the target sample is at most half the source sample, despite arbitrary data-dependent weighting and tuning. The value of a source thus depends on the training problem it creates, on what accuracy there means for the target, and on whether the permitted use of the source can implement the needed correction.

## Acoustic Anomaly Detection for Early Identification of Drill Jamming

DevFeed: [Acoustic Anomaly Detection for Early Identification of Drill Jamming](<https://devfeed.tech/articles/acoustic-anomaly-detection-for-early-identification-of-drill-jamming-120604.md>)

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

Author: Maria Beatriz Silva, Lucas Edson Silva de Ara\\'ujo, Sergio F. Chevtchenko, Ermeson Andrade, Danilo Araujo, Saeed Afshar

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

Content type: article

Language: en

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

Topics: [Predictive AI](<https://devfeed.tech/topics/predictive-ai.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>), [reliability-engineering](<https://devfeed.tech/topics/reliability-engineering.md>), [downtime](<https://devfeed.tech/topics/downtime.md>)

Tags: [anomaly-detection](<https://devfeed.tech/tags/anomaly-detection.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [predictive-maintenance](<https://devfeed.tech/tags/predictive-maintenance.md>)

### AI overview

The study uses ultrasonic acoustic features to identify pre-failure patterns associated with drill jamming in CNC machining. It releases a dataset from 17 drills and compares a semi-supervised autoencoder with supervised XGBoost using Leave-One-Drill-Out validation. The autoencoder achieved recall of 1.00, consolidated F1 of 0.81, and AUC of 0.8294; XGBoost had average F1 of 0.55 and AUC of 0.7559, and missed failures for some drills. The authors report that the autoencoder better separated normal from pre-failure patterns under inter-tool covariate shift. Results are limited to the tested drill bits.

### Source excerpt

arXiv:2611.07356v1 Announce Type: new Abstract: In the context of Industry 4.0, predictive maintenance is essential to minimize unplanned downtime and ensure operational safety. In machining processes, drill jamming is a critical failure that compromises both workpiece quality and tool integrity. This work proposes an acoustic anomaly detection system using ultrasonic sensors to identify pre-failure patterns in Computer Numerical Control (CNC) machining. We release a public dataset of time- and frequency-domain acoustic features from 17 drills, and benchmark semi-supervised autoencoder-based normality modelling against supervised XGBoost classification using Leave-One-Drill-Out validation. The results demonstrate that the Autoencoder is highly effective for industrial safety, achieving a Recall of 1.00 and a consolidated F1-score of 0.81. Furthermore, the threshold-independent analysis shows that the Autoencoder better separates normal and pre-failure acoustic patterns, achieving a consolidated AUC of 0.8294, compared with 0.7559 for the supervised model under inter-tool covariate shift. In contrast, the supervised XGBoost achieved an average F1-score of 0.55 and failed to detect failures in some of the evaluated drills. The findings highlight that the ultrasonic spectrum provides a reliable window for identifying incipient mechanical instabilities, and the AE model offers a robust safety envelope by anticipating all jamming events across the tested drill bits.

## Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines

DevFeed: [Gradient Boosting for Efficient Rank Discovery in Tensor Network Kernel Machines](<https://devfeed.tech/articles/gradient-boosting-for-efficient-rank-discovery-in-tensor-network-kernel-machines-120286.md>)

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

Author: Albert Saiapin, Kim Batselier

Published: 2026-11-06T05: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: [catboost](<https://devfeed.tech/topics/catboost.md>), [scikit-learn](<https://devfeed.tech/topics/scikit-learn.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [approach](<https://devfeed.tech/tags/approach.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [boosting](<https://devfeed.tech/tags/boosting.md>), [builds](<https://devfeed.tech/tags/builds.md>), [candidate](<https://devfeed.tech/tags/candidate.md>), [canonical](<https://devfeed.tech/tags/canonical.md>), [capacity](<https://devfeed.tech/tags/capacity.md>), [complex](<https://devfeed.tech/tags/complex.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cross-validation](<https://devfeed.tech/tags/cross-validation.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [machines](<https://devfeed.tech/tags/machines.md>), [network](<https://devfeed.tech/tags/network.md>), [rank](<https://devfeed.tech/tags/rank.md>)

### AI overview

GB-CPKM avoids explicit tensor-rank search by sequentially adding fixed-rank canonical polyadic tensor network kernel learners, with ensemble size chosen by validation performance. On real-world regression benchmarks, it achieved comparable predictive performance to a cross-validation-based rank-selection method while training up to 6x faster and using up to 2x less peak memory. These reported results apply to the benchmarks described in the abstract.

### Source excerpt

arXiv:2611.08093v1 Announce Type: cross Abstract: Tensor network kernel machines (TNKMs) combine nonlinear features with low-rank tensor representations to model complex relationships efficiently. However, selecting an appropriate tensor rank remains challenging, as conventional rank-search methods require training multiple candidate models, increasing computational costs. In this work, we focus on a canonical polyadic (CP) tensor network parameterization and propose GB-CPKM, a gradient boosting framework that builds a higher-capacity predictor by sequentially adding fixed-rank learners. This approach provides a new perspective on rank selection by incrementally increasing model capacity, with ensemble size selected based on validation performance rather than through explicit rank search. Experiments on real-world regression benchmarks show that GB-CPKM trains up to 6x faster and uses up to 2x less peak memory than a conventional rank-selection method based on cross-validation, while achieving comparable predictive performance. These results highlight the potential of gradient boosting to improve the computational efficiency and scalability of tensor-network learning.

[Next page](<https://devfeed.tech/topics/scikit-learn.md?cursor=WyIyMDI2LTExLTA2VDA1OjAwOjAwKzAwOjAwIiwgIjFhMjQ0MzI4LWZjYjMtNDAyMi1hNDRmLWFjMjAwNWRiZTk2NyJd>)