Optimal Approximation of Signal Priors
نویسنده
چکیده
In signal restoration by Bayesian inference, one typically uses a parametric model of the prior distribution of the signal. Here, we consider how the parameters of a prior model should be estimated from observations of uncorrupted signals. A lot of recent work has implicitly assumed that maximum likelihood estimation is the optimal estimation method. Our results imply that this is not the case. We first obtain an objective function that approximates the error occurred in signal restoration due to an imperfect prior model. Next, we show that in an important special case (small gaussian noise), the error is the same as the score-matching objective function, which was previously proposed as an alternative for likelihood based on purely computational considerations. Our analysis thus shows that score matching combines computational simplicity with statistical optimality in signal restoration, providing a viable alternative to maximum likelihood methods. We also show how the method leads to a new intuitive and geometric interpretation of structure inherent in probability distributions.
منابع مشابه
OPTIMAL NOZZLE SHAPES OF CO2-N2-H2O GASDYNAMIC LASERS
In an axisymmetric CO2-N2-H2O gas dynamic laser, let ? denote the intersection of the vertical plane of symmetry with the upper part of the (supersonic) nozzle. To obtain a maximal small signal gain, some authors have tested several families of curves for ?. To find the most general solution for ?, an application of Pontryagin’s principle led to the conjuncture that the optimal ? must consist o...
متن کاملA simple test to check the optimality of a sparse signal approximation
Approximating a signal or an image with a sparse linear expansion from an overcomplete dictionary of atoms is an extremely useful tool to solve many signal processing problems. Finding the sparsest approximation of a signal from an arbitrary dictionary is a NP-hard problem. Despite of this, several algorithms have been proposed that provide suboptimal solutions. However, it is generally difficu...
متن کاملRadar Signal Detection in K-distributed Clutter by Pade Approximation
In this paper, two suboptimum detectors are proposed for coherent radar signal detection in K-distributed clutter. Assuming certain values for several initial moments of clutter amplitude, the characteristic function of the clutter amplitude is approximated by a limited series. Using the Pade approximation, it is then converted to a rational fraction. Thus, the pdf of the clutter amplitude is o...
متن کاملSignal processing approaches as novel tools for the clustering of N-acetyl-β-D-glucosaminidases
Nowadays, the clustering of proteins and enzymes in particular, are one of the most popular topics in bioinformatics. Increasing number of chitinase genes from different organisms and their sequences have beenidentified. So far, various mathematical algorithms for the clustering of chitinase genes have been used butmost of them seem to be confusing and sometimes insufficient. In the...
متن کاملLearning with Compressible Priors
We describe a set of probability distributions, dubbed compressible priors, whose independent and identically distributed (iid) realizations result in p-compressible signals. A signal x ∈ R is called p-compressible with magnitude R if its sorted coefficients exhibit a power-law decay as |x|(i) . R · i−d, where the decay rate d is equal to 1/p. p-compressible signals live close to K-sparse signa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neural computation
دوره 20 12 شماره
صفحات -
تاریخ انتشار 2008