{"id":"https://openalex.org/W7128646478","doi":"https://doi.org/10.48550/arxiv.2602.09398","title":"Escaping Local Minima: A Finite-Time Markov Chain Analysis of Constant-Temperature Simulated Annealing","display_name":"Escaping Local Minima: A Finite-Time Markov Chain Analysis of Constant-Temperature Simulated Annealing","publication_year":2026,"publication_date":"2026-02-10","ids":{"openalex":"https://openalex.org/W7128646478","doi":"https://doi.org/10.48550/arxiv.2602.09398"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.09398","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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/A5119920620","display_name":"Hansini Ramachandran","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ramachandran, Hansini","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125654763","display_name":"Bhaskar Krishnamachari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krishnamachari, Bhaskar","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5119920620"],"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.14300000667572021,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.14300000667572021,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.1177000030875206,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.11249999701976776,"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/markov-chain","display_name":"Markov chain","score":0.7275000214576721},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6121000051498413},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5468000173568726},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5453000068664551},{"id":"https://openalex.org/keywords/expression","display_name":"Expression (computer science)","score":0.4514000117778778},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4237000048160553},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4205000102519989},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.4189000129699707},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41449999809265137}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7275000214576721},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6322000026702881},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6121000051498413},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5654000043869019},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5468000173568726},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5453000068664551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5152999758720398},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.4514000117778778},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4237000048160553},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4205000102519989},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.4189000129699707},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.40459999442100525},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.39800000190734863},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.36629998683929443},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3416999876499176},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C163175372","wikidata":"https://www.wikidata.org/wiki/Q3339222","display_name":"Linear model","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2759000062942505},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C205147927","wikidata":"https://www.wikidata.org/wiki/Q752718","display_name":"Asymptotic analysis","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C68767595","wikidata":"https://www.wikidata.org/wiki/Q1677999","display_name":"Contiguity","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.2574000060558319}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.09398","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.09398","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.09398","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":"pmh:doi:10.48550/arxiv.2602.09398","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","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":{"Simulated":[0],"Annealing":[1],"(SA)":[2],"is":[3,16],"a":[4,31,40,53,60,69,74,92,108,121,125,128,149,175],"widely":[5],"used":[6,169],"stochastic":[7],"optimization":[8],"algorithm,":[9],"yet":[10],"much":[11],"of":[12,87,110,151,174],"its":[13],"theoretical":[14],"understanding":[15],"limited":[17],"to":[18,67,91,107,120,138,170],"asymptotic":[19],"convergence":[20,106],"guarantees":[21],"or":[22],"general":[23],"spectral":[24],"bounds.":[25],"In":[26],"this":[27,80],"paper,":[28],"we":[29,97,159],"develop":[30],"finite-time":[32],"analytical":[33],"framework":[34],"for":[35,63,134],"constant-temperature":[36],"SA":[37,51],"by":[38],"studying":[39],"piecewise":[41],"linear":[42,71],"cost":[43],"function":[44,150],"that":[45,79],"permits":[46],"exact":[47,132],"characterization.":[48],"We":[49,77,115],"model":[50],"as":[52,148],"discrete-state":[54],"Markov":[55],"chain":[56],"and":[57,100,127,156],"first":[58],"derive":[59],"closed-form":[61],"expression":[62,81],"the":[64,85,118,135,140,145,162,172],"expected":[65,136],"time":[66,137,166],"escape":[68,165],"single":[70],"basin":[72,152,164],"in":[73,112],"one-dimensional":[75],"landscape.":[76],"show":[78],"also":[82],"accurately":[83],"predicts":[84],"behavior":[86],"continuous-state":[88],"searches":[89],"up":[90],"constant":[93],"scaling":[94],"factor,":[95],"which":[96],"analyze":[98],"empirically":[99],"explain":[101],"via":[102],"variance":[103],"matching,":[104],"demonstrating":[105],"factor":[109],"sqrt(3)":[111],"certain":[113],"regimes.":[114],"then":[116],"extend":[117],"analysis":[119],"two-basin":[122],"landscape":[123],"containing":[124],"local":[126,146],"global":[129,141],"optimum,":[130,147],"obtaining":[131],"expressions":[133],"reach":[139],"optimum":[142],"starting":[143],"from":[144],"geometry,":[153],"neighborhood":[154],"radius,":[155],"temperature.":[157],"Finally,":[158],"demonstrate":[160],"how":[161],"predicted":[163],"can":[167],"be":[168],"guide":[171],"design":[173],"simple":[176],"two-temperature":[177],"switching":[178],"strategy.":[179]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-12T00:00:00"}