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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for signal representation

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.

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 ↗

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.

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.

FreSh shifts model's initial frequency spectrum to match target signal, improving neural representation performance.

problem MLPs' low-frequency bias limits capturing high-frequency details accurately.
method FreSh selects embedding hyperparameters to align model's initial output spectrum with target signal's spectrum.
result FreSh improves performance across various neural representation methods and tasks with minimal computational overhead.

RISE framework unifies and improves time series learning with missing data.

problem Learning from time series with missing data.
method RISE framework unifies and improves time series learning with missing data.
result RISE instances always benefit from encoders that learn representations for numerical values.

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 ↗

The presence of noise is common in signal processing regardless the signal type. Deep neural networks have shown good performance in noise removal, especially on the image domain. In this work, we consider deep neural networks as a denoising tool where our focus is on one dimensional signals. We introduce an encoder-de…

2018-12-20abs ↗pdf ↗

This paper explores how different audio signal representations affect topological signatures and their predictive power.

problem The impact of different signal representations on topological signatures and their predictive power.
method The study compares three different signal representations (embedding, spectrogram, and spectrogram zeroes) and evaluates their topological signatures for speaker gender, vowel type, and individual prediction.
result Topological signatures from spectrogram zeroes offer the best improvement for gender prediction, and different representations are complementary.

The construction of a meaningful graph plays a crucial role in the success of many graph-based representations and algorithms for handling structured data, especially in the emerging field of graph signal processing. However, a meaningful graph is not always readily available from the data, nor easy to define depending…

2014-06-30abs ↗pdf ↗

Timely prediction of clinically critical events in Intensive Care Unit (ICU) is important for improving care and survival rate. Most of the existing approaches are based on the application of various classification methods on explicitly extracted statistical features from vital signals. In this work, we propose to elim…

2018-11-14abs ↗pdf ↗

Graph Denoising Policy Network learns robust representations from noisy graphs.

problem Noise sensitivity in graph representation learning.
method Reinforcement learning to select signal neighborhoods and aggregate features.
result Significantly outperforms state-of-the-art methods on node classification tasks.

Proposes a deep multi-scale neural network for EEG signal representation learning.

problem Capturing multi-frequency properties in EEG signals for better brain-computer interface.
method A novel deep multi-scale neural network that discovers feature representations in multiple frequency/time ranges and extracts spatial relationships.
result Improved performance in various active/passive BCI datasets compared to state-of-the-art methods.

A new framework converts EEG signals between subjects and tasks.

problem Noise and variability in EEG data hinder generalizable signal extraction.
method Contrastive Split-Latent Permutation Autoencoder (CSLP-AE) framework.
result The CSLP-AE framework enables zero-shot conversion between unseen subjects.

Many natural signals exhibit a sparse representation, whenever a suitable describing model is given. Here, a linear generative model is considered, where many sparsity-based signal processing techniques rely on such a simplified model. As this model is often unknown for many classes of the signals, we need to select su…

2012-12-12abs ↗pdf ↗

TNC learns time series representations by leveraging temporal neighborhoods.

problem Complex, unlabeled time series data.
method Temporal Neighborhood Coding (TNC) with a debiased contrastive objective.
result TNC outperforms other unsupervised methods in time series clustering and classification.

The study uses response theory to understand RNNs processing input signals.

problem Understanding how RNNs process sequential data.
method Deriving a Volterra series representation for SRNNs output using response theory from nonequilibrium statistical mechanics.
result SRNNs can be viewed as kernel machines operating on a reproducing kernel Hilbert space associated with the response feature.

Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and representation matrix are assumed to be known exactly in advance. However, uncertainties exist due to sampling distortion, …

2013-11-20abs ↗pdf ↗

We present a signal representation framework called the sparse manifold transform that combines key ideas from sparse coding, manifold learning, and slow feature analysis. It turns non-linear transformations in the primary sensory signal space into linear interpolations in a representational embedding space while maint…

2018-06-23abs ↗pdf ↗

We release a large ECG dataset for arrhythmia subtype discovery.

problem Discovering unknown subtypes of arrhythmia from continuous raw signals.
method Unsupervised representation learning task using semi-supervised evaluation.
result Qualitative evaluations show potential for representation learning in arrhythmia sub-type discovery.

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.

Most of the existing methods for sparse signal recovery assume a static system: the unknown signal is a finite-length vector for which a fixed set of linear measurements and a sparse representation basis are available and an L1-norm minimization program is solved for the reconstruction. However, the same representation…

2013-06-14abs ↗pdf ↗

Auto-Encoders are unsupervised models that aim to learn patterns from observed data by minimizing a reconstruction cost. The useful representations learned are often found to be sparse and distributed. On the other hand, compressed sensing and sparse coding assume a data generating process, where the observed data is g…

2016-05-23abs ↗pdf ↗

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.

A major issue in harmonic analysis is to capture the phase dependence of frequency representations, which carries important signal properties. It seems that convolutional neural networks have found a way. Over time-series and images, convolutional networks often learn a first layer of filters which are well localized i…

2018-10-29abs ↗pdf ↗

A scattering transform defines a signal representation which is invariant to translations and Lipschitz continuous relatively to deformations. It is implemented with a non-linear convolution network that iterates over wavelet and modulus operators. Lipschitz continuity locally linearizes deformations. Complex classes o…

2011-12-05abs ↗pdf ↗

Sparse representations using data dictionaries provide an efficient model particularly for signals that do not enjoy alternate analytic sparsifying transformations. However, solving inverse problems with sparsifying dictionaries can be computationally expensive, especially when the dictionary under consideration has a …

2015-11-16abs ↗pdf ↗

In many signal processing problems, it may be fruitful to represent the signal under study in a frame. If a probabilistic approach is adopted, it becomes then necessary to estimate the hyper-parameters characterizing the probability distribution of the frame coefficients. This problem is difficult since in general the …

2009-11-15abs ↗pdf ↗