{"id":"https://openalex.org/W7128739501","doi":"https://doi.org/10.48550/arxiv.2602.10917","title":"Near-Constant Strong Violation and Last-Iterate Convergence for Online CMDPs via Decaying Safety Margins","display_name":"Near-Constant Strong Violation and Last-Iterate Convergence for Online CMDPs via Decaying Safety Margins","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128739501","doi":"https://doi.org/10.48550/arxiv.2602.10917"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.10917","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/A5125690149","display_name":"Qian Zuo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zuo, Qian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125757201","display_name":"Zhiyong Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zhiyong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635369","display_name":"Fengxiang He","orcid":"https://orcid.org/0000-0001-5584-2385"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"He, Fengxiang","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.18513599,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6065000295639038,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6065000295639038,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.2037999927997589,"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/T13553","display_name":"Age of Information Optimization","score":0.12309999763965607,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7372000217437744},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6740000247955322},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5267999768257141},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4893999993801117},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.4609000086784363},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4417000114917755},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4334999918937683},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.41999998688697815}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7372000217437744},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6740000247955322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.620199978351593},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4893999993801117},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4562000036239624},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4417000114917755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4359000027179718},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4334999918937683},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.41999998688697815},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.4178999960422516},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.33809998631477356},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32580000162124634},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C167964875","wikidata":"https://www.wikidata.org/wiki/Q17011487","display_name":"Exponential stability","level":3,"score":0.2800999879837036},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2522999942302704}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.10917","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.10917","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10917","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":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.10917","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":[{"id":"https://metadata.un.org/sdg/16","score":0.8423864245414734,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"safe":[2],"online":[3],"reinforcement":[4],"learning":[5],"in":[6],"Constrained":[7],"Markov":[8],"Decision":[9],"Processes":[10],"(CMDPs)":[11],"under":[12],"strong":[13,30,36,72,77],"regret":[14,32,78],"and":[15,79,88,123],"violation":[16,38,74],"metrics,":[17],"which":[18],"forbid":[19],"error":[20],"cancellation":[21],"over":[22],"time.":[23],"Existing":[24],"primal-dual":[25,93],"methods":[26],"that":[27],"achieve":[28,69],"sublinear":[29,76],"reward":[31],"inevitably":[33],"incur":[34],"growing":[35],"constraint":[37,73],"or":[39],"are":[40],"restricted":[41],"to":[42,46,67,113,130],"average-iterate":[43],"convergence":[44,139],"due":[45],"inherent":[47],"oscillations.":[48],"To":[49],"address":[50],"these":[51],"limitations,":[52],"we":[53,135],"propose":[54],"the":[55,65,92,107,116,121],"Flexible":[56],"safety":[57,86,108],"Domain":[58],"Optimization":[59],"via":[60,141],"Margin-regularized":[61],"Exploration":[62],"(FlexDOME)":[63],"algorithm,":[64],"first":[66],"provably":[68],"near-constant":[70,132],"$\\tilde{O}(1)$":[71],"alongside":[75],"non-asymptotic":[80,137],"last-iterate":[81,138],"convergence.":[82],"FlexDOME":[83],"incorporates":[84],"time-varying":[85],"margins":[87],"regularization":[89],"terms":[90],"into":[91],"framework.":[94],"Our":[95],"theoretical":[96,149],"analysis":[97],"relies":[98],"on":[99],"a":[100,131,142],"novel":[101],"term-wise":[102],"asymptotic":[103],"dominance":[104],"strategy,":[105],"where":[106],"margin":[109],"is":[110],"rigorously":[111],"scheduled":[112],"asymptotically":[114],"majorize":[115],"functional":[117],"decay":[118],"rates":[119],"of":[120],"optimization":[122],"statistical":[124],"errors,":[125],"thereby":[126],"clamping":[127],"cumulative":[128],"violations":[129],"level.":[133],"Furthermore,":[134],"establish":[136],"guarantees":[140],"policy-dual":[143],"Lyapunov":[144],"argument.":[145],"Experiments":[146],"corroborate":[147],"our":[148],"findings.":[150]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-02-13T00:00:00"}