Minimax Theory of Likelihood-Based Deep Learning for Speckle Regression

• URL: http://arxiv.org/abs/2607.14064v1
• Date: Wed, 15 Jul 2026 17:36:23 GMT
• Title: Minimax Theory of Likelihood-Based Deep Learning for Speckle Regression
• Abstract summary: We study the minimax estimation of smooth nonparametric regression functions using likelihood-based deep neural network (DNN) estimators.<n>Our framework accommodates both low-dimensional and sparse high-dimensional features.
• Score: 2.436681150766912
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Speckle noise is a multiplicative noise commonly encountered in coherent imaging modalities such as synthetic aperture radar, optical coherence tomography, and digital holography. Although deep learning methods, in practice, have achieved state-of-the-art performance for speckle denoising, their fundamental statistical limits remain largely unexplored. Unlike additive noise models, multiplicative speckle noise makes the regression function unidentifiable from the conditional mean, rendering conventional least-squares-based deep learning approaches inapplicable. We study the minimax estimation of smooth nonparametric regression functions using likelihood-based deep neural network (DNN) estimators under a model with both multiplicative speckle noise and additive Gaussian noise. Our framework accommodates both low-dimensional and sparse high-dimensional features. We establish finite-sample upper bounds on the estimation error of the proposed DNN estimators and derive minimax lower bounds for nonparametric function recovery under our model, showing that they match up to logarithmic factors in the sample size. Moreover, these minimax rates coincide, up to logarithmic factors, with those for nonparametric regression under additive Gaussian noise alone, demonstrating that the intrinsic difficulty of estimation remains essentially unchanged despite the challenges posed by multiplicative speckle noise. Numerical experiments further supports consistency of our DNN-based despeckling methods and demonstrate their effectiveness.

Related papers

• Nonparametric Deconvolution and Denoising using Simulation Based Inference [3.6640504352010885]
  We learn a latent generative model by matching the observed data distribution to the noise-convolved model distribution.<n>Our method provides a practical, theoretically grounded approach to deconvolution under generative latent distribution models.
  arXiv  Detail & Related papers  (2026-06-20T07:03:37Z)
• Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine [60.669081685261965]
  Diffusion models generate high-dimensional data with remarkable quality.<n>How their training efficiently learns the score function remains theoretically unexplained.<n>We instantiate this principle as Score-induced Latent Diffusion (SiLD)
  arXiv  Detail & Related papers  (2026-05-16T16:51:10Z)
• Anchoring the Eigengap: Cross-Modal Spectral Stabilization for Sample-Efficient Representation Learning [0.8326214193432122]
  We show that vision models degrade sharply in low-data regimes, particularly in medical imaging where labeled samples are scarce.<n>We develop a theory of finite-sample representation learning that quantifies the recoverable dimension K(N)<n>We show that multimodal training maintains more stable modes and improves class separation, even when unimodal models achieve comparable few-shot accuracy.
  arXiv  Detail & Related papers  (2026-05-09T07:49:43Z)
• Diffusion-Based Limited-Angle CT Reconstruction under Noisy Conditions [10.287171164361608]
  Missing angular projections lead to incomplete sinograms and artifacts in reconstructed images.<n>We propose a diffusion-based framework that completes missing angular views using a Mean-Reverting Differential Equation (MR-SDE) formulation.<n>To improve robustness under realistic noise, we propose a novel noise-aware mechanism that explicitly models inference-time uncertainty.
  arXiv  Detail & Related papers  (2025-07-08T03:58:52Z)
• Triply Laplacian Scale Mixture Modeling for Seismic Data Noise Suppression [51.87076090814921]
  Sparsity-based tensor recovery methods have shown great potential in suppressing seismic data noise.<n>We propose a novel triply Laplacian scale mixture (TLSM) approach for seismic data noise suppression.
  arXiv  Detail & Related papers  (2025-02-20T08:28:01Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Optimal Rates and Saturation for Noiseless Kernel Ridge Regression [4.585021053685196]
  We present a comprehensive study of Kernel ridge regression (KRR) in the noiseless regime.<n>KRR is a fundamental method for learning functions from finite samples.<n>We introduce a refined notion of degrees of freedom, which we believe has broader applicability in the analysis of kernel methods.
  arXiv  Detail & Related papers  (2024-02-24T04:57:59Z)
• Convergence of uncertainty estimates in Ensemble and Bayesian sparse model discovery [4.446017969073817]
  We show empirical success in terms of accuracy and robustness to noise with bootstrapping-based sequential thresholding least-squares estimator. We show that this bootstrapping-based ensembling technique can perform a provably correct variable selection procedure with an exponential convergence rate of the error rate.
  arXiv  Detail & Related papers  (2023-01-30T04:07:59Z)
• Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise [64.85879194013407]
  We prove the first high-probability results with logarithmic dependence on the confidence level for methods for solving monotone and structured non-monotone VIPs. Our results match the best-known ones in the light-tails case and are novel for structured non-monotone problems. In addition, we numerically validate that the gradient noise of many practical formulations is heavy-tailed and show that clipping improves the performance of SEG/SGDA.
  arXiv  Detail & Related papers  (2022-06-02T15:21:55Z)
• Shape Matters: Understanding the Implicit Bias of the Noise Covariance [76.54300276636982]
  Noise in gradient descent provides a crucial implicit regularization effect for training over parameterized models. We show that parameter-dependent noise -- induced by mini-batches or label perturbation -- is far more effective than Gaussian noise. Our analysis reveals that parameter-dependent noise introduces a bias towards local minima with smaller noise variance, whereas spherical Gaussian noise does not.
  arXiv  Detail & Related papers  (2020-06-15T18:31:02Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.