Related papers: Improving Cram\'er-Rao Bound And Its Variants: An …

Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…

We consider estimation of a single unknown parameter embedded in a quantum state. Quantum Cram\'er-Rao bound (QCRB) is the ultimate limit of the mean squared error for any unbiased estimator. While it can be achieved asymptotically for a…

This document provides detailed step-by-step derivations for the Cram\'er-Rao Bounds (CRB) for sensing parameters and the refined Signal-to-Interference-plus-Noise Ratio (SINR) expressions under imperfect Channel State Information (CSI) and…

Kernel methods have had great success in Statistics and Machine Learning. Despite their growing popularity, however, less effort has been drawn towards developing kernel based classification methods on Riemannian manifolds due to difficulty…

For some special data in reality, such as the genetic data, adjacent genes may have the similar function. Thus ensuring the smoothness between adjacent genes is highly necessary. But, in this case, the standard lasso penalty just doesn't…

Velocity estimation is a cornerstone of the recently introduced near-field predictive beamforming. This paper derives the Cramer-Rao bounds (CRBs) for joint radial and transverse velocity estimation within a predictive beamforming framework…

The Bishop-Gromov theorem upperbounds the rate of growth of volume of geodesic balls in a space, in terms of the most negative component of the Ricci curvature. In this paper we prove a strengthening of the Bishop-Gromov bound for…

Purpose: To develop a method for optimizing pulsed saturation transfer MR fingerprinting (ST MRF) acquisition. Methods: The Cram\'er-Rao bound (CRB) for variance assessment was employed on Bloch-McConnell-based simulated signals, followed…

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…

We study a Riemannian manifold equipped with a density which satisfies the Bakry--\'Emery Curvature-Dimension condition (combining a lower bound on its generalized Ricci curvature and an upper bound on its generalized dimension). We first…

We prove a new kind of estimate that holds on any manifold with lower Ricci bounds. It relates the geometry of two small balls with the same radius, potentially far apart, but centered in the interior of a common minimizing geodesic. It…

We study hidden boundary trace regularity for two-dimensional hyperbolic equations with boundary degeneracy governed by $\mcA\vp=-\Div(A\nabla \vp)$, where $A=\diag(1,r^\al)$ and $\al\in(0,1)$. We establish well-posedness in weighted…

Complex geometries can be easily treated using the well-known full-way and half-way bounce-back rules. However, the accuracy of the full-way bounce-back rule is one order lower than the half-way bounce-back rule. Moreover, when the walls…

Many nanostructures today are low-dimensional and flimsy, and therefore get easily distorted. Distortion-induced symmetry-breaking makes conventional, translation-periodic simulations invalid, which has triggered developments for new…

In this paper we present a simple partitioning based technique to refine the statistical analysis of classification algorithms. The core of our idea is to divide the input space into two parts such that the first part contains a suitable…

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

This work is on constrained large-scale non-convex optimization where the constraint set implies a manifold structure. Solving such problems is important in a multitude of fundamental machine learning tasks. Recent advances on Riemannian…

Distributionally robust optimization (DRO) is a worst-case framework for stochastic optimization under uncertainty that has drawn fast-growing studies in recent years. When the underlying probability distribution is unknown and observed…

We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added at each node of the search tree to strengthen semidefinite…

We present a new proof of the quantum Cramer-Rao bound for precision parameter estimation [1-3] and extend it to a more general class of measurement procedures. We analyze a generalized framework for parameter estimation that covers most…