{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:51:15Z","timestamp":1648871475718},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"SERB-DST","award":["ECR\/2016\/002035"],"award-info":[{"award-number":["ECR\/2016\/002035"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10994-018-5729-x","type":"journal-article","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T15:03:52Z","timestamp":1530198232000},"page":"575-594","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved linear embeddings via Lagrange duality"],"prefix":"10.1007","volume":"108","author":[{"given":"Kshiteej","family":"Sheth","sequence":"first","affiliation":[]},{"given":"Dinesh","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Anirban","family":"Dasgupta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,28]]},"reference":[{"issue":"1\u20133","key":"5729_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0012-365X(03)00227-9","volume":"273","author":"N Alon","year":"2003","unstructured":"Alon, N. (2003). Problems and results in extremal combinatorics. Discrete Mathematics, 273(1\u20133), 31\u201353.","journal-title":"Discrete Mathematics"},{"key":"5729_CR2","doi-asserted-by":"crossref","unstructured":"Badoiu, M., Har-Peled, S., & Indyk, P. (2002). Approximate clustering via core-sets. In Proceedings of the 34th annual ACM symposium on theory of computing (STOC), May 19\u201321, 2002, Montr\u00e9al, Qu\u00e9bec, Canada (pp. 250\u2013257).","DOI":"10.1145\/509907.509947"},{"key":"5729_CR3","doi-asserted-by":"crossref","unstructured":"Bah, B., Becker, S., Cevher, V., & Gozcu, B. (2014). Metric learning with rank and sparsity constraints. In IEEE international conference on acoustics, speech and signal processing (ICASSP 2014), Florence, Italy, May 4\u20139, 2014 (pp. 21\u201325).","DOI":"10.1109\/ICASSP.2014.6853550"},{"key":"5729_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"issue":"3\u20134","key":"5729_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S. (2015). Convex optimization: Algorithms and complexity. Foundations and Trends in Machine Learning, 8(3\u20134), 231\u2013357.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5729_CR6","doi-asserted-by":"crossref","unstructured":"Grant, E., Hegde, C., & Indyk, P. (2013). Nearly optimal linear embeddings into very low dimensions. In IEEE global conference on signal and information processing, GlobalSIP 2013, Austin, TX, USA, December 3\u20135, 2013 (pp. 973\u2013976).","DOI":"10.1109\/GlobalSIP.2013.6737055"},{"issue":"22","key":"5729_CR7","doi-asserted-by":"publisher","first-page":"6109","DOI":"10.1109\/TSP.2015.2452228","volume":"63","author":"C Hegde","year":"2015","unstructured":"Hegde, C., Sankaranarayanan, A. C., Yin, W., & Baraniuk, R. G. (2015). Numax: A convex approach for learning near-isometric linear embeddings. IEEE Transactions on Signal Processing, 63(22), 6109\u20136121.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"5729_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on the theory of computing (STOC), Dallas, Texas, USA, May 23\u201326, 1998 (pp. 604\u2013613).","DOI":"10.1145\/276698.276876"},{"issue":"3","key":"5729_CR9","first-page":"261","volume":"9","author":"TS Jayram","year":"2013","unstructured":"Jayram, T. S., & Woodruff, D. P. (2013). Optimal bounds for Johnson\u2013Lindenstrauss transforms and streaming problems with subconstant error. ACM Transactions on Algorithms (TALG), 9(3), 261\u20132617.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"5729_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, W., B., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (pp. 189\u2013206).","DOI":"10.1090\/conm\/026\/737400"},{"key":"5729_CR11","unstructured":"LeCun, Y., Cortes, C., & Burges, C. J. (2010). MNIST handwritten digit database. AT&T Labs\n                           (online). \n                    http:\/\/yann.lecun.com\/exdb\/mnist\n                    \n                  , 2."},{"key":"5729_CR12","unstructured":"Luo, J., Shapiro, K., Shi, Hao-Jun, M., Yang, Q., & Zhu, K. (2016). Practical algorithms for learning near-isometric linear embeddings. arXiv preprint \n                    arXiv:1601.00062\n                    \n                  ."},{"key":"5729_CR13","unstructured":"Wang, W., & Carreira-Perpinan, M. A. (2013). Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application. arXiv preprint \n                    arXiv:1309.1541\n                    \n                  ."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5729-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5729-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5729-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:04:06Z","timestamp":1561680246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5729-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,28]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["5729"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5729-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,28]]},"assertion":[{"value":"10 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}