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.
HeMPPCAT improves PCA for data with varying noise.
problem PCA's suboptimal performance on data with heterogeneous noise.
method HeMPPCAT uses a GEM algorithm to estimate factors, means, and noise variances.
result Improved factor estimates and clustering accuracy compared to MPPCA.
New method designs joint initial noises for diffusion models to improve diversity and alignment.
problem Independent initial noises limit diversity in generated images.
method Coupling of initial noises, maintaining Gaussian distribution while allowing dependence.
result Repulsive Gaussian coupling improves diversity without increasing sampling cost.
VFMs use noise adapters to conditionally generate images in one step.
problem Conditional image generation with iterative models is slow and requires explicit sampling paths.
method Developed a variational flow map framework that learns noise distributions for conditional sampling.
result VFMs achieve well-calibrated conditional samples in a single forward pass.
The paper cleans label noise in supervised classification using Bernoulli sampling.
problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.
Diffusion models generate new samples by adding and removing noise.
problem Generating new samples from data.
method Apply noise to data, reverse the process to generate new samples.
result Diffusion models can improve classifier performance on imbalanced data.
Unified framework for isotropic SG noise in posterior sampling.
problem Bayesian posterior sampling with practical and robust methods.
method Designing a novel, isotropic SG noise approach with fixed learning rate.
result Competitive and practical method compared to state-of-the-art.
Improved sample complexity for learning halfspaces with malicious noise.
problem Efficiently learning halfspaces in the presence of malicious noise.
method New analysis of Awasthi et al. algorithm with matrix Chernoff inequality and localization schemes.
result Achieved near-optimal sample complexity of ildeO(d) for isotropic log-concave distributions. Accurate noise modelling is important for training of deep learning reconstruction algorithms. While noise models are well known for traditional imaging techniques, the noise distribution of a novel sensor may be difficult to determine a priori. Therefore, we propose learning arbitrary noise distributions. To do so, th…
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.
SAP corrects model for label noise by identifying and removing noisy samples.
problem Label corruption degrades model performance; acquiring perfect labels is costly.
method SAP uses SVD to identify and project model weights onto a clean activation space.
result SAP improves model generalization by up to 6% on CIFAR dataset with 25% synthetic corruption.
The paper proposes a method to detect and filter noisy or mislabeled data using pointwise mutual information.
problem Detecting and filtering noisy or mislabeled data in deep learning models.
method A mutual information-based framework quantifying statistical dependencies between inputs and labels.
result The method effectively filters low-quality samples, improving classification accuracy by up to 15%.
New research shows that binary classification can be done with noisy data, but only if there are clean samples available.
problem Learning binary classification with instance and label dependent label noise.
method Theoretical analysis and empirical risk minimization.
result Empirical risk minimization achieves the optimal excess risk bound without additional assumptions.
Study shows sample noise impacts active learning performance.
problem Impact of sample noise on active learning performance.
method Proposed Incremental Weighted K-Means for noisy samples.
result Robust sampler improves synthetic tasks but only marginally in real-life.
New method enhances neural network robustness against adversarial attacks.
problem Enhancing neural network robustness against adversarial attacks.
method Variational framework with per-sample noise level selector.
result Enhanced empirical robustness and certified robustness.
BDDMs eliminate noise conditioning in diffusion models, simplifying training and sampling.
problem Noise conditioning in diffusion models is ad hoc and requires unprincipled noise embeddings.
method Introduce blind denoising diffusion models (BDDMs) that do not require noise conditioning.
result BDDMs simplify training and sampling by eliminating noise conditioning.
Improved autoregressive models generate higher quality images and are more robust to noise.
problem Generating high-quality images from autoregressive models.
method Noise conditional maximum likelihood estimation (MLE) with score-based sampling.
result Models trained with noise conditional MLE achieve better test likelihoods and generate higher quality images.
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.
This work extends score-based methods to binary data on the Boolean hypercube.
problem Learning and sampling binary data on the Boolean hypercube.
method Adopting Bernoulli noise as a smoothing device, deriving a TMF-like expression for the optimal denoiser, and using a Langevin-like sampler.
result The method successfully samples noisy binary data and reduces effective noise through multiple measurements.
The gradient noise of SGD is considered to play a central role in the observed strong generalization abilities of deep learning. While past studies confirm that the magnitude and the covariance structure of gradient noise are critical for regularization, it remains unclear whether or not the class of noise distribution…
CORES2 removes noisy labels by sieving out corrupted examples.
problem Instance-dependent label noise degrades DNN performance.
method CORES2 (COnfidence REgularized Sample Sieve) progressively sieves out corrupted examples.
result CORES2 provides theoretical guarantees for filtering out corrupted examples.
New method tackles label noise on imbalanced datasets by considering class-specific uncertainty.
problem Label noise and class imbalance in imbalanced datasets.
method Epistemic and aleatoric uncertainty-aware class-specific noise modeling.
result Proposed ULC framework improves performance on imbalanced datasets.
Noise-corrected Langevin algorithm improves sampling from noisy data.
problem Sampling from noisy data with biased score function.
method Noise-corrected Langevin algorithm using noisy score function.
result Bias due to noisy data is removed, improving sampling accuracy.
Unified framework for word embedding models using noise examples.
problem Improving word embedding models with negative sampling.
method Formulated a Word-Context Classification (WCC) framework that generalizes SkipGram word embedding models.
result The best noise distribution is the data distribution, improving both performance and training speed.
WaveletGAN improves GANs by homogenizing noise through multi-channel wavelet filtering.
problem Current noise generation models in GANs struggle with homogenizing noise, leading to low-fidelity samples.
method Proposes a multi-channel wavelet-based filtering method to homogenize noise in GANs.
result WaveletGAN generates high-fidelity samples with the smallest FIDs on Fashion-MNIST, KMNIST, and SVHN datasets.
Study shows a tradeoff between sample complexity and computational efficiency for learning halfspaces with random noise.
problem PAC learning γ-margin halfspaces with Random Classification Noise.
method Established an information-computation tradeoff and provided a simple efficient algorithm with sample complexity O(1/(γ^2 ε^2)). Also, proved lower bounds for SQ algorithms and low-degree polynomial tests.
result Inherent gap between sample complexity and computational efficiency for learning halfspaces with random noise.
SapAugment learns adaptive augmentation policies for better model training.
problem Fixed data augmentation methods often apply the same augmentation to all samples, ignoring sample difficulty.
method SapAugment adapts augmentation parameters based on training loss, learning a sample-adaptive policy.
result SapAugment achieves up to 21% relative reduction in word error rate on LibriSpeech dataset.
A method for estimating parameters from entangled single-sample distributions, robust to high-noise data.
problem Estimating common parameters from entangled single-sample distributions.
method Iterative trimming of samples to estimate the parameter.
result The method can tolerate a constant fraction of high-noise data points.
Paper presents robust boosting methods for label noise.
problem Boosting methods degrade in noisy environments.
method Robust Minimax Boosting (RMBoost) with theoretical guarantees.
result RMBoost provides strong classification accuracy and robustness.
In this paper, we study a classification problem in which sample labels are randomly corrupted. In this scenario, there is an unobservable sample with noise-free labels. However, before being observed, the true labels are independently flipped with a probability ρ∈[0,0.5), and the random label noise can be class-co…
This work analyzes nonexpansive stochastic approximations with Markovian noise, proving convergence in reinforcement learning.
problem Applying stochastic approximation to reinforcement learning settings with nonexpansive operators.
method Investigates nonexpansive stochastic approximations with Markovian noise, providing asymptotic and finite sample analysis.
result First-time proof of convergence for classical tabular average reward temporal difference learning.
We study Principal Component Analysis (PCA) in a setting where a part of the corrupting noise is data-dependent and, as a result, the noise and the true data are correlated. Under a bounded-ness assumption on the true data and the noise, and a simple assumption on data-noise correlation, we obtain a nearly optimal samp…
Evolutionary algorithms (EAs) are a sort of nature-inspired metaheuristics, which have wide applications in various practical optimization problems. In these problems, objective evaluations are usually inaccurate, because noise is almost inevitable in real world, and it is a crucial issue to weaken the negative effect …
Paper finds sample complexity for learning high-dimensional simplices from noisy data.
problem Learning high-dimensional simplices from noisy samples.
method Combines sample compression, high-dimensional geometry, and Fourier analysis.
result Proves sample complexity bound for achieving a simplex within a certain distance from the true simplex.
We introduce a novel method to combat label noise when training deep neural networks for classification. We propose a loss function that permits abstention during training thereby allowing the DNN to abstain on confusing samples while continuing to learn and improve classification performance on the non-abstained sampl…
This work sets lower bounds on the number of score queries needed for diffusion sampling.
problem Establishing information-theoretic limits on the number of score evaluations required for diffusion sampling.
method Proving lower bounds on the number of adaptive score queries needed for sampling.
result Any sampling algorithm requires at least \(\widetilde{\Omega}(\sqrt{d})\) adaptive score queries for \(d\)-dimensional distributions.
We study the problem of recovering an incomplete m×n matrix of rank r with columns arriving online over time. This is known as the problem of life-long matrix completion, and is widely applied to recommendation system, computer vision, system identification, etc. The challenge is to design provable algorithms…
Principal Component Analysis (PCA) is a method for estimating a subspace given noisy samples. It is useful in a variety of problems ranging from dimensionality reduction to anomaly detection and the visualization of high dimensional data. PCA performs well in the presence of moderate noise and even with missing data, b…
In the stochastic bandit problem, the goal is to maximize an unknown function via a sequence of noisy evaluations. Typically, the observation noise is assumed to be independent of the evaluation point and to satisfy a tail bound uniformly on the domain; a restrictive assumption for many applications. In this work, we c…
This work obtains novel finite sample guarantees for Principal Component Analysis (PCA). These hold even when the corrupting noise is non-isotropic, and a part (or all of it) is data-dependent. Because of the latter, in general, the noise and the true data are correlated. The results in this work are a significant impr…
There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can be substantially smaller than the domain size. For example, over a domain of size n, distinguishing the uniform distribution from distrib…
Study on sample complexity of policy gradient for stabilizing linear systems under multiplicative noise.
problem Learning optimal feedback gain for stabilizing linear systems with multiplicative noise.
method Analyzes the sample complexity of policy gradient methods, addressing the cusp obstruction and using symmetry to control divergent parts of the gradient.
result Proves that projected mini-batch policy gradient attains total sample complexity of O(1/η) when noise density is known and O(η^(-(2s+1)/(2s))) when estimated, for C^s noise densities with s ≥ 2.
Paper analyzes Greedy-GQ for reinforcement learning with Markovian noise.
problem Analyzing Greedy-GQ for reinforcement learning with Markovian noise.
method Develops finite-sample analysis for Greedy-GQ with linear function approximation under Markovian noise.
result Provides theoretical justification for choosing stepsizes for faster convergence.
Efficiently samples posterior distributions using Langevin dynamics.
problem Challenges in generating diverse posterior samples in high-dimensional spaces.
method Simulates Langevin dynamics in the noise space of a pre-trained generative model.
result Noise-space Langevin dynamics approximates the posterior without restarting the full sampling chain.
Study efficient learning of halfspaces with constant noise tolerance.
problem Learning halfspaces in the presence of both instance and label corruption.
method Develops an algorithm to minimize reweighted hinge loss for robustness.
result Achieves constant noise tolerance for halfspace learning.
M2M tackles zero-shot structured noise suppression in images.
problem Structured noise with strong anisotropic correlations in real-world images.
method M2M introduces a novel sampling strategy that generates pseudo-independent sub-image pairs from a single noisy input, using directional interpolation and generalized median filtering.
result M2M consistently outperforms state-of-the-art zero-shot methods under correlated noise.
We study the problem of learning conditional generators from noisy labeled samples, where the labels are corrupted by random noise. A standard training of conditional GANs will not only produce samples with wrong labels, but also generate poor quality samples. We consider two scenarios, depending on whether the noise m…
The paper optimizes training samples for image denoising across different noise levels.
problem Training a denoiser for all noise levels with uniform sample distribution.
method Derives a dual ascent algorithm for optimal sampling distribution.
result The algorithm converges to an optimal sampling distribution for deep neural networks.