Fetching the paper…
Reading the bibliography…
We consider the problem of estimating the mean of a symmetric log-concave distribution under the constraint that only a single bit per sample from this distribution is available to the estimator.
J. Hammersley, “On estimating restricted parameters,” Journal of the Royal Statistical Society. Series B (Methodological) , vol. 12, no. 2, pp. 192–240, 1950
1950
Earlier work this paper cites.
M. R. Sampford, “Some inequalities on mill’s ratio and related functions,” The Annals of Mathematical Statistics , vol. 24, no. 1, pp. 130–132, 1953
1953
Earlier work this paper cites.
I. A. Ibragimov, “On the composition of unimodal distributions,” Theory of Probability & Its Applications , vol. 1, no. 2, pp. 255–260, 1956
1956
Earlier work this paper cites.
D. P. Bertsekas, “Stochastic optimization problems with nondifferentiable cost functionals,” Journal of Optimization Theory and Applications , vol. 12, no. 2, pp. 218–231, 1973
1973
Earlier work this paper cites.
J. Candy, “A use of limit cycle oscillations to obtain robust analog-to-digital converters,” IEEE Transactions on Communications , vol. 22, no. 3, pp. 298–305, Mar 1974
1974
Earlier work this paper cites.
L. Le Cam, Asymptotic Methods in Statistical Decision Theory . Springer-Verlag, 1986
1986
Earlier work this paper cites.
Z. Zhang and T. Berger, “Estimation via compressed information,” IEEE Transactions on Information Theory , vol. 34, no. 2, pp. 198–211, 1988
1988
Earlier work this paper cites.
J. N. Tsitsiklis, “Decentralized detection by a large number of sensors,” Mathematics of Control, Signals, and Systems (MCSS) , vol. 1, no. 2, pp. 167–182, 1988
1988
Earlier work this paper cites.
P. W. Wong and R. M. Gray, “Sigma-delta modulation with i.i.d. Gaussian inputs,” IEEE Transactions on Information Theory , vol. 36, no. 4, pp. 784–798, Jul 1990
1990
Earlier work this paper cites.
M. Longo, T. D. Lookabaugh, and R. M. Gray, “Quantization for decentralized hypothesis testing under communication constraints,” IEEE Transactions on Information Theory , vol. 36, no. 2, pp. 241–255, Mar 1990
1990
Earlier work this paper cites.
B. T. Polyak, “New stochastic approximation type procedures,” Automat. i Telemekh , vol. 7, no. 98-107, p. 2, 1990
1990
Earlier work this paper cites.
B. T. Polyak and A. B. Juditsky, “Acceleration of stochastic approximation by averaging,” SIAM Journal on Control and Optimization , vol. 30, no. 4, pp. 838–855, 1992
1992
Earlier work this paper cites.
R. D. Gill and B. Y. Levit, “Applications of the van Trees inequality: a Bayesian Cramér-Rao bound,” Bernoulli , pp. 59–79, 1995
1995
Earlier work this paper cites.
R. Beran, “The role of Hájek’s convolution theorem in statistical theory,” Kybernetika , vol. 31, no. 3, pp. 221–237, 1995
1995
Earlier work this paper cites.
T. Berger, Z. Zhang, and H. Viswanathan, “The CEO problem [multiterminal source coding],” IEEE Transactions on Information Theory , vol. 42, no. 3, pp. 887–902, 1996
1996
Earlier work this paper cites.
H. Viswanathan and T. Berger, “The quadratic Gaussian CEO problem,” IEEE Transactions on Information Theory , vol. 43, no. 5, pp. 1549–1559, 1997
1997
Earlier work this paper cites.
T. Han and S. Amari, “Statistical inference under multiterminal data compression,” IEEE Transactions on Information Theory , vol. 44, no. 6, pp. 2300–2324, Oct 1998
1998
Earlier work this paper cites.
R. Gray and D. Neuhoff, “Quantization,” IEEE Transactions on Information Theory , vol. 44, no. 6, pp. 2325–2383, Oct 1998
1998
Earlier work this paper cites.
A. W. van der Vaart, Asymptotic Statistics , ser. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 1998
1998
Earlier work this paper cites.
Y. Oohama, “The rate-distortion function for the quadratic Gaussian CEO problem,” IEEE Transactions on Information Theory , vol. 44, no. 3, pp. 1057–1070, 1998
1998
Earlier work this paper cites.
E. L. Lehmann and G. Casella, Theory of Point Estimation, Second Edition . Springer, 1998
1998
Cited alongside, same era.
L. Le Cam and G. L. Yang, Asymptotics in Statistics: Some Basic Concepts . Springer, 2000
2000
Cited alongside, same era.
W. Shi, T. W. Sun, and R. D. Wesel, “Quasi-convexity and optimal binary fusion for distributed detection with identical sensors in generalized Gaussian noise,” IEEE Transactions on Information Theory , vol. 47, no. 1, pp. 446–450, Jan 2001
2001
Cited alongside, same era.
D. Li, K. Wong, Y. Hu, and A. Sayeed, “Detection, classification and tracking of targets in distributed sensor networks,” in IEEE Signal Processing Magazine , 2002, pp. 17–29
2002
Cited alongside, same era.
V. Lesser, C. Ortiz, and M. Tambe, Eds., Distributed Sensor Networks: A Multiagent Perspective . Kluwer Academic Publishers, 2003, vol. 9
2003
A. Garg, T. Ma, and H. L. Nguyen, “On communication cost of distributed statistical estimation and dimensionality,” in Advances in Neural Information Processing Systems 27 , 2014
2014
Later among the works it cites.
O. Shamir, “Fundamental limits of online and distributed algorithms for statistical learning and estimation,” in Advances in Neural Information Processing Systems , 2014, pp. 163–171
2014
Later among the works it cites.
M. A. Davenport, Y. Plan, E. van den Berg, and M. Wootters, “One-bit matrix completion,” Information and Inference , p. to appear, 2015
2015
Later among the works it cites.
J. Choi, J. Mo, and R. W. Heath, “Near maximum-likelihood detector and channel estimator for uplink multiuser massive mimo systems with one-bit adcs,” IEEE Transactions on Communications , vol. 64, no. 5, pp. 2005–2018, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
V. Prabhakaran, D. Tse, and K. Ramachandran, “Rate region of the quadratic Gaussian CEO problem,” in Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on . IEEE, 2004, p. 119
2004
Cited alongside, same era.
J. Chen, X. Zhang, T. Berger, and S. Wicker, “An upper bound on the sum-rate distortion function and its corresponding rate allocation schemes for the CEO problem,” Selected Areas in Communications, IEEE Journal on , vol. 22, no. 6, pp. 977–987, Aug 2004
2004
Cited alongside, same era.
M. Bagnoli and T. Bergstrom, “Log-concave probability and its applications,” Economic theory , vol. 26, no. 2, pp. 445–469, 2005
2005
Cited alongside, same era.
P. Venkitasubramaniam, L. Tong, and A. Swami, “Quantization for maximin are in distributed estimation,” IEEE Transactions on Signal Processing , vol. 55, no. 7, pp. 3596–3605, July 2007
2007
Cited alongside, same era.
A. B. Tsybakov, Introduction to Nonparametric Estimation . Springer, 2009
2009
Cited alongside, same era.
H. Chen and P. K. Varshney, “Performance limit for distributed estimation systems with identical one-bit quantizers,” IEEE Transactions on Signal Processing , vol. 58, no. 1, pp. 466–471, 2010
2010
Cited alongside, same era.
——, “Performance limit for distributed estimation systems with identical one-bit quantizers,” IEEE Transactions on Signal Processing , vol. 58, no. 1, pp. 466–471, Jan 2010
2010
Cited alongside, same era.
2016
Later among the works it cites.
M. Braverman, A. Garg, T. Ma, H. L. Nguyen, and D. P. Woodruff, “Communication lower bounds for statistical estimation problems via a distributed data processing inequality,” in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , 2016, pp. 1011–1020
2016
Later among the works it cites.
A. Dembo, “Lecture notes on probability theory: Stanford statistics 310,” 2016, accessed October 1, 2016. [Online]. Available: http://statweb.stanford.edu/~adembo/stat-310b/lnotes.pdf
2016
Later among the works it cites.
A. Kipnis and J. C. Duchi, “Mean estimation from adaptive one-bit measurements,” in 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , Oct 2017, pp. 1000–1007
2017
Later among the works it cites.
R. G. Baraniuk, S. Foucart, D. Needell, Y. Plan, and M. Wootters, “Exponential decay of reconstruction error from binary measurements of sparse signals,” IEEE Transactions on Information Theory , vol. 63, no. 6, pp. 3368–3385, 2017
2017
Later among the works it cites.
Y. Li, C. Tao, G. Seco-Granados, A. Mezghani, A. L. Swindlehurst, and L. Liu, “Channel estimation and performance analysis of one-bit massive mimo systems,” IEEE Trans. Signal Process , vol. 65, no. 15, pp. 4075–4089, 2017
2017
Later among the works it cites.
A. Xu and M. Raginsky, “Information-theoretic lower bounds on Bayes risk in decentralized estimation,” IEEE Transactions on Information Theory , vol. 63, no. 3, pp. 1580–1600, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Minimax optimal procedures for locally private estimation (with discussion),” Journal of the American Statistical Association , vol. 113, no. 521, pp. 182–215, 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
Y. Han, P. Mukherjee, A. Ozgur, and T. Weissman, “Distributed statistical estimation of high-dimensional and nonparametric distributions,” in 2018 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2018, pp. 506–510
2018
Later among the works it cites.
L. Barnes, Y. Han, and A. Ozgur, “A geometric characterization of fisher information from quantized samples with applications to distributed statistical estimation,” in 2018 56st Annual Allerton Conference on Communication, Control, and Computing (Allerton) , Oct 2018
2018
Later among the works it cites.
Y. Han, A. Özgür, and T. Weissman, “Geometric lower bounds for distributed parameter estimation under communication constraints,” in Conference On Learning Theory . PMLR, 2018, pp. 3163–3188
2018
Later among the works it cites.
2020
Closest in time.
L. P. Barnes, Y. Han, and A. Ozgur, “Lower bounds for learning distributions under communication constraints via fisher information,” Journal of Machine Learning Research , vol. 21, no. 236, pp. 1–30, 2020
2020
Closest in time.