{"id":"https://openalex.org/W7117993856","doi":"https://doi.org/10.48550/arxiv.2512.24506","title":"Generalising E-prop to Deep Networks","display_name":"Generalising E-prop to Deep Networks","publication_year":2025,"publication_date":"2025-12-30","ids":{"openalex":"https://openalex.org/W7117993856","doi":"https://doi.org/10.48550/arxiv.2512.24506"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2512.24506","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.24506","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2512.24506","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048239223","display_name":"Beren Millidge","orcid":"https://orcid.org/0000-0003-1872-5635"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Millidge, Beren","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048239223"],"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.2867000102996826,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.2867000102996826,"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/T12611","display_name":"Neural Networks and Reservoir Computing","score":0.13349999487400055,"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/T10241","display_name":"Functional Brain Connectivity Studies","score":0.09809999912977219,"subfield":{"id":"https://openalex.org/subfields/2805","display_name":"Cognitive Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/backpropagation","display_name":"Backpropagation","score":0.6746000051498413},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.6003999710083008},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5680000185966492},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5605999827384949},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5026000142097473},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4821000099182129}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8026000261306763},{"id":"https://openalex.org/C155032097","wikidata":"https://www.wikidata.org/wiki/Q798503","display_name":"Backpropagation","level":3,"score":0.6746000051498413},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.6003999710083008},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5964999794960022},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5680000185966492},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5605999827384949},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5026000142097473},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4821000099182129},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3946000039577484},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.382999986410141},{"id":"https://openalex.org/C147168706","wikidata":"https://www.wikidata.org/wiki/Q1457734","display_name":"Recurrent neural network","level":3,"score":0.36340001225471497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32350000739097595},{"id":"https://openalex.org/C40506919","wikidata":"https://www.wikidata.org/wiki/Q7452469","display_name":"Sequence learning","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29919999837875366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2754000127315521}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2512.24506","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.24506","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2512.24506","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.24506","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":false,"raw_source_name":null,"raw_type":"article"},"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":{"Recurrent":[0,42],"networks":[1,205],"are":[2],"typically":[3],"trained":[4],"with":[5,126],"backpropagation":[6,207],"through":[7,208],"time":[8,57,195],"(BPTT).":[9],"However,":[10,113,129],"BPTT":[11,72,94],"requires":[12],"storing":[13],"the":[14,20,36,60,91,132,155,172,200],"history":[15],"of":[16,84,93,139,175,202],"all":[17],"states":[18],"in":[19,28,56,122,131,143],"network":[21],"and":[22,117,137,196],"then":[23],"replaying":[24],"them":[25],"sequentially":[26],"backwards":[27],"time.":[29,148,209],"This":[30],"computation":[31],"appears":[32],"extremely":[33],"implausible":[34],"for":[35,77],"brain":[37,133],"to":[38,90,158,177],"implement.":[39],"Real":[40],"Time":[41],"Learning":[43],"(RTRL)":[44],"proposes":[45,81],"an":[46,82,107,184],"mathematically":[47],"equivalent":[48],"alternative":[49],"where":[50],"gradient":[51],"information":[52],"is":[53],"propagated":[54],"forwards":[55],"locally":[58],"alongside":[59],"regular":[61],"forward":[62,100],"pass,":[63],"however":[64],"it":[65,75],"has":[66],"significantly":[67],"greater":[68],"computational":[69],"complexity":[70,89],"than":[71],"which":[73,86,102,170],"renders":[74],"impractical":[76],"large":[78],"networks.":[79],"E-prop":[80,118,156,176],"approximation":[83],"RTRL":[85,116],"reduces":[87],"its":[88],"level":[92],"while":[95],"maintaining":[96],"a":[97,123,164],"purely":[98],"online":[99,185],"update":[101],"can":[103,188],"be":[104],"implemented":[105],"by":[106],"eligibility":[108,173],"trace":[109],"at":[110],"each":[111],"synapse.":[112],"works":[114],"on":[115],"ubiquitously":[119],"investigate":[120],"learning":[121,130,186],"single":[124],"layer":[125],"recurrent":[127,204],"dynamics.":[128],"spans":[134],"multiple":[135],"layers":[136],"consists":[138],"both":[140,194],"hierarchal":[141],"dynamics":[142],"depth":[144,169,197],"as":[145,147],"well":[146],"In":[149],"this":[150],"mathematical":[151],"note,":[152],"we":[153],"extend":[154],"framework":[157],"handle":[159],"arbitrarily":[160],"deep":[161,203],"networks,":[162],"deriving":[163],"novel":[165],"recursion":[166],"relationship":[167],"across":[168,193],"extends":[171],"traces":[174],"deeper":[178],"layers.":[179],"Our":[180],"results":[181],"thus":[182],"demonstrate":[183],"algorithm":[187],"perform":[189],"accurate":[190],"credit":[191],"assignment":[192],"simultaneously,":[198],"allowing":[199],"training":[201],"without":[206]},"counts_by_year":[],"updated_date":"2026-01-02T23:15:32.796280","created_date":"2026-01-02T00:00:00"}