{"id":"https://openalex.org/W7148389175","doi":"https://doi.org/10.48550/arxiv.2604.00328","title":"Stable algorithms cannot reliably find isolated perceptron solutions","display_name":"Stable algorithms cannot reliably find isolated perceptron solutions","publication_year":2026,"publication_date":"2026-03-31","ids":{"openalex":"https://openalex.org/W7148389175","doi":"https://doi.org/10.48550/arxiv.2604.00328"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.00328","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00328","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":null,"license_id":null,"version":null,"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":"https://doi.org/10.48550/arxiv.2604.00328","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132822200","display_name":"Shuyang Gong","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gong, Shuyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022600724","display_name":"Brice Huang","orcid":"https://orcid.org/0000-0001-5435-9754"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Brice","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067198518","display_name":"Shuangping Li","orcid":"https://orcid.org/0000-0003-3578-1524"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Shuangping","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5012362703","display_name":"Mark Sellke","orcid":"https://orcid.org/0000-0001-9166-8185"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sellke, Mark","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5132822200"],"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5990999937057495,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.5990999937057495,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07460000365972519,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.046300001442432404,"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/intersection","display_name":"Intersection (aeronautics)","score":0.47839999198913574},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4738999903202057},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44020000100135803},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4185999929904938},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4023999869823456},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.39100000262260437},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.36550000309944153},{"id":"https://openalex.org/keywords/resampling","display_name":"Resampling","score":0.33239999413490295},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.32910001277923584},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.3199000060558319}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6502000093460083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.641700029373169},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.47839999198913574},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4738999903202057},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4185999929904938},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4023999869823456},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.36550000309944153},{"id":"https://openalex.org/C150921843","wikidata":"https://www.wikidata.org/wiki/Q1170431","display_name":"Resampling","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.32910001277923584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3246999979019165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3228999972343445},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3199000060558319},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.31949999928474426},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C60908668","wikidata":"https://www.wikidata.org/wiki/Q690207","display_name":"Perceptron","level":3,"score":0.30070000886917114},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2946000099182129},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C138405894","wikidata":"https://www.wikidata.org/wiki/Q3179949","display_name":"Multivariate random variable","level":3,"score":0.2833999991416931},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25870001316070557},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2563999891281128},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2547999918460846},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.00328","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00328","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.00328","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.00328","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":null,"license_id":null,"version":null,"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":{"We":[0,87,112],"study":[1],"the":[2,18,60,91,105,159,179,196,198],"binary":[3],"perceptron,":[4],"a":[5,14,42,77,100,131,192,205],"random":[6,23,193],"constraint":[7,36,73],"satisfaction":[8],"problem":[9],"that":[10,32,41,114,129,165,190],"asks":[11],"to":[12,67,154,204],"find":[13,68],"Boolean":[15],"vector":[16],"in":[17,90],"intersection":[19],"of":[20,28,45,104,145,195,200],"independently":[21],"chosen":[22],"halfspaces.":[24],"A":[25],"striking":[26],"feature":[27],"this":[29,89,163],"model":[30],"is":[31,39,97],"at":[33,70,121,211],"every":[34,126],"positive":[35,72],"density,":[37],"it":[38],"expected":[40],"$1-o_N(1)$":[43,135],"fraction":[44],"solutions":[46,69,169,201],"are":[47,65],"\\emph{strongly":[48],"isolated},":[49],"i.e.":[50],"separated":[51],"from":[52],"all":[53],"others":[54],"by":[55],"Hamming":[56],"distance":[57],"$\u03a9(N)$.":[58],"At":[59],"same":[61],"time,":[62],"efficient":[63],"algorithms":[64,147],"known":[66],"certain":[71],"densities.":[74],"This":[75],"raises":[76],"natural":[78],"question:":[79],"can":[80,107],"any":[81,115],"isolated":[82,110,138,168,207],"solution":[83,132,139,208],"be":[84],"algorithmically":[85],"visible?":[86],"answer":[88],"negative:":[92],"no":[93],"algorithm":[94,117,128],"whose":[95],"output":[96],"stable":[98,116,127,146],"under":[99,158],"tiny":[101],"Gaussian":[102],"resampling":[103],"disorder":[106],"\\emph{reliably}":[108],"locate":[109],"solutions.":[111],"show":[113,185],"has":[118],"success":[119],"probability":[120,134,141],"most":[122],"$\\frac{3\\sqrt{17}-9}{4}+o_N(1)\\leq":[123],"0.84233$.":[124],"Furthermore,":[125],"finds":[130,136],"with":[133,140],"an":[137],"$o_N(1)$.":[142],"The":[143],"class":[144],"we":[148,184],"consider":[149],"includes":[150],"degree-$D$":[151],"polynomials":[152],"up":[153],"$D\\leq":[155],"o(N/\\log":[156],"N)$;":[157],"low-degree":[160],"heuristic":[161],"\\cite{hopkins2018statistical},":[162],"suggests":[164],"locating":[166],"strongly":[167],"requires":[170],"running":[171],"time":[172],"$\\exp(\\widetilde\u0398(N))$.":[173],"Our":[174],"proof":[175],"does":[176],"not":[177],"use":[178],"overlap":[180],"gap":[181],"property.":[182],"Instead,":[183],"via":[186],"Pitt's":[187],"correlation":[188],"inequality":[189],"after":[191],"perturbation":[194],"disorder,":[197],"number":[199],"located":[202],"close":[203],"pre-existing":[206],"cannot":[209],"concentrate":[210],"$1$.":[212]},"counts_by_year":[],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2026-04-03T00:00:00"}