{"id":"https://openalex.org/W7130725074","doi":"https://doi.org/10.48550/arxiv.2602.17493","title":"Learning with Boolean threshold functions","display_name":"Learning with Boolean threshold functions","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7130725074","doi":"https://doi.org/10.48550/arxiv.2602.17493"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.17493","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118975106","display_name":"Veit Elser","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Elser, Veit","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5065397681","display_name":"Manish Krishan Lal","orcid":"https://orcid.org/0000-0002-1950-9603"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lal, Manish Krishan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5118975106"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.2849000096321106,"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"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.2849000096321106,"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/T11948","display_name":"Machine Learning in Materials Science","score":0.10980000346899033,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.05689999833703041,"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/boolean-function","display_name":"Boolean function","score":0.6506999731063843},{"id":"https://openalex.org/keywords/interpretability","display_name":"Interpretability","score":0.6428999900817871},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5429999828338623},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.48260000348091125},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.46140000224113464},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4359999895095825},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4260999858379364},{"id":"https://openalex.org/keywords/disjunctive-normal-form","display_name":"Disjunctive normal form","score":0.414900004863739},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.40290001034736633},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.38260000944137573}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6506999731063843},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.6428999900817871},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5059999823570251},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.48260000348091125},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.46140000224113464},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.454800009727478},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.414900004863739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41260001063346863},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40310001373291016},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39719998836517334},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.38260000944137573},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.34869998693466187},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.3467999994754791},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.31869998574256897},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.2955999970436096},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.29260000586509705},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.27320000529289246},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.26510000228881836},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.262800008058548},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.2615000009536743}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.17493","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.17493","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.17493","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"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":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.17493","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"develop":[1],"a":[2,44,51,61,114,146,186],"method":[3,39,164],"for":[4,192,200],"training":[5,57],"neural":[6,196],"networks":[7,30,135],"on":[8,117],"Boolean":[9,52],"data":[10],"in":[11,171,194],"which":[12],"the":[13,23,78,97,118,126,163],"values":[14],"at":[15],"all":[16],"nodes":[17],"are":[18,26,34,129],"strictly":[19],"$\\pm":[20,36,142],"1$,":[21],"and":[22,56,76,89,132,158,188,202],"resulting":[24],"models":[25],"typically":[27],"equivalent":[28,133],"to":[29,106,134],"whose":[31],"nonzero":[32],"weights":[33],"also":[35],"1$.":[37],"The":[38,99],"replaces":[40],"loss":[41],"minimization":[42],"with":[43,86,141,198],"nonconvex":[45],"constraint":[46,112,183],"formulation.":[47],"Each":[48,110],"node":[49],"implements":[50],"threshold":[53],"function":[54],"(BTF),":[55],"is":[58,104,123],"expressed":[59],"through":[60],"divide-and-concur":[62],"decomposition":[63],"into":[64],"two":[65],"complementary":[66],"constraints:":[67],"one":[68],"enforces":[69],"local":[70],"BTF":[71,111],"consistency":[72],"between":[73],"inputs,":[74],"weights,":[75],"output;":[77],"other":[79],"imposes":[80],"architectural":[81],"concurrence,":[82],"equating":[83],"neuron":[84],"outputs":[85],"downstream":[87],"inputs":[88],"enforcing":[90],"weight":[91],"equality":[92],"across":[93],"training-data":[94],"instantiations":[95],"of":[96,137,148],"network.":[98],"reflect-reflect-relax":[100],"(RRR)":[101],"projection":[102],"algorithm":[103],"used":[105],"reconcile":[107],"these":[108],"constraints.":[109],"includes":[113],"lower":[115],"bound":[116,122],"margin.":[119],"When":[120],"this":[121],"sufficiently":[124],"large,":[125],"learned":[127],"representations":[128],"provably":[130],"sparse":[131],"composed":[136],"simple":[138],"logical":[139],"gates":[140],"1$":[143],"weights.":[144],"Across":[145],"range":[147],"tasks":[149],"--":[150,162],"including":[151],"multiplier-circuit":[152],"discovery,":[153],"binary":[154],"autoencoding,":[155],"logic-network":[156],"inference,":[157],"cellular":[159],"automata":[160],"learning":[161,193],"achieves":[165],"exact":[166],"solutions":[167],"or":[168],"strong":[169],"generalization":[170],"regimes":[172],"where":[173],"standard":[174],"gradient-based":[175],"methods":[176],"struggle.":[177],"These":[178],"results":[179],"demonstrate":[180],"that":[181],"projection-based":[182],"satisfaction":[184],"provides":[185],"viable":[187],"conceptually":[189],"distinct":[190],"foundation":[191],"discrete":[195],"systems,":[197],"implications":[199],"interpretability":[201],"efficient":[203],"inference.":[204]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-21T00:00:00"}
