Loading…
Online Class-Incremental Continual Learning with Adversarial Shapley Value
As image-based deep learning becomes pervasive on every device, from cell phones to smart watches, there is a growing need to develop methods that continually learn from data while minimizing memory footprint and power consumption. While memory replay techniques have shown exceptional promise for th...
Saved in:
Published in: | arXiv.org 2021-03 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Shim, Dongsub Zheda Mai Jeong, Jihwan Sanner, Scott Kim, Hyunwoo Jang, Jongseong |
description | As image-based deep learning becomes pervasive on every device, from cell phones to smart watches, there is a growing need to develop methods that continually learn from data while minimizing memory footprint and power consumption. While memory replay techniques have shown exceptional promise for this task of continual learning, the best method for selecting which buffered images to replay is still an open question. In this paper, we specifically focus on the online class-incremental setting where a model needs to learn new classes continually from an online data stream. To this end, we contribute a novel Adversarial Shapley value scoring method that scores memory data samples according to their ability to preserve latent decision boundaries for previously observed classes (to maintain learning stability and avoid forgetting) while interfering with latent decision boundaries of current classes being learned (to encourage plasticity and optimal learning of new class boundaries). Overall, we observe that our proposed ASER method provides competitive or improved performance compared to state-of-the-art replay-based continual learning methods on a variety of datasets. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2439764890</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2439764890</sourcerecordid><originalsourceid>FETCH-proquest_journals_24397648903</originalsourceid><addsrcrecordid>eNqNiksKwjAUAIMgWLR3CLguxCT9LaUoKoILxW0J-rQp8bXmo3h7u_AArmZgZkQiLsQiKSTnExI71zLGeJbzNBUR2R3QaARaGeVcssWLhQegV4ZWHXqNYbA9KIsa7_StfUOX1xdYp6weyrFRvYEPPSsTYEbGN2UcxD9OyXy9OlWbpLfdM4DzddsFi0OquRRlnsmiZOK_6wvTeTzr</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2439764890</pqid></control><display><type>article</type><title>Online Class-Incremental Continual Learning with Adversarial Shapley Value</title><source>Access via ProQuest (Open Access)</source><creator>Shim, Dongsub ; Zheda Mai ; Jeong, Jihwan ; Sanner, Scott ; Kim, Hyunwoo ; Jang, Jongseong</creator><creatorcontrib>Shim, Dongsub ; Zheda Mai ; Jeong, Jihwan ; Sanner, Scott ; Kim, Hyunwoo ; Jang, Jongseong</creatorcontrib><description>As image-based deep learning becomes pervasive on every device, from cell phones to smart watches, there is a growing need to develop methods that continually learn from data while minimizing memory footprint and power consumption. While memory replay techniques have shown exceptional promise for this task of continual learning, the best method for selecting which buffered images to replay is still an open question. In this paper, we specifically focus on the online class-incremental setting where a model needs to learn new classes continually from an online data stream. To this end, we contribute a novel Adversarial Shapley value scoring method that scores memory data samples according to their ability to preserve latent decision boundaries for previously observed classes (to maintain learning stability and avoid forgetting) while interfering with latent decision boundaries of current classes being learned (to encourage plasticity and optimal learning of new class boundaries). Overall, we observe that our proposed ASER method provides competitive or improved performance compared to state-of-the-art replay-based continual learning methods on a variety of datasets.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Boundaries ; Machine learning ; Plastic properties ; Stability</subject><ispartof>arXiv.org, 2021-03</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2439764890?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Shim, Dongsub</creatorcontrib><creatorcontrib>Zheda Mai</creatorcontrib><creatorcontrib>Jeong, Jihwan</creatorcontrib><creatorcontrib>Sanner, Scott</creatorcontrib><creatorcontrib>Kim, Hyunwoo</creatorcontrib><creatorcontrib>Jang, Jongseong</creatorcontrib><title>Online Class-Incremental Continual Learning with Adversarial Shapley Value</title><title>arXiv.org</title><description>As image-based deep learning becomes pervasive on every device, from cell phones to smart watches, there is a growing need to develop methods that continually learn from data while minimizing memory footprint and power consumption. While memory replay techniques have shown exceptional promise for this task of continual learning, the best method for selecting which buffered images to replay is still an open question. In this paper, we specifically focus on the online class-incremental setting where a model needs to learn new classes continually from an online data stream. To this end, we contribute a novel Adversarial Shapley value scoring method that scores memory data samples according to their ability to preserve latent decision boundaries for previously observed classes (to maintain learning stability and avoid forgetting) while interfering with latent decision boundaries of current classes being learned (to encourage plasticity and optimal learning of new class boundaries). Overall, we observe that our proposed ASER method provides competitive or improved performance compared to state-of-the-art replay-based continual learning methods on a variety of datasets.</description><subject>Algorithms</subject><subject>Boundaries</subject><subject>Machine learning</subject><subject>Plastic properties</subject><subject>Stability</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNiksKwjAUAIMgWLR3CLguxCT9LaUoKoILxW0J-rQp8bXmo3h7u_AArmZgZkQiLsQiKSTnExI71zLGeJbzNBUR2R3QaARaGeVcssWLhQegV4ZWHXqNYbA9KIsa7_StfUOX1xdYp6weyrFRvYEPPSsTYEbGN2UcxD9OyXy9OlWbpLfdM4DzddsFi0OquRRlnsmiZOK_6wvTeTzr</recordid><startdate>20210322</startdate><enddate>20210322</enddate><creator>Shim, Dongsub</creator><creator>Zheda Mai</creator><creator>Jeong, Jihwan</creator><creator>Sanner, Scott</creator><creator>Kim, Hyunwoo</creator><creator>Jang, Jongseong</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20210322</creationdate><title>Online Class-Incremental Continual Learning with Adversarial Shapley Value</title><author>Shim, Dongsub ; Zheda Mai ; Jeong, Jihwan ; Sanner, Scott ; Kim, Hyunwoo ; Jang, Jongseong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_24397648903</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Boundaries</topic><topic>Machine learning</topic><topic>Plastic properties</topic><topic>Stability</topic><toplevel>online_resources</toplevel><creatorcontrib>Shim, Dongsub</creatorcontrib><creatorcontrib>Zheda Mai</creatorcontrib><creatorcontrib>Jeong, Jihwan</creatorcontrib><creatorcontrib>Sanner, Scott</creatorcontrib><creatorcontrib>Kim, Hyunwoo</creatorcontrib><creatorcontrib>Jang, Jongseong</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shim, Dongsub</au><au>Zheda Mai</au><au>Jeong, Jihwan</au><au>Sanner, Scott</au><au>Kim, Hyunwoo</au><au>Jang, Jongseong</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Online Class-Incremental Continual Learning with Adversarial Shapley Value</atitle><jtitle>arXiv.org</jtitle><date>2021-03-22</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>As image-based deep learning becomes pervasive on every device, from cell phones to smart watches, there is a growing need to develop methods that continually learn from data while minimizing memory footprint and power consumption. While memory replay techniques have shown exceptional promise for this task of continual learning, the best method for selecting which buffered images to replay is still an open question. In this paper, we specifically focus on the online class-incremental setting where a model needs to learn new classes continually from an online data stream. To this end, we contribute a novel Adversarial Shapley value scoring method that scores memory data samples according to their ability to preserve latent decision boundaries for previously observed classes (to maintain learning stability and avoid forgetting) while interfering with latent decision boundaries of current classes being learned (to encourage plasticity and optimal learning of new class boundaries). Overall, we observe that our proposed ASER method provides competitive or improved performance compared to state-of-the-art replay-based continual learning methods on a variety of datasets.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2021-03 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2439764890 |
source | Access via ProQuest (Open Access) |
subjects | Algorithms Boundaries Machine learning Plastic properties Stability |
title | Online Class-Incremental Continual Learning with Adversarial Shapley Value |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T10%3A45%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Online%20Class-Incremental%20Continual%20Learning%20with%20Adversarial%20Shapley%20Value&rft.jtitle=arXiv.org&rft.au=Shim,%20Dongsub&rft.date=2021-03-22&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2439764890%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_24397648903%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2439764890&rft_id=info:pmid/&rfr_iscdi=true |