Proposes an additive approximation method for multiplicative noise.
problem Limitations in existing approaches to marginalize over multiplicative errors.
method Embeds multiplicative noise in an additive error term.
result Proposed approach provides feasible error estimates.
Develops efficient inference for noise heterogeneity in machine learning models.
problem Downstream procedures based on residuals can be biased in additive noise models.
method Semiparametrically efficient inference using a novel Hilbert-valued one-step estimator.
result Constructs tests and confidence intervals for residual independence and goodness of fit.
Paper proposes a self-supervised method to denoise autoregressive signals with heavy-tailed noise.
problem Denoising autoregressive signals corrupted by heavy-tailed noise.
method Self-supervised learning approach without requiring full noise distribution knowledge.
result Strong denoising performance compared to baseline methods, especially for impulsive noise.
We analyze a family of methods for statistical causal inference from sample under the so-called Additive Noise Model. While most work on the subject has concentrated on establishing the soundness of the Additive Noise Model, the statistical consistency of the resulting inference methods has received little attention. W…
Identifying causal direction in location-scale noise models with hidden variables
problem Causal discovery in location-scale noise models with hidden variables
method ADMGs satisfying a bow-free condition
result First identifiability result for causally insufficient models beyond noise additivity
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.
New model identifies causal direction in nonlinear systems with observed data.
problem Identifying causal direction in nonlinear systems with observed data.
method Cascade Nonlinear Additive Noise Model (CNANM) with Variational Auto-Encoder (VAE) estimation.
result Causal direction is identifiable under suitable conditions on data generation.
New methods infer causal structure from data without hidden variables.
problem Inferring causal structure from observational data with hidden variables.
method Introduces alternative independence tests and conditionally-additive-noise models.
result Can infer causal relations without assumptions about equation form or hidden variables.
Noisy EM speeds up convergence in mixture models.
problem Speeding up convergence of EM algorithms in mixture models.
method Noisy Expectation Maximization (NEM) algorithm with various noise injection methods.
result NEM algorithm speeds up convergence to local maxima in mixture models.
New method recovers causal graphs from data scores in non-linear models.
problem Recovering causal graphs from data scores in non-linear models.
method Score matching algorithms and efficient Jacobian approximation.
result New method, SCORE, is competitive and faster than state-of-the-art methods.
Study on deep learning for speckle noise reduction in imaging modalities.
problem Multiplicative speckle noise challenges conventional deep learning methods for speckle denoising.
method Likelihood-based deep neural network (DNN) estimators for nonparametric regression under speckle noise.
result Established minimax rates for speckle denoising, matching those for additive Gaussian noise alone.
Detects model misspecifications in causal models using observational data.
problem Identifying predictor variables with causal effects in misspecified models.
method Develops a general framework based on observational data distribution and proposes an algorithm for finite sample data.
result Identifies predictor variables for causal effects even in misspecified models.
Optimizes control of noisy discrete systems without system matrix knowledge.
problem Optimal control of discrete-time systems with additive and multiplicative noises.
method Stochastic Lyapunov and Riccati equations, model-free reinforcement learning.
result Model-free reinforcement learning algorithm converges to optimal control policy.
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.
Additive asynchronous and cyclostationary impulsive noise limits communication performance in OFDM powerline communication (PLC) systems. Conventional OFDM receivers assume additive white Gaussian noise and hence experience degradation in communication performance in impulsive noise. Alternate designs assume a parametr…
The paper analyzes generalization of noisy iterative algorithms using communication theory.
problem Generalization of models trained by noisy iterative algorithms under different distributions.
method Connecting noisy iterative algorithms to additive noise channels in communication theory.
result Distribution-dependent generalization bounds for noisy iterative algorithms.
Nonnegative Matrix Factorization (NMF) is a widely used technique in many applications such as face recognition, motion segmentation, etc. It approximates the nonnegative data in an original high dimensional space with a linear representation in a low dimensional space by using the product of two nonnegative matrices. …
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.
Wave maps with noise can lead to self-similar blowup from arbitrary initial data.
problem Analyzing self-similar blowup in wave maps with additive noise.
method Stochastic perturbation of wave maps in supercritical dimensions.
result Self-similar blowup with positive probability for arbitrary corotational initial data.
LANCA uses ANM to learn latent causal factors without supervision.
problem Learning latent causal factors without supervision.
method LANCA employs a deterministic Wasserstein Auto-Encoder coupled with a differentiable ANM Layer.
result LANCA outperforms baselines on physics and photorealistic environments.
Privacy preserving mechanisms such as differential privacy inject additional randomness in the form of noise in the data, beyond the sampling mechanism. Ignoring this additional noise can lead to inaccurate and invalid inferences. In this paper, we incorporate the privacy mechanism explicitly into the likelihood functi…
Study on online regression with noise, achieving near-optimal regret bounds.
problem Online generalized linear regression with stochastic noise.
method Sharp analysis of FTRL algorithm for stochastic label noise.
result Achieved near-optimal regret bounds for O(σ2dlogT)+o(logT). New algorithm for estimating MLR parameters with non-Gaussian noise.
problem Estimating MLR parameters with non-Gaussian noise.
method Combining ADMM with EM algorithm idea.
result Our method outperforms EM algorithm in non-Gaussian noise case.
Paper addresses causal inference and clustering for mixtures of ANMs.
problem Causal inference from heterogeneous sources with multiple ANMs.
method Generalized ANM to a mixture model, GPPOM with independence enforcement.
result Effective causal inference and clustering for mixtures of ANMs.
Inferring the causal structure of a set of random variables from a finite sample of the joint distribution is an important problem in science. Recently, methods using additive noise models have been suggested to approach the case of continuous variables. In many situations, however, the variables of interest are discre…
RECLAIM discovers causal graphs in cyclic, noisy systems.
problem Discovering causal relationships in cyclic, noisy systems.
method RECLAIM uses EM with residual normalizing flows to handle cycles and noise.
result RECLAIM effectively discovers causal graphs in both synthetic and real-world datasets.
Researchers establish bounds for SGMs' KL and Wasserstein divergences under various noise schedules.
problem Estimating the error between target and estimated distributions in SGMs.
method Established upper bounds for KL divergence and Wasserstein distance, incorporating target distribution properties and SGM hyperparameters.
result Optimal noise schedules identified for SGMs, improving generative quality.
Simple noise training improves image recognition robustness.
problem Modern neural networks struggle with unseen image corruptions.
method Additive Gaussian and Speckle noise training, adversarial training against worst-case noise.
result Significant improvement in robustness on ImageNet-C and MNIST-C benchmarks.
The paper identifies generators of linear SDEs with noise types.
problem Identifying the generator of linear SDEs from their solution distribution.
method Deriving sufficient and necessary conditions for additive noise, and sufficient conditions for multiplicative noise.
result Generic conditions for identifying the generator of linear SDEs with both types of noise.
Deep models can fit noisy labels, but robustness and reliability are still issues.
problem Training deep models with noisy labels leads to unreliable uncertainty quantification.
method Analysis of conditional distribution over noisy labels and evaluation of robust loss functions.
result Strictly proper and robust loss functions preserve accuracy but do not guarantee reliability.
We propose a method for inferring the existence of a latent common cause ('confounder') of two observed random variables. The method assumes that the two effects of the confounder are (possibly nonlinear) functions of the confounder plus independent, additive noise. We discuss under which conditions the model is identi…
SoftBart improves BART for high-noise modeling in science.
problem High noise in scientific data.
method Soft BART algorithm for Bayesian additive regression trees.
result Improves predictive performance and facilitates larger model integration.
Proposes engression for extrapolation in distributional regression.
problem Challenging extrapolation problem in nonlinear regression.
method Neural network-based distributional regression.
result Engression successfully performs extrapolation under certain assumptions.
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…
An asymmetric information model is introduced for the situation in which there is a small agent who is more susceptible to the flow of information in the market than the general market participant, and who tries to implement strategies based on the additional information. In this model market participants have access t…
Graph neural networks struggle with structural noise.
problem Robustness of graph neural networks to structural noise.
method Controlled experiments with a representative GNN model.
result Graph neural networks are not robust to structural noise.
Financial correlation matrices measure the unsystematic correlations between stocks. Such information is important for risk management. The correlation matrices are known to be ``noise dressed''. We develop a new and alternative method to estimate this noise. To this end, we simulate certain time series and random matr…
Using a Bayesian approach, we consider the problem of recovering sparse signals under additive sparse and dense noise. Typically, sparse noise models outliers, impulse bursts or data loss. To handle sparse noise, existing methods simultaneously estimate the sparse signal of interest and the sparse noise of no interest.…
Improved noise estimation in latent neural SDEs enhances model accuracy.
problem Latent neural SDEs underestimate noise, limiting their stochastic dynamics modeling.
method Explicit additional noise regularization in the loss function.
result Model accurately captures diffusion component of stochastic time series data.
Bayesian method improves forecasting of nonseparable Hamiltonian systems with noise.
problem Forecasting nonseparable Hamiltonian systems with multiplicative noise.
method Bayesian approach using deep learning and reduced-order modeling.
result Bayesian method yields up to 724 times improvement in forecasting accuracy.
Unified scalable GPCs for various likelihoods using additive noise.
problem Scalability issues and intractable inference in GPC for big data and non-Gaussian likelihoods.
method Additive noise to unify scalable GPCs for multiple likelihoods, using variational inference.
result Empirically superior results for binary/multi-class classification tasks with up to two million data points.
Two models incorporate market microstructure noise into asset pricing and option valuation.
problem Effect of market microstructure noise on asset pricing and option valuation.
method Developed two models: a continuous-time Black-Scholes-Merton model and a discrete binomial tree model.
result Extracted coefficients to quantify noise impact on volatility and drift.
Optimal test for detecting signal in noisy matrix model.
problem Signal detection in noisy matrix models with unknown rank.
method Hypothesis test based on linear spectral statistics, optimal under Gaussian noise.
result Optimal test under Gaussian noise, improved with non-Gaussian noise.
The paper proposes noise-invariant distances and features for robust testing and learning.
problem Testing and learning on distributions with irrelevant noise.
method Kernel embeddings, Maximum Mean Discrepancy, distances invariant to additive symmetric noise.
result Noise-invariant distances and features for robust testing and learning.
HARFE approximates sparse additive functions using random features and ridge regression.
problem Approximating high-dimensional sparse additive functions.
method Hard-ridge random feature expansion with sparse ridge regression and hard-thresholding pursuit.
result HARFE method converges with a given error bound and achieves lower error than other algorithms.
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.
New framework provides robustness guarantees against adversarial attacks.
problem Adversarial examples lead to different outputs from deep-learning algorithms.
method Connects robustness to additive noise and proposes a training strategy.
result Scalable method improves certified bounds on adversarial perturbation.
This paper examines fundamental error characteristics for a general class of matrix completion problems, where the matrix of interest is a product of two a priori unknown matrices, one of which is sparse, and the observations are noisy. Our main contributions come in the form of minimax lower bounds for the expected pe…