{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:28:56Z","timestamp":1763036936865,"version":"3.37.3"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T00:00:00Z","timestamp":1447891200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 876, C4"],"award-info":[{"award-number":["SFB 876, C4"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 876, C4"],"award-info":[{"award-number":["SFB 876, C4"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11222-015-9608-z","type":"journal-article","created":{"date-parts":[[2015,11,19]],"date-time":"2015-11-19T05:57:20Z","timestamp":1447912640000},"page":"79-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Random projections for Bayesian regression"],"prefix":"10.1007","volume":"27","author":[{"given":"Leo N.","family":"Geppert","sequence":"first","affiliation":[]},{"given":"Katja","family":"Ickstadt","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Munteanu","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Quedenfeld","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Sohler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,19]]},"reference":[{"issue":"4","key":"9608_CR1","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s00454-008-9110-x","volume":"42","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Liberty, E.: Fast dimension reduction using Rademacher series on dual BCH codes. Discret. Comput. Geom. 42(4), 615\u2013630 (2009)","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"9608_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9608_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1214\/06-BA112","volume":"1","author":"S Balakrishnan","year":"2006","unstructured":"Balakrishnan, S., Madigan, D.: A one-pass sequential Monte Carlo method for Bayesian analysis of massive datasets. Bayesian Anal. 1(2), 345\u2013361 (2006)","journal-title":"Bayesian Anal."},{"issue":"1","key":"9608_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1093\/biomet\/ass068","volume":"100","author":"A Banerjee","year":"2013","unstructured":"Banerjee, A., Dunson, D.B., Tokdar, S.T.: Efficient Gaussian process regression for large datasets. Biometrika 100(1), 75\u201389 (2013)","journal-title":"Biometrika"},{"issue":"3","key":"9608_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","volume":"28","author":"R Baraniuk","year":"2008","unstructured":"Baraniuk, R., Davenport, M., Devore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. 28(3), 253\u2013263 (2008)","journal-title":"Constr. Approx."},{"key":"9608_CR6","unstructured":"Bardenet, R., Doucet, A., Holmes, C.C.: Towards scaling up Markov Chain Monte Carlo an adaptive subsampling approach. In: Proc. of ICML, pp. 405\u2013413 (2014)"},{"issue":"6","key":"9608_CR7","doi-asserted-by":"crossref","first-page":"1704","DOI":"10.1137\/090772873","volume":"41","author":"JD Batson","year":"2012","unstructured":"Batson, J.D., Spielman, D.A., Srivastava, N.: Twice-Ramanujan sparsifiers. SIAM J. Comput. 41(6), 1704\u20131721 (2012)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9608_CR8","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1093\/genetics\/162.4.2025","volume":"162","author":"MA Beaumont","year":"2002","unstructured":"Beaumont, M.A., Zhang, W., Balding, D.J.: Approximate Bayesian computation in population genetics. Genetics 162(4), 2025\u20132035 (2002)","journal-title":"Genetics"},{"key":"9608_CR9","doi-asserted-by":"crossref","unstructured":"Benson, A.R., Gleich, D.F., Demmel, J.: Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures. In: Proceedings of IEEE International Conference on Big Data, pp. 264\u2013272 (2013)","DOI":"10.1109\/BigData.2013.6691583"},{"key":"9608_CR10","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, Berlin (2006)"},{"issue":"3","key":"9608_CR11","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1137\/120874540","volume":"34","author":"C Boutsidis","year":"2013","unstructured":"Boutsidis, C., Gittens, A.: Improved matrix algorithms via the subsampled randomized hadamard transform. SIAM J. Matrix Anal. Appl. 34(3), 1301\u20131340 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9608_CR12","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Magdon-Ismail, M.: Faster SVD-truncated regularized least-squares. In: IEEE symposium information theory, pp. 1321\u20131325 (2014)","DOI":"10.1109\/ISIT.2014.6875047"},{"key":"9608_CR13","unstructured":"Boutsidis, C., Zouzias, A., Drineas, P.: Random projections for $$k$$ k -means clustering. In: Proceedings of NIPS, pp. 298\u2013306 (2010)"},{"issue":"10","key":"9608_CR14","doi-asserted-by":"crossref","first-page":"6880","DOI":"10.1109\/TIT.2013.2272457","volume":"59","author":"C Boutsidis","year":"2013","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal coresets for least-squares regression. IEEE Trans. Inf. Theory 59(10), 6880\u20136892 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9608_CR15","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J.K., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9608_CR16","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proceedings of STOC, pp. 205\u2013214 (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"9608_CR17","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low rank approximation and regression in input sparsity time. In: Proceedings of STOC, pp. 81\u201390 (2013)","DOI":"10.1145\/2488608.2488620"},{"key":"9608_CR18","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Sketching for M-estimators: A unified approach to robust regression. In: Proceedings of SODA, pp. 921\u2013939 (2015)","DOI":"10.1137\/1.9781611973730.63"},{"key":"9608_CR19","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Drineas, P., Magdon-Ismail, M., Mahoney, M.W., Meng, X., Woodruff, D.P.: The fast Cauchy transform and faster robust linear regression. In: Proceedings of SODA, pp. 466\u2013477 (2013)","DOI":"10.1137\/1.9781611973105.34"},{"key":"9608_CR20","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Elder, S., Musco, C., Musco, C., Persu, M.: Dimensionality reduction for $$k$$ k -means clustering and low rank approximation. In: Proceedings of STOC (2015)","DOI":"10.1145\/2746539.2746569"},{"key":"9608_CR21","doi-asserted-by":"crossref","unstructured":"Constantine, P.G., Gleich, D.F.: Tall and skinny QR factorizations in MapReduce architectures. In: Proceedings of International Workshop on MapReduce and Application, ACM, pp. 43\u201350 (2011)","DOI":"10.1145\/1996092.1996103"},{"issue":"7","key":"9608_CR22","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.tree.2010.04.001","volume":"25","author":"K Csillery","year":"2010","unstructured":"Csillery, K., Blum, M., Gaggiotti, O., Francois, O.: Approximate Bayesian computation (ABC) in practice. Trends Ecol. Evol. 25(7), 410\u2013418 (2010)","journal-title":"Trends Ecol. Evol."},{"issue":"5","key":"9608_CR23","doi-asserted-by":"crossref","first-page":"2060","DOI":"10.1137\/070696507","volume":"38","author":"A Dasgupta","year":"2009","unstructured":"Dasgupta, A., Drineas, P., Harb, B., Kumar, R., Mahoney, M.W.: Sampling algorithms and coresets for $$\\ell _p$$ \u2113 p regression. SIAM J. Comput. 38(5), 2060\u20132078 (2009)","journal-title":"SIAM J. Comput."},{"key":"9608_CR24","doi-asserted-by":"crossref","unstructured":"Demmel, J., Grigori, L., Hoemmen, M., Langou, J.: Communication-optimal parallel and sequential QR and LU factorizations. SIAM J. Sci. Comput. 34(1), A206\u2013A239 (2012)","DOI":"10.1137\/080731992"},{"issue":"1","key":"9608_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M Dietzfelbinger","year":"1997","unstructured":"Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25(1), 19\u201351 (1997)","journal-title":"J. Algorithms"},{"issue":"2","key":"9608_CR26","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(2), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9608_CR27","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Sampling algorithms for $$\\ell _{2}$$ \u2113 2 regression and applications. In: Proceedings of SODA, pp. 1127\u20131136 (2006)","DOI":"10.1145\/1109557.1109682"},{"issue":"2","key":"9608_CR28","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarl\u00f3s, T.: Faster least squares approximation. Numer. Math. 117(2), 219\u2013249 (2011)","journal-title":"Numer. Math."},{"key":"9608_CR29","doi-asserted-by":"crossref","unstructured":"DuMouchel, W., Volinsky, C., Johnson, T., Cortes, C., Pregibon, D.: Squashing flat files flatter. In: Proceedings of KDD, pp. 6\u201315 (1999)","DOI":"10.1145\/312129.312184"},{"issue":"2\u20133","key":"9608_CR30","first-page":"113","volume":"2","author":"H Fanaee-T","year":"2014","unstructured":"Fanaee-T, H., Gama, J.: Event labeling combining ensemble detectors and background knowledge. Prog. in AI 2(2\u20133), 113\u2013127 (2014)","journal-title":"Prog. in AI"},{"key":"9608_CR31","doi-asserted-by":"crossref","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering. In: Proceedings of SODA, pp. 1434\u20131453 (2013)","DOI":"10.1137\/1.9781611973105.103"},{"issue":"3","key":"9608_CR32","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1214\/06-BA117A","volume":"1","author":"A Gelman","year":"2006","unstructured":"Gelman, A.: Prior distributions for variance parameters in hierarchical models (comment on article by Browne and Draper). Bayesian Anal. 1(3), 515\u2013534 (2006)","journal-title":"Bayesian Anal."},{"key":"9608_CR33","volume-title":"Bayesian Data Analysis. Texts in Statistical Science","author":"A Gelman","year":"2014","unstructured":"Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A., Rubin, D.B.: Bayesian Data Analysis. Texts in Statistical Science, 3rd edn. Chapman & Hall\/CRC, London (2014)","edition":"3"},{"key":"9608_CR34","doi-asserted-by":"crossref","unstructured":"Geppert, L.N., Ickstadt, K., Munteanu, A., Quedenfeld, J., Sohler, C.: RaProR: Random Projections for Bayesian Linear Regression, R-package, Version 1.0 (2015) http:\/\/ls2-www.cs.uni-dortmund.de\/projekte\/RaProR\/","DOI":"10.1007\/s11222-015-9608-z"},{"issue":"2","key":"9608_CR35","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1307\/mmj\/1029003026","volume":"31","author":"CR Givens","year":"1984","unstructured":"Givens, C.R., Shortt, R.M.: A class of Wasserstein metrics for probability distributions. Mich. Math. J. 31(2), 231\u2013240 (1984)","journal-title":"Mich. Math. J."},{"issue":"3","key":"9608_CR36","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF01436075","volume":"7","author":"GH Golub","year":"1965","unstructured":"Golub, G.H.: Numerical methods for solving linear least squares problems. Numer. Math. 7(3), 206\u2013216 (1965)","journal-title":"Numer. Math."},{"key":"9608_CR37","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., van Loan, C.F.: Matrix computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"9608_CR38","doi-asserted-by":"publisher","unstructured":"Guhaniyogi, R., Dunson, D.B.: Bayesian compressed regression. J. Amer. Stat. Assoc. published online (2014) doi: 10.1080\/01621459.2014.969425","DOI":"10.1080\/01621459.2014.969425"},{"issue":"2","key":"9608_CR39","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.-G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"9608_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data mining, Inference, and Prediction, 2nd edn. Springer, New York (2009)","edition":"2"},{"key":"9608_CR41","first-page":"1593","volume":"15","author":"MD Hoffman","year":"2014","unstructured":"Hoffman, M.D., Gelman, A.: The No-U-Turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo. J. Mach. Learn. Res. 15, 1593\u20131623 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"9608_CR42","volume-title":"Matrix Analysis","author":"R Horn","year":"1990","unstructured":"Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press, Cambridge (1990)"},{"key":"9608_CR43","doi-asserted-by":"crossref","unstructured":"Ji, S., Carin, L.: Bayesian compressive sensing and projection optimization. In: Proceedings of ICML, pp. 377\u2013384 (2007)","DOI":"10.1145\/1273496.1273544"},{"key":"9608_CR44","volume-title":"Principal Component Analysis","author":"I Jolliffe","year":"2002","unstructured":"Jolliffe, I.: Principal Component Analysis, 2nd edn. Springer, Berlin (2002)","edition":"2"},{"issue":"3\u20134","key":"9608_CR45","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1561\/0400000025","volume":"4","author":"R Kannan","year":"2009","unstructured":"Kannan, R., Vempala, S.: Spectral algorithms. Found. Trends Theor. Comput. Sci. 4(3\u20134), 157\u2013288 (2009)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"9608_CR46","unstructured":"Kannan, R., Vempala, S., Woodruff, D.P.: Principal component analysis and higher correlations for distributed data. In: Proceedings of COLT, pp. 1040\u20131057 (2014)"},{"key":"9608_CR47","unstructured":"Kerber, M., Raghvendra, S.: Approximation and streaming algorithms for projective clustering via random projections. CoRR abs\/1407.2063 (2014)"},{"key":"9608_CR48","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971217","volume-title":"Solving Least Squares Problems. Classics in Applied Mathematics","author":"CL Lawson","year":"1995","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Classics in Applied Mathematics. SIAM, Philadelphia, PA (1995)"},{"key":"9608_CR49","unstructured":"Lichman, M.: UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml (2013)"},{"key":"9608_CR50","unstructured":"Ma, P., Mahoney, M.W., Yu, B.: A statistical perspective on algorithmic leveraging. In: Proceedings of ICML, pp. 91\u201399 (2014)"},{"issue":"2","key":"9608_CR51","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1014095614948","volume":"6","author":"D Madigan","year":"2002","unstructured":"Madigan, D., Raghavan, N., DuMouchel, W., Nason, M., Posse, C., Ridgeway, G.: Likelihood-based data squashing: a modeling approach to instance construction. Data Min. Knowl. Discov. 6(2), 173\u2013190 (2002)","journal-title":"Data Min. Knowl. Discov."},{"key":"9608_CR52","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.csda.2013.04.014","volume":"67","author":"T Martins","year":"2013","unstructured":"Martins, T., Simpson, D., Lindgren, F., Rue, H.: Bayesian computing with INLA: new features. Comput. Stat. Data Anal. 67, 68\u201383 (2013)","journal-title":"Comput. Stat. Data Anal."},{"key":"9608_CR53","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2) 1\u2013126 (2005)","DOI":"10.1561\/0400000002"},{"key":"9608_CR54","doi-asserted-by":"crossref","unstructured":"Nelson, J., Nguyen, H.L.: OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. In: Proceedings of FOCS, pp. 117\u2013126 (2013a)","DOI":"10.1109\/FOCS.2013.21"},{"key":"9608_CR55","doi-asserted-by":"crossref","unstructured":"Nelson, J., Nguyen, H.L.: Sparsity lower bounds for dimensionality reducing maps. In: Proceedings of STOC, pp. 101\u2013110 (2013b)","DOI":"10.1145\/2488608.2488622"},{"key":"9608_CR56","doi-asserted-by":"crossref","unstructured":"Nelson, J., Nguy\u00ean, H.L.: Lower bounds for oblivious subspace embeddings. In: Proceedings of ICALP, Part I, pp. 883\u2013894 (2014)","DOI":"10.1007\/978-3-662-43948-7_73"},{"issue":"4","key":"9608_CR57","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2641760","volume":"8","author":"S Paul","year":"2014","unstructured":"Paul, S., Boutsidis, C., Magdon-Ismail, M., Drineas, P.: Random projections for linear support vector machines. ACM Trans. Knowl. Discov. Data 8(4), 22 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"9608_CR58","doi-asserted-by":"crossref","unstructured":"Quiroz, M., Villani, M., Kohn, R.: Speeding up MCMC by efficient data subsampling. stat.ME abs\/1404.4178 (2015)","DOI":"10.2139\/ssrn.2592889"},{"key":"9608_CR59","unstructured":"R Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2014) http:\/\/www.R-project.org"},{"key":"9608_CR60","unstructured":"Raskutti, G., Mahoney, M.: Statistical and algorithmic perspectives on randomized sketching for ordinary least-squares. In: Proceedings of ICML, pp. 617\u2013625 (2015)"},{"key":"9608_CR61","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1111\/j.1467-9868.2008.00700.x","volume":"71","author":"H Rue","year":"2009","unstructured":"Rue, H., Martino, S., Chopin, N.: Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations (with discussion). J. R. Stat. Soc. B 71, 319\u2013392 (2009)","journal-title":"J. R. Stat. Soc. B"},{"issue":"2","key":"9608_CR62","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1242524.1242528","volume":"32","author":"F Rusu","year":"2007","unstructured":"Rusu, F., Dobra, A.: Pseudo-random number generation for sketch-based estimations. ACM Trans. Database Syst. 32(2), 11 (2007)","journal-title":"ACM Trans. Database Syst."},{"key":"9608_CR63","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T.: Improved approximation algorithms for large matrices via random projections. In: Proceedings of FOCS, pp. 143\u2013152 (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"9608_CR64","unstructured":"Stan Development Team: Stan: A C++ Library for Probability and Sampling, Version 2.3. (2013) http:\/\/mc-stan.org\/"},{"key":"9608_CR65","doi-asserted-by":"crossref","unstructured":"Venkatasubramanian, S., Wang, Q.: The Johnson-Lindenstrauss transform: an empirical study. In: Proceedings of ALENEX, pp. 164\u2013173 (2011)","DOI":"10.1137\/1.9781611972917.16"},{"key":"9608_CR66","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal transport: Old and new. Grundlehren der mathematischen Wissenschaften","author":"C Villani","year":"2009","unstructured":"Villani, C.: Optimal transport: Old and new. Grundlehren der mathematischen Wissenschaften. Springer, Berlin (2009)"},{"issue":"4","key":"9608_CR67","first-page":"8","volume":"21","author":"M Welling","year":"2014","unstructured":"Welling, M., Teh, Y.W., Andrieu, C., Kominiarczuk, J., Meeds, T., Shahbaba, B., Vollmer, S.: Bayesian inference & Big Data: a snapshot from a workshop. ISBA Bull. 21(4), 8\u201311 (2014)","journal-title":"ISBA Bull."},{"key":"9608_CR68","unstructured":"Woodruff, D.P., Zhang, Q.: Subspace embeddings and $$\\ell _p$$ \u2113 p -regression using exponential random variables. In: Proceedings of COLT, pp. 546\u2013567 (2013)"},{"key":"9608_CR69","unstructured":"Yang, J., Meng, X., Mahoney, M.W.: Implementing randomized matrix algorithms in parallel and distributed environments. CoRR abs\/1502.03032 (2015)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-015-9608-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9608-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9608-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9608-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T22:26:08Z","timestamp":1692138368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-015-9608-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,19]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9608"],"URL":"https:\/\/doi.org\/10.1007\/s11222-015-9608-z","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2015,11,19]]}}}