{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:48:33Z","timestamp":1781912913675,"version":"3.54.5"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/ijcnn.2015.7280694","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T21:48:02Z","timestamp":1443736082000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["From cutting planes algorithms to compression schemes and active learning"],"prefix":"10.1109","author":[{"given":"Ugo","family":"Louche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liva","family":"Ralaivola","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.1.99"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0519"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544727X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"ref37","article-title":"Ultraconservative online algorithms for multiclass problems","author":"crammer","year":"2003","journal-title":"JMLR"},{"key":"ref36","first-page":"441","article-title":"Toward optimal active learning through sampling estimation of error reduction","author":"roy","year":"2001","journal-title":"ICML"},{"key":"ref35","article-title":"Active boosted learning (actboost)","author":"trapeznikov","year":"2011","journal-title":"AISTATS"},{"key":"ref34","article-title":"Expectation propagation for approximate bayesian infer-ence","author":"minka","year":"2013","journal-title":"CoRR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref11","article-title":"Optimized cutting plane algorithm for large-scale risk minimization","author":"franc","year":"2009","journal-title":"JMLR"},{"key":"ref12","article-title":"Bundle methods for regularized risk minimization","author":"teo","year":"2010","journal-title":"JMLR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2200\/S00429ED1V01Y201207AIM018"},{"key":"ref14","article-title":"Adaptive submodularity: A new approach to active learning and stochastic optimization","author":"golovin","year":"2010","journal-title":"CoRR"},{"key":"ref15","article-title":"Efficient active learning of halfspaces: an aggressive approach","author":"gonen","year":"2013","journal-title":"JMLR"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72927-3_5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2099-5_1"},{"key":"ref18","article-title":"The cutting plane method for solving convex programs","author":"kelley","year":"1960","journal-title":"SIAM"},{"key":"ref19","article-title":"Cutting plane algorithms from analytic centers: efficiency estimates","author":"nesterov","year":"1995","journal-title":"Mathematical Programming"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580439"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.5.3.388"},{"key":"ref27","article-title":"Localization and cutting-plane meth-ods","author":"boyd","year":"2008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007662407062"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.34.123"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-038-x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1037\/h0042519"},{"key":"ref7","article-title":"On convergence proofs on perceptrons","author":"novikoff","year":"1962","journal-title":"Proceedings of the Symposium on the Mathematical Theory of Automata"},{"key":"ref2","article-title":"Bayes point machines","author":"herbrich","year":"2001","journal-title":"JMLR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993593"},{"key":"ref1","article-title":"Svm active learning with applications to text classification","author":"tong","year":"2002","journal-title":"JMLR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/080742506"},{"key":"ref22","article-title":"The perceptron algorithm with uneven margins","author":"li","year":"2002"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-0462-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1960.10.1257"},{"key":"ref23","article-title":"Online passive-aggressive algorithms","author":"crammer","year":"2006","journal-title":"JMLR"},{"key":"ref26","article-title":"On an algorithm for the minimization of convex functions","author":"levin","year":"1965","journal-title":"Soviet Math Doklady"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/321281.321291"}],"event":{"name":"2015 International Joint Conference on Neural Networks (IJCNN)","location":"Killarney, Ireland","start":{"date-parts":[[2015,7,12]]},"end":{"date-parts":[[2015,7,17]]}},"container-title":["2015 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7256526\/7280295\/07280694.pdf?arnumber=7280694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T21:08:03Z","timestamp":1490389683000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7280694\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2015.7280694","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}