Fetching the paper…
Reading the bibliography…
In this work, we consider the deterministic optimization using random projections as a statistical estimation problem, where the squared distance between the predictions from the estimator and the true solution is the error metric.
1902
Earlier work this paper cites.
C. Stein, “Inadmissibility of the usual estimator for the mean of a multivariate normal distribution,” in Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics . Berkeley, Calif.: University of California Press, 1956, pp. 197–206. [Online]. Available: https://projecteuclid.org/euclid.bsmsp/1200501656
1956
Earlier work this paper cites.
W. James and C. Stein, “Estimation with quadratic loss,” in Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Contributions to the Theory of Statistics . Berkeley, Calif.: University of California Press, 1961, pp. 361–379. [Online]. Available: https://projecteuclid.org/euclid.bsmsp/1200512173
1961
Earlier work this paper cites.
B. Efron and C. Morris, “Multivariate empirical bayes and estimation of covariance matrices,” Ann. Statist. , vol. 4, no. 1, pp. 22–32, 01 1976
1976
Earlier work this paper cites.
B. Efron and C. Morris, “Stein’s paradox in statistics,” Scientific American - SCI AMER , vol. 236, pp. 119–127, 05 1977
1977
Earlier work this paper cites.
C. M. Stein, “Estimation of the mean of a multivariate normal distribution,” Ann. Statist. , vol. 9, no. 6, pp. 1135–1151, 11 1981
1981
Earlier work this paper cites.
P. Y.-S. Shao and W. E. Strawderman, “Improving on the james-stein positive-part estimator,” The Annals of Statistics , pp. 1517–1538, 1994
1994
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 , vol. 1, no. 1-2, pp. 59–79, 03 1995. [Online]. Available: https://projecteuclid.org:443/euclid.bj/1186078362
1995
Earlier work this paper cites.
A. A. Borovkov, Mathematical statistics . Australia: Gordon and Breach Science Publishers, 1998
1998
Earlier work this paper cites.
K. H. Yung, “Explaining the stein paradox,” 1999
1999
Earlier work this paper cites.
S. S. Vempala, The random projection method . American Mathematical Soc., 2005, vol. 65
2005
Earlier work this paper cites.
T. Sarlos, “Improved approximation algorithms for large matrices via random projections,” in 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06) , 2006, pp. 143–152
2006
Earlier work this paper cites.
P. Drineas, M. W. Mahoney, and S. Muthukrishnan, “Sampling algorithms for l2 regression and applications,” in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm , ser. SODA ’06. USA: Society for Industrial and Applied Mathematics, 2006, p. 1127–1136
2006
Cited alongside, same era.
N. Ailon and B. Chazelle, “Approximate nearest neighbors and the fast johnson-lindenstrauss transform,” in Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing , ser. STOC ’06. New York, NY, USA: Association for Computing Machinery, 2006, p. 557–563. [Online]. Available: https://doi.org/10.1145/1132516.1132597
2006
Cited alongside, same era.
P. Li, T. J. Hastie, and K. W. Church, “Very sparse random projections,” in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , 2006, pp. 287–296
2006
Cited alongside, same era.
B. E. Hansen, “Generalized shrinkage estimators,” manuscript, University of Wisconsin , 2008
2008
M. Pilanci and M. J. Wainwright, “Iterative hessian sketch: Fast and accurate solution approximation for constrained least-squares,” 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
M. Pilanci and M. J. Wainwright, “Randomized sketches of convex programs with sharp guarantees,” IEEE Transactions on Information Theory , vol. 61, no. 9, pp. 5096–5115, 2015
2015
Later among the works it cites.
P. Ma, M. W. Mahoney, and B. Yu, “A statistical perspective on algorithmic leveraging,” The Journal of Machine Learning Research , vol. 16, no. 1, pp. 861–911, 2015
2015
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.
S. Zhou, K. Ligett, and L. Wasserman, “Differential privacy with compression,” in 2009 IEEE International Symposium on Information Theory , 2009, pp. 2718–2722
2009
Cited alongside, same era.
C. Boutsidis and P. Drineas, “Random projections for the nonnegative least-squares problem,” Linear algebra and its applications , vol. 431, no. 5-7, pp. 760–771, 2009
2009
Cited alongside, same era.
M. W. Mahoney et al. , “Randomized algorithms for matrices and data,” Foundations and Trends® in Machine Learning , vol. 3, no. 2, pp. 123–224, 2011
2011
Cited alongside, same era.
P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlós, “Faster least squares approximation,” Numerische mathematik , vol. 117, no. 2, pp. 219–249, 2011
2011
Cited alongside, same era.
C.-C. Chang and C.-J. Lin, “Libsvm: A library for support vector machines,” ACM Trans. Intell. Syst. Technol. , vol. 2, no. 3, May 2011. [Online]. Available: http://www.csie.ntu.edu.tw/~cjlin/libsvmtools/datasets/
2011
Cited alongside, same era.
R. C. Rogers, The calculus of several variables , 2011, p. 289
2011
Cited alongside, same era.
J. Blocki, A. Blum, and O. Sheffet, “The johnson-lindenstrauss transform itself preserves differentialprivacy,” 04 2012
2012
Cited alongside, same era.
P. D. Hoff, “Shrinkage estimators,” Course notes. University of Washington , 2012
2012
Cited alongside, same era.
2016
Later among the works it cites.
J. Nelson, Oblivious Subspace Embeddings . New York, NY: Springer New York, 2016, pp. 1430–1434
2016
Later among the works it cites.
K. L. Clarkson and D. P. Woodruff, “Low-rank approximation and regression in input sparsity time,” Journal of the ACM (JACM) , vol. 63, no. 6, pp. 1–45, 2017
2017
Later among the works it cites.
D. Ahfock, W. J. Astle, and S. Richardson, “Statistical properties of sketching algorithms,” 2017
2017
Later among the works it cites.
M. Showkatbakhsh, C. Karakus, and S. Diggavi, “Privacy-utility trade-off of linear regression under random projections and additive noise,” 06 2018, pp. 186–190
2018
Later among the works it cites.
A. K. Gupta and D. K. Nagar, Matrix variate distributions . Chapman and Hall/CRC, 2018, ch. 3
2018
Later among the works it cites.
E. Dobriban and S. Liu, “Asymptotics for sketching in least squares regression,” in Advances in Neural Information Processing Systems , 2019, pp. 3670–3680
2019
Later among the works it cites.