{"id":"https://openalex.org/W6889729988","doi":"https://doi.org/10.26083/tuprints-00024782","title":"Reinforcement Learning Curricula as Interpolations between Task Distributions","display_name":"Reinforcement Learning Curricula as Interpolations between Task Distributions","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6889729988","doi":"https://doi.org/10.26083/tuprints-00024782"},"language":"en","primary_location":{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:141301","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Dissertation"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://tuprints.ulb.tu-darmstadt.de/24782/1/thesis.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Klink, Pascal","orcid":"https://orcid.org/0000-0001-5318-3785"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Klink, Pascal","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5318-3785","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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":true,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.436599999666214,"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.436599999666214,"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.08879999816417694,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.019899999722838402,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.7527999877929688},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5938000082969666},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5429999828338623},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.5199999809265137},{"id":"https://openalex.org/keywords/multi-task-learning","display_name":"Multi-task learning","score":0.486299991607666},{"id":"https://openalex.org/keywords/instance-based-learning","display_name":"Instance-based learning","score":0.4327000081539154},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4099000096321106},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.37619999051094055},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.3725999891757965},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.36419999599456787}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7527999877929688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7361000180244446},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6870999932289124},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5978000164031982},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5938000082969666},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5429999828338623},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.5199999809265137},{"id":"https://openalex.org/C28006648","wikidata":"https://www.wikidata.org/wiki/Q6934509","display_name":"Multi-task learning","level":3,"score":0.486299991607666},{"id":"https://openalex.org/C24138899","wikidata":"https://www.wikidata.org/wiki/Q17141258","display_name":"Instance-based learning","level":3,"score":0.4327000081539154},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4099000096321106},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3725999891757965},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.36419999599456787},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.3634999990463257},{"id":"https://openalex.org/C58973888","wikidata":"https://www.wikidata.org/wiki/Q1041418","display_name":"Semi-supervised learning","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.3418000042438507},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3334999978542328},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C59404180","wikidata":"https://www.wikidata.org/wiki/Q17013334","display_name":"Feature learning","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C2986563244","wikidata":"https://www.wikidata.org/wiki/Q6822310","display_name":"Learning to learn","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C199190896","wikidata":"https://www.wikidata.org/wiki/Q3509276","display_name":"Learning classifier system","level":3,"score":0.3034999966621399},{"id":"https://openalex.org/C2778827112","wikidata":"https://www.wikidata.org/wiki/Q22245680","display_name":"Feature engineering","level":3,"score":0.29989999532699585},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C115903097","wikidata":"https://www.wikidata.org/wiki/Q7094097","display_name":"Online machine learning","level":3,"score":0.29899999499320984},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C32254414","wikidata":"https://www.wikidata.org/wiki/Q4724364","display_name":"Algorithmic learning theory","level":3,"score":0.2825999855995178},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.2651999890804291},{"id":"https://openalex.org/C12298181","wikidata":"https://www.wikidata.org/wiki/Q7246814","display_name":"Proactive learning","level":5,"score":0.26350000500679016},{"id":"https://openalex.org/C40506919","wikidata":"https://www.wikidata.org/wiki/Q7452469","display_name":"Sequence learning","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C188116033","wikidata":"https://www.wikidata.org/wiki/Q2664563","display_name":"Q-learning","level":3,"score":0.2612000107765198},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:141301","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Dissertation"},{"id":"pmh:oai:tuprints.ulb.tu-darmstadt.de:24782","is_oa":true,"landing_page_url":"https://tuprints.ulb.tu-darmstadt.de/24782/1/thesis.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401590","display_name":"Technischen Universit\u00e4t Darmstadt","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Ph.D. Thesis"},{"id":"doi:10.26083/tuprints-00024782","is_oa":true,"landing_page_url":"https://doi.org/10.26083/tuprints-00024782","pdf_url":null,"source":{"id":"https://openalex.org/S7407051655","display_name":"TUprints","issn_l":null,"issn":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Dissertation"}],"best_oa_location":{"id":"pmh:oai:tuprints.ulb.tu-darmstadt.de:24782","is_oa":true,"landing_page_url":"https://tuprints.ulb.tu-darmstadt.de/24782/1/thesis.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401590","display_name":"Technischen Universit\u00e4t Darmstadt","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Ph.D. Thesis"},"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":{"In":[0,135,157,287,353,452,644,832],"the":[1,4,89,112,121,136,144,166,173,256,307,341,344,358,366,371,409,461,467,488,500,532,536,546,557,591,597,603,621,631,633,645,651,675,736,748,753,764,804,812,816,878,889],"last":[2],"decade,":[3],"increased":[5],"availability":[6,122],"of":[7,18,38,61,99,123,130,138,146,168,170,176,183,235,244,259,279,282,309,343,360,373,403,419,440,446,460,490,502,506,535,548,556,567,574,590,602,620,654,677,729,752,767,774,797,806,818,881,891],"powerful":[8],"computing":[9,125],"machinery":[10],"has":[11,24,51],"led":[12],"to":[13,44,74,165,197,206,316,330,348,370,415,471,481,610,623,657,668,690,734,776,787,821,876],"an":[14,35,104,241,338,377,449,457,564,665,678,757,788,807],"increasingly":[15,184],"widespread":[16],"application":[17],"machine":[19],"learning":[20,23,49,149,174,203,214,236,246,257,285,298,305,320,368,478,639,717,739,785,841,883],"methods.":[21,493],"Machine":[22],"been":[25,52,325],"particularly":[26],"successful":[27,283],"when":[28,212],"large":[29],"models,":[30],"typically":[31,191],"neural":[32],"networks":[33],"with":[34,152,607,674,702,886,897],"ever-increasing":[36],"number":[37],"parameters,":[39],"can":[40,384],"leverage":[41],"vast":[42],"data":[43],"make":[45],"predictions.":[46],"While":[47],"reinforcement":[48,100,284,297,304,319,483,716,840,882,898],"(RL)":[50],"no":[53],"exception":[54],"from":[55,254,306,443],"this":[56,140,158,223,292,795,834,852,869],"development,":[57],"a":[58,77,249,276,388,398,401,416,435,444,472,528,553,571,616,658,670,683,696,712,837,855],"distinguishing":[59],"feature":[60],"RL":[62,177,260,382,390,394,426,437,666,789,820],"is":[63,563],"its":[64,703],"well-known":[65],"exploration-exploitation":[66],"trade-off,":[67],"whose":[68],"optimal":[69,450,582,808],"solution":[70,890],"\u2013":[71,83,464,474],"while":[72,594],"possible":[73],"model":[75,555],"as":[76,103,201,269,400,430,504,615,843,858],"partially":[78,697],"observable":[79,698],"Markov":[80,576],"decision":[81],"process":[82],"evades":[84],"computation":[85],"in":[86,143,215,222,262,275,327,365,476,511,531,641,661,695,747,780],"all":[87],"but":[88],"simplest":[90],"problems.":[91,334],"Consequently,":[92],"it":[93,431],"seems":[94],"unsurprising":[95],"that":[96,132,209,266,376,406,456,465,544,625,743,761,791],"notable":[97],"demonstrations":[98],"learning,":[101,362,484],"such":[102,200,614],"RL-based":[105],"Go":[106,114],"agent":[107,411,667],"(AlphaGo)":[108],"by":[109,150,179,227,294,387,515],"Deepmind":[110],"beating":[111],"professional":[113],"player":[115],"Lee":[116],"Sedol,":[117],"relied":[118],"both":[119],"on":[120,181,424,499,682,811,839],"massive":[124],"capabilities":[126],"and":[127,194,248,300,350,539,707,782,825,861,894],"specific":[128],"forms":[129],"regularization":[131,141],"facilitate":[133],"learning.":[134,799,899],"case":[137],"AlphaGo,":[139,171],"came":[142],"form":[145,796],"self-play,":[147],"enabling":[148],"interacting":[151],"gradually":[153],"more":[154,517,617,783],"proficient":[155],"opponents.":[156],"thesis,":[159],"we":[160,220,290,346,356,454,522,649,663,720,770],"develop":[161,221],"techniques":[162],"that,":[163,700,887],"similarly":[164],"concept":[167,359],"self-play":[169],"improve":[172],"performance":[175,258,412,479,489,640,805],"agents":[178,261,383],"training":[180],"sequences":[182,189,505],"complex":[185],"tasks.":[186,217,421],"These":[187],"task":[188,251,272,404,469,508,519,558,568,592,604,664,727,846],"are":[190,195,626],"called":[192],"curricula":[193,226,268,317,345,433,503,550,773,842,884],"known":[196],"side-step":[198],"problems":[199,860,896],"slow":[202],"or":[204,230,486],"convergence":[205],"poor":[207],"behavior":[208],"may":[210,872],"occur":[211],"directly":[213],"complicated":[216],"The":[218,688,724,800,848],"algorithms":[219],"thesis":[224,293,835],"create":[225],"minimizing":[228],"distances":[229],"divergences":[231],"between":[232,240,271,845],"probability":[233],"distributions":[234,273,405,509,593],"tasks,":[237],"generating":[238,397,441],"interpolations":[239,270,844],"initial":[242],"distribution":[243,418,470,520],"easy":[245],"tasks":[247,624,830],"target":[250,420,730,768],"distribution.":[252],"Apart":[253],"improving":[255],"experiments,":[263,453],"developing":[264],"methods":[265,311,323,849],"realize":[267],"results":[274,475,694],"nuanced":[277],"picture":[278],"key":[280,542],"aspects":[281],"curricula.":[286,723],"Chapter":[288,354,495,512,647,655],"1,":[289],"start":[291],"introducing":[295],"required":[296],"notation":[299],"then":[301],"motivating":[302],"curriculum":[303,379,399,425,463,622,738,819],"perspective":[308,838,853],"continuation":[310,322],"for":[312,318,381,586,630,714,741,827],"non-linear":[313,328,828],"optimization.":[314],"Similar":[315],"agents,":[321],"have":[324,744],"used":[326],"optimization":[329,333,759,859],"solve":[331],"challenging":[332,892],"This":[335,392,422],"similarity":[336,414,569],"provides":[337],"intuition":[339,501],"about":[340,448],"effect":[342],"aim":[347],"generate":[349,772],"their":[351],"limits.":[352],"2,":[355],"transfer":[357],"self-paced":[361],"initially":[363],"proposed":[364],"supervised":[367],"community,":[369],"problem":[372],"RL,":[374],"showing":[375],"automated":[378],"generation":[380,547],"be":[385,777],"motivated":[386],"regularized":[389,393,436],"objective.":[391],"objective":[395,438],"implies":[396],"sequence":[402],"trade":[407],"off":[408],"expected":[410],"against":[413],"specified":[417],"view":[423],"contrasts":[427],"existing":[428,491],"approaches,":[429],"motivates":[432],"via":[434,570,722],"instead":[439],"them":[442],"set":[445],"assumptions":[447,526],"curriculum.":[451],"show":[455,523],"approximate":[458],"implementation":[459],"aforementioned":[462],"restricts":[466],"interpolating":[468,507],"Gaussian":[473],"improved":[477,758],"compared":[480,786],"regular":[482],"matching":[485],"surpassing":[487],"curriculum-based":[492],"Subsequently,":[494],"3":[496,656],"builds":[497],"up":[498],"established":[510],"2.":[513],"Motivated":[514],"using":[516],"flexible":[518,587],"representations,":[521],"how":[524],"parametric":[525,554],"play":[527],"crucial":[529],"role":[530],"empirical":[533,863],"success":[534],"previous":[537,754],"approach":[538,635],"subsequently":[540],"uncover":[541],"ingredients":[543],"enable":[545,888],"meaningful":[549],"without":[551],"assuming":[552],"distributions.":[559,847],"One":[560],"major":[561],"ingredient":[562],"explicit":[565],"notion":[566],"distance":[572],"function":[573],"two":[575],"Decision":[577],"Processes.":[578],"We":[579],"turn":[580],"towards":[581],"transport":[583],"theory,":[584],"allowing":[585],"particle-based":[588],"representations":[589],"properly":[595],"considering":[596],"newly":[598],"introduced":[599],"metric":[600],"structure":[601,766],"space.":[605],"Combined":[606],"other":[608],"improvements":[609],"our":[611],"first":[612],"method,":[613],"aggressive":[618],"restriction":[619],"not":[627,745,793],"too":[628],"hard":[629],"agent,":[632],"resulting":[634,779],"delivers":[636],"consistently":[637],"high":[638],"multiple":[642],"experiments.":[643,866],"final":[646],"4,":[648],"apply":[650],"refined":[652],"method":[653,740],"trajectory-tracking":[659],"task,":[660],"which":[662,719],"follow":[669],"three-dimensional":[671],"reference":[672],"trajectory":[673],"tip":[676],"inverted":[679],"pendulum":[680],"mounted":[681],"Barrett":[684],"Whole":[685],"Arm":[686],"Manipulator.":[687],"access":[689],"only":[691],"positional":[692],"information":[693],"system":[699],"paired":[701],"inherent":[704],"instability,":[705],"underactuation,":[706],"non-trivial":[708],"kinematic":[709],"structure,":[710],"presents":[711],"challenge":[713],"modern":[715],"algorithms,":[718],"tackle":[721],"technically":[725],"infinite-dimensional":[726],"space":[728],"trajectories":[731,775],"allows":[732],"us":[733],"probe":[735],"developed":[737,850],"flaws":[742],"surfaced":[746],"rather":[749],"low-dimensional":[750],"experiments":[751],"chapters.":[755],"Through":[756],"scheme":[760],"better":[762],"respects":[763],"non-Euclidean":[765],"trajectories,":[769],"reliably":[771],"tracked,":[778],"faster":[781],"robust":[784],"baseline":[790,810],"does":[792],"exploit":[794],"structured":[798],"learned":[801],"policy":[802],"matches":[803],"control":[809,826,895],"real":[813],"system,":[814],"demonstrating":[815],"potential":[817],"learn":[822],"state":[823],"estimation":[824],"tracking":[829],"jointly.":[831],"summary,":[833],"introduces":[836],"under":[851],"enjoy":[854],"precise":[856,870],"formulation":[857,871],"deliver":[862],"benefits":[864],"throughout":[865],"Building":[867],"upon":[868],"allow":[873],"future":[874],"work":[875],"advance":[877],"formal":[879],"understanding":[880],"and,":[885],"decision-making":[893]},"counts_by_year":[],"updated_date":"2026-07-01T08:55:40.977307","created_date":"2025-10-10T00:00:00"}