Searcharxiv⌕ Search

arXiv · 2610.04191

Consistency of penalized maximum likelihood estimation for multidimensional change-in-velocity detection

Abstract

We establish statistical consistency for the penalized maximum-likelihood estimator underlying CPLASS, a method for detecting changes in velocity in $d$-dimensional time-series data. The signal is modeled as a continuous piecewise-linear trajectory observed with independent Gaussian noise. Unlike classical change-in-mean models, continuity across adjacent segments couples their parameters and prevents direct application of standard segmentation arguments. Under compact parameter spaces, minimum segment-length and velocity-jump conditions, and a strengthened Schwarz information criterion penalty $ρ_k(\log n)^γ$ with $γ>1$, we prove joint consistency of the estimated number of segments and all changepoint locations in the high-frequency regime $n\to\infty$. The maximum changepoint-location error is $O_{\mathbb{P}}\{(\log n/n)^{1/2}\}$. The proof first uses empirical-process theory to establish convergence of the fitted signal, variance, and likelihood for each fixed model size. It then combines overfitting and underfitting arguments with a two-stage geometric localization analysis, yielding an initial $(\log n/n)^{1/3}$ rate that is sharpened by exploiting the local two-segment continuous piecewise-linear structure.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Linh Do, Dat Do, Scott A. McKinley. 2026-10-03. Consistency of penalized maximum likelihood estimation for multidimensional change-in-velocity detection. https://arxiv.org/abs/2610.04191

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Construction of optimal tests for symmetry on the torus and their quantitative error bounds

In this paper, we investigate the general problem of assessing symmetry in data points on the hyper-dimensional torus, a question that originally emerged in applications from bioinformatics and directional statistics. We develop optimal tests for symmetry for both scenarios where the center of symmetry is known and where it is unknown. Our new tests are not only valid under a given parametric hypothesis but also under a very broad class of symmetric distributions. The asymptotic behavior of the proposed tests is studied both under the null hypothesis and local alternatives. A key contribution of our paper is that we accompany our asymptotic results with error guarantees by deriving quantitative bounds on the distributional distance between the exact (unknown) distribution of the test statistic and its asymptotic counterpart by leveraging Stein's method. The finite-sample performance of the tests is evaluated through simulation studies, and their practical utility in bioinformatics is demonstrated via an application to protein folding data.

math.ST↗

Axioms for testing with data-dependent levels, e-values and p-values

The emerging literature on hypothesis testing with data-dependent and post-hoc significance levels relies on a particular extension of the Type-I error to data-dependent levels. Existing arguments for this extension are heuristic, and primarily motivated by a resulting connection to the e-value. Our first contribution is to show that it is uniquely characterized by three axioms: law-invariance, calibration to classical testing, and a mixing axiom. Inspired by a combination of Birnbaum's conditionality principle and Savage's sure-thing principle, the mixing axiom assumes that a test produced by randomly selecting between (in)valid tests must be (in)valid. Our second contribution is to show that three analogous axioms characterize the e-value as a continuous generalization of a test in a decision-theoretic framework. We recover the p-value by dropping part of the mixing axiom, showing that e-values correspond to those p-values for which a random choice between two invalid p-values cannot lead to a valid p-value. Finally, we show that the relationship between e-values and post-hoc testing goes through under much weaker axioms.

math.ST↗

Stochastic Inversion of Multivariate Uniform-Distribution-Preserving Transformations

A multivariate transformation of the unit cube with component transformations that are piecewise continuously differentiable and uniform distribution preserving (udp) is considered. A stochastic inverse transformation is defined using randomization to overcome the non-injective nature of the udp transformations. The inverse transformation preserves the uniform margins of a random vector distributed according to a copula and yields different copulas for different randomizations. A copula density transformation result for the multivariate stochastic inverse is proved and illustrated in the bivariate case.

math.ST↗