{"id":204524,"updated":"2025-01-19T20:10:13.416850+00:00","links":{},"created":"2025-01-19T01:06:47.614615+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00204524","sets":["1164:2592:10084:10210"]},"path":["10210"],"owner":"44499","recid":"204524","title":["A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-05-02"},"_buckets":{"deposit":"b9dcb003-8383-4851-97aa-0705b12bdf0c"},"_deposit":{"id":"204524","pid":{"type":"depid","value":"204524","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation","author_link":["506529","506531","506533","506527","506530","506532","506526","506534","506535","506528"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation"},{"subitem_title":"A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"招待講演","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2020-05-02","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/204524/files/IPSJ-AL20178004.pdf","label":"IPSJ-AL20178004.pdf"},"date":[{"dateType":"Available","dateValue":"2022-05-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL20178004.pdf","filesize":[{"value":"704.8 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"667203f1-7ad0-4791-af28-020cf8056f6e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mitsuru, Kusumoto"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuya, Inoue"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Gentaro, Watanabe"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuya, Akiba"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masanori, Koyama"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mitsuru, Kusumoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuya, Inoue","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Gentaro, Watanabe","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takuya, Akiba","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masanori, Koyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Recomputation algorithms collectively refer to a family of methods that aims to reduce the memory consumption of the backpropagation by selectively discarding the intermediate results of the forward propagation and recomputing the discarded results as needed. In this paper, we will propose a novel and efficient recomputation method that can be applied to a wider range of neural nets than previous methods. We use the language of graph theory to formalize the general recomputation problem of minimizing the computational overhead under a fixed memory budget constraint, and provide a dynamic programming solution to the problem. Our method can reduce the peak memory consumption on various benchmark networks by 36%~81%, which outperforms the reduction achieved by other methods.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recomputation algorithms collectively refer to a family of methods that aims to reduce the memory consumption of the backpropagation by selectively discarding the intermediate results of the forward propagation and recomputing the discarded results as needed. In this paper, we will propose a novel and efficient recomputation method that can be applied to a wider range of neural nets than previous methods. We use the language of graph theory to formalize the general recomputation problem of minimizing the computational overhead under a fixed memory budget constraint, and provide a dynamic programming solution to the problem. Our method can reduce the peak memory consumption on various benchmark networks by 36%~81%, which outperforms the reduction achieved by other methods.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム(AL)"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2020-05-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2020-AL-178"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}