PulseAugur
EN
LIVE 07:52:29

New pESTO algorithm improves kernel regression with noisy data

By PulseAugur Editorial · [1 sources] ·

Researchers have developed a novel kernel regression algorithm called pESTO, designed to handle noisy data more effectively. This iterative p-greedy approach separates approximation error from statistical noise, using Stein's unbiased risk estimator (SURE) as a proxy for mean squared error. The SURE criterion provides a principled method for determining the optimal number of approximation nodes, balancing accuracy and noise contributions, as demonstrated by numerical experiments. AI

RANK_REASON The cluster contains a research paper detailing a new algorithm. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv stat.ML →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New pESTO algorithm improves kernel regression with noisy data

How we ranked this

Signal score
27 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
The cluster contains a research paper detailing a new algorithm. [lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

Full methodology in our editorial standards.

COVERAGE [1]

  1. arXiv stat.ML TIER_1 English(EN) · L. Bruni Bruno, P. Massa, E. Perracchione, M. Trombini ·

    pESTO: Iterative p-greedy kernel regression with risk-driven Early STOpping

    arXiv:2611.08555v1 Announce Type: new Abstract: Kernel-based greedy algorithms select suitable approximation nodes by minimizing point-wise error indicators, such as the power function; in this context, they are usually referred to as p-greedy approaches. In the presence of noisy…

RELATED ENTITIES

RELATED TOPICS