Joint blind source separation (J-BSS) is an emerging data-driven technique for multi-set data-fusion. In this paper, J-BSS is addressed from a tensorial perspective. We show how, by using second-order multi-set statistics in J-BSS, a specific double coupled canonical polyadic decomposition (DC-CPD) problem can be formu…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
39 results for “CPD”
Recently, there has been a trend to combine independent component analysis and canonical polyadic decomposition (ICA-CPD) for an enhanced robustness for the computation of CPD, and ICA-CPD could be further converted into CPD of a 5th-order partially symmetric tensor, by calculating the eigenmatrices of the 4th-order cu…
Unified framework detects changes in complex system models.
problem Accurate identification of dynamic changes in simulation models.
method Combines machine learning and process-driven simulation modeling.
result Significantly improves change point detection accuracy.
Proposes a model to detect changes in multivariate time series data.
problem Detect abrupt changes in multivariate time series data considering dependencies and correlations.
method Integrates graph neural networks into an encoder-decoder framework to model correlation structures and dynamics.
result Advantageous performance on CPD tasks over strong baselines, classifying changes as correlation or independent.
Online CPD for weighted and directed graphs using RDPG model.
problem Monitoring and detecting changes in weighted and directed graph data.
method Spectral embeddings of RDPG models for online updates and error-rate control.
result A lightweight online CPD algorithm with improved detection resolution and delay.
A new method for non-rigid point set registration reduces computational complexity.
problem Efficiently registering non-rigid point sets with large numbers of points.
method Structured Analytic Coherent Point Drift (Analytic-CPD) reformulates CPD for structured analytic mappings.
result Analytic-CPD reduces computational complexity by controlling the deformation model's dimensionality.
Paper introduces WWAggr for ensemble CPD, improving accuracy and decision threshold selection.
problem Challenges in detecting abrupt distribution shifts in high-dimensional data streams.
method Introduces WWAggr, a novel task-specific ensemble aggregation method based on Wasserstein distance.
result Demonstrates WWAggr outperforms standard aggregation techniques and decision threshold selection.
In this paper, we introduce canonical principal direction (CPD) submanifolds with higher codimension in Euclidean spaces. We obtain the complete classification of surfaces endowed with CPD in the Euclidean 4-space.
Proposes models to better represent ordinal data with non-unimodal distributions.
problem Real-world ordinal data often have non-unimodal conditional probability distributions.
method Develops approximately unimodal likelihood models to better represent non-unimodal CPDs.
result Proposed models can effectively represent both unimodal and nearly unimodal CPDs.
Improved tensor rank learning for CPD models using a generalized hyperbolic prior.
problem Inaccurate tensor rank determination leads to overfitting or underfitting in CPD models.
method Introduced a generalized hyperbolic prior for automatic tensor rank learning in probabilistic CPD models.
result Significantly improved performance in learning both low and high tensor ranks, even for low SNR cases.
FRAPPE estimates tensor canonical rank without CPD computation.
problem Estimating the canonical rank of tensors efficiently.
method Generates synthetic data matching input tensor's size and sparsity, trains a regression model to estimate rank.
result 24 times faster than best baseline, 10% improvement in MAPE on synthetic dataset.
Unified framework for non-Euclidean CPD under scalable stochastic mirror descent.
problem Handling non-Euclidean losses in tensor decomposition.
method Tensor fiber sampling strategy-based stochastic mirror descent.
result Global convergence to a stationary point under reasonable conditions.
Tensor networks constrain kernel machines to Gaussian processes.
problem Speeding up kernel machines with reduced model complexity.
method Proving CPD and TT-constrained models recover Gaussian processes with i.i.d. priors.
result TT-constrained models exhibit more Gaussian process behavior than CPD for the same parameters.
Detecting the emergence of abrupt property changes in time series is a challenging problem. Kernel two-sample test has been studied for this task which makes fewer assumptions on the distributions than traditional parametric approaches. However, selecting kernels is non-trivial in practice. Although kernel selection fo…
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distributions (CPDs) stored at each node. The majority of this work has concentrated on using decision-tree representations for the CPDs. In addition, re…
New GoF test improves change point detection in multivariate time series.
problem Detecting changes in multivariate time series data efficiently and robustly.
method Developed a novel multivariate rank-energy GoF test (sRE) for change point detection.
result sRE-based CPD outperforms existing methods in AUC and F1-score.
A new probabilistic BTD method for tensor data.
problem Modeling higher-order tensors with robust inference.
method Probabilistic Block-Term Decomposition using variational Bayesian inference and von-Mises Fisher distribution.
result The proposed pBTD can quantify multi-linear structures robustly.
We consider the representation power of siamese-style similarity functions used in neural network-based graph embedding. The inner product similarity (IPS) with feature vectors computed via neural networks is commonly used for representing the strength of association between two nodes. However, only a little work has b…
A novel method for estimating Bayesian network (BN) parameters from data is presented which provides improved performance on test data. Previous research has shown the value of representing conditional probability distributions (CPDs) via neural networks(Neal 1992), noisy-OR gates (Neal 1992, Diez 1993)and decision tre…
GOCPD detects change points by maximizing the probability of two independent models.
problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.
Change Point Detection in Time Series Data using Autoencoders with a Time-Invariant Representationcs.LG
Autoencoder detects subtle changes in time series data.
problem Detect abrupt changes in time series data with high accuracy.
method Autoencoder with time-invariant representation and postprocessing.
result Outperforms baseline methods on various data sets.
Real-time fuel leakage detection framework MOCPD improves accuracy.
problem Early detection of fuel leakage to prevent hazards and losses.
method Memory-based Online Change Point Detection (MOCPD) framework.
result MOCPD outperforms baseline methods in detection accuracy.
Change-point detection (CPD) aims to locate abrupt transitions in the generative model of a sequence of observations. When Bayesian methods are considered, the standard practice is to infer the posterior distribution of the change-point locations. However, for complex models (high-dimensional or heterogeneous), it is n…
Many real-world time series, such as in health, have changepoints where the system's structure or parameters change. Since changepoints can indicate critical events such as onset of illness, it is highly important to detect them. However, existing methods for changepoint detection (CPD) often require user-specified mod…
Existing MAP inference algorithms for determinantal point processes (DPPs) need to calculate determinants or conduct eigenvalue decomposition generally at the scale of the full kernel, which presents a great challenge for real-world applications. In this paper, we introduce a class of DPPs, called BwDPPs, that are char…
Our interest lies in the recoverability properties of compressed tensors under the \textit{canonical polyadic decomposition} (CPD) model. The considered problem is well-motivated in many applications, e.g., hyperspectral image and video compression. Prior work studied this problem under somewhat special assumptions---e…
Improves BN graph learning with splines for scalability.
problem Learning accurate BN graph structures from data.
method Score-and-search approach with MARS for CPD modeling.
result Improves BN graph accuracy and scalability.
Slow Momentum with Fast Reversion: A Trading Strategy Using Deep Learning and Changepoint Detectionstat.ML
Improved trading strategy using deep learning and changepoint detection for market changes.
problem Traditional momentum strategies struggle with rapid market changes, especially after trend reversals.
method Inserted an online changepoint detection module into a Deep Momentum Network (DMN) pipeline.
result Improvement in Sharpe ratio by one-third over 1995-2020 period, especially beneficial in nonstationary periods.
New method extends conformal prediction to multivariate settings using optimal transport.
problem Limited applicability of conformal prediction to multivariate real-valued scores.
method Use optimal transport to define vector-ranks and multivariate quantile regions for finite-sample coverage.
result Constructs the first multivariate conformal predictive distributions with finite-sample calibration.
On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detectionstat.ML
Paper uses optimal transport-based statistics for change point detection.
problem Change point detection in multivariate data.
method Soft rank energy and entropically regularized optimal transport.
result Soft rank energy performs better in real datasets with strong continuity and convergence properties.
PPC detects anomalies in high-dimensional data efficiently.
problem Scalability issues and reduced performance with high-dimensional data.
method Probabilistic Predictive Coding (PPC) learns latent representations and predicts uncertainties.
result PPC achieves linear time complexity and high adaptability.
A new method uses CPD to efficiently model feature interactions in non-sequential data.
problem Efficiently modeling feature interactions in non-sequential data with high computational and memory costs.
method Implicitly represent model parameters as a tensor, factorize into a compact Tensor Train (TT) format, and use Canonical Polyadic (CP) Decomposition for invariance to feature ordering.
result The proposed CP-based predictor outperforms other TN-based predictors on sparse data and matches neural network performance on dense non-sequential tasks.
Graph Embedding with Shifted Inner Product Similarity and Its Improved Approximation Capabilitystat.ML
We propose shifted inner-product similarity (SIPS), which is a novel yet very simple extension of the ordinary inner-product similarity (IPS) for neural-network based graph embedding (GE). In contrast to IPS, that is limited to approximating positive-definite (PD) similarities, SIPS goes beyond the limitation by introd…
Unified framework for PDF estimation using MDL-based binning and tensor factorization.
problem Challenges in estimating PDFs for non-uniform, multimodal data.
method MDL-based binning with quantile cuts, tensor factorization (CPD).
result Effective PDF estimation on synthetic and real data.
A conjugate Bayesian method detects change points in Hawkes processes efficiently.
problem Non-conjugacy between Hawkes process likelihood and prior causes inefficiency in change point detection.
method Data augmentation to propose a conjugate Bayesian two-step change point detection method.
result The conjugate method is more accurate and efficient than non-conjugate methods.
Efficiently samples conformal boundaries in high dimensions using flows.
problem Difficulty in interpreting and using prediction sets in high-dimensional or structured output spaces.
method Flow-based approach using differentiable nonconformity scores to induce deterministic flows on the output space.
result Sampling conformal boundaries in arbitrary dimensions becomes computationally efficient and training-free.
Method detects if text is generated by a language model with watermarks.
problem Detecting if text is generated by a language model with watermarks.
method Randomization tests and change point detection techniques.
result Method ensures Type I and Type II error control and accurately identifies watermarked sub-strings.
This paper presents a Bayesian method for estimating the rank of a low-rank tensor model of joint PMF.
problem Estimating the rank of a low-rank tensor model of joint PMF from observed data.
method Bayesian framework for estimating low-rank components and rank simultaneously, using variational inference.
result Automatic rank detection and improved estimation accuracy compared to cross-validation methods.
Paper introduces a new method for efficient portfolio risk quantification.
problem Efficiently quantify risk in large portfolios with many trades and few dominant risk factors.
method Combines Fourier-cosine series with tensor decomposition techniques for dimension reduction.
result Achieves relative errors below 0.1% with significant runtime improvement.