{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:19:13Z","timestamp":1773886753465,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":116,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1629397"],"award-info":[{"award-number":["1629397"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1553169"],"award-info":[{"award-number":["1553169"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3299869.3300077","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T17:41:43Z","timestamp":1560879703000},"page":"1135-1152","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["BlinkML"],"prefix":"10.1145","author":[{"given":"Yongjoo","family":"Park","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyi","family":"Qing","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Shen","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barzan","family":"Mozafari","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Retrieved","year":"2018","unstructured":"Apache spark's scalable machine learning library. https:\/\/spark.apache.org\/mllib\/ . Retrieved : July 18, 2018 . Apache spark's scalable machine learning library. https:\/\/spark.apache.org\/mllib\/. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_2_1","volume-title":"https:\/\/cloud.google.com\/automl\/. Retrieved","year":"2018","unstructured":"Cloud automl. https:\/\/cloud.google.com\/automl\/. Retrieved : Oct 30, 2018 . Cloud automl. https:\/\/cloud.google.com\/automl\/. Retrieved: Oct 30, 2018."},{"key":"e_1_3_2_1_3_1","volume-title":"https:\/\/conda.io\/docs\/index.html. Retrieved","year":"2018","unstructured":"Conda. https:\/\/conda.io\/docs\/index.html. Retrieved : July 18, 2018 . Conda. https:\/\/conda.io\/docs\/index.html. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_4_1","volume-title":"https:\/\/oracle.github.io\/python-cx_Oracle\/. Retrieved","year":"2018","unstructured":"cxtextunderscore oracle version 6.2. https:\/\/oracle.github.io\/python-cx_Oracle\/. Retrieved : July 18, 2018 . cxtextunderscore oracle version 6.2. https:\/\/oracle.github.io\/python-cx_Oracle\/. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_5_1","volume-title":"Retrieved","year":"2018","unstructured":"Download kaggle display advertising challenge dataset. http:\/\/labs.criteo.com\/2014\/02\/download-kaggle-display-advertising-challenge-dataset\/ . Retrieved : Oct 30, 2018 . Download kaggle display advertising challenge dataset. http:\/\/labs.criteo.com\/2014\/02\/download-kaggle-display-advertising-challenge-dataset\/. Retrieved: Oct 30, 2018."},{"key":"e_1_3_2_1_6_1","unstructured":"Fast approximate analysis of big data (yahoo's druid). http:\/\/yahooeng.tumblr.com\/post\/135390948446\/data-sketches.  Fast approximate analysis of big data (yahoo's druid). http:\/\/yahooeng.tumblr.com\/post\/135390948446\/data-sketches."},{"key":"e_1_3_2_1_7_1","volume-title":"Retrieved","year":"2018","unstructured":"ibmdbr : Ibm in-database analytics for r. https:\/\/cran.r-project.org\/web\/packages\/ibmdbR\/index.html . Retrieved : July 18, 2018 . ibmdbr: Ibm in-database analytics for r. https:\/\/cran.r-project.org\/web\/packages\/ibmdbR\/index.html. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_8_1","unstructured":"Individual household electric power consumption data set. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Individual  Individual household electric power consumption data set. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Individual"},{"key":"e_1_3_2_1_9_1","unstructured":"household  household"},{"key":"e_1_3_2_1_10_1","unstructured":"electric  electric"},{"key":"e_1_3_2_1_11_1","unstructured":"power  power"},{"key":"e_1_3_2_1_12_1","volume-title":"Oct 30","year":"2018","unstructured":"consumption. Retrieved : Oct 30 , 2018 . consumption. Retrieved: Oct 30, 2018."},{"key":"e_1_3_2_1_13_1","volume-title":"Retrieved","year":"2018","unstructured":"The infinite mnist dataset. http:\/\/leon.bottou.org\/projects\/infimnist . Retrieved : July 18, 2018 . The infinite mnist dataset. http:\/\/leon.bottou.org\/projects\/infimnist. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_14_1","volume-title":"https:\/\/docs.microsoft.com\/en-us\/sql\/connect\/python\/pymssql\/python-sql-driver-pymssql. Retrieved","year":"2018","unstructured":"Python sql driver - pymssql. https:\/\/docs.microsoft.com\/en-us\/sql\/connect\/python\/pymssql\/python-sql-driver-pymssql. Retrieved : July 18, 2018 . Python sql driver - pymssql. https:\/\/docs.microsoft.com\/en-us\/sql\/connect\/python\/pymssql\/python-sql-driver-pymssql. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_15_1","volume-title":"Retrieved","year":"2018","unstructured":"Python support for ibm db2 and ibm informix. https:\/\/github.com\/ibmdb\/python-ibmdb . Retrieved : July 18, 2018 . Python support for ibm db2 and ibm informix. https:\/\/github.com\/ibmdb\/python-ibmdb. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_16_1","volume-title":"Retrieved","author":"R","year":"2018","unstructured":"R interface to oracle data mining. http:\/\/www.oracle.com\/technetwork\/database\/options\/odm\/odm-r-integration-089013.html . Retrieved : July 18, 2018 . R interface to oracle data mining. http:\/\/www.oracle.com\/technetwork\/database\/options\/odm\/odm-r-integration-089013.html. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_17_1","volume-title":"https:\/\/docs.microsoft.com\/en-us\/sql\/advanced-analytics\/r\/revoscaler-overview. Retrieved","year":"2018","unstructured":"Revoscaler. https:\/\/docs.microsoft.com\/en-us\/sql\/advanced-analytics\/r\/revoscaler-overview. Retrieved : July 18, 2018 . Revoscaler. https:\/\/docs.microsoft.com\/en-us\/sql\/advanced-analytics\/r\/revoscaler-overview. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_18_1","volume-title":"https:\/\/www.kaggle.com\/yelp-dataset\/yelp-dataset. Retrieved","year":"2018","unstructured":"Yelp dataset. https:\/\/www.kaggle.com\/yelp-dataset\/yelp-dataset. Retrieved : July 18, 2018 . Yelp dataset. https:\/\/www.kaggle.com\/yelp-dataset\/yelp-dataset. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304207"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304581"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593667"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_3_2_1_23_1","volume-title":"CIDR","author":"Anderson M. R.","year":"2013","unstructured":"M. R. Anderson , D. Antenucci , V. Bittorf , M. Burgess , M. J. Cafarella , A. Kumar , F. Niu , Y. Park , C. R\u00e9 , and C. Zhang . Brainwash: A data system for feature engineering . In CIDR , 2013 . M. R. Anderson, D. Antenucci, V. Bittorf, M. Burgess, M. J. Cafarella, A. Kumar, F. Niu, Y. Park, C. R\u00e9, and C. Zhang. Brainwash: A data system for feature engineering. In CIDR, 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498272"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872822"},{"key":"e_1_3_2_1_26_1","volume-title":"Practical coreset constructions for machine learning. arXiv preprint arXiv:1703.06476","author":"Bachem O.","year":"2017","unstructured":"O. Bachem , M. Lucic , and A. Krause . Practical coreset constructions for machine learning. arXiv preprint arXiv:1703.06476 , 2017 . O. Bachem, M. Lucic, and A. Krause. Practical coreset constructions for machine learning. arXiv preprint arXiv:1703.06476, 2017."},{"key":"e_1_3_2_1_27_1","volume-title":"Searching for exotic particles in high-energy physics with deep learning. Nature communications","author":"Baldi P.","year":"2014","unstructured":"P. Baldi , P. Sadowski , and D. Whiteson . Searching for exotic particles in high-energy physics with deep learning. Nature communications , 2014 . P. Baldi, P. Sadowski, and D. Whiteson. Searching for exotic particles in high-energy physics with deep learning. Nature communications, 2014."},{"key":"e_1_3_2_1_28_1","volume-title":"ICML","author":"Bardenet R.","year":"2013","unstructured":"R. Bardenet , M. Brendel , B. K\u00e9gl , and M. Sebag . Collaborative hyperparameter tuning . In ICML , 2013 . R. Bardenet, M. Brendel, B. K\u00e9gl, and M. Sebag. Collaborative hyperparameter tuning. In ICML, 2013."},{"key":"e_1_3_2_1_29_1","volume-title":"Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures","author":"Bergstra J.","year":"2013","unstructured":"J. Bergstra , D. Yamins , and D. D. Cox . Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures . 2013 . J. Bergstra, D. Yamins, and D. D. Cox. Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures. 2013."},{"key":"e_1_3_2_1_30_1","volume-title":"NIPS","author":"Bergstra J. S.","year":"2011","unstructured":"J. S. Bergstra , R. Bardenet , Y. Bengio , and B. K\u00e9gl . Algorithms for hyper-parameter optimization . In NIPS , 2011 . J. S. Bergstra, R. Bardenet, Y. Bengio, and B. K\u00e9gl. Algorithms for hyper-parameter optimization. In NIPS, 2011."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722191"},{"key":"e_1_3_2_1_32_1","volume-title":"Pattern recognition and machine learning","author":"Bishop C. M.","year":"2006","unstructured":"C. M. Bishop . Pattern recognition and machine learning . 2006 . C. M. Bishop. Pattern recognition and machine learning. 2006."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007279"},{"key":"e_1_3_2_1_34_1","volume-title":"NIPS","author":"Bottou L.","year":"2008","unstructured":"L. Bottou and O. Bousquet . The tradeoffs of large scale learning . In NIPS , 2008 . L. Bottou and O. Bousquet. The tradeoffs of large scale learning. In NIPS, 2008."},{"key":"e_1_3_2_1_35_1","volume-title":"Optimal subset selection: Multiple regression, interdependence and optimal network algorithms","author":"Boyce D.","year":"2013","unstructured":"D. Boyce , A. Farhi , and R. Weischedel . Optimal subset selection: Multiple regression, interdependence and optimal network algorithms . 2013 . D. Boyce, A. Farhi, and R. Weischedel. Optimal subset selection: Multiple regression, interdependence and optimal network algorithms. 2013."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242526"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783332"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688113"},{"key":"e_1_3_2_1_39_1","volume-title":"NSDI","author":"Crankshaw D.","year":"2017","unstructured":"D. Crankshaw , X. Wang , G. Zhou , M. J. Franklin , J. E. Gonzalez , and I. Stoica . Clipper: A low-latency online prediction serving system . In NSDI , 2017 . D. Crankshaw, X. Wang, G. Zhou, M. J. Franklin, J. E. Gonzalez, and I. Stoica. Clipper: A low-latency online prediction serving system. In NSDI, 2017."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080248"},{"key":"e_1_3_2_1_41_1","volume-title":"NIPS","author":"Derezinski M.","year":"2017","unstructured":"M. Derezinski and M. K. Warmuth . Unbiased estimates for linear regression via volume sampling . In NIPS , 2017 . M. Derezinski and M. K. Warmuth. Unbiased estimates for linear regression via volume sampling. In NIPS, 2017."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687675"},{"key":"e_1_3_2_1_43_1","volume-title":"JMLR","author":"Drineas P.","year":"2012","unstructured":"P. Drineas , M. Magdon-Ismail , M. W. Mahoney , and D. P. Woodruff . Fast approximation of matrix coherence and statistical leverage . JMLR , 2012 . P. Drineas, M. Magdon-Ismail, M. W. Mahoney, and D. P. Woodruff. Fast approximation of matrix coherence and statistical leverage. JMLR, 2012."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109682"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"e_1_3_2_1_46_1","author":"Duchi J.","year":"2011","unstructured":"J. Duchi , E. Hazan , and Y. Singer . Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research , 2011 . J. Duchi, E. Hazan, and Y. Singer. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 2011.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994515"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993712"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627920"},{"key":"e_1_3_2_1_50_1","volume-title":"NIPS","author":"Feurer M.","year":"2015","unstructured":"M. Feurer , A. Klein , K. Eggensperger , J. Springenberg , M. Blum , and F. Hutter . Efficient and robust automated machine learning . In NIPS , 2015 . M. Feurer, A. Klein, K. Eggensperger, J. Springenberg, M. Blum, and F. Hutter. Efficient and robust automated machine learning. In NIPS, 2015."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.snb.2015.03.028"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634127"},{"key":"e_1_3_2_1_53_1","volume-title":"JMLR","author":"Gittens A.","year":"2016","unstructured":"A. Gittens and M. W. Mahoney . Revisiting the nystr\u00f6m method for improved large-scale machine learning . JMLR , 2016 . A. Gittens and M. W. Mahoney. Revisiting the nystr\u00f6m method for improved large-scale machine learning. JMLR, 2016."},{"key":"e_1_3_2_1_54_1","volume-title":"Asynchronous complex analytics in a distributed dataflow architecture. arXiv preprint arXiv:1510.07092","author":"Gonzalez J. E.","year":"2015","unstructured":"J. E. Gonzalez , P. Bailis , M. I. Jordan , M. J. Franklin , J. M. Hellerstein , A. Ghodsi , and I. Stoica . Asynchronous complex analytics in a distributed dataflow architecture. arXiv preprint arXiv:1510.07092 , 2015 . J. E. Gonzalez, P. Bailis, M. I. Jordan, M. J. Franklin, J. M. Hellerstein, A. Ghodsi, and I. Stoica. Asynchronous complex analytics in a distributed dataflow architecture. arXiv preprint arXiv:1510.07092, 2015."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944968"},{"key":"e_1_3_2_1_56_1","volume-title":"Omnivore: An optimizer for multi-device deep learning on cpus and gpus. arXiv preprint arXiv:1606.04487","author":"Hadjis S.","year":"2016","unstructured":"S. Hadjis , C. Zhang , I. Mitliagkas , D. Iter , and C. R\u00e9 . Omnivore: An optimizer for multi-device deep learning on cpus and gpus. arXiv preprint arXiv:1606.04487 , 2016 . S. Hadjis, C. Zhang, I. Mitliagkas, D. Iter, and C. R\u00e9. Omnivore: An optimizer for multi-device deep learning on cpus and gpus. arXiv preprint arXiv:1606.04487, 2016."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193538"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367510"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9833-9"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196892"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035933"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/3091574.3091590"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882940"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137664"},{"key":"e_1_3_2_1_66_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma D.","year":"2014","unstructured":"D. Kingma and J. Ba . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 , 2014 . D. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.127"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935694.2935698"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723713"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882952"},{"key":"e_1_3_2_1_71_1","volume-title":"ICML","author":"Le Q. V.","year":"2011","unstructured":"Q. V. Le , J. Ngiam , A. Coates , A. Lahiri , B. Prochnow , and A. Y. Ng . On optimization methods for deep learning . In ICML , 2011 . Q. V. Le, J. Ngiam, A. Coates, A. Lahiri, B. Prochnow, and A. Y. Ng. On optimization methods for deep learning. In ICML, 2011."},{"key":"e_1_3_2_1_72_1","volume-title":"Efficient sampling for k-determinantal point processes. arXiv preprint arXiv:1509.01618","author":"Li C.","year":"2015","unstructured":"C. Li , S. Jegelka , and S. Sra . Efficient sampling for k-determinantal point processes. arXiv preprint arXiv:1509.01618 , 2015 . C. Li, S. Jegelka, and S. Sra. Efficient sampling for k-determinantal point processes. arXiv preprint arXiv:1509.01618, 2015."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_3_2_1_74_1","volume-title":"JMLR","author":"Lin C.-J.","year":"2008","unstructured":"C.-J. Lin , R. C. Weng , and S. S. Keerthi . Trust region newton method for logistic regression . JMLR , 2008 . C.-J. Lin, R. C. Weng, and S. S. Keerthi. Trust region newton method for logistic regression. JMLR, 2008."},{"key":"e_1_3_2_1_75_1","volume-title":"JMLR","author":"Lucic M.","year":"2017","unstructured":"M. Lucic , M. Faulkner , A. Krause , and D. Feldman . Training gaussian mixture models at scale via coresets . JMLR , 2017 . M. Lucic, M. Faulkner, A. Krause, and D. Feldman. Training gaussian mixture models at scale via coresets. JMLR, 2017."},{"key":"e_1_3_2_1_76_1","volume-title":"ICML","author":"Maclaurin D.","year":"2015","unstructured":"D. Maclaurin , D. Duvenaud , and R. Adams . Gradient-based hyperparameter optimization through reversible learning . In ICML , 2015 . D. Maclaurin, D. Duvenaud, and R. Adams. Gradient-based hyperparameter optimization through reversible learning. In ICML, 2015."},{"key":"e_1_3_2_1_77_1","volume-title":"ICML","author":"Martens J.","year":"2010","unstructured":"J. Martens . Deep learning via hessian-free optimization . In ICML , 2010 . J. Martens. Deep learning via hessian-free optimization. In ICML, 2010."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371238"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056098"},{"key":"e_1_3_2_1_80_1","volume-title":"A handbook for building an approximate query engine","author":"Mozafari B.","year":"2015","unstructured":"B. Mozafari and N. Niu . A handbook for building an approximate query engine . IEEE Data Eng. Bull ., 2015 . B. Mozafari and N. Niu. A handbook for building an approximate query engine. IEEE Data Eng. Bull., 2015."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447867"},{"key":"e_1_3_2_1_82_1","volume-title":"NIPS","author":"Musco C.","year":"2017","unstructured":"C. Musco and C. Musco . Recursive sampling for the nystrom method . In NIPS , 2017 . C. Musco and C. Musco. Recursive sampling for the nystrom method. In NIPS, 2017."},{"key":"e_1_3_2_1_83_1","volume-title":"Large sample estimation and hypothesis testing. Handbook of econometrics","author":"Newey W. K.","year":"1994","unstructured":"W. K. Newey and D. McFadden . Large sample estimation and hypothesis testing. Handbook of econometrics , 1994 . W. K. Newey and D. McFadden. Large sample estimation and hypothesis testing. Handbook of econometrics, 1994."},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015435"},{"key":"e_1_3_2_1_85_1","volume-title":"ICML","author":"Ogawa K.","year":"2013","unstructured":"K. Ogawa , Y. Suzuki , and I. Takeuchi . Safe screening of non-support vectors in pathwise svm computation . In ICML , 2013 . K. Ogawa, Y. Suzuki, and I. Takeuchi. Safe screening of non-support vectors in pathwise svm computation. In ICML, 2013."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_3_2_1_87_1","volume-title":"Hemingway: modeling distributed optimization algorithms. arXiv","author":"Pan X.","year":"2017","unstructured":"X. Pan , S. Venkataraman , Z. Tai , and J. Gonzalez . Hemingway: modeling distributed optimization algorithms. arXiv , 2017 . X. Pan, S. Venkataraman, Z. Tai, and J. Gonzalez. Hemingway: modeling distributed optimization algorithms. arXiv, 2017."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850589"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498287"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196905"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064013"},{"key":"e_1_3_2_1_92_1","volume-title":"JMLR","author":"Pedregosa F.","year":"2011","unstructured":"F. Pedregosa , G. Varoquaux , A. Gramfort , V. Michel , B. Thirion , O. Grisel , M. Blondel , P. Prettenhofer , R. Weiss , V. Dubourg , J. Vanderplas , A. Passos , D. Cournapeau , M. Brucher , M. Perrot , and E. Duchesnay . Scikit-learn: Machine learning in Python . JMLR , 2011 . F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit-learn: Machine learning in Python. JMLR, 2011."},{"key":"e_1_3_2_1_93_1","volume-title":"NIPS","author":"Recht B.","year":"2011","unstructured":"B. Recht , C. Re , S. Wright , and F. Niu . Hogwild: A lock-free approach to parallelizing stochastic gradient descent . In NIPS , 2011 . B. Recht, C. Re, S. Wright, and F. Niu. Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In NIPS, 2011."},{"key":"e_1_3_2_1_94_1","volume-title":"AISTATS","author":"Salakhutdinov R.","year":"2010","unstructured":"R. Salakhutdinov and H. Larochelle . Efficient learning of deep boltzmann machines . In AISTATS , 2010 . R. Salakhutdinov and H. Larochelle. Efficient learning of deep boltzmann machines. In AISTATS, 2010."},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882939"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390273"},{"key":"e_1_3_2_1_98_1","volume-title":"Measuring the effects of data parallelism on neural network training","author":"Shallue C. J.","year":"2018","unstructured":"C. J. Shallue , J. Lee , J. Antognini , J. Sohl-Dickstein , R. Frostig , and G. E. Dahl . Measuring the effects of data parallelism on neural network training . 2018 . C. J. Shallue, J. Lee, J. Antognini, J. Sohl-Dickstein, R. Frostig, and G. E. Dahl. Measuring the effects of data parallelism on neural network training. 2018."},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809991"},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806945"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.109"},{"key":"e_1_3_2_1_102_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2013.19"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487629"},{"key":"e_1_3_2_1_104_1","volume-title":"Lecture 6.5-rmsprop, coursera: Neural networks for machine learning","author":"Tieleman T.","year":"2012","unstructured":"T. Tieleman and G. Hinton . Lecture 6.5-rmsprop, coursera: Neural networks for machine learning . University of Toronto , Tech. Rep, 2012 . T. Tieleman and G. Hinton. Lecture 6.5-rmsprop, coursera: Neural networks for machine learning. University of Toronto, Tech. Rep, 2012."},{"key":"e_1_3_2_1_105_1","author":"Tipping M. E.","year":"1999","unstructured":"M. E. Tipping and C. M. Bishop . Probabilistic principal component analysis. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , 1999 . M. E. Tipping and C. M. Bishop. Probabilistic principal component analysis. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 1999.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"key":"e_1_3_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1292914"},{"key":"e_1_3_2_1_107_1","volume-title":"BigLearn","author":"Weimer M.","year":"2011","unstructured":"M. Weimer , T. Condie , R. Ramakrishnan , Machine learning in scalops, a higher order cloud computing language . In BigLearn , 2011 . M. Weimer, T. Condie, R. Ramakrishnan, et al. Machine learning in scalops, a higher order cloud computing language. In BigLearn, 2011."},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"e_1_3_2_1_109_1","volume-title":"Retrieved","author":"Xing E.","year":"2018","unstructured":"E. Xing . Vc dimension and model complexity. https:\/\/www.cs.cmu.edu\/ epxing\/Class\/10701\/slides\/lecture16-VC.pdf . Retrieved : July 18, 2018 . E. Xing. Vc dimension and model complexity. https:\/\/www.cs.cmu.edu\/ epxing\/Class\/10701\/slides\/lecture16-VC.pdf. Retrieved: July 18, 2018."},{"key":"e_1_3_2_1_110_1","volume-title":"TPAML","author":"Yang A. Y.","year":"2007","unstructured":"A. Y. Yang , J. Wright , Y. Ma , and S. S. Sastry . Feature selection in face recognition: A sparse representation perspective . TPAML , 2007 . A. Y. Yang, J. Wright, Y. Ma, and S. S. Sastry. Feature selection in face recognition: A sparse representation perspective. TPAML, 2007."},{"key":"e_1_3_2_1_111_1","volume-title":"an adaptive learning rate method. arXiv preprint arXiv:1212.5701","author":"Zeiler M. D.","year":"2012","unstructured":"M. D. Zeiler . Adadelta : an adaptive learning rate method. arXiv preprint arXiv:1212.5701 , 2012 . M. D. Zeiler. Adadelta: an adaptive learning rate method. arXiv preprint arXiv:1212.5701, 2012."},{"key":"e_1_3_2_1_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588579"},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593678"},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2733001"},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638950"},{"key":"e_1_3_2_1_116_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447819"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2019 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300077","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300077","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3299869.3300077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:16Z","timestamp":1750208536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3299869.3300077"}},"subtitle":["Efficient Maximum Likelihood Estimation with Probabilistic Guarantees"],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":116,"alternative-id":["10.1145\/3299869.3300077","10.1145\/3299869"],"URL":"https:\/\/doi.org\/10.1145\/3299869.3300077","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}