{"id":"https://openalex.org/W7154455397","doi":"https://doi.org/10.48550/arxiv.2604.12811","title":"Algorithmic Analysis of Dense Associative Memory: Finite-Size Guarantees and Adversarial Robustness","display_name":"Algorithmic Analysis of Dense Associative Memory: Finite-Size Guarantees and Adversarial Robustness","publication_year":2026,"publication_date":"2026-04-14","ids":{"openalex":"https://openalex.org/W7154455397","doi":"https://doi.org/10.48550/arxiv.2604.12811"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2604.12811","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.12811","pdf_url":"https://arxiv.org/pdf/2604.12811","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2604.12811","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027878968","display_name":"Madhava Gaikwad","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gaikwad, Madhava","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5027878968"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10320","display_name":"Neural Networks and Applications","score":0.9804999828338623,"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/T10320","display_name":"Neural Networks and Applications","score":0.9804999828338623,"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/T10581","display_name":"Neural dynamics and brain function","score":0.0027000000700354576,"subfield":{"id":"https://openalex.org/subfields/2805","display_name":"Cognitive Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dense-associative-memory","display_name":"dense associative memory","score":0.996999979019165},{"id":"https://openalex.org/keywords/hopfield-neural-network","display_name":"Hopfield neural network","score":0.8640000224113464},{"id":"https://openalex.org/keywords/higher-order-interactions","display_name":"higher-order interactions","score":0.6990000009536743},{"id":"https://openalex.org/keywords/storage-capacity","display_name":"storage capacity","score":0.7289999723434448},{"id":"https://openalex.org/keywords/retrieval-dynamics","display_name":"retrieval dynamics","score":0.7329999804496765},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.699999988079071},{"id":"https://openalex.org/keywords/adversarial-robustness","display_name":"adversarial robustness","score":0.8190000057220459},{"id":"https://openalex.org/keywords/margin-condition","display_name":"margin condition","score":0.871999979019165},{"id":"https://openalex.org/keywords/pattern-separation","display_name":"pattern separation","score":0.781000018119812},{"id":"https://openalex.org/keywords/potential-games","display_name":"potential games","score":0.6299999952316284},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.8569999933242798},{"id":"https://openalex.org/keywords/asynchronous-updates","display_name":"asynchronous updating","score":0.7300000190734863},{"id":"https://openalex.org/keywords/basins-of-attraction","display_name":"basins of attraction","score":0.8930000066757202}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6696000099182129},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6294000148773193},{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.5145000219345093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5141000151634216},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5005999803543091},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4645000100135803},{"id":"https://openalex.org/C159423971","wikidata":"https://www.wikidata.org/wiki/Q177251","display_name":"Associative property","level":2,"score":0.45210000872612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4255000054836273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34880000352859497},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32839998602867126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31360000371932983},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C53442348","wikidata":"https://www.wikidata.org/wiki/Q745101","display_name":"Content-addressable memory","level":3,"score":0.2766999900341034},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2734000086784363},{"id":"https://openalex.org/C95763700","wikidata":"https://www.wikidata.org/wiki/Q578985","display_name":"Convergence of random variables","level":3,"score":0.26579999923706055},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26260000467300415}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2604.12811","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.12811","pdf_url":"https://arxiv.org/pdf/2604.12811","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2604.12811","doi":"https://doi.org/10.48550/arxiv.2604.12811","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.12811","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2604.12811","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.12811","pdf_url":"https://arxiv.org/pdf/2604.12811","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7154455397.pdf","grobid_xml":"https://content.openalex.org/works/W7154455397.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3210710606","https://openalex.org/W4414892904","https://openalex.org/W2990162075","https://openalex.org/W3217321225","https://openalex.org/W7213372646","https://openalex.org/W7220727680","https://openalex.org/W4391776157","https://openalex.org/W169131389","https://openalex.org/W4417098719","https://openalex.org/W7116869137"],"abstract_inverted_index":{"Dense":[0],"Associative":[1],"Memory":[2],"(DAM)":[3],"generalizes":[4],"Hopfield":[5],"networks":[6],"through":[7,105],"higher-order":[8],"interactions":[9],"and":[10,36,69,120,184],"achieves":[11],"storage":[12],"capacity":[13,122,185],"that":[14,56,110,124,149,157,178],"scales":[15],"as":[16,126],"$O(N^{n-1})$":[17],"under":[18,60,164],"suitable":[19],"pattern":[20,63,144],"separation":[21,67],"conditions.":[22,64],"Existing":[23],"dynamical":[24],"analyses":[25],"primarily":[26],"study":[27],"the":[28,91,94,112,133,138,172,180],"thermodynamic":[29],"limit":[30],"$N\\to\\infty$":[31],"with":[32,175],"randomly":[33],"sampled":[34],"patterns":[35],"therefore":[37],"do":[38],"not":[39],"provide":[40],"finite-size":[41],"guarantees":[42,59,123],"or":[43],"explicit":[44,107],"convergence":[45,79,88,159],"rates.":[46],"We":[47,98],"develop":[48],"an":[49,106],"algorithmic":[50],"analysis":[51],"of":[52,80,96,114],"DAM":[53,150],"retrieval":[54,82,151],"dynamics":[55,152],"yields":[57],"finite-$N$":[58],"explicit,":[61],"verifiable":[62],"Under":[65],"a":[66,70,154],"assumption":[68],"bounded-interference":[71],"condition":[72,109],"at":[73],"high":[74],"loading,":[75],"we":[76,147],"prove":[77],"geometric":[78],"asynchronous":[81,165],"dynamics,":[83],"which":[84],"implies":[85],"$O(\\log":[86],"N)$":[87],"time":[89],"once":[90],"trajectory":[92],"enters":[93],"basin":[95],"attraction.":[97],"further":[99],"establish":[100],"adversarial":[101],"robustness":[102],"bounds":[103],"expressed":[104],"margin":[108],"quantifies":[111],"number":[113],"corrupted":[115],"bits":[116],"tolerable":[117],"per":[118],"sweep,":[119],"derive":[121],"scale":[125],"$\u0398(N^{n-1})$":[127,140],"up":[128],"to":[129,160],"polylogarithmic":[130],"factors":[131],"in":[132,171],"worst":[134],"case,":[135],"while":[136],"recovering":[137],"classical":[139],"scaling":[141,186],"for":[142],"random":[143],"ensembles.":[145],"Finally,":[146],"show":[148],"admit":[153],"potential-game":[155],"interpretation":[156],"ensures":[158],"pure":[161],"Nash":[162],"equilibria":[163],"updates.":[166],"Complete":[167],"proofs":[168],"are":[169],"provided":[170],"appendices,":[173],"together":[174],"preliminary":[176],"experiments":[177],"illustrate":[179],"predicted":[181],"convergence,":[182],"robustness,":[183],"behavior.":[187]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-04-16T00:00:00"}