{"id":"https://openalex.org/W7131667651","doi":"https://doi.org/10.48550/arxiv.2602.22146","title":"Provable Last-Iterate Convergence for Multi-Objective Safe LLM Alignment via Optimistic Primal-Dual","display_name":"Provable Last-Iterate Convergence for Multi-Objective Safe LLM Alignment via Optimistic Primal-Dual","publication_year":2026,"publication_date":"2026-02-25","ids":{"openalex":"https://openalex.org/W7131667651","doi":"https://doi.org/10.48550/arxiv.2602.22146"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.22146","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/A5040395286","display_name":"Yining Li","orcid":"https://orcid.org/0000-0003-1753-0887"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li, Yining","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126885151","display_name":"Peizhong Ju","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ju, Peizhong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5035752536","display_name":"Ness B. Shroff","orcid":"https://orcid.org/0000-0002-4606-6879"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shroff, Ness","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040395286"],"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/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.18930000066757202,"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/T12026","display_name":"Explainable Artificial Intelligence (XAI)","score":0.18930000066757202,"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/T10028","display_name":"Topic Modeling","score":0.1809999942779541,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.04989999905228615,"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/convergence","display_name":"Convergence (economics)","score":0.6970000267028809},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.593500018119812},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5630999803543091},{"id":"https://openalex.org/keywords/divergence","display_name":"Divergence (linguistics)","score":0.4706999957561493},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4027000069618225},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.39320001006126404},{"id":"https://openalex.org/keywords/closing","display_name":"Closing (real estate)","score":0.3919999897480011}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6970000267028809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6154000163078308},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607200026512146},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.593500018119812},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5630999803543091},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4027000069618225},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39320001006126404},{"id":"https://openalex.org/C2778775528","wikidata":"https://www.wikidata.org/wiki/Q5135432","display_name":"Closing (real estate)","level":2,"score":0.3919999897480011},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29510000348091125},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2773999869823456}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.22146","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.22146","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.22146","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.22146","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":{"Reinforcement":[0],"Learning":[1],"from":[2],"Human":[3],"Feedback":[4],"(RLHF)":[5],"plays":[6,167],"a":[7,29,40,75,84,144,168,181],"significant":[8],"role":[9,170],"in":[10,48,60,67,137,171],"aligning":[11],"Large":[12],"Language":[13],"Models":[14],"(LLMs)":[15],"with":[16,21,39],"human":[17],"preferences.":[18],"While":[19],"RLHF":[20,81],"expected":[22],"reward":[23],"constraints":[24],"can":[25],"be":[26],"formulated":[27],"as":[28],"primal-dual":[30,34,53,77,106],"optimization":[31,136],"problem,":[32],"standard":[33,52],"methods":[35,54],"only":[36],"guarantee":[37],"convergence":[38,126,142],"distributional":[41,139],"policy":[42,65,135],"where":[43],"the":[44,61,129,138,147],"saddle-point":[45,121],"problem":[46],"is":[47,152],"convex-concave":[49],"form.":[50],"Moreover,":[51],"may":[55],"exhibit":[56],"instability":[57],"or":[58],"divergence":[59],"last":[62],"iterate":[63],"under":[64,159],"parameterization":[66],"practical":[68,189],"applications.":[69],"In":[70],"this":[71,100],"work,":[72],"we":[73,102],"propose":[74],"universal":[76],"framework":[78],"for":[79,113,128],"safe":[80],"that":[82,109,165],"unifies":[83],"broad":[85],"class":[86],"of":[87,146],"existing":[88],"alignment":[89,177],"algorithms,":[90],"including":[91],"safe-RLHF,":[92],"one-shot,":[93],"and":[94,116,141,157,188],"multi-shot":[95],"based":[96],"methods.":[97],"Building":[98],"on":[99],"framework,":[101],"introduce":[103],"an":[104],"optimistic":[105],"(OPD)":[107],"algorithm":[108],"incorporates":[110],"predictive":[111],"updates":[112],"both":[114,133],"primal":[115],"dual":[117],"variables":[118],"to":[119,143,154,175],"stabilize":[120],"dynamics.":[122],"We":[123],"establish":[124],"last-iterate":[125],"guarantees":[127],"proposed":[130],"method,":[131],"covering":[132],"exact":[134],"space":[140],"neighborhood":[145],"optimal":[148],"solution":[149],"whose":[150],"gap":[151,184],"related":[153],"approximation":[155],"error":[156],"bias":[158],"parameterized":[160],"policies.":[161],"Our":[162],"analysis":[163],"reveals":[164],"optimism":[166],"crucial":[169],"mitigating":[172],"oscillations":[173],"inherent":[174],"constrained":[176,186],"objectives,":[178],"thereby":[179],"closing":[180],"key":[182],"theoretical":[183],"between":[185],"RL":[187],"RLHF.":[190]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-27T00:00:00"}