Research
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.

169,341 papers · 148 categories

Trend · papers per month

69138206275 · May 202619922001200920182026
48 results for Joint Blind Source Separation

Paper proposes a new algorithm for joint blind source separation using tensorial methods.

problem Joint blind source separation of multi-set data.
method Double coupled canonical polyadic decomposition (DC-CPD) with algebraic approach.
result Deterministic and exact solution for noiseless case, effective initialization for noisy case.

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.

A new method for blind source separation using hierarchical structure and KL divergence.

problem Blind source separation of complex interacting signals.
method Hierarchical log-linear model with KL divergence minimization.
result Superior performance compared to existing techniques on images and time series data.

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

AR-Flow VAE improves blind source separation with flexible autoregressive priors.

problem Unsupervised blind source separation of latent signals from mixtures.
method AR-Flow VAE uses autoregressive flows to model latent sources, enhancing flexibility and capturing complex dependencies.
result AR-Flow VAE effectively separates latent sources, demonstrating improved performance over conventional methods.

A new method for separating mixed signals in space and time.

problem Nonlinear and nonstationary spatio-temporal data challenges.
method Identifiable autoregressive variational autoencoder.
result The method outperforms existing techniques in blind source separation and spatio-temporal prediction.

New algorithm separates audio sources better using alpha-stable distributions.

problem Improving audio source separation using complex distributions.
method Estimating mixtures of alpha-stable distributions using characteristic function matching.
result Better separation performance than Gaussian-based methods.

New algorithms improve blind source separation for linear-quadratic mixtures.

problem Blind source separation of linear-quadratic mixtures under separability assumptions.
method Proposed two algorithms: SNPALQ and BF. SNPALQ generalizes SNPA for LQ model, BF post-processes SNPALQ.
result Proven robustness and computational tractability of SNPALQ in separating sources even with noise.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

Algorithm finds frequencies, amplitudes, and phases of sinusoids in noisy data.

problem Finding frequencies, amplitudes, and phases of sinusoids in noisy data.
method Maximum likelihood approach to estimate tone parameters from contaminated observations. Successively estimates frequencies and jointly optimizes amplitudes and phases.
result Near-linear computational complexity (O(N)) for estimating MM number of sinusoidal sources.

DECOMPOSE improves accuracy and robustness in blind source separation.

problem Extracting sources from large-scale data using blind source separation.
method Probabilistic blind source separation framework (DECOMPOSE) that adapts to individual sources and handles large-scale data.
result Substantial improvements in accuracy and robustness on artificial and real data.

Develops a method for extracting sources in multi-subject fMRI data.

problem Analyzing brain imaging datasets from multiple subjects with varying levels of jointness.
method Deflation-based algorithm using higher order cumulants and thin-SVD factorization.
result The algorithm accurately identifies joint, partially-joint, and individual sources with high precision.

Blind Source Separation is a widely used technique to analyze multichannel data. In many real-world applications, its results can be significantly hampered by the presence of unknown outliers. In this paper, a novel algorithm coined rGMCA (robust Generalized Morphological Component Analysis) is introduced to retrieve s…

2015-07-08abs ↗pdf ↗

StrADiff separates sources from mixtures without labels, using structured priors.

problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.

New method separates audio sources without needing known decompositions.

problem Difficulty in training source separation models on real-world mixtures.
method Generates estimated decompositions from stereo mixtures and trains a deep learning model.
result Trained model can separate single-channel audio sources effectively.

A deep clustering model learns to separate audio sources without supervision.

problem Training deep clustering models requires supervision, limiting their applicability.
method Proposes an unsupervised spatial clustering approach to train a deep clustering system.
result The deep clustering model achieves similar performance to a multi-channel teacher without supervision.

A new method for joint noise removal and trend estimation from sparse signals.

problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.

The paper proposes a method to identify power system oscillation modes using blind source separation.

problem Accurately identifying oscillation modes in power systems with renewable energy sources.
method A high-order blind source identification (HOBI) algorithm based on copula statistic combined with Hilbert transform and iteration procedure.
result The method can identify all oscillation modes and model order from a single channel of observation signals, outperforming state-of-the-art methods.

Theoretical validation of linear PCA and ICA for accurate nonlinear BSS.

problem Blind source separation for high-dimensional nonlinear source mixtures.
method Theoretical validation of a cascade of linear PCA and ICA.
result Zero-element-wise-error nonlinear BSS is achieved under certain conditions.

New framework for understanding BSS robustness under model violations.

problem Understanding how BSS solutions behave under statistical prior assumptions violations.
method Introducing an informative topology on the space of possible causes and explicit continuity guarantees.
result First comprehensive robustness framework for BSS.

SAHMM-VAE separates sources adaptively using hidden Markov priors.

problem Unsupervised blind source separation.
method Source-wise adaptive Hidden Markov prior variational autoencoder.
result Different latent dimensions align with different source-specific temporal organizations.

This paper addresses the problem of identifying a lower dimensional space where observed data can be sparsely represented. This under-complete dictionary learning task can be formulated as a blind separation problem of sparse sources linearly mixed with an unknown orthogonal mixing matrix. This issue is formulated in a…

2009-08-31abs ↗pdf ↗