Related papers: Cramer-Rao bound in detection of reversals
We consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover x' satisfying ||x-x'||_1 <= C min_{k-sparse} x"} ||x-x"||_1. It is known that there exist…
Recently, circumcentering reflection method (CRM) has been introduced for solving the feasibility problem of finding a point in the intersection of closed constraint sets. It is closely related with Douglas--Rachford method (DR). We prove…
Given a random sample from a parametric model, we show how indirect inference estimators based on appropriate nonparametric density estimators (i.e., simulation-based minimum distance estimators) can be constructed that, under mild…
Rotating modulation is a technique for indirect imaging in the hard x-ray and soft gamma-ray energy bands, which may offer an advantage over coded aperture imaging at high energies. A rotating modulator (RM) consists of a single mask of…
This paper derives a general expression for the Cram\'er-Rao bound (CRB) of wireless localization algorithms using range measurements subject to bias corruption. Specifically, the a priori knowledge about which range measurements are…
In this lecture note, we show a general property of the Cramer-Rao bound (CRB) that quantifies the interdependencies between the parameters in a vector. The presented result is valid for more general models than the additive noise model and…
Pipage rounding is a dependent random sampling technique that has several interesting properties and diverse applications. One property that has been particularly useful is negative correlation of the resulting vector. Unfortunately…
A coupling method and an analytic one allow us to prove new lower bounds for the spectral gap of reversible diffusions on compact manifolds. Those bounds are based on the a notion of curvature of the diffusion, like the coarse Ricci…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
The magnetization reversal in a single molecular magnet (SMM) weakly coupled to an electrode with spin-dependent splitting of chemical potentials (spin bias) is theoretically investigated by means of the rate equation. A microscopic…
In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to obtain risk lower bounds involves the use of Fano's inequality. In an…
Given the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, the goal of this paper is to establish deterministic conditions under which exact recovery of the low-rank and sparse…
We propose reverse time migration (RTM) methods for the imaging of periodic obstacles using only measurements from lower or upper side of the obstacle arrays at a fixed frequency. We analyze the resolution of the lower side and upper side…
When the limiting compensator of a sequence of martingales is continuous, we obtain a weak convergence theorem for the martingales; the limiting process can be written as a Brownian motion evaluated at the compensator and we find sufficient…
In this study, the hybrid Cramer-Rao bound (CRB) is developed for target localization, to establish the sensitivity of the estimation mean-square error (MSE) to the level of phase synchronization mismatch in coherent Multiple-Input…
We consider the large deviations associated with the empirical mean of independent and identically distributed random variables under a subexponential moment condition. We show that non-trivial deviations are observable at a subexponential…
Consider the geometric inverse problem: There is a set of delta-sources in spacetime that emit waves travelling at unit speed. If we know all the arrival times at the boundary cylinder of the spacetime, can we reconstruct the space, a…
We study the deviation from proportionality of rows and columns in products of positive matrices. We prove a sharp, dimension-free bound showing that worst-case misalignment is already captured in dimension two and follows an explicit…
The effectiveness of using model sparsity as a priori information when solving linear inverse problems is studied. We investigate the reconstruction quality of such a method in the non-idealized case and compute some typical recovery errors…
This work presents a geometric refinement of the classical Cram\'er--Rao bound (CRB) in the non-asymptotic regime by incorporating curvature-aware corrections based on the second fundamental form associated with the statistical model…