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

1122 · Feb 201919922001200920172026
48 results for low-pass

We propose a Bayesian nonparametric method for low-pass filtering that can naturally handle unevenly-sampled and noise-corrupted observations. The proposed model is constructed as a latent-factor model for time series, where the latent factors are Gaussian processes with non-overlapping spectra. With this construction,…

2019-02-09abs ↗pdf ↗

The MAXFLAT low-pass filter improves factor adjustment for better portfolio performance in China's stock market.

problem Improving factor adjustment for better portfolio performance in China's stock market.
method Using MAXFLAT low-pass volatility model to adjust factors and construct portfolios.
result Adjusted factors by MAXFLAT volatility model show better performance in both large and small cap universes.

DOPPLER optimizes DP training with low-pass filtering, improving model accuracy.

problem Privacy concerns in deep learning models and performance degradation of DP optimizers.
method Developed DOPPLER, a low-pass filter for DP optimizers, to reduce privacy noise and enhance model quality.
result DOPPLER optimizers outperform non-DOPPLER counterparts by 3%-10% in test accuracy.

Study assesses deep neural networks' robustness in mammogram images.

problem Understanding deep neural networks' robustness in mammogram images for breast cancer screening.
method Measuring sensitivity to four perturbations and analyzing low-pass filtering effects.
result Mammogram image classifiers are sensitive to perturbations similar to natural images, but low-pass filtering degrades clinically meaningful features.

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 ↗

We study the nature of fluctuations in variety of price indices involving companies listed on the New York Stock Exchange. The fluctuations at multiple scales are extracted through the use of wavelets belonging to Daubechies basis. The fact that these basis sets satisfy vanishing moments conditions makes them ideal to …

2012-05-08abs ↗pdf ↗

Paper develops an online EM algorithm for graph signal inference from streaming data.

problem Joint inference and clustering of graph signals with non-white excitation.
method Mixture model with low-rank plus sparse prior, online EM algorithm.
result Proposed online EM algorithm converges to MAP solution.

Robust ASR model removes fast-changing features to resist attacks.

problem Vulnerability of ASR systems to adversarial attacks.
method Removing fast-changing features using slow feature analysis or low-pass filtering.
result Hybrid ASR models are more than four times more robust against targeted attacks.

Fourier methods have a long and proven track record as an excellent tool in data processing. As memory and computational constraints gain importance in embedded and mobile applications, we propose to combine Fourier methods and recurrent neural network architectures. The short-time Fourier transform allows us to effici…

2018-12-13abs ↗pdf ↗

New pp-Laplacian GNN model tackles heterophilic graphs by improving node classification.

problem Heterophilic graphs where node labels differ, leading to poor GNN performance.
method Proposes pp-Laplacian GNN model with a new message passing mechanism derived from discrete regularization.
result Significantly outperforms state-of-the-art GNNs on heterophilic benchmarks.

Recently, the field of adversarial machine learning has been garnering attention by showing that state-of-the-art deep neural networks are vulnerable to adversarial examples, stemming from small perturbations being added to the input image. Adversarial examples are generated by a malicious adversary by obtaining access…

2019-08-06abs ↗pdf ↗

We perform wavelet decomposition of high frequency financial time series into large and small time scale components. Taking the FTSE100 index as a case study, and working with the Haar basis, it turns out that the small scale component defined by most (\simeq 99.6%) of the wavelet coefficients can be neglected for th…

2011-03-18abs ↗pdf ↗

A simple method for estimating PMF on large supports, preserving structure and suppressing noise.

problem Nonparametric estimation of multi-modal, heavy-tailed PMF on large discrete support.
method Data-dependent low-pass filtering on a line graph Laplacian.
result Smooth, multi-modal estimate of PMF that preserves coarse structure and suppresses noise.

In this paper we propose the use of continuous residual modules for graph kernels in Graph Neural Networks. We show how both discrete and continuous residual layers allow for more robust training, being that continuous residual layers are those which are applied by integrating through an Ordinary Differential Equation …

2019-11-21abs ↗pdf ↗

Graph Convolutional Networks (GCNs) and their variants have experienced significant attention and have become the de facto methods for learning graph representations. GCNs derive inspiration primarily from recent deep learning approaches, and as a result, may inherit unnecessary complexity and redundant computation. In…

2019-02-19abs ↗pdf ↗

A new method for joint noise removal and trend estimation from sparse signals.

problem Jointly removing noise and estimating trends from sparse signals.
method PENDANTSS combines SOOT/SPOQ penalties with BEADS algorithm in a Trust-Region block alternating variable metric forward-backward approach.
result Outperforms comparable methods in deconvolving analytical chemistry signals.

This paper considers a new framework to detect communities in a graph from the observation of signals at its nodes. We model the observed signals as noisy outputs of an unknown network process, represented as a graph filter that is excited by a set of unknown low-rank inputs/excitations. Application scenarios of this m…

2018-09-05abs ↗pdf ↗

Seminal works on graph neural networks have primarily targeted semi-supervised node classification problems with few observed labels and high-dimensional signals. With the development of graph networks, this setup has become a de facto benchmark for a significant body of research. Interestingly, several works have rece…

2019-11-13abs ↗pdf ↗

Time-continuous dimensional descriptions of emotions (e.g., arousal, valence) allow researchers to characterize short-time changes and to capture long-term trends in emotion expression. However, continuous emotion labels are generally not synchronized with the input speech signal due to delays caused by reaction-time, …

2019-07-05abs ↗pdf ↗

Filter banks are a popular tool for the analysis of piecewise smooth signals such as natural images. Motivated by the empirically observed properties of scale and detail coefficients of images in the wavelet domain, we propose a hierarchical deep generative model of piecewise smooth signals that is a recursion across s…

2019-07-23abs ↗pdf ↗

Introduces Spectral Attention for better long-range time series forecasting.

problem Challenges in capturing long-range dependencies in time series forecasting.
method Spectral Attention mechanism that preserves temporal correlations and long-range dependencies.
result Achieves state-of-the-art results on 11 real-world time series datasets.

Improved image restoration using frequency-guided sampling.

problem Restoring high-quality images from degraded observations with known degradation processes.
method Proposed a frequency-guided sampling approach for diffusion-based image restoration, incorporating a time-varying low-pass filter.
result Significantly improved performance on challenging image restoration tasks, including motion deblurring and image dehazing.

Graph-based methods have been demonstrated as one of the most effective approaches for semi-supervised learning, as they can exploit the connectivity patterns between labeled and unlabeled data samples to improve learning performance. However, existing graph-based methods either are limited in their ability to jointly …

2019-01-28abs ↗pdf ↗

BankGCN improves graph convolution networks by handling multi-channel signals with adaptive filter banks.

problem Handling multi-channel graph signals with limited architectures.
method BankGCN decomposes multi-channel signals into subspaces and uses adapted filters for each subspace.
result BankGCN achieves excellent performance in graph classification on benchmark datasets.

Data coarse graining improves model performance by filtering out less relevant features.

problem Lossy data transformations lose information but can improve model generalization.
method Data coarse graining schemes that systematically discard features based on relevance to the learning task.
result A 'high-pass' scheme helps models generalize better by filtering out less relevant features.

A new hybrid GNN framework tackles oversmoothing in graph data.

problem Oversmoothing in graph convolutional networks limits their expressive power and generalization.
method Combines traditional GCN filters with band-pass filters defined via geometric scattering and introduces an attention framework.
result Improves expressive power and generalization of graph convolutional networks.

New method improves image denoising with fewer parameters and less data.

problem Image denoising requires large datasets and supervised settings, limiting practical applications.
method Self-supervised framework using Tucker low-rank tensor approximation.
result Improves model generalizability and reduces data acquisition costs.

Convolutional Neural Networks (CNNs) have shown impressive performance in computer vision tasks such as image classification, detection, and segmentation. Moreover, recent work in Generative Adversarial Networks (GANs) has highlighted the importance of learning by progressively increasing the difficulty of a learning t…

2020-03-03abs ↗pdf ↗

AGE improves graph embedding by smoothing features and iteratively enhancing node embeddings.

problem Challenges in attributed graph embedding, especially in preserving optimal low-pass characteristics and robustness.
method AGE, a novel framework combining Laplacian smoothing and adaptive encoding, addresses these issues.
result AGE consistently outperforms state-of-the-art methods on node clustering and link prediction tasks.

This paper examines how Higher-Order Langevin Dynamics reduces memorization in diffusion models.

problem Memorization of training samples in diffusion models, violating copyright and privacy.
method Introduces Higher-Order Langevin Dynamics (HOLD) to regularize diffusion model trajectories.
result The dynamics of the data variable in HOLD are governed by a low-pass-filtered version of the learned score function, with smoothness increasing with model order.

Graph convolutions can enhance high frequencies, leading to over-sharpening.

problem Graph convolutions suffer from over-smoothing and poor performance on heterophilic graphs.
method Rigorously prove that linear graph convolutions minimize a generalized Dirichlet energy, showing that weight matrices induce edge-wise attraction or repulsion.
result Graph convolutions can enhance high frequencies, leading to over-sharpening instead of over-smoothing.

AaSP improves audio self-supervised learning by addressing aliasing issues.

problem Alias issues in audio spectrogram transformers.
method AaSP combines aliasing-aware patch representation, teacher-student masked modeling, cross-attention predictor, and contrastive regularization.
result AaSP learns more stable representations that integrate high-frequency cues.

Develops method for learning signed graphs from smooth signals.

problem Learning signed graphs from observed data, especially in contexts with both positive and negative interactions.
method Uses net Laplacian as graph shift operator and minimizes total variation of observed signals with ADMM.
result Theoretical proofs of convergence and estimation error bound provided.

FRA-Attack improves adversarial transferability for closed-source MLLMs by aligning visual focus across models.

problem Improving adversarial transferability for closed-source MLLMs, especially with high accuracy.
method Unified frequency-domain regularization approach: high-pass DCT objective for feature alignment and Frequency-domain Gradient Regularization (FGR) for gradient optimization.
result FRA-Attack achieves superior cross-model transferability, especially on GPT-5.4, Claude-Opus-4.6, and Gemini-3-flash.

Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.

problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution

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 ↗