Using a recently developed method of noise level estimation that makes use of properties of the coarse grained-entropy we have analyzed the noise level for the Dow Jones index and a few stocks from the New York Stock Exchange. We have found that the noise level ranges from 40 to 80 percent of the signal variance. The c…
Time changes of noise level at Warsaw Stock Market are analyzed using a recently developed method basing on properties of the coarse grained entropy. The condition of the minimal noise level is used to build an efficient portfolio. Our noise level approach seems to be a much better tool for risk estimations than standa…
Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual square and scaling the penalty in proportion to the estimated noise level. The iterat…
New auto-encoder handles varying noise levels without retraining.
problem Auto-encoders degrade in noisy conditions.
method Formalized auto-encoders as transform learning, derived new architecture.
result Models generalize well to different noise levels.
New method learns from noisy data without knowing noise level.
problem Learning from noisy data without knowing noise level.
method Uses Stein's Unbiased Risk Estimate (SURE) without noise level knowledge.
result Outperforms other self-supervised methods on imaging problems.
New algorithm trains binary-activation, multi-level RNNs for noise-resilient, ADC-/DAC-free PIM inference.
problem Training noise-resilient, ADC-/DAC-free neural networks.
method Binary activations and multi-level weights for eNVM-based processing-in-memory circuits.
result Higher accuracy and noise resilience for recurrent networks compared to existing methods.
Study bounds noise level in linear regression with dependent data.
problem Analyzing noise level in linear regression with dependent data.
method Derive upper bounds for random design linear regression with β-mixing data, without realizability assumptions. result Correctly recovers the noise level of the problem, exhibiting graceful degradation with misspecification.
This study examines how noise levels affect causal discovery methods.
problem Impact of noise levels on causal discovery methods.
method Empirical study using Regression with Subsequent Independence Test and Identification using Conditional Variances on ANMs with varying noise levels.
result Causal discovery methods can fail for certain noise levels.
This paper studies how label noise affects Federated Learning.
problem The impact of label noise on Federated Learning.
method The paper derives an upper bound for the generalization error and conducts experiments on MNIST and CIFAR-10 datasets.
result The global model accuracy decreases linearly with increasing label noise, consistent with theoretical analysis.
Improved image quality in diffusion models by limiting guidance to a specific noise level range.
problem Improving image quality in diffusion models with guidance.
method Restricting guidance to a specific noise level range.
result Significantly improved FID score from 1.81 to 1.40 in ImageNet-512.
Proposes MGPLL for PL learning with non-random noise.
problem Partial label learning with non-random label noise.
method Bi-directional mapping framework, conditional noise label generation, multi-class predictor, adversarial learning.
result Demonstrates state-of-the-art performance in partial label learning.
Study evaluates how noise affects ANMs' ability to identify causal directions.
problem Challenges in identifying causal relationships in bivariate cases with noise.
method Empirical study using Regression with Subsequent Independence Test (RESIT) on various ANM models.
result ANMs can fail to identify true causal directions for certain noise levels.
The study finds that memorization is necessary or harmful depending on the prior distribution and noise level.
problem The impact of memorization on generalization in overparameterized models.
method An overparameterized linear model with general priors in a Bayesian setup.
result Explicit conditions for optimal generalization based on the prior distribution and noise level.
AVICA estimates noise levels for better group ICA source recovery.
problem Estimating shared independent sources from multiple noisy views.
method AVICA models each view as a linear mixture of shared sources with additive noise, optimizing noise levels alongside sources.
result AVICA yields better source estimates than other methods, especially in real-world applications like MEG and fMRI.
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.
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.
In high dimension, it is customary to consider Lasso-type estimators to enforce sparsity. For standard Lasso theory to hold, the regularization parameter should be proportional to the noise level, yet the latter is generally unknown in practice. A possible remedy is to consider estimators, such as the Concomitant/Scale…
We consider the problem of making machine translation more robust to character-level variation at the source side, such as typos. Existing methods achieve greater coverage by applying subword models such as byte-pair encoding (BPE) and character-level encoders, but these methods are highly sensitive to spelling mistake…
Noise-resilient method improves Hurst exponent estimation accuracy in noisy data.
problem Noise degrades accuracy of Hurst exponent estimation methods.
method Noise-Controlled ALPHEE (NC-ALPHEE) using wavelet multi-scale analysis and neural network combination.
result NC-ALPHEE consistently outperforms existing techniques in noisy conditions.
Measures three types of noise in LLM evaluations.
problem Separating signal from noise in LLM experiments.
method Defined and measured three types of noise: prediction, data, and total noise. Proposed the all-pairs paired method for statistical power.
result Total noise level is characteristic and predictable across all model pairs.
Improves score estimation for noised targets using known clean scores.
problem Poor score estimation at low noise levels in Denoising Score Matching.
method Introduces Target Score Identity and Target Score Matching loss.
result Score estimates are more accurate at low noise levels.
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.
The so-called level crossing analysis has been used to investigate the empirical data set. But there is a lack of interpretation for what is reflected by the level crossing results. The fractional Gaussian noise as a well-defined stochastic series could be a suitable benchmark to make the level crossing findings more s…
This research tackles image classification with noise, proposing committees of CNNs.
problem Image classification with concurrent feature and label noise.
method Committees of Convolutional Neural Networks (CNNs) for MNIST, CIFAR-10, and CIFAR-100 datasets.
result Committees outperform single models in noisy conditions, especially on difficult datasets.
New method for NMF without tuning parameter.
problem Finding latent structures in noisy data matrices.
method Inspired by square-root lasso, proposes a tuning-free minimum-volume NMF.
result Optimal tuning parameter value is noise level-independent.
New method calibrates noise for attack risk, improving ML model accuracy.
problem Improving accuracy of privacy-preserving ML models while maintaining privacy.
method Directly calibrates noise scale to a desired attack risk level, bypassing the standard ε-calibration. result Significantly decreases noise scale, leading to increased utility at the same risk level.
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.
A new attack for probabilistic classifiers adapts to noise levels.
problem Adversarial examples can mislead probabilistic classifiers.
method Adapts HopSkipJump attack for probabilistic classifiers, adjusting queries based on noise levels.
result Decision-based attacks are effective against probabilistic classifiers, even with noise.
This study presents the results of a series of simulation experiments that evaluate and compare four different manifold alignment methods under the influence of noise. The data was created by simulating the dynamics of two slightly different double pendulums in three-dimensional space. The method of semi-supervised fea…
Paper benchmarks real-world noisy labels and proposes a method to improve deep learning performance.
problem Understanding deep learning with real-world noisy labels.
method Develops a simple method to handle both synthetic and real noisy labels.
result Method achieves best results on benchmark datasets and web noise.
CNNs learn about input data uncertainties, improving classification performance.
problem Errors in measurements are often neglected in ML, affecting classification performance.
method Constructed a model with known noise levels and used CNNs to learn about uncertainties.
result CNNs can incorporate information about input data uncertainties, improving classification performance.
Sparsity promoting norms are frequently used in high dimensional regression. A limitation of such Lasso-type estimators is that the optimal regularization parameter depends on the unknown noise level. Estimators such as the concomitant Lasso address this dependence by jointly estimating the noise level and the regressi…
FCNv2 robustness tested under noise and random initial conditions.
problem Assessing AI weather forecasting model robustness to input noise.
method Two experiments with varying noise levels and random initial conditions.
result FCNv2 preserves hurricane features under low to moderate noise, but underestimates intensity and persistence.
A method merges two pretrained diffusion experts to improve image quality and likelihood.
problem Trade-off between image quality and data likelihood in diffusion models.
method Combining two pretrained diffusion experts by switching between them along the denoising trajectory.
result The merged model consistently matches or outperforms its base components, improving or preserving both likelihood and sample quality.
We consider the problem of learning the level set for which a noisy black-box function exceeds a given threshold. To efficiently reconstruct the level set, we investigate Gaussian process (GP) metamodels. Our focus is on strongly stochastic samplers, in particular with heavy-tailed simulation noise and low signal-to-no…
Image denoising based on a probabilistic model of local image patches has been employed by various researchers, and recently a deep (denoising) autoencoder has been proposed by Burger et al. [2012] and Xie et al. [2012] as a good model for this. In this paper, we propose that another popular family of models in the fie…
Study uses Bayesian Optimization to analyze noise effects in materials research.
problem Optimizing materials with many variables and experimental noise.
method Batch Bayesian Optimization with synthetic data analysis.
result Noise sensitivity varies by problem landscape, impacting optimization outcomes.
Many data-driven approaches exist to extract neural representations of functional magnetic resonance imaging (fMRI) data, but most of them lack a proper probabilistic formulation. We propose a group level scalable probabilistic sparse factor analysis (psFA) allowing spatially sparse maps, component pruning using automa…
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 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.
The ability to detect sparse signals from noisy high-dimensional data is a top priority in modern science and engineering. A sparse solution of the linear system Aρ=b0 can be found efficiently with an l1-norm minimization approach if the data is noiseless. Detection of the signal's support from data corrupted b…
We address noisy Euclidean distances in high dimensions, estimating noise levels and correcting distances.
problem Distorted pairwise Euclidean distances due to heteroskedastic noise.
method Developed a hyperparameter-free approach to jointly estimate noise magnitudes and correct distances.
result Our method provides accurate noise magnitude estimates and corrected distances in high-dimensional settings.
Vote-boosting is a sequential ensemble learning method in which the individual classifiers are built on different weighted versions of the training data. To build a new classifier, the weight of each training instance is determined in terms of the degree of disagreement among the current ensemble predictions for that i…
Paper reconciles minimax rates and optimal recovery rates for noisy observations.
problem Estimating a function from noisy observations.
method Develops NLA minimax rates for Besov classes in Lq-norms. result NLA minimax rates continuously depend on noise level and match optimal recovery rates as noise decreases.
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 α-Alternator adapts to varying noise levels in sequences, improving robustness and performance.
problem Current models assume uniform noise levels, limiting performance on noisy temporal data.
method Introduces α-Alternator using Vendi Score to dynamically adjust noise sensitivity. result Outperforms Alternators and state-of-the-art models in trajectory prediction, imputation, and forecasting.
We introduce the active exploration problem in Markov decision processes (MDPs). Each state of the MDP is characterized by a random value and the learner should gather samples to estimate the mean value of each state as accurately as possible. Similarly to active exploration in multi-armed bandit (MAB), states may have…
We investigate multiple testing and variable selection using the Least Angle Regression (LARS) algorithm in high dimensions under the assumption of Gaussian noise. LARS is known to produce a piecewise affine solution path with change points referred to as the knots of the LARS path. The key to our results is an express…