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

Trend · papers per month

2.2%4.4%6.7%8.9% · May 202619922001200920172026
48 results for Gabor noise

The paper addresses instability in CNNs' first layer by proving max pooling's shift invariance.

problem Instability in CNNs' first layer, leading to sensitivity to small input shifts.
method Establishing conditions for max pooling's shift invariance and deriving a measure of stability.
result Max pooling approximates a nearly shift-invariant complex modulus under certain conditions.

This article addresses the issue of representing electroencephalographic (EEG) signals in an efficient way. While classical approaches use a fixed Gabor dictionary to analyze EEG signals, this article proposes a data-driven method to obtain an adapted dictionary. To reach an efficient dictionary learning, appropriate s…

2013-03-04abs ↗pdf ↗

We present a machine learning model for the analysis of randomly generated discrete signals, modeled as the points of an inhomogeneous, compound Poisson point process. Like the wavelet scattering transform introduced by Mallat, our construction is naturally invariant to translations and reflections, but it decouples th…

2019-02-10abs ↗pdf ↗

Much work has been done refining and characterizing the receptive fields learned by deep learning algorithms. A lot of this work has focused on the development of Gabor-like filters learned when enforcing sparsity constraints on a natural image dataset. Little work however has investigated how these filters might expan…

2012-10-31abs ↗pdf ↗

Study K-theory of Etesi CC^*-algebras to understand smooth manifolds.

problem Understanding smooth manifolds through K-theory of Etesi CC^*-algebras.
method Calculate topological and smooth invariants of manifolds using K-theory of Etesi CC^*-algebras.
result Smoothings of a manifold form a torsion abelian group isomorphic to the Brauer group of a number field.

Deep convolutional neural networks have led to breakthrough results in practical feature extraction applications. The mathematical analysis of these networks was pioneered by Mallat, 2012. Specifically, Mallat considered so-called scattering networks based on identical semi-discrete wavelet frames in each network layer…

2015-04-21abs ↗pdf ↗

Modeling curvature-sensitive cells in visual cortex with geometric structures.

problem Understanding the functional architecture of curvature-sensitive cells in the visual cortex.
method Geometric model based on Engel structure and SIM(2) symmetry.
result Identified SIM(2) as the natural symmetry group for curvature-sensitive cells.

This paper tackles spatio-temporal information preservation in machine learning.

problem Conventional machine learning assumes orthogonal data attributes, disrupting spatio-temporal information.
method Shift-invariant k-means, convolutional dictionary learning, and spatio-temporal hypercomplex encoding schemes are proposed.
result Gabor feature extraction outperforms convolutional dictionary learning in spatio-temporal information preservation.

The study investigates noise effects on parameter estimation for Ornstein-Uhlenbeck processes.

problem Impact of noise on parameter fitting for Ornstein-Uhlenbeck processes.
method Proposed algorithms to distinguish between thermal and multiplicative noise.
result Effective methods to estimate parameters even when multiplicative noise dominates.

Noise in SGD affects overparameterized models, favoring sparse solutions.

problem Understanding and mitigating implicit bias in SGD with parameter-dependent noise.
method Theoretical analysis of a quadratically-parameterized model with label noise and Gaussian noise.
result SGD with label noise recovers sparse ground-truth solutions, while SGD with Gaussian noise overfits dense solutions.

L2R learns to denoise images without needing noise distribution knowledge.

problem Traditional denoising methods require noise distribution knowledge, limiting their applicability.
method L2R uses a learnable monotonic neural network to learn recorruption without distribution knowledge.
result L2R achieves state-of-the-art performance across various noise distributions.

We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local…

2018-01-12abs ↗pdf ↗

BeGIN benchmarks GNNs for instance-dependent label noise in graphs.

problem Instance-dependent label noise in graph data.
method BeGIN introduces a benchmark with various noise types and evaluates noise-handling strategies across GNN architectures.
result Challenges of instance-dependent noise, especially LLM-based corruption, and the importance of node-specific parameterization.

Enhanced consistency bounds derived for classification under a new noise condition.

problem Enhanced consistency bounds for classification under a new noise condition.
method Model Margin Noise (MM noise) assumption, derived enhanced H-consistency bounds.
result Enhanced H-consistency bounds under MM noise condition, interpolates between linear and square-root regimes.

Proposes a progressive label correction method for feature-dependent label noise.

problem Real-world large-scale datasets often suffer from heterogeneous, feature-dependent label noise.
method A progressive label correction algorithm that iteratively refines the model.
result A classifier trained with this strategy converges to be consistent with the Bayes classifier for various noise patterns.

New methods for handling time-varying label noise in time series classification.

problem Temporal label noise in time series classification tasks.
method Proposed methods to estimate temporal label noise function directly from data.
result Our methods lead to state-of-the-art performance under diverse types of temporal label noise.

Paper tackles online control of linear systems with unbounded noise.

problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and established O(mpoly(logT)) O({ m poly} (\log T)) regret bound for strongly convex costs and sub-Gaussian noise.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and O(mpoly(logT)) O({ m poly} (\log T)) regret bound for specific noise and cost conditions.

TrustNet robustly learns noise patterns from trusted data to improve weakly-supervised classification.

problem Robustness to label noise in weakly-supervised learning.
method TrustNet learns noise patterns from trusted data, then trains a robust classifier using these patterns.
result TrustNet outperforms state-of-the-art methods in robustness to various noise patterns.

Geometry-aware noise improves model generalization on complex manifolds.

problem Improving model generalization on highly curved data manifolds.
method Add geometry-aware noise to input space, projecting Gaussian noise onto tangent space of manifold and mapping it via geodesic curve.
result Geometry-aware noise leads to improved generalization and robustness on highly curved manifolds.

A method uses confidence scores to handle noisy labels for each instance.

problem Learning with noisy labels where each instance's label can randomly change.
method Introduces confidence-scored instance-dependent noise (CSIDN) to estimate transition distributions for each instance.
result Demonstrates the utility and effectiveness of CSIDN through experiments with synthetic and real-world noise.

New insights into noise distribution for self-supervised learning.

problem Challenges the assumption that optimal noise should match data distribution.
method Turns to Noise-Contrastive Estimation (NCE) to define optimality of noise distribution.
result Optimal noise distribution is different from data distribution, challenging GANs assumption.