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

Trend · papers per month

2.7%5.4%8.2%10.9% · Jun 202019922001200920172026
48 results for noisy layers

Recently, the deep-belief-networks (DBN) based voice activity detection (VAD) has been proposed. It is powerful in fusing the advantages of multiple features, and achieves the state-of-the-art performance. However, the deep layers of the DBN-based VAD do not show an apparent superiority to the shallower layers. In this…

2013-03-04abs ↗pdf ↗

Generalizes neural tangent kernel analysis for two-layer networks with noise and regularization.

problem Limitations of NTK analysis in deep learning practice.
method Generalized NTK analysis for two-layer neural networks with weight decay and gradient noise.
result Noisy gradient descent with weight decay exhibits 'kernel-like' behavior and converges linearly.

Deep learning models can overfit noisy data without losing generalization.

problem Understanding the generalization of deep learning models in noisy data.
method Empirical investigation of epoch-wise double descent in fully connected neural networks trained on CIFAR-10 with 30% label noise.
result The model achieves strong re-generalization on test data after overfitting noisy training data, corresponding to a 'benign overfitting' state.

Enhances deep learning models to resist adversarial attacks.

problem Protecting deep learning models from adversarial examples.
method Combines two mechanisms: increased robustness at the cost of accuracy and improved accuracy without robustness guarantee.
result Combining mechanisms provides robustness against adversarial examples while maintaining accuracy.

Improved fine-tuning with regularization and robustness for noisy labels.

problem Fine-tuning pre-trained models on small datasets can lead to overfitting and memorization.
method PAC-Bayes generalization bound analysis, layer-wise regularization, self-label-correction, label-reweighting.
result Improves performance by 1.76% on average for image classification tasks and 0.75% for few-shot classification.

Transformers can learn noisy linear systems with depth and IID data.

problem Learning noisy linear dynamical systems with transformers.
method Theoretical analysis of multi-layer and single-layer transformers with respect to L2L^2-testing loss.
result Single-layer transformers have a non-diminishing lower bound on approximation error, suggesting depth separation.

MASnet enhances speech on mobile devices with low latency.

problem Efficiently enhancing speech on mobile devices with low latency.
method MASnet processes linear-scale spectrograms, using ratio masks to enhance noisy frames, and operates in low-latency incremental inference mode.
result MASnet achieves efficient speech enhancement with low latency, reducing FMA/s operations.

Study shows exponential gap in sample complexity between noisy and non-noisy recurrent neural networks.

problem Understanding the impact of noise on the sample complexity of recurrent neural networks.
method Analyzing noisy multi-layered sigmoid recurrent neural networks with independent noise and proving lower bounds.
result Exponential gap in sample complexity between noisy and non-noisy networks, even for small noise values.

Large-scale datasets may contain significant proportions of noisy (incorrect) class labels, and it is well-known that modern deep neural networks (DNNs) poorly generalize from such noisy training datasets. To mitigate the issue, we propose a novel inference method, termed Robust Generative classifier (RoG), applicable …

2019-01-31abs ↗pdf ↗

Neural networks can interpolate noisy data and still generalize well.

problem Generalization of neural networks trained on noisy data.
method Two-layer neural networks trained to interpolation by gradient descent on corrupted labels.
result Neural networks can achieve zero training error and optimal test error.

The method constructs arbitrage-free option surfaces from noisy quotes using Chebyshev bases and a fog post-fit layer.

problem Constructing arbitrage-free option price surfaces from noisy bid-ask quotes.
method Chebyshev tensor bases, linear sampling, no-arbitrage operators, quadratic objective, OSQP solvers, fog post-fit layer, Hamiltonian energy.
result High inside-spread coverage (98-99%) and low no-arbitrage violations (below 1%) in stable periods, controlled leakage in stressed periods.

We study the problem of learning one-hidden-layer neural networks with Rectified Linear Unit (ReLU) activation function, where the inputs are sampled from standard Gaussian distribution and the outputs are generated from a noisy teacher network. We analyze the performance of gradient descent for training such kind of n…

2018-06-20abs ↗pdf ↗

We describe a novel family of models of multi- layer feedforward neural networks in which the activation functions are encoded via penalties in the training problem. Our approach is based on representing a non-decreasing activation function as the argmin of an appropriate convex optimiza- tion problem. The new framewor…

2018-05-03abs ↗pdf ↗

We study the problem of training machine learning models incrementally with batches of samples annotated with noisy oracles. We select each batch of samples that are important and also diverse via clustering and importance sampling. More importantly, we incorporate model uncertainty into the sampling probability to com…

2019-09-27abs ↗pdf ↗

Most existing image denoising approaches assumed the noise to be homogeneous white Gaussian distributed with known intensity. However, in real noisy images, the noise models are usually unknown beforehand and can be much more complex. This paper addresses this problem and proposes a novel blind image denoising algorith…

2016-01-13abs ↗pdf ↗

Normalization layers improve the accuracy of Differentially Private training of deep neural networks.

problem Reduced accuracy in deep neural networks with Differentially Private training.
method Proposed a novel method for integrating batch normalization with Differentially Private Stochastic Gradient Descent (DPSGD) without additional privacy loss.
result Training deeper networks with better utility-privacy trade-off is possible.

Paper introduces a neural network training algorithm for noisy data that achieves optimal parameters and replicates real-world behaviors.

problem Theoretical gap between universal approximation theorems and practical machine learning with noisy data.
method Randomized training algorithm for neural networks trained on noisy data samples.
result Trained neural networks achieve optimal parameters and exhibit real-world behaviors like sub-linear complexity and interpolation.

Machine learning, and more specifically deep learning, have shown remarkable performance in sensing, communications, and inference. In this paper, we consider the application of the deep unfolding technique in the problem of signal reconstruction from its one-bit noisy measurements. Namely, we propose a model-based mac…

2018-11-30abs ↗pdf ↗

The study analyzes how label noise affects deep learning feature learning.

problem The impact of label noise on deep learning feature learning.
method Theoretical analysis of a two-layer convolutional neural network under noisy label conditions.
result Two key stages identified: signal learning in Stage I and noise memorization in Stage II.

Learning with noisy labels, which aims to reduce expensive labors on accurate annotations, has become imperative in the Big Data era. Previous noise transition based method has achieved promising results and presented a theoretical guarantee on performance in the case of class-conditional noise. However, this type of a…

2019-03-06abs ↗pdf ↗

Over-parameterized models can memorize noisy labels and still generalize well, revealing a hidden structure.

problem Understanding how over-parameterized models can simultaneously memorize noisy labels and generalize well.
method Investigated through modular arithmetic tasks with label noise using two-layer neural networks.
result Over-parameterized models can achieve near-perfect test accuracy with 80% label noise by extracting an internal generalization structure.

This work shows linear convergence for two-layer neural networks in mean-field regime.

problem Optimizing two-layer neural networks in the mean-field regime.
method Mean-field analysis and continuous-time noisy gradient descent.
result Establishes linear convergence rate for two-layer neural networks.

The paper explores how linear neural networks can overfit without bias when data is well-behaved.

problem Understanding why linear neural networks can generalize well despite fitting noisy data.
method Analyzing two-layer linear neural networks trained with gradient flow, deriving bounds on excess risk.
result The excess risk depends on initialization quality and data covariance matrix properties.

Classical convolutional neural networks (cCNNs) are very good at categorizing objects in images. But, unlike human vision which is relatively robust to noise in images, the performance of cCNNs declines quickly as image quality worsens. Here we propose to use recurrent connections within the convolutional layers to mak…

2018-11-21abs ↗pdf ↗

We analyze random feature and two-layer neural networks using duality framework.

problem Understanding and analyzing functions within Fp,π\mathcal{F}_{p,π} and Barron spaces.
method Duality framework based on information-based complexity (IBC).
result Sharp bounds for learning Fp,π\mathcal{F}_{p,π} using RFMs without curse of dimensionality for p>1p>1.

Large datasets often have unreliable labels-such as those obtained from Amazon's Mechanical Turk or social media platforms-and classifiers trained on mislabeled datasets often exhibit poor performance. We present a simple, effective technique for accounting for label noise when training deep neural networks. We augment…

2017-05-09abs ↗pdf ↗

We study the problem of inverting a deep generative model with ReLU activations. Inversion corresponds to finding a latent code vector that explains observed measurements as much as possible. In most prior works this is performed by attempting to solve a non-convex optimization problem involving the generator. In this …

2019-06-18abs ↗pdf ↗

Efficiently learns linear non-Gaussian DAGs with noisy nodes.

problem Learning DAGs with non-Gaussian noise and diverging number of nodes.
method Proposes a novel method using topological layers for bottom-up reconstruction and consistent parent-child relations.
result Topological layers can be exactly reconstructed and parent-child relations established without faithfulness assumption.

Algorithms that fuse multiple input sources benefit from both complementary and shared information. Shared information may provide robustness against faulty or noisy inputs, which is indispensable for safety-critical applications like self-driving cars. We investigate learning fusion algorithms that are robust against …

2019-06-11abs ↗pdf ↗

RFMs transition from linear to nonlinear under specific input-label correlation.

problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.

SGATs learn sparse attention coefficients to improve graph learning tasks on large, noisy graphs.

problem Overfitting and noisy edges in GNNs on large, noisy graphs.
method Sparse Graph Attention Networks (SGATs) learn sparse attention coefficients under L0L_0-norm regularization.
result SGATs can remove 50%-80% edges from large graphs while maintaining similar classification accuracies.

Multi-layer neural networks are among the most powerful models in machine learning, yet the fundamental reasons for this success defy mathematical understanding. Learning a neural network requires to optimize a non-convex high-dimensional objective (risk function), a problem which is usually attacked using stochastic g…

2018-04-18abs ↗pdf ↗