arXiv (All)
open access
Non-Adaptive 1-Bit Mean Estimation: Minimax Rates and the Sample-Interval Tradeoff
We study distributed one-dimensional mean estimation under a 1-bit communication constraint. Each agent observes one sample, drawn independently from an unknown distribution, and returns a single bit in response to a query $Q: \mathbb{R}\to\{0,1\}$ chosen by a central learner. The distribution has m
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Approximate Best Linear Unbiased Channel Estimation for Frequency Selective Channels With Long Delay Spreads: Robustness To Timing and Carrier Offsets#1027251
- ADAPTIVE ALGORITHMS FOR CHANNEL ESTIMATION: USING A PRIORI INFORMATION FOR OPTIMUM DESIGN#288424
- Query Lower Bounds for Diffusion Sampling#1130527
- Uma análise probabilística do desempenho de sistemas ASR para rádios e tvs brasileiras#1040716
- Distributional Variants of the Aaronson-Ambainis Conjecture#1129919
Record · ID 985906
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive