{"id":"https://openalex.org/W1985142965","doi":"https://doi.org/10.1145/1542362.1542370","title":"Coresets for polytope distance","display_name":"Coresets for polytope distance","publication_year":2009,"publication_date":"2009-06-08","ids":{"openalex":"https://openalex.org/W1985142965","doi":"https://doi.org/10.1145/1542362.1542370","mag":"1985142965"},"language":"en","primary_location":{"id":"doi:10.1145/1542362.1542370","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542362.1542370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/229256","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017124525","display_name":"Bernd G\u00e4rtner","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Bernd G\u00e4rtner","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073756389","display_name":"Martin Jaggi","orcid":"https://orcid.org/0000-0003-1579-5558"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Martin Jaggi","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017124525"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":5.3011,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.95747868,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.9245814085006714},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6662117838859558},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.60931396484375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5480508804321289},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5177459120750427},{"id":"https://openalex.org/keywords/margin","display_name":"Margin (machine learning)","score":0.5107319355010986},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.4844394028186798},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45825067162513733},{"id":"https://openalex.org/keywords/perceptron","display_name":"Perceptron","score":0.4326930046081543},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.4150470495223999},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3801601231098175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38007113337516785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33716773986816406},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22157418727874756},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.20810475945472717},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07765284180641174}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.9245814085006714},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6662117838859558},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.60931396484375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5480508804321289},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5177459120750427},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.5107319355010986},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4844394028186798},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45825067162513733},{"id":"https://openalex.org/C60908668","wikidata":"https://www.wikidata.org/wiki/Q690207","display_name":"Perceptron","level":3,"score":0.4326930046081543},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.4150470495223999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3801601231098175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38007113337516785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33716773986816406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22157418727874756},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.20810475945472717},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07765284180641174},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1542362.1542370","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1542362.1542370","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.3011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.3011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.m8j.net/data/List/Files-143/Coresets%20for%20Polytope%20Distance%20-%20Martins%20Version.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.8692","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://delivery.acm.org/10.1145/1550000/1542370/p33-gartner.pdf?CFID%3D285707620%26CFTOKEN%3D20203871%26__acm__%3D1362046528_1fbfb90b3d98796925837087b455f23c%26acc%3DACTIVE+SERVICE%26ip%3D130.203.136.92","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:229256","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/229256","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:229256","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/229256","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3015932448","display_name":"Support vector machines: Geometry, Combinatorics and Algorithms","funder_award_id":"121957","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G3344625169","display_name":null,"funder_award_id":"20PA21-121957","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1512098439","https://openalex.org/W1534663718","https://openalex.org/W1545509459","https://openalex.org/W1597196612","https://openalex.org/W1604585277","https://openalex.org/W1604938182","https://openalex.org/W1640313366","https://openalex.org/W1947474278","https://openalex.org/W1977263019","https://openalex.org/W1981313592","https://openalex.org/W1987492370","https://openalex.org/W2040870580","https://openalex.org/W2059651397","https://openalex.org/W2061383870","https://openalex.org/W2063958549","https://openalex.org/W2064380440","https://openalex.org/W2073620032","https://openalex.org/W2098641446","https://openalex.org/W2105867876","https://openalex.org/W2114296668","https://openalex.org/W2133629339","https://openalex.org/W2136885855","https://openalex.org/W2138745909","https://openalex.org/W2139212933","https://openalex.org/W2155319834","https://openalex.org/W2159168492","https://openalex.org/W2162302594","https://openalex.org/W2166282318","https://openalex.org/W2166316739","https://openalex.org/W2166479660","https://openalex.org/W2170756173","https://openalex.org/W2247953682","https://openalex.org/W2567465089","https://openalex.org/W2621075174","https://openalex.org/W3193477162","https://openalex.org/W4285719527","https://openalex.org/W6631932664","https://openalex.org/W6635671133","https://openalex.org/W6636597629","https://openalex.org/W6681915100","https://openalex.org/W6690901460"],"related_works":["https://openalex.org/W3012067785","https://openalex.org/W2139627488","https://openalex.org/W4288417334","https://openalex.org/W1854884900","https://openalex.org/W4297969877","https://openalex.org/W2963837916","https://openalex.org/W3211516828","https://openalex.org/W2778515850","https://openalex.org/W2950031786","https://openalex.org/W4280529077"],"abstract_inverted_index":{"Following":[0],"recent":[1],"work":[2],"of":[3,13,53,58,83,89,97,101,145],"Clarkson,":[4],"we":[5,79,92,130],"translate":[6],"the":[7,11,15,19,25,51,81,102,113,116,119,133,143],"coreset":[8,125],"framework":[9],"to":[10,18,118],"problems":[12],"finding":[14,24],"point":[16],"closest":[17],"origin":[20],"inside":[21],"a":[22,84,87],"polytope,":[23,85],"shortest":[26],"distance":[27],"between":[28],"two":[29,120],"polytopes,":[30],"Perceptrons,":[31],"and":[32,47,67,110,115,139,147],"soft-":[33],"as":[34,36,65],"well":[35],"hard-margin":[37],"Support":[38],"Vector":[39],"Machines":[40],"(SVM).":[41],"We":[42],"prove":[43,93,136],"asymptotically":[44],"matching":[45,137],"upper":[46,138],"lower":[48,140],"bounds":[49,126,141],"on":[50],"size":[52,59],"coresets,":[54],"stating":[55],"that":[56,68,129],"\u00b5-coresets":[57],"(1+o(1))":[60],"E*/\u00b5":[61],"do":[62],"always":[63],"exist":[64],"\u00b5-0,":[66],"this":[69],"is":[70,77],"best":[71],"possible.":[72],"The":[73],"crucial":[74],"quantity":[75],"E*":[76],"what":[78],"call":[80],"excentricity":[82],"or":[86],"pair":[88],"polytopes.":[90],"Additionally,":[91],"linear":[94],"convergence":[95],"speed":[96],"Gilbert's":[98],"algorithm,":[99],"one":[100],"earliest":[103],"known":[104],"approximation":[105],"algorithms":[106],"for":[107,132,142],"polytope":[108,121],"distance,":[109],"generalize":[111],"both":[112],"algorithm":[114],"proof":[117],"case.":[122],"Interestingly,":[123],"our":[124],"also":[127],"imply":[128],"can":[131],"first":[134],"time":[135],"sparsity":[144],"Perceptron":[146],"SVM":[148],"solutions.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}