ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Cramer-Rao bounds”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

eess.SPTheoreticalRecentJun 10, 2026

Near Field Multi-Band Localization: CRB, Efficient Estimator, and Threshold SNR

Roberto Bomfin, Marco Mezzavilla, Sundeep Rangan, Marwa Chafii

This paper presents a theoretical framework for multi-band localization in SIMO systems.

View →
eess.SPTheoreticalRecentJul 9, 2026

Fundamental Sensing Limits of 6G Cooperative MIMO-ISAC Networks: Joint Position-Velocity CRLB and Decoupling Analysis

Yanpeng Su, Norman Franchi, Maximilian Lübke

This paper derives Cramér-Rao lower bounds for cooperative MIMO integrated sensing and communication networks, considering position and velocity coupling in the Fisher information matrix.

View →
cs.ITeess.SPTheoreticalRecentJun 22, 2026

How Many RF Chains Does a Microwave Linear Analog Computer (MiLAC) Need to Match the Fully-Digital Cramér-Rao Bound?

Yuchen Zhang, Yu Ge, Bruno Clerckx, Tareq Y. Al-Naffouri

This paper analyzes direction-of-arrival estimation using a tunable receive-side lossless reciprocal MiLAC combiner for antenna arrays and shows it can achieve the digital Cramér-Rao bound with fewer…

View →
eess.SPEmpiricalRecentJun 24, 2026

MCRB and MSE Analysis for Parameter Estimation in AFDM-ISAC Systems

Tianyao Ma, Aimin Tang, Yin Xu, Qu Luo +2 more

This paper characterizes the parameter-estimation performance of AFDM-ISAC systems under practical model misspecification.

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View →
cs.ITeess.SPTheoreticalRecentJul 3, 2026

Cramér-Rao Bound Optimization for Massive MIMO DFRC Systems with 1-Bit DACs and ADCs

Chenfei Huang, Mingjie Shao, Ya-Feng Liu

This paper investigates the design of dual-function radar-communication systems for massive MIMO systems using 1-bit DACs and ADCs, optimizing the transmit signal matrix for enhanced sensing performan…

View →
cs.ITcs.AIcs.LGRecentMay 30, 2026

Information-Theoretic Lower Bounds for Bit-Constrained Stochastic Optimization via a Reduction to Compressed Gaussian Mean Estimation

Munsik Kim

The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…

View →
cs.ITeess.SPEmpiricalRecentJun 22, 2026

Movable Antennas for Robust Wireless Sensing via Joint Cramér-Rao Bound and Sidelobe Minimization

Wenyan Ma, Lipeng Zhu, Weitong Zhai, Rui Zhang

The paper presents a novel design approach for movable antenna-enabled wireless sensing systems by jointly minimizing the Cramér-Rao bound and the maximum sidelobe level of the ambiguity function via…

View →
cs.ITTheoreticalRecentJun 17, 2026

Reconstruction Limits for Repeated Differentially Private Aggregates: A Cramer-Rao Perspective on Query Geometry

Chenyue Zhang, Andrew Campbell, Anna Scaglione, Sean Peisert

The paper shows that repeated differentially private releases are not evaluated correctly by transcript length or cumulative privacy accounting, and develops a principle for local reconstruction risk.

View →
math.OCcs.CCcs.LGSurveyRecentOct 29, 2026

Stochastic and Noisy Oracles in Smooth Continuous Optimization

Albert S. Berahas, Liyuan Cao, Katya Scheinberg

This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.

View →
cs.ITmath.COTheoreticalRecentAug 6, 2026

Moment-based linear programming bounds for locally recoverable codes

Shujian Li, Hengjia Wei, Maosheng Xiong

This paper derives new linear programming bounds for q-ary (r,δ)-locally recoverable codes, improving upon previous bounds and applying to both linear and nonlinear codes.

View →
math.PRcs.ITmath.MGTheoreticalRecentJul 15, 2026

Stochastic Domination of Gaussian Maxima: A Resolution to the Weak Simplex Conjecture

Abhijeet Mulgund

The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.

View →
stat.MLcs.LGmath.OCEmpiricalRecentJun 18, 2026

Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach

Haonan Xu, Yingying Li

This paper proposes a novel algorithm SME-OFU that improves the regret bound for stochastic linear contextual bandits with bounded reward noise.

View →
cs.ITeess.SYTheoreticalRecentJul 9, 2026

On the Convergence of Belief Propagation for Multipath Data Association in Target Tracking

Kuilong Yang, Zengfu Wang, Hua Lan, Jing Fu

This paper proves convergence of belief propagation algorithms for multipath data association to a unique fixed point.

View →