{"id":"https://openalex.org/W7130569996","doi":"https://doi.org/10.48550/arxiv.2602.16028","title":"Markov Chains with Rewinding","display_name":"Markov Chains with Rewinding","publication_year":2026,"publication_date":"2026-02-17","ids":{"openalex":"https://openalex.org/W7130569996","doi":"https://doi.org/10.48550/arxiv.2602.16028"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.16028","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":"article","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/A5049819184","display_name":"Amir Azarmehr","orcid":"https://orcid.org/0009-0005-6451-3985"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Azarmehr, Amir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125649300","display_name":"Soheil Behnezhad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Behnezhad, Soheil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104278897","display_name":"Alma Ghafari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghafari, Alma","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039861396","display_name":"Madhu Sudan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudan, Madhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15346489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T12288","display_name":"Optimization and Search Problems","score":0.1559000015258789,"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/T12288","display_name":"Optimization and Search Problems","score":0.1559000015258789,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.09239999949932098,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.09109999984502792,"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.8385999798774719},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.572700023651123},{"id":"https://openalex.org/keywords/variable-order-markov-model","display_name":"Variable-order Markov model","score":0.4853000044822693},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.4262999892234802},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4259999990463257},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4172999858856201},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3752000033855438},{"id":"https://openalex.org/keywords/markov-property","display_name":"Markov property","score":0.3691999912261963},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.3578999936580658}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.8385999798774719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5820000171661377},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.572700023651123},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.4853000044822693},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.4262999892234802},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4259999990463257},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4172999858856201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39169999957084656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38589999079704285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38280001282691956},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.3691999912261963},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.3578999936580658},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3310000002384186},{"id":"https://openalex.org/C93457212","wikidata":"https://www.wikidata.org/wiki/Q4669888","display_name":"Absorbing Markov chain","level":5,"score":0.3301999866962433},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.30230000615119934},{"id":"https://openalex.org/C97074811","wikidata":"https://www.wikidata.org/wiki/Q6771322","display_name":"Markov chain mixing time","level":5,"score":0.2989000082015991},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C163540672","wikidata":"https://www.wikidata.org/wiki/Q1115431","display_name":"Markov renewal process","level":5,"score":0.29089999198913574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C76408418","wikidata":"https://www.wikidata.org/wiki/Q5419314","display_name":"Examples of Markov chains","level":5,"score":0.28700000047683716},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C106666656","wikidata":"https://www.wikidata.org/wiki/Q6771323","display_name":"Markov kernel","level":5,"score":0.2540000081062317},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.16028","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.16028","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16028","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,"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":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.16028","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,56],"techniques":[2],"developed":[3],"in":[4,111,122,130,142,215,287],"recent":[5],"progress":[6],"on":[7,66],"lower":[8],"bounds":[9],"for":[10],"sublinear":[11],"time":[12],"algorithms":[13],"(Behnezhad,":[14],"Roghani":[15],"and":[16,22,27,135,278],"Rubinstein,":[17],"STOC":[18,23],"2023,":[19,21],"FOCS":[20],"2024)":[24],"we":[25,37,136,227],"introduce":[26,228],"study":[28,103],"a":[29,50,112,164,212,229,260,269,282],"new":[30],"class":[31],"of":[32,88,106,119,152,178,218,240,271,273],"randomized":[33],"algorithmic":[34],"processes":[35],"that":[36,93,149,197,272,280],"call":[38],"Markov":[39,60,91,116,124],"Chains":[40],"with":[41,49,99,155,163],"Rewinding.":[42],"In":[43],"this":[44,69,120,255],"setting,":[45],"an":[46],"algorithm":[47],"interacts":[48],"(partially":[51],"observable)":[52],"Markovian":[53],"random":[54],"evolution":[55,73],"strategically":[57],"rewinding":[58,157,166,170,183,213,262],"the":[59,67,72,80,89,104,108,127,131,140,179,216,234,238,274],"chain":[61,92],"to":[62,74,82,138,188,202,211,244,253],"previous":[63,203],"states.":[64],"Depending":[65],"application,":[68],"may":[70,94],"lead":[71],"desired":[75],"states":[76,153],"faster,":[77],"or":[78,85,97],"allow":[79],"agent":[81],"efficiently":[83],"learn":[84],"test":[86],"properties":[87],"underlying":[90],"be":[95,161,186,189],"infeasible":[96],"inefficient":[98],"passive":[100,194],"observation.":[101],"We":[102,258],"task":[105],"identifying":[107],"initial":[109],"state":[110],"given":[113],"partially":[114],"observable":[115],"chain.":[117],"Analysis":[118],"question":[121],"specific":[123],"chains":[125],"is":[126,148,252,267,285],"central":[128],"ingredient":[129],"above":[132],"cited":[133],"works":[134],"aim":[137],"systematize":[139],"analysis":[141],"our":[143],"work.":[144],"Our":[145,248],"first":[146],"result":[147],"any":[150,156,176],"pair":[151],"distinguishable":[154,246],"strategy":[158,167,214,263],"can":[159,185],"also":[160],"distinguished":[162],"non-adaptive":[165,261],"(one":[168],"whose":[169,264],"choices":[171],"are":[172],"determined":[173],"before":[174],"observing":[175],"outcomes":[177],"chain).":[180],"Therefore,":[181],"while":[182],"strategies":[184,195],"shown":[187],"strictly":[190],"more":[191],"powerful":[192],"than":[193],"(those":[196],"do":[198],"not":[199,207],"rewind":[200],"back":[201],"states),":[204],"adaptivity":[205],"does":[206],"give":[208],"additional":[209],"power":[210],"absence":[217],"efficiency":[219,231,256],"considerations.":[220],"The":[221],"difference":[222],"becomes":[223],"apparent":[224],"however":[225],"when":[226],"natural":[230],"measure,":[232],"namely":[233],"query":[235,265],"complexity":[236,266],"(i.e.,":[237],"number":[239],"observations":[241],"they":[242],"need":[243],"identify":[245],"states).":[247],"second":[249],"main":[250],"contribution":[251],"quantify":[254],"gap.":[257],"present":[259],"within":[268],"polynomial":[270,283],"optimal":[275],"(adaptive)":[276],"strategy,":[277],"show":[279],"such":[281],"loss":[284],"necessary":[286],"general.":[288]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-20T00:00:00"}