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

Trend · papers per month

1.6%3.2%4.8%6.5% · Jun 202619922001200920182026
48 results for k-bandlimited signals

We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, i.e., independent of the graph structure, and its performance depends on a parameter called the graph coherence. On the co…

2015-11-16abs ↗pdf ↗

New sampling method for graph signals using DPPs for perfect recovery on small graphs, and sub-optimal but faster approach for large graphs.

problem Sampling k-bandlimited signals on graphs efficiently.
method Determinantal Point Processes (DPP) for both small and large graphs.
result Preliminary experiments show efficient sampling especially for graphs with strong community structure.

A new geometry for comparing signals, overcoming traditional limitations.

problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.

This work uses encoder-decoder networks to denoise one-dimensional signals by aligning clean and noisy signal latent representations.

problem Noise removal in one-dimensional signals, especially in medical and motion signals.
method Encoder-decoder architecture with adversarial learning to align clean and noisy signal latent representations.
result Better performance on electrocardiogram and motion signal denoising compared to learning-based and non-learning approaches.

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.

Paper presents a unique method to recover signals from their bispectrum.

problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.

Generative adversarial network improves signal reconstruction from magnitude spectrograms.

problem Reconstructing a time-domain signal from a magnitude spectrogram.
method Deep neural network and generative adversarial network approach.
result Our method reconstructs signals faster with higher quality than the Griffin-Lim method.

New framework models graph signals as distribution-valued signals in Wasserstein space.

problem Limitations of classical vector-based GSP, including synchronous observations and uncertainty.
method Introduces graph distribution-valued signals (GDSs) in the Wasserstein space.
result GDSs naturally encode uncertainty and stochasticity, generalizing traditional graph signals.

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.

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 ↗

Improved language identification accuracy through signal combination methods.

problem Enhancing speech recognition accuracy across multiple languages.
method Combining low-level acoustic signals with language-specific recognizer signals using lattice-based ensemble models and deep neural networks.
result Deep neural network model outperforms lattice-based ensemble model, reducing error rate from 5.5% to 4.3%.

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.

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.

We find ways to make physical signals misclassified by computer vision models.

problem Vulnerability of signal classifiers to adversarial perturbations in physical signals.
method Solving PDE-constrained optimization problems to construct imperceptible perturbations.
result Effective and physically realizable adversarial perturbations can be computed for machine learning models.

Optimizes signal detection in particle physics by decorrelating classifiers.

problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.

Paper improves signal proportion estimation by accounting for variable dependence.

problem Traditional estimators assume independence, limiting applicability in real-world scenarios.
method Integrates arbitrary covariance dependence information using principal factor approximation.
result Method outperforms state-of-the-art estimators in accuracy and detection of weaker signals.

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains.…

2012-06-04abs ↗pdf ↗

Detects missing tensor signals in a KS subspace with high probability.

problem Detecting tensor signals with many missing entities in a KS subspace.
method Projecting the signal onto the KS subspace and bounding residual energy.
result Reliable detection is possible if the missing signal cardinality exceeds KS subspace dimensions.

GAN-based spoofing attacks improve wireless signal authentication.

problem Improving wireless signal authentication against sophisticated spoofing attacks.
method Generative Adversarial Network (GAN) for generating synthetic signals.
result GAN-based spoofing attacks significantly increase the success probability of wireless signal spoofing.

SMSSVD simplifies biomedical signal decomposition without parameters.

problem Identifying and separating overlaid signals from technical artefacts.
method Unsupervised, parameter-free Singular Value Decomposition (SMSSVD) for denoising and signal representation.
result SMSSVD outperforms existing methods like PCA and SPC in real and synthetic datasets.

A new model classifies lightning signals more accurately across different scales.

problem Classifying VLF lightning transients to reduce interference and improve navigation system reliability.
method Introduces a multi-scale residual transformer (MRTransformer) to classify lightning signals.
result Achieved 90% accuracy in lightning signal classification.

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.

Research compares ML and Time Series methods for generating trading signals.

problem Efficiency of on-line learning Algorithms in generating trading signals.
method Used technical indicators and ensemble of Random Forests, also Kalman Filter.
result Kalman Filter outperformed Random Forests in on-line learning predictions of stock prices.

Model improves emotion recognition using multiple physiological signals.

problem Single physiological signal is insufficient for accurate emotion recognition.
method Fused multiple modal physiological signals (EEG, EMG, EOG) for emotion classification.
result Best classification accuracy of 94.42% on arousal and 94.02% on valence in two-class tasks.

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 ↗

ZM-Net efficiently manipulates images with unseen signals in real-time.

problem Efficiently alter images with diverse guiding signals (e.g. paintings, attributes).
method Proposes ZM-Net, a fully-differentiable architecture that jointly optimizes TNet and PNet.
result ZM-Net performs high-quality image manipulation in real-time (tens of milliseconds per image) for unseen signals.

Paper learns hypergraph structures from signals with smoothness priors.

problem Learning hypergraph structures from signals with high-order relationships.
method Proposes HGSL framework with dual smoothness prior to map signals to hypergraph structure.
result HGSL efficiently infers meaningful hypergraph topologies from signals.

This work tackles phaseless subspace tracking, recovering time-varying signals from phaseless projections.

problem Recovering time-varying signals from phaseless linear projections under gradual subspace change.
method Dynamic subspace tracking approach, leveraging gradual subspace change over time.
result Demonstrates feasibility of phaseless subspace tracking with gradual subspace change.

This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of sever…

2013-11-21abs ↗pdf ↗

Study detects signal in financial stock correlations using phase-ordering kinetics.

problem Detecting meaningful signals in financial stock return correlations.
method Stochastic field theory model to establish a detection threshold.
result Detection of a signal in the largest eigenvalues of the stock return correlation matrix.