{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:42:48Z","timestamp":1743079368527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030676575"},{"type":"electronic","value":"9783030676582"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67658-2_39","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T12:03:33Z","timestamp":1614168213000},"page":"677-693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Training of a Recurrent Neural Network Exploiting a Multi-scale Dynamic Memory"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Carta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Sperduti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Bacciu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Bacciu, D., Carta, A., Sperduti, A.: Linear Memory Networks. In: ICANN (2019)","DOI":"10.1007\/978-3-030-30487-4_40"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Bengio, Y., Louradour, J., Collobert, R., Weston, J.: Curriculum learning. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 41\u201348. ACM (2009)","DOI":"10.1145\/1553374.1553380"},{"key":"39_CR3","unstructured":"Chung, J., Ahn, S., Bengio, Y.: Hierarchical multiscale recurrent neural networks. In: ICLR (2017)"},{"key":"39_CR4","doi-asserted-by":"publisher","unstructured":"Cummins, F., Gers, F.A., Schmidhuber, J.: Learning to forget: continual prediction with LSTM. Neural Comput. 2, 850\u2013855 (2000). https:\/\/doi.org\/10.1197\/jamia.M2577","DOI":"10.1197\/jamia.M2577"},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","volume":"14","author":"JL Elman","year":"1990","unstructured":"Elman, J.L.: Finding structure in time. Cognit. Sci. 14(2), 179\u2013211 (1990)","journal-title":"Cognit. Sci."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Garofolo, J.S., Fisher, W.M., Fiscus, J.G., Pallett, D.S., Dahlgren, N.L.: DARPA TIMIT: Acoustic-phonetic continuous speech corpus CD-ROM, NIST speech disc 1-1.1 (1993)","DOI":"10.6028\/NIST.IR.4930"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Graves, A., Fern\u00e1ndez, S., Gomez, F., Schmidhuber, J.: Connectionist temporal classification: labelling unsegmented sequence data with recurrent neural networks. In: Proceedings of the 23rd International Conference on Machine Learning (2006)","DOI":"10.1145\/1143844.1143891"},{"key":"39_CR8","unstructured":"Graves, A., Liwicki, M., Bunke, H., Schmidhuber, J., Fern\u00e1ndez, S.: Unconstrained on-line handwriting recognition with recurrent neural networks. In: Advances in Neural Information Processing Systems, pp. 577\u2013584 (2008)"},{"key":"39_CR9","doi-asserted-by":"publisher","unstructured":"Graves, A., Mohamed, A.r., Hinton, G.: Speech recognition with deep recurrent neural networks. In: Department of Computer Science, University of Toronto. IEEE International Conference (3), pp. 6645\u20136649 (2013). https:\/\/doi.org\/10.1093\/ndt\/gfr624","DOI":"10.1093\/ndt\/gfr624"},{"issue":"02","key":"39_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S0218488598000094","volume":"6","author":"S Hochreiter","year":"1998","unstructured":"Hochreiter, S.: The vanishing gradient problem during learning recurrent neural nets and problem solutions. Int. J. Uncertain. Fuzz. Knowl.-Based Syst. 6(02), 107\u2013116 (1998)","journal-title":"Int. J. Uncertain. Fuzz. Knowl.-Based Syst."},{"issue":"8","key":"39_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1144\/GSL.MEM.1999.018.01.02","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1\u201332 (1997). https:\/\/doi.org\/10.1144\/GSL.MEM.1999.018.01.02","journal-title":"Neural Comput."},{"key":"39_CR12","unstructured":"Ke, N.R., Alias Parth Goyal, A.G., Bilaniuk, O., Binas, J., Mozer, M.C., Pal, C., Bengio, Y.: Sparse attentive backtracking: temporal credit assignment through reminding. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 31, pp. 7640\u20137651. Curran Associates, Inc. (2018). http:\/\/papers.nips.cc\/paper\/7991-sparse-attentive-backtracking-temporal-credit-assignment-through-reminding.pdf"},{"key":"39_CR13","doi-asserted-by":"publisher","unstructured":"Kingma, D.P., Ba, J.: Adam: A Method for Stochastic Optimization. arXiv preprint arXiv:1412.6980 pp. 1\u201315 (2014). https:\/\/doi.org\/10.1145\/1830483.1830503","DOI":"10.1145\/1830483.1830503"},{"key":"39_CR14","unstructured":"Koutnik, J., Greff, K., Gomez, F., Schmidhuber, J.: A clockwork RNN. In: Proceedings of the 31 St International Conference on Machine Learning, Beijing, China, vol. 32, pp. 1\u20139 (2014)"},{"key":"39_CR15","unstructured":"Mali, A., Ororbia, A., Giles, C.L.: The neural state pushdown automata. ArXiv abs\/1909.05233 (2019)"},{"key":"39_CR16","unstructured":"Neil, D., Pfeiffer, M., Liu, S.C.: Phased LSTM: accelerating recurrent network training for long or event-based sequences. In: Advances in Neural Information Processing Systems, pp. 3882\u20133890 (2016)"},{"key":"39_CR17","unstructured":"van den Oord, A., et al.: WaveNet: a generative model for raw audio. arXiv:1609.03499 [cs], September 2016"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNNLS.2019.2953622","volume":"31","author":"A Ororbia","year":"2020","unstructured":"Ororbia, A., Mali, A., Giles, C.L., Kifer, D.: Continual learning of recurrent neural networks by locally aligning distributed representations. IEEE Trans. Neural Netw. Learn. Syst. 31, 1\u201312 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"39_CR19","first-page":"3572","volume":"27","author":"L Pasa","year":"2014","unstructured":"Pasa, L., Sperduti, A.: Pre-training of recurrent neural networks via linear autoencoders. Adv. Neural Inf. Process. Syst. 27, 3572\u20133580 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"39_CR20","unstructured":"Pascanu, R., Mikolov, T., Bengio, Y.: On the difficulty of training Recurrent Neural Networks. In: International Conference on Machine Learning, November 2013"},{"key":"39_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11840817_37","volume-title":"Artificial Neural Networks \u2013 ICANN 2006","author":"A Sperduti","year":"2006","unstructured":"Sperduti, A.: Exact solutions for recursive principal components analysis of sequences and trees. In: Kollias, S.D., Stafylopatis, A., Duch, W., Oja, E. (eds.) ICANN 2006, Part I. LNCS, vol. 4131, pp. 349\u2013356. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11840817_37"},{"key":"39_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-74958-5_32","volume-title":"Machine Learning: ECML 2007","author":"A Sperduti","year":"2007","unstructured":"Sperduti, A.: Efficient computation of recursive principal component analysis for structured input. In: Kok, J.N., Koronacki, J., Mantaras, R.L., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 335\u2013346. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74958-5_32"},{"key":"39_CR23","unstructured":"Tallec, C., Ollivier, Y.: Unbiased online recurrent optimization. In: International Conference on Learning Representations, February 2018"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67658-2_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T23:05:58Z","timestamp":1740351958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67658-2_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030676575","9783030676582"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67658-2_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd2020.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"945","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"195","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}