{"id":"https://openalex.org/W7135077869","doi":"https://doi.org/10.1109/camsap66162.2025.11423967","title":"Unrolling Dynamic Programming via Graph Filters","display_name":"Unrolling Dynamic Programming via Graph Filters","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7135077869","doi":"https://doi.org/10.1109/camsap66162.2025.11423967"},"language":null,"primary_location":{"id":"doi:10.1109/camsap66162.2025.11423967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap66162.2025.11423967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 10th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077468628","display_name":"Sergio Rozada","orcid":"https://orcid.org/0000-0003-1042-7502"},"institutions":[{"id":"https://openalex.org/I182083151","display_name":"Universidad Rey Juan Carlos","ror":"https://ror.org/01v5cv687","country_code":"ES","type":"education","lineage":["https://openalex.org/I182083151"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Sergio Rozada","raw_affiliation_strings":["King Juan Carlos University,Dep. of Signal Theory,Madrid,Spain"],"affiliations":[{"raw_affiliation_string":"King Juan Carlos University,Dep. of Signal Theory,Madrid,Spain","institution_ids":["https://openalex.org/I182083151"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114367813","display_name":"Samuel Rey","orcid":null},"institutions":[{"id":"https://openalex.org/I182083151","display_name":"Universidad Rey Juan Carlos","ror":"https://ror.org/01v5cv687","country_code":"ES","type":"education","lineage":["https://openalex.org/I182083151"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Samuel Rey","raw_affiliation_strings":["King Juan Carlos University,Dep. of Signal Theory,Madrid,Spain"],"affiliations":[{"raw_affiliation_string":"King Juan Carlos University,Dep. of Signal Theory,Madrid,Spain","institution_ids":["https://openalex.org/I182083151"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006078163","display_name":"Gonzalo Mateos","orcid":"https://orcid.org/0000-0002-9847-6298"},"institutions":[{"id":"https://openalex.org/I182083151","display_name":"Universidad Rey Juan Carlos","ror":"https://ror.org/01v5cv687","country_code":"ES","type":"education","lineage":["https://openalex.org/I182083151"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Gonzalo Mateos","raw_affiliation_strings":["King Juan Carlos University,Dep. of Signal Theory,Madrid,Spain"],"affiliations":[{"raw_affiliation_string":"King Juan Carlos University,Dep. of Signal Theory,Madrid,Spain","institution_ids":["https://openalex.org/I182083151"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054312245","display_name":"Antonio G. Marqu\u00e9s","orcid":"https://orcid.org/0000-0002-4642-7718"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Antonio G. Marques","raw_affiliation_strings":["University of Rochester,Dep. of ECE,USA"],"affiliations":[{"raw_affiliation_string":"University of Rochester,Dep. of ECE,USA","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5077468628"],"corresponding_institution_ids":["https://openalex.org/I182083151"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76867591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"96","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.16060000658035278,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.16060000658035278,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.10719999670982361,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.07450000196695328,"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-decision-process","display_name":"Markov decision process","score":0.6955999732017517},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6413999795913696},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.5023999810218811},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.4961000084877014},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.46860000491142273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4551999866962433},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.43720000982284546},{"id":"https://openalex.org/keywords/partially-observable-markov-decision-process","display_name":"Partially observable Markov decision process","score":0.4153999984264374},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.39899998903274536},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.374099999666214}],"concepts":[{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.6955999732017517},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6413999795913696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6031000018119812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5421000123023987},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.5023999810218811},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.4961000084877014},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.46860000491142273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4551999866962433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4413999915122986},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.43720000982284546},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.4153999984264374},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3889000117778778},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C49555168","wikidata":"https://www.wikidata.org/wiki/Q176583","display_name":"Stochastic matrix","level":3,"score":0.3499999940395355},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31310001015663147},{"id":"https://openalex.org/C60810621","wikidata":"https://www.wikidata.org/wiki/Q2333568","display_name":"Optimal substructure","level":3,"score":0.30730000138282776},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2930000126361847},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C2776045410","wikidata":"https://www.wikidata.org/wiki/Q25111241","display_name":"Parametric programming","level":3,"score":0.2687000036239624},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.257999986410141},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.2533999979496002},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/camsap66162.2025.11423967","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap66162.2025.11423967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 10th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"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":{"Dynamic":[0],"programming":[1],"(DP)":[2],"is":[3,17,57],"a":[4,24,69,79,111,129,139,162,174],"fundamental":[5],"tool":[6],"used":[7],"across":[8],"many":[9],"engineering":[10],"fields.":[11],"The":[12],"main":[13],"goal":[14],"of":[15,39,104,110,131,145,176],"DP":[16],"to":[18,42,88,122],"solve":[19,43],"Bellman\u2019s":[20],"optimality":[21],"equations":[22,41],"for":[23],"given":[25],"Markov":[26],"decision":[27],"process":[28],"(MDP).":[29],"Standard":[30],"methods":[31],"like":[32],"policy":[33,76,146],"iteration":[34],"exploit":[35],"the":[36,54,61,90,100,105,108,177],"fixed-point":[37],"nature":[38],"these":[40,47],"them":[44],"iteratively.":[45],"However,":[46],"algorithms":[48],"can":[49,168],"be":[50],"computationally":[51],"expensive":[52],"when":[53,60],"state-action":[55],"space":[56],"large":[58],"or":[59],"problem":[62],"involves":[63],"long-term":[64],"dependencies.":[65],"Here":[66],"we":[67,86,115],"propose":[68],"new":[70],"approach":[71],"that":[72,166],"unrolls":[73],"and":[74,142,147],"truncates":[75],"iterations":[77,178],"into":[78],"learnable":[80],"parametric":[81],"model":[82],"dubbed":[83],"BellNet,":[84],"which":[85],"train":[87],"minimize":[89],"so-termed":[91],"Bellman":[92],"error":[93],"from":[94,118],"random":[95],"value":[96,148],"function":[97],"initializations.":[98],"Viewing":[99],"transition":[101],"probability":[102],"matrix":[103],"MDP":[106],"as":[107,128],"adjacency":[109],"weighted":[112],"directed":[113],"graph,":[114],"draw":[116],"insights":[117],"graph":[119,133],"signal":[120],"processing":[121],"interpret":[123],"(and":[124],"compactly":[125],"re-parameterize)":[126],"BellNet":[127,167],"cascade":[130],"nonlinear":[132],"filters.":[134],"This":[135],"fresh":[136],"look":[137],"facilitates":[138],"concise,":[140],"transferable,":[141],"unifying":[143],"representation":[144],"iteration,":[149],"with":[150],"an":[151],"explicit":[152],"handle":[153],"on":[154],"complexity":[155],"during":[156],"inference.":[157],"Preliminary":[158],"experiments":[159],"conducted":[160],"in":[161,173],"grid-like":[163],"environment":[164],"demonstrate":[165],"effectively":[169],"approximate":[170],"optimal":[171],"policies":[172],"fraction":[175],"required":[179],"by":[180],"classical":[181],"methods.":[182]},"counts_by_year":[],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2026-03-13T00:00:00"}