{"id":"https://openalex.org/W7162520783","doi":"https://doi.org/10.4230/lipics.socg.2026.80","title":"Hardness of High-Dimensional Linear Classification","display_name":"Hardness of High-Dimensional Linear Classification","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162520783","doi":"https://doi.org/10.4230/lipics.socg.2026.80"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25887","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.80","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.80/LIPIcs.SoCG.2026.80.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.80/LIPIcs.SoCG.2026.80.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023613530","display_name":"Alexander Munteanu","orcid":"https://orcid.org/0000-0001-6549-3270"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Munteanu, Alexander","raw_affiliation_strings":["TU Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066638486","display_name":"Simon Omlor","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Omlor, Simon","raw_affiliation_strings":["TU Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017619650","display_name":"Jeff M. Phillips","orcid":"https://orcid.org/0000-0003-1169-2965"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Phillips, Jeff M.","raw_affiliation_strings":["University of Utah, Salt Lake City, UT, USA"],"raw_orcid":"https://orcid.org/0000-0003-1169-2965","affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT, USA","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64386129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.3447999954223633,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12404","display_name":"Mathematical Approximation and Integration","score":0.3447999954223633,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.21089999377727509,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11540000140666962,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/degeneracy","display_name":"Degeneracy (biology)","score":0.775600016117096},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.746999979019165},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.743399977684021},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5636000037193298},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5629000067710876},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5299999713897705},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4970000088214874},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48989999294281006}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8274999856948853},{"id":"https://openalex.org/C2777727622","wikidata":"https://www.wikidata.org/wiki/Q5251772","display_name":"Degeneracy (biology)","level":2,"score":0.775600016117096},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.746999979019165},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.743399977684021},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5636000037193298},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5629000067710876},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5299999713897705},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4970000088214874},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48989999294281006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42829999327659607},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4169999957084656},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.36910000443458557},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3668999969959259},{"id":"https://openalex.org/C207221997","wikidata":"https://www.wikidata.org/wiki/Q938614","display_name":"Affine combination","level":3,"score":0.36239999532699585},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3028999865055084},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C55974624","wikidata":"https://www.wikidata.org/wiki/Q1188504","display_name":"Exponential family","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25887","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.80","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.80/LIPIcs.SoCG.2026.80.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.80","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.80","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25887","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.80","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.80/LIPIcs.SoCG.2026.80.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162520783.pdf","grobid_xml":"https://content.openalex.org/works/W7162520783.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,59],"establish":[1],"new":[2],"exponential":[3,55],"in":[4,22,28,56,130],"dimension":[5,57],"lower":[6,48,84],"bounds":[7,41,49,85],"for":[8,73],"the":[9,54,111],"Maximum":[10],"Halfspace":[11],"Discrepancy":[12],"problem,":[13],"which":[14,120],"models":[15],"linear":[16],"classification.":[17],"Both":[18],"are":[19,42],"fundamental":[20],"problems":[21],"computational":[23,112],"geometry":[24],"and":[25,31,37,44,77,88,96,98,128,134],"machine":[26],"learning":[27],"their":[29],"exact":[30],"approximate":[32],"forms.":[33],"However,":[34],"only":[35],"O(n^d)":[36],"respectively":[38,89,99],"\u00d5(1/\u03b5^d)":[39],"upper":[40],"known":[43],"complemented":[45],"by":[46,67],"polynomial":[47],"that":[50],"do":[51],"not":[52],"support":[53],"dependence.":[58],"close":[60],"this":[61],"gap":[62],"up":[63],"to":[64,116,122],"polylogarithmic":[65],"terms":[66],"reduction":[68],"from":[69],"widely-believed":[70],"hardness":[71],"conjectures":[72],"Affine":[74,93],"Degeneracy":[75,94],"testing":[76],"k-Sum":[78],"problems.":[79],"Our":[80],"reductions":[81],"yield":[82],"matching":[83],"of":[86],"\u03a9\u0303(n^d)":[87],"\u03a9\u0303(1/\u03b5^d)":[90],"based":[91],"on":[92,102],"testing,":[95],"\u03a9\u0303(n^{d/2})":[97],"\u03a9\u0303(1/\u03b5^{d/2})":[100],"conditioned":[101],"k-Sum.":[103],"The":[104],"first":[105],"bound":[106],"also":[107],"holds":[108],"unconditionally":[109],"if":[110],"model":[113],"is":[114],"restricted":[115],"make":[117],"sidedness":[118],"queries,":[119],"corresponds":[121],"a":[123],"widely":[124],"spread":[125],"setting":[126],"implemented":[127],"optimized":[129],"many":[131],"contemporary":[132],"algorithms":[133],"computing":[135],"paradigms.":[136]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}