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

133265398530 · Jun 202019922001200920172026
48 results for signal complexity

This paper reconstructs complex graph signals using kernel methods on manifolds.

problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.

Tutorials on signal processing on higher-order networks like simplicial complexes and hypergraphs.

problem Processing complex data structures with polyadic relationships.
method Introduction to simplicial complexes and hypergraphs, Fourier analysis, signal denoising, interpolation, embeddings, neural networks.
result Multi-relational operators like the Hodge Laplacian for simplicial complexes and tensor representations for hypergraphs.

Proposes a probabilistic framework for stationary topological signals on simplicial complexes.

problem Complex data structures require new models and tools.
method Generalizes stationarity to topological signals on simplicial complexes.
result Defines topological power spectral density (PSD) for stationary signals.

We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of arbitrary corruption, tractable recovery is possible when both signal and corrup…

2013-05-11abs ↗pdf ↗

The construction of synthetic complex-valued signals from real-valued observations is an important step in many time series analysis techniques. The most widely used approach is based on the Hilbert transform, which maps the real-valued signal into its quadrature component. In this paper, we define a probabilistic gene…

2016-11-30abs ↗pdf ↗

PolarBM models complex-valued audio signals in polar coordinates, improving over conventional methods.

problem Discarding structural information in complex-valued problems simplifies models but loses important amplitude-phase relationships.
method Proposes PolarBM, a novel Boltzmann machine for complex-valued variables in polar coordinates, and LogPolarBM for logarithmic amplitude.
result PolarBM and LogPolarBM achieve superior modeling accuracy compared to conventional models, including deep neural networks.

Deep neural networks help recover two signals from noisy mixtures.

problem Recovering two signals from noisy subgaussian mixtures with prior structural information.
method Used deep generative neural networks (GNNs) to solve the demixing problem for Lipschitz signals.
result Proved a sample complexity bound for nearly optimal recovery error, extending previous results.

This work optimizes signal estimation for sparse MRA with collision-free signals.

problem Recovering an unknown signal from repeated observations under cyclic isometries with high noise.
method Investigates minimax optimality for collision-free signals in the MRA model.
result The minimax optimal rate of estimation is \( \sigma^2/\sqrt{n} \) for sparse MRA.

The relation between performance and stress is described by the Yerkes-Dodson Law but varies significantly between individuals. This paper describes a method for determining the individual optimal performance as a function of physiological signals. The method is based on attention and reasoning tests of increasing comp…

2015-07-13abs ↗pdf ↗

Proposes a new complex Gaussian distribution for better modeling of complex-valued signals.

problem Limited ability of Gaussian distribution to represent diverse amplitude characteristics.
method Introduces a power-weighted noncentral complex Gaussian distribution on the complex plane.
result Consistently outperforms conventional distributions in log-likelihood for speech power spectra.

Novel algorithm learns sparse signal representations over topological spaces.

problem Sparse representation of signals over combinatorial topological spaces.
method Leveraging Hodge theory, the paper embeds topology into a dictionary structure via concatenated sub-dictionaries, each as a polynomial of Hodge Laplacians, and optimizes the dictionary coefficients and sparse signal representation via iterative alternating algorithms.
result Efficiently learned sparse representations and underlying relational structure of topological signals.

Complex-valued signals are used in the modeling of many systems in engineering and science, hence being of fundamental interest. Often, random complex-valued signals are considered to be proper. A proper complex random variable or process is uncorrelated with its complex conjugate. This assumption is a good model of th…

2015-02-17abs ↗pdf ↗

Detect anomalies in complex networks using topological subspace detectors.

problem Detect anomalies in complex networks defined by simplicial complexes.
method Formulate a hypothesis testing framework using Neyman-Pearson matched topological subspace detectors.
result Effective detection of anomalies in foreign currency exchange networks and other real-world data.

Improved model for non-smooth signals with complex spectra.

problem Current models struggle with non-smooth signals and complex spectral structures.
method CGPCM and RGPCM models with causality and Bayesian nonparametric interpretations, improved variational inference.
result Proposed models show better performance on synthetic and real-world data.

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

2014-11-26abs ↗pdf ↗

We consider the problem of recovering a signal xRn\mathbf{x}^* \in \mathbf{R}^n, from magnitude-only measurements yi=ai,xy_i = |\left\langle\mathbf{a}_i,\mathbf{x}^*\right\rangle| for i=[m]i=[m]. Also called the phase retrieval, this is a fundamental challenge in bio-,astronomical imaging and speech processing. The problem abov…

2017-05-18abs ↗pdf ↗

A new neural network captures and explains trajectory patterns.

problem Analyzing complex spatial trajectories in urban planning and neuroscience.
method Composite Signal Neural Networks (CompSNN) combining three interpretable ANN modules.
result CompSNN outperforms individual modules and visualizes useful signal parts.

We propose a novel adaptive kernel based regression method for complex-valued signals: the generalized complex-valued kernel least-mean-square (gCKLMS). We borrow from the new results on widely linear reproducing kernel Hilbert space (WL-RKHS) for nonlinear regression and complex-valued signals, recently proposed by th…

2019-02-22abs ↗pdf ↗

While deep learning has received a surge of interest in a variety of fields in recent years, major deep learning models barely use complex numbers. However, speech, signal and audio data are naturally complex-valued after Fourier Transform, and studies have shown a potentially richer representation of complex nets. In …

2019-10-22abs ↗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.

Neural process model improves real-time condition monitoring signal prediction.

problem Real-time adaptation for complex condition monitoring signals.
method Label-aware neural processes encoding and reconstruction.
result Advantages in real-time adaptation, enhanced signal prediction with uncertainty quantification, and joint prediction for labels and signals.

Method recovers complex-valued signals from speckle-noised measurements.

problem Recovering complex-valued signals from speckle-noised measurements.
method Bagged Deep Image Priors integrated with projected gradient descent and Newton-Schulz algorithm.
result Achieves state-of-the-art performance in MSE reduction.

This research improves asset life prediction by integrating deep learning with mixture distributions.

problem Predicting residual useful life for assets with multiple failure modes.
method Integrates mixture (log)-location-scale distribution with deep learning.
result Proposed models outperform existing methods in predicting residual useful life.

We present reconstruction algorithms for smooth signals with block sparsity from their compressed measurements. We tackle the issue of varying group size via group-sparse least absolute shrinkage selection operator (LASSO) as well as via latent group LASSO regularizations. We achieve smoothness in the signal via fusion…

2013-09-10abs ↗pdf ↗

In this paper, we develop a new framework for sensing and recovering structured signals. In contrast to compressive sensing (CS) systems that employ linear measurements, sparse representations, and computationally complex convex/greedy algorithms, we introduce a deep learning framework that supports both linear and mil…

2015-08-17abs ↗pdf ↗

Non-linear image reconstruction and signal analysis deal with complex inverse problems. To tackle such problems in a systematic way, I present information field theory (IFT) as a means of Bayesian, data based inference on spatially distributed signal fields. IFT is a statistical field theory, which permits the construc…

2013-01-11abs ↗pdf ↗

New AMP algorithms for rotationally invariant models with reduced complexity.

problem Signal estimation in generalized linear models with arbitrary spectral design matrices.
method Rotationally invariant approximate message passing (AMP) algorithms.
result Performance close to Vector AMP with significantly lower complexity.

In this paper, we present new results on using orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries for complex cases (i.e., complex measurement vector, complex dictionary and complex additive white Gaussian noise (CAWGN)). A sufficient condition that OMP can recover …

2012-06-11abs ↗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.

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

Study on estimating signals from shifted and noisy copies in high dimensions, revealing a phase transition.

problem Estimating a signal in high-dimensional space from its circularly-shifted and noisy copies.
method Analysis of sample complexity in the high-dimensional regime, focusing on the parameter α.
result A phase transition phenomenon governed by α, with different sample complexities based on α values.