{"id":"https://openalex.org/W4415179787","doi":"https://doi.org/10.23919/ecc65951.2025.11186895","title":"A New Finite-Horizon Dynamic Programming Analysis of Nonanticipative Rate-Distortion Function for Markov Sources","display_name":"A New Finite-Horizon Dynamic Programming Analysis of Nonanticipative Rate-Distortion Function for Markov Sources","publication_year":2025,"publication_date":"2025-06-24","ids":{"openalex":"https://openalex.org/W4415179787","doi":"https://doi.org/10.23919/ecc65951.2025.11186895"},"language":"en","primary_location":{"id":"doi:10.23919/ecc65951.2025.11186895","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11186895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-05317342/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062221455","display_name":"Zixuan He","orcid":"https://orcid.org/0009-0004-7830-831X"},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zixuan He","raw_affiliation_strings":["EURECOM,Foundation and Algorithm Group,Communication Systems Department,France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EURECOM,Foundation and Algorithm Group,Communication Systems Department,France","institution_ids":["https://openalex.org/I1902872"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035087201","display_name":"Charalambos D. Charalambous","orcid":"https://orcid.org/0000-0002-2168-0231"},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Charalambos D. Charalambous","raw_affiliation_strings":["University of Cyprus,Department of Electrical and Computer Engineering,Cyprus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cyprus,Department of Electrical and Computer Engineering,Cyprus","institution_ids":["https://openalex.org/I34771391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111606657","display_name":"Photios A. Stavrou","orcid":null},"institutions":[{"id":"https://openalex.org/I1902872","display_name":"EURECOM","ror":"https://ror.org/00sse7z02","country_code":"FR","type":"education","lineage":["https://openalex.org/I1902872","https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Photios A. Stavrou","raw_affiliation_strings":["EURECOM,Foundation and Algorithm Group,Communication Systems Department,France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EURECOM,Foundation and Algorithm Group,Communication Systems Department,France","institution_ids":["https://openalex.org/I1902872"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"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":"749","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.8079000115394592,"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"}},"topics":[{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.8079000115394592,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.7645999789237976,"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/convexity","display_name":"Convexity","score":0.5701000094413757},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5342000126838684},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5166000127792358},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5164999961853027},{"id":"https://openalex.org/keywords/lossy-compression","display_name":"Lossy compression","score":0.5151000022888184},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.48660001158714294},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.45320001244544983},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4334000051021576},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.43050000071525574},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.415800005197525}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5946000218391418},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.5701000094413757},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5342000126838684},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5166000127792358},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5164999961853027},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.5151000022888184},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.48660001158714294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4756999909877777},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.45320001244544983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4521999955177307},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4334000051021576},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.43050000071525574},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.415800005197525},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4016000032424927},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3849000036716461},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.3637999892234802},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.3384000062942505},{"id":"https://openalex.org/C64185310","wikidata":"https://www.wikidata.org/wiki/Q843483","display_name":"Rate\u2013distortion theory","level":3,"score":0.334199994802475},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.32739999890327454},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.3230000138282776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32260000705718994},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C126780896","wikidata":"https://www.wikidata.org/wiki/Q899871","display_name":"Distortion (music)","level":4,"score":0.29820001125335693},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.29760000109672546},{"id":"https://openalex.org/C106666656","wikidata":"https://www.wikidata.org/wiki/Q6771323","display_name":"Markov kernel","level":5,"score":0.2944999933242798},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.28529998660087585},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.2840999960899353},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.27880001068115234},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C2779954242","wikidata":"https://www.wikidata.org/wiki/Q6031227","display_name":"Information structure","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25189998745918274},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/ecc65951.2025.11186895","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc65951.2025.11186895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Control Conference (ECC)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05317342v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05317342","pdf_url":"https://hal.science/hal-05317342/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ECC 2025, European Control Conference, IEEE, Jun 2025, Thessaloniki, Greece. pp.749-754, ⟨10.23919/ECC65951.2025.11186895⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05317342v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05317342","pdf_url":"https://hal.science/hal-05317342/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ECC 2025, European Control Conference, IEEE, Jun 2025, Thessaloniki, Greece. pp.749-754, ⟨10.23919/ECC65951.2025.11186895⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415179787.pdf","grobid_xml":"https://content.openalex.org/works/W4415179787.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,12,18,41,50,85,93,108,123,148,151,166],"computation":[4],"of":[5,24,147,168],"a":[6,36,68,78,99,144],"non-asymptotic":[7],"lower":[8],"bound,":[9],"given":[10],"by":[11],"nonanticipative":[13],"rate-distortion":[14],"function":[15,113],"(NRDF),":[16],"for":[17,40,137],"discrete-time":[19],"zero-delay":[20],"variable-rate":[21],"lossy":[22],"compression":[23],"discrete":[25],"Markov":[26,163],"sources":[27,164],"under":[28],"per-stage":[29,129],"single-letter":[30],"distortion":[31],"constraints.":[32],"We":[33,121],"first":[34],"derive":[35,88],"new":[37,44],"information":[38,74],"structure":[39],"NRDF":[42,149],"and":[43,75,97,111,126],"convexity":[45],"results":[46,159],"that":[47,71,135],"allow":[48],"reformulating":[49],"problem":[51],"as":[52,150],"an":[53,131],"unconstrained":[54],"partially":[55],"observable":[56],"finite-horizon":[57],"stochastic":[58],"dynamic":[59],"program":[60],"(DP)":[61],"using":[62,130,160],"Lagrange":[63],"duality":[64],"theorem":[65],"subject":[66],"to":[67,105],"belief":[69,152],"state":[70,153],"summarizes":[72],"past":[73],"evolves":[76],"in":[77],"continuous":[79],"space.":[80],"Rather":[81],"than":[82],"directly":[83],"approximating":[84],"DP,":[86],"we":[87],"implicit":[89],"optimal":[90],"conditions":[91,96],"via":[92],"Karush-Kuhn-Tucker":[94],"(KKT)":[95],"propose":[98],"novel":[100],"alternating":[101],"minimization":[102],"(AM)":[103],"scheme":[104],"approximate":[106],"both":[107],"control":[109,124],"policy":[110],"cost-to-go":[112,127],"through":[114],"backward":[115],"recursions":[116],"with":[117],"provable":[118],"convergence":[119],"guarantees.":[120],"evaluate":[122],"policies":[125],"functions":[128],"online":[132],"forward":[133],"algorithm":[134],"executes":[136],"any":[138],"finite":[139],"horizon.":[140],"Our":[141],"methodology":[142],"yields":[143],"near-optimal":[145],"approximation":[146],"space":[154],"becomes":[155],"sufficiently":[156],"large.":[157],"Simulation":[158],"time-varying":[161],"binary":[162],"validate":[165],"effectiveness":[167],"our":[169],"approach.":[170]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-15T00:00:00"}