{"id":"https://openalex.org/W4312278848","doi":"https://doi.org/10.1109/icpr56361.2022.9956482","title":"Combinatorial optimization for low bit-width neural networks","display_name":"Combinatorial optimization for low bit-width neural networks","publication_year":2022,"publication_date":"2022-08-21","ids":{"openalex":"https://openalex.org/W4312278848","doi":"https://doi.org/10.1109/icpr56361.2022.9956482"},"language":"en","primary_location":{"id":"doi:10.1109/icpr56361.2022.9956482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr56361.2022.9956482","pdf_url":null,"source":{"id":"https://openalex.org/S4363607731","display_name":"2022 26th International Conference on Pattern Recognition (ICPR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 26th International Conference on Pattern Recognition (ICPR)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/20.500.12942/700849","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100784566","display_name":"Han Zhou","orcid":"https://orcid.org/0000-0002-1088-7827"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Han Zhou","raw_affiliation_strings":["Center for Processing Speech and Images,Dept. ESAT,KU Leuven,Belgium","Dept. ESAT, Center for Processing Speech and Images, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Processing Speech and Images,Dept. ESAT,KU Leuven,Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Dept. ESAT, Center for Processing Speech and Images, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084441530","display_name":"Aida Ashrafi","orcid":"https://orcid.org/0009-0000-9117-592X"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Aida Ashrafi","raw_affiliation_strings":["University of Bergen,Norway","University of Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen,Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077783791","display_name":"Matthew B. Blaschko","orcid":"https://orcid.org/0000-0002-2640-181X"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Matthew B. Blaschko","raw_affiliation_strings":["Center for Processing Speech and Images,Dept. ESAT,KU Leuven,Belgium","Dept. ESAT, Center for Processing Speech and Images, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Processing Speech and Images,Dept. ESAT,KU Leuven,Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Dept. ESAT, Center for Processing Speech and Images, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":null,"first_page":"2246","last_page":"2252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9986000061035156,"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/submodular-set-function","display_name":"Submodular set function","score":0.7901983261108398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6400852203369141},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.5843394994735718},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.567104697227478},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5654478073120117},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5616673231124878},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5593749284744263},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.526194155216217},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5031039118766785},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48625648021698},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4652828574180603},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.4568406641483307},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4560007154941559},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4520379304885864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44826871156692505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2558963894844055},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24168440699577332},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07844951748847961}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7901983261108398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6400852203369141},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.5843394994735718},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.567104697227478},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5654478073120117},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5616673231124878},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5593749284744263},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.526194155216217},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5031039118766785},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48625648021698},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4652828574180603},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.4568406641483307},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4560007154941559},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4520379304885864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44826871156692505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2558963894844055},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24168440699577332},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07844951748847961},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpr56361.2022.9956482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr56361.2022.9956482","pdf_url":null,"source":{"id":"https://openalex.org/S4363607731","display_name":"2022 26th International Conference on Pattern Recognition (ICPR)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 26th International Conference on Pattern Recognition (ICPR)","raw_type":"proceedings-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/700849","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/700849","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"26th international conference on pattern recognition - ICPR 2022, Montr\u00e9al, Qu\u00e9bec, Canada, 21-25 August 2022","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/700849","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/700849","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"26th international conference on pattern recognition - ICPR 2022, Montr\u00e9al, Qu\u00e9bec, Canada, 21-25 August 2022","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W103281076","https://openalex.org/W1677182931","https://openalex.org/W1902934009","https://openalex.org/W2053381548","https://openalex.org/W2080379754","https://openalex.org/W2110798204","https://openalex.org/W2147800946","https://openalex.org/W2158557760","https://openalex.org/W2300242332","https://openalex.org/W2405920868","https://openalex.org/W2586654419","https://openalex.org/W2963047948","https://openalex.org/W2964200805","https://openalex.org/W2982344224","https://openalex.org/W3008515144","https://openalex.org/W3036174144","https://openalex.org/W3083404835","https://openalex.org/W3132138018","https://openalex.org/W4230674625","https://openalex.org/W4301207789","https://openalex.org/W4312278848","https://openalex.org/W6604182307","https://openalex.org/W6639703010","https://openalex.org/W6676481782","https://openalex.org/W6687785706","https://openalex.org/W6757376125","https://openalex.org/W6784311791"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4379619607","https://openalex.org/W1989453388","https://openalex.org/W2922450688","https://openalex.org/W4313349366","https://openalex.org/W2923536170","https://openalex.org/W2098394614","https://openalex.org/W2703574989"],"abstract_inverted_index":{"Low-bit":[0],"width":[1],"neural":[2,107],"networks":[3],"have":[4,19],"been":[5],"extensively":[6],"explored":[7],"for":[8,100],"deployment":[9],"on":[10,21,146],"edge":[11],"devices":[12],"to":[13,87],"reduce":[14],"computational":[15],"resources.":[16],"Existing":[17],"approaches":[18],"focused":[20],"gradient-based":[22],"optimization":[23,33,72],"in":[24,73],"a":[25,31,88,132],"two-stage":[26],"train-and-compress":[27],"setting":[28],"or":[29],"as":[30],"combined":[32],"where":[34,117],"gradients":[35],"are":[36],"quantized":[37,61],"during":[38,45],"training.":[39],"Such":[40],"schemes":[41],"require":[42],"high-performance":[43],"hardware":[44],"the":[46,60,74,101,120,126],"training":[47],"phase":[48],"and":[49,105,123,138],"usually":[50],"store":[51],"an":[52,97],"equivalent":[53,86],"number":[54],"of":[55,69,76,134],"full-precision":[56],"weights":[57],"apart":[58],"from":[59],"weights.":[62],"In":[63],"this":[64,139],"paper,":[65],"we":[66],"explore":[67],"methods":[68],"direct":[70],"combinatorial":[71],"problem":[75],"risk":[77],"minimization":[78],"with":[79,103],"binary":[80,147],"weights,":[81],"which":[82],"can":[83,142],"be":[84],"made":[85],"non-monotone":[89],"submodular":[90],"maximization":[91],"under":[92],"certain":[93],"conditions.":[94],"We":[95,129],"employ":[96],"approximation":[98],"algorithm":[99],"cases":[102],"single":[104],"multilayer":[106],"networks.":[108],"For":[109],"linear":[110],"models,":[111],"it":[112],"has":[113],"$\\mathcal{O}(nd)$":[114],"time":[115],"complexity":[116],"n":[118],"is":[119,125],"sample":[121],"size":[122],"d":[124],"data":[127],"dimension.":[128],"show":[130],"that":[131],"combination":[133],"greedy":[135],"coordinate":[136],"descent":[137],"novel":[140],"approach":[141],"attain":[143],"competitive":[144],"accuracy":[145],"classification":[148],"tasks.":[149]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}