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.

168,695 papers · 148 categories

Trend · papers per month

4386129172 · May 202619922001200920172026
48 results for signal decomposition

SRMD uses random features for efficient time-frequency analysis.

problem Efficiently analyzing time-series data with low computational cost.
method Sparse Random Mode Decomposition (SRMD) constructs a sparse approximation to the spectrogram.
result SRMD outperforms other methods in signal representation, outlier removal, and mode decomposition.

Study on signal-plus-noise decomposition in nonlinear spiked random matrices.

problem Nonlinear spiked random matrix models with rank-one signal and noise.
method Signal-plus-noise decomposition and phase transition analysis.
result Identified precise phase transitions in signal components at critical thresholds.

Generalizes PCA and ICA for continuous-time signals using neural networks.

problem Low-rank decomposition of continuous-time vector-valued signals.
method Implicit neural network framework to learn numerical approximations of PCA and ICA.
result Unified approach to PCA and ICA in continuous domain, enforcing decorrelation and independence.

High throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data…

2017-10-23abs ↗pdf ↗

VDA improves disentanglement of latent representations in complex signals.

problem Learning disentangled and interpretable representations in nonstationary, high-dimensional time-evolving signals.
method Variational decomposition autoencoding (VDA) framework, incorporating signal decomposition, contrastive self-supervised task, and variational prior approximation.
result DecVAEs surpass state-of-the-art VAE-based methods in disentanglement quality and generalization.

Unified deep learning approach for time series forecasting using VMD-CNN-LSTM.

problem Time series forecasting problem.
method Proposes a unified deep learning approach with decomposition-reconstruction-ensemble framework using VMD-CNN-LSTM.
result The proposed approach outperforms benchmark approaches in forecasting accuracy.

We propose a greedy variational method for decomposing a non-negative multivariate signal as a weighted sum of Gaussians, which, borrowing the terminology from statistics, we refer to as a Gaussian mixture model. Notably, our method has the following features: (1) It accepts multivariate signals, i.e. sampled multivari…

2019-09-01abs ↗pdf ↗

New algorithm for decomposing multidimensional, non-stationary signals.

problem Handling complex, non-stationary signals in multidimensional and multivariate data.
method Multidimensional and Multivariate Fast Iterative Filtering (MdMvFIF) algorithm.
result Extracts Intrinsic Mode Functions (IMFs) from complex signals varying in space and time.

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful novel concept in algebraic geometry that generalizes the tensor CP decomposition…

2016-03-04abs ↗pdf ↗

DeepTensor uses deep networks to efficiently decompose tensors with improved performance and robustness.

problem Efficiently decomposing tensors with deep learning to capture nonlinear structures.
method Low-rank tensor decomposition using deep generative networks trained to minimize approximation error.
result DeepTensor outperforms classical methods like SVD and PCA in various applications, including image denoising and 3D MRI.

New method uses tensor decomposition to improve noise reduction in machine fault detection.

problem Noise in acoustic signals hinders fault detection in industrial machines.
method Non-negative Canonical Polyadic (CP) decomposition for denoising spectral data.
result Improvement in unsupervised anomaly detection for machine fault detection.

Proposes a new graph trend filtering model for inhomogeneous graph signals.

problem Estimating piecewise smooth signals over a graph with varying smoothness levels.
method Introduces a l2,0 norm penalized Graph Trend Filtering (GTF) model and two solution methods: spectral decomposition and simulated annealing.
result The GTF model performs better than existing approaches in denoising, support recovery, and semi-supervised classification.

We introduce Contrastive Multivariate Singular Spectrum Analysis, a novel unsupervised method for dimensionality reduction and signal decomposition of time series data. By utilizing an appropriate background dataset, the method transforms a target time series dataset in a way that evinces the sub-signals that are enhan…

2018-10-31abs ↗pdf ↗

We propose the product-of-filters (PoF) model, a generative model that decomposes audio spectra as sparse linear combinations of "filters" in the log-spectral domain. PoF makes similar assumptions to those used in the classic homomorphic filtering approach to signal processing, but replaces hand-designed decompositions…

2013-12-20abs ↗pdf ↗

This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the signal space on which the tools of differential (Riemannian) geometry can be appli…

2008-01-22abs ↗pdf ↗

A new diffusion model improves time-series forecasting by preserving seasonal patterns.

problem Improving time-series forecasting accuracy, especially for seasonal data.
method A forward diffusion process that decomposes signals into spectral components, altering only the diffusion process.
result The method maintains high signal-to-noise ratios for dominant frequencies, improving long-term pattern recovery.

Study evaluates thresholds for removing noise from DNN weights using random matrix theory.

problem Removing noise from deep neural network weights for better approximation.
method Model weights as signal + noise, use random matrix theory to estimate thresholds, evaluate using cosine similarity.
result Proposed threshold estimation method improves approximation quality.

BankGCN improves graph convolution networks by handling multi-channel signals with adaptive filter banks.

problem Handling multi-channel graph signals with limited architectures.
method BankGCN decomposes multi-channel signals into subspaces and uses adapted filters for each subspace.
result BankGCN achieves excellent performance in graph classification on benchmark datasets.

Paper proposes a new framework to improve stability-based bounds in deep learning.

problem Explaining generalization in overparameterized neural networks.
method Decomposes excess risk dynamics into signal and noise components, applying stability-based bounds only to the noise.
result The decomposition framework improves stability-based bounds and explains generalization in neural networks.

This study proposes methods for multi-step-ahead stock price prediction using decomposition and neural networks.

problem Inaccurate one-step-ahead forecasting limits stock market decision-making.
method Two novel methods: DCT-MFRFNN and VMD-MFRFNN.
result VMD-MFRFNN outperforms other methods in multi-step-ahead stock price prediction.

Neural signals are characterized by rich temporal and spatiotemporal dynamics that reflect the organization of cortical networks. Theoretical research has shown how neural networks can operate at different dynamic ranges that correspond to specific types of information processing. Here we present a data analysis framew…

2016-05-09abs ↗pdf ↗

We consider deep feedforward neural networks with rectified linear units from a signal processing perspective. In this view, such representations mark the transition from using a single (data-driven) linear representation to utilizing a large collection of affine linear representations tailored to particular regions of…

2019-03-29abs ↗pdf ↗

New neural network extracts signal components and their IFs from non-uniform samples.

problem Recovering signal components and their IFs from discrete blind-source data.
method Inspired by theory, deep neural network extends Hilbert transform and synchrosqueezed wavelet transform.
result Neural network resolves inverse problem for non-uniformly sampled data.

Privacy subsidy found in market trading with noisy direction signals.

problem Analyzing welfare and bid-ask spread in a market with privacy mechanisms.
method Closed-form derivation of bid-ask spread and welfare under flip-noise direction observation.
result Privacy subsidy of μηΔμηΔ from liquidity pool to traders, robust across models.

TSL learns separable models to avoid signal cancellation and off-support extrapolation.

problem Signal cancellation and off-support extrapolation in additive models.
method Tensor Separation Learning (TSL) via stagewise greedy procedure with orthogonal refitting.
result TSL avoids information loss caused by marginalizing higher-order interactions.

Divergence functions play a key role as to measure the discrepancy between two points in the field of machine learning, statistics and signal processing. Well-known divergences are the Bregman divergences, the Jensen divergences and the f-divergences. In this paper, we show that the symmetric Bregman divergence can be …

2018-10-03abs ↗pdf ↗

Novel approach for estimating joint probability densities using tensor decompositions and dictionaries.

problem Estimating joint probability densities of mixed discrete and continuous variables.
method Low-rank tensor decomposition combined with dictionary learning.
result Better classification and lower error rates compared to existing methods.

Combining neural networks and multiscale decomposition for financial market analysis.

problem Financial markets' complexity and mainstream models' limitations in capturing non-linear structures.
method Neural networks for non-linear associations combined with multiscale decomposition.
result Improved understanding of financial market data substructures.

Paper studies nonnegative Tucker decomposition identifiability with sparsity conditions.

problem Identify nonnegative Tucker decomposition factors uniquely.
method Adapting NMF identifiability results, derive procedures using tensor unfoldings or slices.
result Nonnegative Tucker decomposition factors are identifiable under certain sparsity conditions.

Tensors or {\em multi-way arrays} are functions of three or more indices (i,j,k,)(i,j,k,\cdots) -- similar to matrices (two-way arrays), which are functions of two indices (r,c)(r,c) for (row,column). Tensors have a rich history, stretching over almost a century, and touching upon numerous disciplines; but they have only recent…

2016-07-06abs ↗pdf ↗

Graph-Dictionary model for sparse multivariate signal representation.

problem Capturing complex relational information in multivariate signals.
method Graph dictionaries and bilinear primal-dual splitting algorithm.
result Graph-dictionary model outperforms baselines in signal reconstruction and classification.