Optimal regularization for a data source
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5618837 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- scientific article; zbMATH DE number 1568956 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- scientific article; zbMATH DE number 3202900 (Why is no real title available?)
- scientific article; zbMATH DE number 3100841 (Why is no real title available?)
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- A Generative Variational Model for Inverse Problems in Imaging
- A theory of optimal convex regularization for low-dimensional recovery
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis of Langevin Monte Carlo via convex optimization
- Atomic Norm Denoising With Applications to Line Spectral Estimation
- Bayesian inverse problems with Gaussian priors
- Centroid Bodies and Dual Mixed Volumes
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Compressed Sensing Off the Grid
- Computational and statistical tradeoffs via convex relaxation
- Consistency of Bayesian inference with Gaussian process priors in an elliptic inverse problem
- Consistent Inversion of Noisy <scp>Non‐Abelian X‐Ray</scp> Transforms
- Convergence of stochastic processes
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Convex Bodies The Brunn-MinkowskiTheory
- Dictionary learning and tensor decomposition via the sum-of-squares method
- Dual mixed volumes
- Efficient Algorithms for Convolutional Sparse Representations
- Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
- Exact matrix completion via convex optimization
- Exponential convergence of Langevin distributions and their discrete approximations
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Geometric tomography
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hit-and-Run from a Corner
- Image recovery via total variation minimization and related problems
- Inverse problems: a Bayesian perspective
- Lagrange Multipliers and Optimality
- Learning semidefinite regularizers
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Living on the edge: phase transitions in convex programs with random data
- Local Rademacher complexities
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- Maximum Entropy Regularization for Fredholm Integral Equations of the First Kind
- Metrics in the family of star bodies
- Modern regularization methods for inverse problems
- Nearly unbiased variable selection under minimax concave penalty
- Nonconvex regularization for sparse neural networks
- Nonlinear total variation based noise removal algorithms
- On the convergence theorem for star-shaped sets in E^n
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- On the local Lipschitz stability of Bayesian inverse problems
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Optimal rates of convergence for convex set estimation from support functions
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Sample Complexity of Dictionary Learning and Other Matrix Factorizations
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Sharp MSE bounds for proximal denoising
- Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
- Solving inverse problems using data-driven models
- Sparse Regularization via Convex Analysis
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse modeling for image and vision processing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable signal recovery from incomplete and inaccurate measurements
- Starshaped sets
- The Little Engine that Could: Regularization by Denoising (RED)
- The convex geometry of linear inverse problems
- The geometry of logconcave functions and sampling algorithms
- The sample complexity of dictionary learning
- Total generalized variation
- Uncertainty Quantification and Weak Approximation of an Elliptic Inverse Problem
- Understanding machine learning. From theory to algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Optimal regularization for a data source
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238826)
