{"id":"https://openalex.org/W7127974468","doi":"https://doi.org/10.48550/arxiv.2602.04200","title":"Restoring Sparsity in Potts Machines via Mean-Field Constraints","display_name":"Restoring Sparsity in Potts Machines via Mean-Field Constraints","publication_year":2026,"publication_date":"2026-02-04","ids":{"openalex":"https://openalex.org/W7127974468","doi":"https://doi.org/10.48550/arxiv.2602.04200"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.04200","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/A5123074933","display_name":"Kevin Callahan-Coray","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Callahan-Coray, Kevin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011557836","display_name":"K. Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Kyle","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125119576","display_name":"Kyle Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Kyle","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124110810","display_name":"Kerem Y. Camsari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Camsari, Kerem Y.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5123074933"],"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/T11321","display_name":"Error Correcting Code Techniques","score":0.1386999934911728,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.1386999934911728,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.09430000185966492,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.07109999656677246,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7588000297546387},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7587000131607056},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6201000213623047},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5145000219345093},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5095000267028809},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4772000014781952},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4675000011920929},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44780001044273376}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7588000297546387},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7587000131607056},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6201000213623047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5967000126838684},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5145000219345093},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4772000014781952},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4675000011920929},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4251999855041504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40619999170303345},{"id":"https://openalex.org/C51329190","wikidata":"https://www.wikidata.org/wiki/Q1076349","display_name":"Ising model","level":2,"score":0.40549999475479126},{"id":"https://openalex.org/C98925819","wikidata":"https://www.wikidata.org/wiki/Q7235385","display_name":"Potts model","level":3,"score":0.3993000090122223},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39430001378059387},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.3873000144958496},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3871000111103058},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3698999881744385},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3336000144481659},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26019999384880066},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.04200","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.04200","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.04200","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.04200","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Ising":[0,64],"machines":[1],"and":[2,14,30],"related":[3],"probabilistic":[4,51,150],"hardware":[5,31],"have":[6],"emerged":[7],"as":[8],"promising":[9],"platforms":[10],"for":[11,49,145],"NP-hard":[12],"optimization":[13,148],"sampling.":[15],"However,":[16],"many":[17],"practical":[18,124],"problems":[19],"involve":[20],"constraints":[21,84],"that":[22,54,89],"induce":[23],"dense":[24,58,91],"or":[25],"all-to-all":[26,112],"couplings,":[27],"undermining":[28],"scalability":[29],"efficiency.":[32],"We":[33,66],"address":[34],"this":[35],"constraint-induced":[36],"density":[37],"through":[38],"two":[39],"complementary":[40],"approaches.":[41],"First,":[42],"we":[43,81,121],"introduce":[44],"a":[45,86,143],"hardware-aware":[46],"native":[47],"formulation":[48],"multi-state":[50],"digits":[52],"(p-dits)":[53],"avoids":[55],"the":[56,76,123],"locally":[57],"intra-variable":[59],"couplings":[60,94],"required":[61],"by":[62,70,129],"binary":[63],"encodings.":[65],"validate":[67],"p-dit":[68],"dynamics":[69],"reproducing":[71],"known":[72],"critical":[73],"behavior":[74],"of":[75,126],"2D":[77],"Potts":[78],"model.":[79],"Second,":[80],"propose":[82],"mean-field":[83],"(MFC),":[85],"hybrid":[87],"scheme":[88],"replaces":[90],"pairwise":[92],"constraint":[93,113],"with":[95],"dynamically":[96],"updated":[97],"single-node":[98],"biases.":[99],"Applied":[100],"to":[101,110],"balanced":[102],"graph":[103,118],"partitioning,":[104],"MFC":[105],"achieves":[106],"solution":[107],"quality":[108],"comparable":[109],"exact":[111],"formulations":[114],"while":[115],"dramatically":[116],"reducing":[117],"density.":[119],"Finally,":[120],"demonstrate":[122],"impact":[125],"restored":[127],"sparsity":[128],"an":[130],"FPGA":[131],"implementation,":[132],"enabling":[133],"orders-of-magnitude":[134],"acceleration":[135],"over":[136],"CPU-based":[137],"solvers.":[138],"Together,":[139],"these":[140],"results":[141],"outline":[142],"pathway":[144],"scaling":[146],"constrained":[147],"on":[149],"hardware.":[151]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-07T00:00:00"}
