Soft and subspace robust multivariate rank tests based on entropy regularized optimal transport
In this paper, we extend the recently proposed multivariate rank energy distance, based on the theory of optimal transport, for statistical testing of distributional similarity, to soft rank energy distance. Being differentiable, this in turn allows us to extend the rank energy to a subspace robust rank energy distance, dubbed Projected soft-Rank Energy distance, which can be computed via optimization over the Stiefel manifold. We show via experiments that using projected soft rank energy one can trade-off the detection power vs the false alarm via projections onto an appropriately selected low dimensional subspace. We also show the utility of the proposed tests on unsupervised change point detection in multivariate time series data. All codes are publicly available at the link provided in the experiment section.
Code (1)
Tasks
Change Point DetectionTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Projection pursuit based on Gaussian mixtures and evolutionary algorithms
We propose a projection pursuit (PP) algorithm based on Gaussian mixture models (GMMs). The negentropy obtained from a multivariate density estimated by GMMs is adopted as the PP index to be maximised. For a fixed dimens…
Density EstimationEvolutionary AlgorithmsRobust and efficient change point detection using novel multivariate rank-energy GoF test
In this paper, we use and further develop upon a recently proposed multivariate, distribution-free Goodness-of-Fit (GoF) test based on the theory of Optimal Transport (OT) called the Rank Energy (RE) [1], for non-paramet…
Change Point DetectionTime SeriesTime Series AnalysisOnline Variational Bayesian Subspace Filtering with Applications
Matrix completion and robust principal component analysis have been widely used for the recovery of data suffering from missing entries or outliers. In many real-world applications however, the data is also time-varying,…
ImputationMatrix CompletionSubspace Change-Point Detection via Low-Rank Matrix Factorisation
Multivariate time series can often have a large number of dimensions, whether it is due to the vast amount of collected features or due to how the data sources are processed. Frequently, the main structure of the high-di…
Change Point DetectionTime SeriesTime Series AnalysisQuantum principal component analysis without eigenvector recovery
Principal component analysis (PCA) is traditionally implemented through a covariance or kernel matrix, leading-eigenvector extraction, and hard rank-$k$ projection. These steps can be computationally costly in high-dimen…
Anomaly Detection