Robust CDF‐Filtering of a Location Parameter

ABSTRACT This paper introduces a novel framework for designing robust filters associated with signal plus noise models having symmetric observation density. The filters are obtained by a recursion where the innovation term is a transform of the cumulative distribution function of the residuals. The latter downweights extreme values by construction and allows the filters to be analytically tractable. The updating scheme naturally arises as the solution of an optimization problem, where the objective function is a continuous version of the quantile check function, formerly employed as a proper scoring function for quantiles and used to construct robust minimum contrast estimators. Stationarity, ergodicity and invertibility are derived under minimal assumptions and preserved under different parametric specifications. Estimation is carried out by the method of maximum likelihood and the asymptotic theory is developed under misspecification. As an illustration, the new filters are applied to brain scan data and compared across Gaussian, Student‐t, Cauchy and Logistic density specifications, with alternative methods. Additional results include a novel class of score‐driven models and a subgaussian density suitable for robust filtering and modelling, arising as the infinite sum of independent non‐identically distributed uniform random variables.

Authors

Institutions

Publication Details

Journal
Journal of Time Series Analysis
Published
2025-11-02
DOI
https://doi.org/10.1111/jtsa.70026
Primary Topic
Medical Image Segmentation Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust CDF‐Filtering of a Location Parameter

Andrew Harvey, Leopoldo Catania, Alessandra Luati
Journal of Time Series Analysis
Medical Image Segmentation Techniques
article

Robust CDF‐Filtering of a Location Parameter

Andrew Harvey, Leopoldo Catania, Alessandra Luati
article en

Abstract

ABSTRACT This paper introduces a novel framework for designing robust filters associated with signal plus noise models having symmetric observation density. The filters are obtained by a recursion where the innovation term is a transform of the cumulative distribution function of the residuals. The latter downweights extreme values by construction and allows the filters to be analytically tractable. The updating scheme naturally arises as the solution of an optimization problem, where the objective function is a continuous version of the quantile check function, formerly employed as a proper scoring function for quantiles and used to construct robust minimum contrast estimators. Stationarity, ergodicity and invertibility are derived under minimal assumptions and preserved under different parametric specifications. Estimation is carried out by the method of maximum likelihood and the asymptotic theory is developed under misspecification. As an illustration, the new filters are applied to brain scan data and compared across Gaussian, Student‐t, Cauchy and Logistic density specifications, with alternative methods. Additional results include a novel class of score‐driven models and a subgaussian density suitable for robust filtering and modelling, arising as the infinite sum of independent non‐identically distributed uniform random variables.

Journal of Time Series Analysis
Aarhus University (DK), University of Cambridge (GB), Aarhus Business College (DK), Bridge University (SS), Imperial College London (GB), University of Bologna (IT)
Openalex Percentile: Top 67%
Medical Image Segmentation Techniques
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.