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

Trend · papers per month

90180270360 · Jun 202019922001200920172026
48 results for Graph Signal Denoising

This paper explains GNNs using graph signal denoising.

problem Understanding how GNNs work for node representation learning.
method Spectral graph convolutional networks and graph attention networks are analyzed from the perspective of graph signal denoising.
result GNNs implicitly solve graph signal denoising problems.

New method denoises graph signals using wavelets, scalable for large graphs.

problem Denoising graph signals with overcomplete tight frames and correlated noise.
method Data-driven wavelet tight frame, Stein's unbiased risk estimate, Chebyshev-Jackson polynomial approximations, Monte-Carlo strategy.
result Method scales to large graphs and finds applications in differential privacy.

This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued. We extend the graph trend filtering framework to denoising vector-valued graph signals with a family of non-convex regularizers, which exhibi…

2019-05-29abs ↗pdf ↗

We propose a new framework for manifold denoising based on processing in the graph Fourier frequency domain, derived from the spectral decomposition of the discrete graph Laplacian. Our approach uses the Spectral Graph Wavelet transform in order to per- form non-iterative denoising directly in the graph frequency domai…

2016-11-29abs ↗pdf ↗

Detects graph topology changes from noisy signals using prior spectral information.

problem Detecting changes in graph topology from graph signals.
method Leverages graph filtering and subspace detection to distill problem into a CUSUM-based algorithm.
result Demonstrates the effectiveness of incorporating prior spectral signatures for change-point detection.

Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over graphs or networks. In this paper, we generalize the traditional concept of wide …

2016-01-11abs ↗pdf ↗

We study an extention of total variation denoising over images to over Cartesian power graphs and its applications to estimating non-parametric network models. The power graph fused lasso (PGFL) segments a matrix by exploiting a known graphical structure, GG, over the rows and columns. Our main results shows that for …

2018-05-25abs ↗pdf ↗

This study uses deep learning to improve the accuracy of raw data denoising in ProtoDUNE experiments.

problem Improving the accuracy of raw data denoising in ProtoDUNE experiments.
method Investigates two graph neural network architectures to enhance the receptive field of convolutional neural networks for raw data denoising.
result Graph neural network architectures outperform traditional algorithms in denoising raw ProtoDUNE data.

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions,…

2016-02-14abs ↗pdf ↗

Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods for signal processing on graphs ignore the dimension of time, tr…

2016-06-22abs ↗pdf ↗

Graph representation learning, aiming to learn low-dimensional representations which capture the geometric dependencies between nodes in the original graph, has gained increasing popularity in a variety of graph analysis tasks, including node classification and link prediction. Existing representation learning methods …

2019-10-04abs ↗pdf ↗

Novel Haar-Laplacian for directed graphs enhances spectral graph applications.

problem Lack of suitable Laplacian for directed graphs in spectral graph theory.
method Inspired by Haar-like transformation, introduces a Hermitian matrix preserving direction and weight.
result HaarNet outperforms in weight prediction and denoising on directed graphs.

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.

In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on weighted graphs, an additional design challenge is to incorporate …

2014-01-05abs ↗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 ↗

New denoisers improve signal recovery from noisy data without knowing noise distribution.

problem Denoising signals when only noise level is known, not distribution.
method Universal denoisers that shrink PYP_Y toward PXP_X with higher-order accuracy.
result Achieves O(σ4)O(σ^4) and O(σ6)O(σ^6) accuracy in matching generalized moments and densities.

RP-GFRFT unifies fractional order and rotation control for graph signals.

problem Lack of rotation-based spectral control in GFRFT and zero-angle degeneracy in AGFT.
method Rotation-parameterized graph fractional Fourier transform (RP-GFRFT) with degeneracy preserving rotation matrix.
result RP-GFRFT improves spectral filtering performance over existing methods.

We consider the problem of estimating a low-rank matrix from a noisy observed matrix. Previous work has shown that the optimal method depends crucially on the choice of loss function. In this paper, we use a family of weighted loss functions, which arise naturally for problems such as submatrix denoising, denoising wit…

2019-02-25abs ↗pdf ↗

A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorit…

2014-06-16abs ↗pdf ↗

New method for faster graph parameter inference from large random Kronecker graphs.

problem Efficiently infer graph parameters from large random Kronecker graphs.
method Decompose adjacency matrix into signal and noise components, then use denoising and solving approach.
result Proposed method achieves comparable or better performance than existing methods at lower computational cost.

Self-supervised method predicts clean signal and noise distribution from noisy images.

problem Blind denoising and noise estimation in biomedical images with limited clean data.
method Two neural networks jointly predict clean signal and noise distribution from noisy observations.
result Significantly outperforms state-of-the-art algorithms on six biomedical image datasets.

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 ↗

We present a probabilistic modeling and inference framework for discriminative analysis dictionary learning under a weak supervision setting. Dictionary learning approaches have been widely used for tasks such as low-level signal denoising and restoration as well as high-level classification tasks, which can be applied…

2018-02-05abs ↗pdf ↗

Study uses neural networks to filter financial spillovers from noise.

problem Accurately measuring spillovers in financial markets from noise.
method Neural network-based denoising of covariance matrices.
result Developed markets are net transmitters of volatility spillovers, but can become receivers during stress.

Study improves KRR for non-i.i.d. data, with applications in denoising.

problem Kernel regression in structured non-i.i.d. settings.
method Developed a blockwise decomposition method for dependent data, deriving excess risk bounds.
result Established generalization guarantees for KRR in non-i.i.d. settings.

Effective and powerful methods for denoising real electrocardiogram (ECG) signals are important for wearable sensors and devices. Deep Learning (DL) models have been used extensively in image processing and other domains with great success but only very recently have been used in processing ECG signals. This paper pres…

2019-08-27abs ↗pdf ↗

Method separates target signal properties from noisy mixtures.

problem Signal recovery from noisy mixtures with specific statistical properties.
method Statistical component separation method using noise samples and matching statistics.
result Method outperforms standard denoising methods in recovering target signal properties.

The paper develops a cross-validation method for improving signal denoising techniques.

problem Improving signal denoising methods for nonparametric regression.
method Develops a general cross-validation framework for signal denoising and applies it to Trend Filtering and Dyadic CART.
result Cross validated versions of Trend Filtering and Dyadic CART achieve nearly optimal convergence rates.

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.

Graph neural networks have become one of the most important techniques to solve machine learning problems on graph-structured data. Recent work on vertex classification proposed deep and distributed learning models to achieve high performance and scalability. However, we find that the feature vectors of benchmark datas…

2019-05-23abs ↗pdf ↗

Paper proposes JDR to denoise graph features and rewire graphs for better node classification.

problem Jointly denoise noisy graph features and rewire graphs for improved node classification.
method Align leading spectral spaces of graph and feature matrices to solve non-convex optimization problem.
result JDR consistently outperforms existing methods on various node classification tasks.

We present a method for audio denoising that combines processing done in both the time domain and the time-frequency domain. Given a noisy audio clip, the method trains a deep neural network to fit this signal. Since the fitting is only partly successful and is able to better capture the underlying clean signal than th…

2019-04-16abs ↗pdf ↗

Paper proposes a self-supervised method to denoise autoregressive signals with heavy-tailed noise.

problem Denoising autoregressive signals corrupted by heavy-tailed noise.
method Self-supervised learning approach without requiring full noise distribution knowledge.
result Strong denoising performance compared to baseline methods, especially for impulsive noise.

GDiff tackles blind denoising with Gibbs sampling and Monte Carlo inference.

problem Blind denoising of signals with unknown noise parameters.
method Gibbs Diffusion (GDiff) method that alternates sampling steps from a conditional diffusion model and a Monte Carlo sampler.
result GDiff achieves blind denoising of natural images and cosmic microwave background data.

A new distance metric derived from information theory and estimation theory.

problem Developing a robust distance metric for complex signal distributions.
method Information-Estimation Metric (IEM) derived from continuous probability density and denoising errors.
result The IEM is a valid global distance metric that adapts to the geometry of complex distributions.

New algorithms improve rank one signal estimation from noisy data.

problem Estimating a rank one signal matrix from corrupted data with rotationally invariant noise.
method Developed approximate message-passing algorithms exploiting eigenvalues and iterates denoisers.
result Achieves optimal asymptotic estimation error among iterative algorithms.

We analyze the Laplacian pyramids algorithm of Rabin and Coifman for extending and denoising a function sampled on a discrete set of points. We provide mild conditions under which the algorithm converges, and prove stability bounds on the extended function. We also consider the iterative application of truncated Laplac…

2019-09-17abs ↗pdf ↗

Self-training in linear models shows a U-shaped test-risk curve due to signal forgetting and denoising.

problem Understanding the dynamics of iterative self-training in high-dimensional linear regression.
method Derivation of deterministic-equivalent recursions for prediction risk and effective noise, analysis of signal forgetting and denoising effects.
result An optimal early-stopping time is determined, and a U-shaped test-risk curve is observed.

Image denoising is an important pre-processing step in medical image analysis. Different algorithms have been proposed in past three decades with varying denoising performances. More recently, having outperformed all conventional methods, deep learning based models have shown a great promise. These methods are however …

2016-08-16abs ↗pdf ↗