Adaptive Generalized P-Splines for Functional Data: A Statistical Framework via Blockwise GSVD

Abstract In this work, we introduce a novel approach for functional data approximation based on generalized P-splines with non-uniform and adaptively placed knots. The key innovation of our proposal is the integration of a conditioning-aware strategy for selecting both the number and positions of the knots, as well as the regularization parameters. By reformulating the Tikhonov regularization problem, we propose a computationally efficient criterion that controls model complexity while ensuring numerical stability. The resulting approximation framework not only improves the fit across the entire functional domain but also maintains compactness and robustness. Extensive numerical experiments conducted on both synthetic and real-world datasets demonstrate that our approach significantly outperforms traditional free knot and smoothing spline methods in terms of approximation error and conditioning.

Authors

Institutions

Publication Details

Journal
Statistics and Computing
Published
2025-09-25
DOI
https://doi.org/10.1007/s11222-025-10734-3
Primary Topic
Image and Signal Denoising Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Generalized P-Splines for Functional Data: A Statistical Framework via Blockwise GSVD

Anna De Magistris, Rosanna Campagna, Elvira Romano
Statistics and Computing
Image and Signal Denoising Methods
article

Adaptive Generalized P-Splines for Functional Data: A Statistical Framework via Blockwise GSVD

Anna De Magistris, Rosanna Campagna, Elvira Romano
article en

Abstract

Abstract In this work, we introduce a novel approach for functional data approximation based on generalized P-splines with non-uniform and adaptively placed knots. The key innovation of our proposal is the integration of a conditioning-aware strategy for selecting both the number and positions of the knots, as well as the regularization parameters. By reformulating the Tikhonov regularization problem, we propose a computationally efficient criterion that controls model complexity while ensuring numerical stability. The resulting approximation framework not only improves the fit across the entire functional domain but also maintains compactness and robustness. Extensive numerical experiments conducted on both synthetic and real-world datasets demonstrate that our approach significantly outperforms traditional free knot and smoothing spline methods in terms of approximation error and conditioning.

Statistics and ComputingVol. 35(6)
University of Campania "Luigi Vanvitelli" (IT), University of Campania "Luigi Vanvitelli" (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", European Commission, Ministero dell’Istruzione, dell’Università e della Ricerca, Università degli Studi della Campania Luigi Vanvitelli, Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 74%
Image and Signal Denoising Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Adaptive Generalized P-Splines for Functional Data: A Statistical Framework via Blockwise GSVD — Anna De Magistris, Rosanna Campagna, et al. · Statistics and Computing (2025) | TGRS Research Map | TGRS