{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:20Z","timestamp":1781077700773,"version":"3.54.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1609\/19"],"award-info":[{"award-number":["1609\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Amazon Research Award"},{"name":"BGU Data Science Research Center"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1109\/tit.2021.3134898","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T21:07:38Z","timestamp":1639429658000},"page":"1976-1984","source":"Crossref","is-referenced-by-count":4,"title":["Learning Convex Polyhedra With Margin"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3355-351X","authenticated-orcid":false,"given":"Lee-Ad","family":"Gottlieb","sequence":"first","affiliation":[{"name":"Department of Computer Science, Ariel University, Ariel, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1428-1486","authenticated-orcid":false,"given":"Eran","family":"Kaufman","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ariel University, Ariel, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8038-8671","authenticated-orcid":false,"given":"Aryeh","family":"Kontorovich","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5960-4253","authenticated-orcid":false,"given":"Gabriel","family":"Nivasch","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ariel University, Ariel, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00254-G"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00115-1"},{"key":"ref4","first-page":"1020","article-title":"Efficient learning of simplices","volume-title":"Proc. 26th Annu. Conf. Learn. Theory","author":"Anderson"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2006.12.025"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129746"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-6265-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0512-8"},{"key":"ref9","first-page":"42","article-title":"A new approach to strongly polynomial linear programming","volume-title":"Innovations in Computer Science","author":"B\u00e1r\u00e1sz","year":"2010"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1130.003.0007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00038-2"},{"key":"ref12","first-page":"41","article-title":"Optimal partitions for the sum and the maximum of eigenvalues","volume-title":"Proc. 14th Int. Conf. Zaragoza-Pau Math. Appl.","author":"Bogosel"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9889-1"},{"key":"ref14","volume-title":"Notes on the Khachiyan-Kalantari Algorithm","year":"2018"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3_14"},{"key":"ref16","article-title":"Learning neural networks with two nonlinear layers in polynomial time","author":"Goel","year":"2017","journal-title":"arXiv:1709.06010"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3134898"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.08.030"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/180139.181124"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.018"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1011"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00067-9"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref24","first-page":"522","article-title":"Learning halfspaces under log-concave densities: Polynomial approximations and moment matching","volume-title":"Proc. 26th Annual Conf. Learn. Theory","author":"Kane"},{"key":"ref25","first-page":"3248","article-title":"Large-margin convex polytope machine","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kantchelian"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.04.012"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.07.008"},{"key":"ref30","article-title":"Fat-shattering dimension of K-fold maxima","author":"Kontorovich","year":"2021","journal-title":"arXiv:2110.04763"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-020-4475-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013834"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7"},{"key":"ref34","volume-title":"Understanding and Using Linear Programming (Universitext)","author":"Matou\u0161ek","year":"2006"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187916"},{"key":"ref36","volume-title":"Complexity of Finding a Consistent Hyperplane","author":"Nikolov","year":"2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/09500830500229501"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10853-007-2439-3"},{"key":"ref39","first-page":"1","article-title":"Learning convex bodies is hard","volume-title":"Proc. 22nd Conf. Learn. Theory","author":"Rademacher ad N. Goyal"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1142\/9789812792815_0045"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref42","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"Vershynin","year":"2010","journal-title":"arXiv:1011.3027"},{"issue":"6","key":"ref43","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","article-title":"Linea napproximability max clique chromatic number","volume":"3","author":"Zuckerman","year":"2007","journal-title":"Theory Comput."}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9715731\/09646969.pdf?arnumber=9646969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:15:39Z","timestamp":1706058939000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9646969\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3134898","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}