Related papers: Learning to Bound: A Generative Cram\'er-Rao Bound
The conditional posterior Cramer-Rao lower bound (PCRLB) is an effective sensor resource management criteria for large, geographically distributed sensor networks. Existing algorithms for distributed computation of the PCRLB (dPCRLB) are…
Constrained generative modeling is fundamental to applications such as robotic control and autonomous driving, where models must respect physical laws and safety-critical constraints. In real-world settings, these constraints rarely take…
Non-data-aided (NDA) parameter estimation is considered for binary-phase-shift-keying transmission in an additive white Gaussian noise channel. Cramer-Rao lower bounds (CRLBs) for signal amplitude, noise variance, channel reliability…
Estimating boundary curves has many applications such as economics, climate science, and medicine. Bayesian trend filtering has been developed as one of locally adaptive smoothing methods to estimate the non-stationary trend of data. This…
This letter aims at extending the Constrained Semiparametric Cramer-Rao Bound (CSCRB) for the joint estimation of mean vector and scatter matrix of Real Elliptically Symmetric (RES) distributions to Complex Elliptically Symmetric (CES)…
Large Language Models (LLMs) often struggle with dynamically changing knowledge and handling unknown static information. Retrieval-Augmented Generation (RAG) is employed to tackle these challenges and has a significant impact on improving…
We prove risk bounds for binary classification in high-dimensional settings when the sample size is allowed to be smaller than the dimensionality of the training set observations. In particular, we prove upper bounds for both 'compressive…
This paper addresses the real-time state estimation problem for dynamic systems while protecting exogenous inputs against adversaries, who may be honest-but-curious third parties or external eavesdroppers. The Cram\'er-Rao lower bound…
Many results in the quantum metrology literature use the Cram\'er-Rao bound and the Fisher information to compare different quantum estimation strategies. However, there are several assumptions that go into the construction of these tools,…
Already since the work by Abbe and Rayleigh the difficulty of super resolution where one wants to recover a collection of point sources from low-resolved microscopy measurements is thought to be dependent on whether the distance between the…
This paper studies a near-field multiple-input multiple-output (MIMO) radar sensing system, in which the transceivers with massive antennas aim to localize multiple near-field targets in the three-dimensional (3D) space over unknown…
In this paper, we derive the Cramer-Rao bound (CRB) for blind channel estimation in redundant block transmission systems, a lower bound for the mean squared error of any blind channel estimators. The derived CRB is valid for any full-rank…
Data sampling enhances classifier efficiency and robustness through data compression and quality improvement. Recently, the sampling method based on granular-ball (GB) has shown promising performance in generality and noisy classification…
signal direction-of-arrival estimation using an array of sensors has been the subject of intensive research and development during the last two decades. Efforts have been directed to both, better solutions for the general data model and to…
In this paper, we address the theoretical limitations in reconstructing sparse signals (in a known complete basis) using compressed sensing framework. We also divide the CS to non-blind and blind cases. Then, we compute the Bayesian…
Sensitivity limits are usually determined using the Cram\'er-Rao bound. Recently this approach has been used to obtain the ultimate resolution limit for the estimation of the separation between two incoherent point sources. However, methods…
Solving Constraint Optimization Problems (COPs) can be dramatically simplified by boundary estimation, that is, providing tight boundaries of cost functions. By feeding a supervised Machine Learning (ML) model with data composed of known…
Constraint Optimization Problems (COP) are often considered without sufficient knowledge on the boundaries of the objective variable to optimize. When available, tight boundaries are helpful to prune the search space or estimate problem…
This paper examines the problem of estimating the parameters of a bandlimited signal from samples corrupted by random jitter (timing noise) and additive iid Gaussian noise, where the signal lies in the span of a finite basis. For the…
Neural networks are not learning optimal decision boundaries. We show that decision boundaries are situated in areas of low training data density. They are impacted by few training samples which can easily lead to overfitting. We provide a…