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

Trend · papers per month

149298447596 · Jun 202019922001200920182026
48 results for discrete signal processing

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.

New method distinguishes stochastic from deterministic signals using excursion counts.

problem Distinguishing between stochastic and deterministic signals in discrete time series.
method Excursion and crossing theorems for continuous semimartingales, comparing empirical excursion counts to theoretical expectation.
result A robust data-driven diffusion test that classifies signals based on log-log slope deviation.

Study compares WTT and DWT for FTIR data feature extraction of medicinal plants.

problem Improving machine learning efficiency with FTIR spectra of medicinal plants.
method Comparison of WTT and DWT for feature extraction, varying preprocessing steps.
result WTT and DWT yield similar results, improving clustering and classification accuracy.

Data-driven methods link graphon limits to random walks and spectral clustering.

problem Clustering signals evolving over time with graphon limits.
method Transfer operators, Koopman and Perron-Frobenius, for estimating graphon from signal data.
result Spectral clustering can be extended to graphons, reconstructing transition densities and graphons.

Efficiently models event-based data with general parametric kernels.

problem Inference for Hawkes processes with general parametric kernels requires large datasets.
method Developed a fast 2\ell_2 gradient-based solver using a discretized version of events.
result Improved estimation of pattern latency in brain signals.

VFPred combines signal processing and machine learning for VF detection from short ECG signals.

problem Detecting Ventricular Fibrillation from short ECG signals.
method VFPred uses Empirical Mode Decomposition, Discrete Time Fourier Transform, and Support Vector Machine.
result VFPred achieves high sensitivity and specificity even from short 5-second signals.

This article develops a statistical test for the null hypothesis of strict stationarity of a discrete time stochastic process in the frequency domain. When the null hypothesis is true, the second order cumulant spectrum is zero at all the discrete Fourier frequency pairs in the principal domain. The test uses a window …

2018-01-20abs ↗pdf ↗

Approach detects illegal insider trading proactively from diverse data sources.

problem Detecting illegal insider trading in the stock market.
method Deep-learning and discrete signal processing on time series data, combined with tree-based visualization.
result Approach has a good success rate in detecting illegal insider trading patterns.

The paper introduces novel Gaussian process models for vector-valued signals on manifolds.

problem Modeling vector-valued signals on non-Euclidean domains, especially for applications like wind speeds.
method Intrinsically defined Gaussian vector fields on manifolds, accounting for manifold geometry.
result Gaussian vector fields provide more refined inductive biases than extrinsic fields.

Paper analyzes symbolic-dynamics inspired Markov modeling for time-series data.

problem Capturing temporal patterns in sequential data for statistical learning.
method Two-step process: discretization of continuous attributes and estimation of temporal memory.
result Effective Markov modeling depends on accurate discretization and memory estimation.

New method for separating mixed signals with nonlinear functions.

problem Recovering source signals from nonlinear mixtures.
method Optimisation-based function approximation to minimize mutual statistical dependence.
result The method can recover source signals from nonlinear mixtures under certain conditions.

In this paper, we study the generative models of sequential discrete data. To tackle the exposure bias problem inherent in maximum likelihood estimation (MLE), generative adversarial networks (GANs) are introduced to penalize the unrealistic generated samples. To exploit the supervision signal from the discriminator, m…

2018-04-11abs ↗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 ↗

Study the geometry of signal spaces in deep neural networks.

problem Contradiction between theoretical predictions and finite-size effects in deep neural networks.
method Analyze the manifold and curvature of embedded signal spaces in deep networks.
result The scalar curvature of the embedded manifold converges to a constant or diverges to infinity slowly, leading to a stable fixed value in the limit of infinite layers and neurons.

BIGMACS aligns multiple ocean sediment cores using Bayesian inference and Gaussian process regression.

problem Aligning and synchronizing ages from different ocean sediment cores using multiple proxies.
method BIGMACS uses Bayesian inference and Gaussian process regression to align and integrate age proxies.
result Constructs a new Deep Northeastern Atlantic stack and age models for additional cores.

GCNN research tackles graph data topology and prediction.

problem Graphs' irregularity and complexity make traditional CNN methods unsuitable.
method Review and categorization of GCNN techniques.
result TAGCN approach shows promise for improving graph data prediction.

New algorithm defends against adversarial examples in image classification.

problem Defending against adversarial examples in image classification.
method Approximates Discrete Fourier transform of sparse signals corrupted by L0L_0 noise.
result Successfully defends against L0L_0 adversaries in image classification.

Proposes AWS method for precise speech enhancement using DNN.

problem T-F resolution problem in fixed-resolution short-time frequency transforms.
method Incorporates trainable adaptive window switching into speech enhancement procedure.
result Achieved higher signal-to-distortion ratio than conventional methods.

Paper reviews multi-way graph signal processing for tensor data.

problem Maximizing use of multi-way structure in irregular tensor data.
method Generalizes GSP to multi-way data, focusing on graph signals across tensor modes.
result Synthesizes common themes in combining GSP with tensor analysis.

New methods detect continuous variation in single-cell data.

problem Continuous variation within and between cell types not detected by discrete analyses.
method Three topologically motivated mathematical methods for unsupervised feature selection.
result Detect additional biologically meaningful genes with coherent expression patterns.

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.

Paper reveals hidden convexities in deep learning models using sparse signal processing.

problem Non-convex loss functions in deep learning models complicate optimization and theoretical understanding.
method Developed convex equivalences of ReLU NNs and their connections to sparse signal processing models.
result Recent research has uncovered hidden convexities in certain NN architectures, notably two-layer ReLU networks and other architectures.

New algorithms improve signal processing in federated learning.

problem Efficiently process distributed signal samples with privacy and communication constraints.
method Proposes overpredictive signal approximations using convex optimization.
result Quantifies tradeoffs between communication cost, sampling rate, and approximation error.

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.

SC-Net learns interpretable filters for inverse problems, achieving optimal convergence and super-resolution.

problem Solving ill-posed inverse problems with effective regularization and interpretability.
method SC-Net operates in the spectral domain, learning a pointwise adaptive filter function based on signal-to-noise ratio.
result SC-Net achieves optimal convergence rate and zero-shot super-resolution, matching theoretical bounds.