Estimates rank-one spikes from heavy-tailed noise using self-avoiding walks.
problem Estimating rank-one spikes from heavy-tailed noise.
method Self-avoiding walks to count and estimate the spikes.
result Optimal estimation up to the BBP threshold for heavy-tailed noise.
S-SGD adds symmetrical noise to weights to avoid sharp minima in deep learning.
problem SGD does not always converge to a flat minimum, leading to poor generalization.
method Symmetrical weight noise injection in SGD.
result S-SGD outperforms conventional SGD and weight-noise injection methods in large batch training.
The paper tackles scalarization issues in A2C RL algorithms, proposing methods to avoid gradient overlap and noise.
problem Scalarization issues in A2C RL algorithms leading to gradient overlap and uncontrolled noise.
method Proposes techniques to avoid gradient overlap and noise in A2C RL algorithms.
result Pilot experiments show the proposed method speeds up training in A2C RL algorithms.
A new method avoids noise amplification when subtracting or dividing stochastic signals.
problem Noise amplification when subtracting or dividing stochastic signals.
method Normalizing flows to approximate the distribution of the signal of interest.
result Normalizing flows can generate an approximation of the probability distribution over the signal of interest, avoiding subtraction or division.
Differentially private learning avoids iterative optimization in parameter space.
problem Differentially private training of neural networks
method Hypernetworks trained on public datasets
result Significantly reduces noise in parameter space
A new framework for robust and coherent counterfactual transports.
problem Estimating joint distributions over counterfactual outcomes in personalized decision-making and treatment risk assessment.
method Counterfactual cocycles that use algebraic structure to provide coherence and identifiability guarantees, bridging the gap between bijective SCMs and OT methods.
result Counterfactual cocycles provide state-of-the-art performance and noise-robustness across synthetic benchmarks and a real-world study.
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.
This work addresses various open questions in the theory of active learning for nonparametric classification. Our contributions are both statistical and algorithmic: -We establish new minimax-rates for active learning under common \textit{noise conditions}. These rates display interesting transitions -- due to the inte…
Truncated SGD with heavy-tailed noise eliminates sharp local minima.
problem Avoiding sharp local minima in deep learning models.
method Truncated SGD with heavy-tailed gradient noise.
result Truncated SGD can eliminate sharp local minima entirely from its training trajectory.
Interpolation hurts robust generalization even without noise.
problem The challenge of robust generalization in the absence of noise.
method Avoiding interpolation through ridge regularization.
result Ridge regularization improves robust generalization.
The paper introduces false discovery rate control for BMF to avoid noisy patterns.
problem No guarantees exist for BMF patterns being real, not just noise.
method Proposes false discovery rate (FDR) to control BMF patterns, proving bounds on FDR.
result Improved BMF algorithms using theoretical FDR bounds for rank selection.
2020 Census uses more noise to protect privacy than needed, improving data accuracy.
problem Ensuring privacy in census data while maintaining accuracy for policy decisions.
method Applied f-differential privacy to track and reduce noise across geographical levels. result The 2020 Census provides stronger privacy protections than its nominal guarantees suggest.
Paper proposes a new method to stabilize noisy gradient algorithms.
problem Stochastic-gradient Langevin algorithms can introduce bias when taming denominators depend on stochastic-gradient realizations.
method Proposes a structure-preserving framework for designing tamed denominators that avoid unnecessary taming and maintain the stabilizing effect of taming.
result The method avoids stationary bias and explains the stationary error split into bias and remaining error.
Improved self-supervised denoising for Poisson-Gaussian noise.
problem Handling Poisson-Gaussian noise in self-supervised denoising.
method Extended blindspot model, improved training scheme without hyperparameters.
result Improved denoising performance on microscope image benchmarks.
Gaussians as noise in NCE lead to exponentially bad conditioning, hindering its efficiency.
problem Exponential conditioning of Hessian in NCE with Gaussian noise.
method Using Gaussian as the noise distribution in NCE.
result Gaussian noise in NCE leads to exponentially bad conditioning of the loss Hessian.
Deep-neural-network (DNN) based noise suppression systems yield significant improvements over conventional approaches such as spectral subtraction and non-negative matrix factorization, but do not generalize well to noise conditions they were not trained for. In comparison to DNNs, humans show remarkable noise suppress…
We consider the problem of reconstructing a low rank matrix from noisy observations of a subset of its entries. This task has applications in statistical learning, computer vision, and signal processing. In these contexts, "noise" generically refers to any contribution to the data that is not captured by the low-rank m…
The discovery of non-linear causal relationship under additive non-Gaussian noise models has attracted considerable attention recently because of their high flexibility. In this paper, we propose a novel causal inference algorithm called least-squares independence regression (LSIR). LSIR learns the additive noise model…
Deep networks can handle noisy labels up to a certain threshold.
problem Deep learning's robustness to noisy labels.
method Applying classical statistical theory and universal consistency of DNNs.
result Certain DNNs can tolerate massive symmetric label noise up to the information-theoretic threshold.
Improves neural networks by adjusting labels to reduce overfitting to noisy data.
problem Reduces overfitting to mislabeled or non-representative samples in neural networks.
method Combines self-adaptive training with mixup to improve accuracy and robustness.
result Achieves state-of-the-art accuracy on image recognition datasets with label noise.
Early stopping helps prevent overfitting to noisy labels in neural networks.
problem Overfitting to noisy labels in real-world training data.
method Two-phase training method (Prestopping) that early stops training and resumes using a maximal safe set.
result Significantly outperforms state-of-the-art methods in test error under label noise.
SVDD and Deep SVDD improve radar target detection in clutter.
problem Clutter and thermal noise degrade classical radar detection methods.
method Support Vector Data Description (SVDD) and Deep SVDD for one-class learning.
result SVDD and Deep SVDD outperform traditional methods on simulated radar data.
DiPriMe forests use private medians to create balanced tree splits for privacy-protected data.
problem Privacy concerns in training random forests due to multiple data queries.
method Proposes DiPriMe forests, which use a private median to generate balanced splits, ensuring differential privacy.
result DiPriMe forests achieve high utility while maintaining differential privacy, as shown both theoretically and empirically.
Generative model improves noise estimation in stochastic rotating shallow water models.
problem Improving noise estimation in stochastic partial differential equations for fluid dynamics.
method Replaced PCA with a generative model to avoid constraints on stochastic increments.
result Generative model produces better RMSE, CRPS score, and forecast rank histograms.
The paper studies how noisy labels impact decision-making in machine learning.
problem The impact of noisy labels on decision-making in machine learning.
method Introducing a notion of regret, studying standard approaches, and estimating individual-level mistakes.
result Standard approaches can lead to unforeseen mistakes for individuals, revealing the need for anticipation.
Generative Adversarial Networks generate PXD background noise efficiently.
problem Efficiently generate statistically independent PXD background noise samples.
method Conditional Generative Adversarial Networks (GANs) with contrastive learning.
result On-demand PXD background generator reduces storage requirements.
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.
New algorithm reduces MFGs with common noise complexity.
problem Prohibitive computational cost in solving MFGs with common noise.
method Signatured deep fictitious play based on rough path theory.
result Significantly reduced computational complexity and improved efficiency.
New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.
problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.
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…
Generative method avoids function estimation for data generation.
problem Challenges in function estimation for generative models.
method Deterministic point transport with gradient descent.
result Data generation possible without function estimation.
This work improves texture segmentation by automatically tuning hyperparameters for Total-Variation.
problem The challenge is to automatically select hyperparameters for Total-Variation texture segmentation.
method The approach involves extending Stein's unbiased gradient estimator to handle correlated Gaussian noise, leading to an automatic tuning method.
result The method provides an automatic way to select hyperparameters for Total-Variation texture segmentation.
Stochastic gradient methods can converge in expectation under heavy-tailed noise.
problem Convergence of stochastic gradient methods under heavy-tailed noise.
method Comprehensive study of stochastic optimization under heavy-tailed noise for extsfSGD, extsfSMD, extsfASMD, extsfSGDM in convex and nonconvex optimization. result Established in-expectation convergence results for various stochastic gradient methods.
We develop a classification algorithm for estimating posterior distributions from positive-unlabeled data, that is robust to noise in the positive labels and effective for high-dimensional data. In recent years, several algorithms have been proposed to learn from positive-unlabeled data; however, many of these contribu…
We propose a unifying view of two different Bayesian inference algorithms, Stochastic Gradient Markov Chain Monte Carlo (SG-MCMC) and Stein Variational Gradient Descent (SVGD), leading to improved and efficient novel sampling schemes. We show that SVGD combined with a noise term can be framed as a multiple chain SG-MCM…
Convolutional neural networks provide visual features that perform remarkably well in many computer vision applications. However, training these networks requires significant amounts of supervision. This paper introduces a generic framework to train deep networks, end-to-end, with no supervision. We propose to fix a se…
FAL improves formation resistivity prediction from cased boreholes with noise resistance.
problem Noise and high-frequency disaster in predicting formation resistivity from cased boreholes.
method Frequency-aware framework and temporal anti-noise block for LSTM.
result FAL achieves a 24.3% improvement in R2 over LSTM, reaching R2=0.91.
Despite recent advances, large scale visual artifacts are still a common occurrence in images generated by GANs. Previous work has focused on improving the generator's capability to accurately imitate the data distribution pdata. In this paper, we instead explore methods that enable GANs to actively avoid errors b…
Survey of deep learning methods for noisy labels in image classification.
problem Label noise in deep learning image classification.
method Noise model based and noise model free methods.
result Deep learning is robust to label noise but requires counter algorithms.
K-means fails catastrophically in high dimensions, Hartigan's avoids it.
problem K-means algorithm's failure in high-dimensional data.
method Proof of k-means failure and Hartigan's algorithm success.
result Hartigan's algorithm avoids the catastrophic failure of k-means in high dimensions.
New loss function helps models avoid noisy labels, improving robustness.
problem Designing robust models for datasets with noisy labels.
method Introduced a gambler's loss function that encourages models to abstain from learning noisy data points.
result Training with gambler's loss leads to improved robustness and generalization across various tasks.
Dual-T method improves transition matrix estimation in noisy label learning.
problem Large estimation error in noisy class posterior leads to poor transition matrix estimation.
method Introducing an intermediate class to avoid direct estimation of noisy class posterior, factorizing the transition matrix into two easier-to-estimate matrices.
result The dual-T estimator leads to better classification performances.
GD-trained shallow ReLU nets learn Lipschitz functions with noise.
problem Learning Lipschitz functions with additive noise in overparameterized neural networks.
method Gradient Descent (GD) with early stopping, focusing on the Neural Tangent Kernel (NTK).
result Early-stopped GD achieves minimax optimal rates for learning Lipschitz functions.
Strong inductive biases prevent harmless interpolation in overparameterized models.
problem Understanding the conditions under which overparameterized models can interpolate noise without overfitting.
method Theoretical analysis of high-dimensional kernel regression and deep neural networks, focusing on the role of inductive biases.
result The strength of an estimator's inductive bias determines whether interpolation is harmless or requires fitting noise for good generalization.
NCE and CD are shown to be equivalent ML methods.
problem Estimating unnormalised models without normalisation constant.
method NCE uses proxy criterion, CD uses importance sampling.
result NCE and CD are equivalent ML methods.
This work improves deep reinforcement learning robustness to adversarial state uncertainty.
problem Robustness of deep reinforcement learning to adversarial state uncertainty.
method Certified adversarial robustness techniques are applied to deep reinforcement learning algorithms to compute guaranteed lower bounds on state-action values.
result The approach increases robustness to noise and adversaries in pedestrian collision avoidance and classic control tasks.
New method identifies network dynamics and noise structure.
problem Estimating network and disturbance topologies in dynamic systems.
method Extended multi-step Sequential Linear Regression and Weighted Null Space Fitting methods.
result Consistent estimation of dynamic networks with reduced computational burden.
We present an algorithm, AROFAC2, which detects the (CP-)rank of a degree 3 tensor and calculates its factorization into rank-one components. We provide generative conditions for the algorithm to work and demonstrate on both synthetic and real world data that AROFAC2 is a potentially outperforming alternative to the go…