Training-Free Robust Multimodal Learning via Sample-Wise Jacobian Regularization
Multimodal fusion emerges as an appealing technique to improve model performances on many tasks. Nevertheless, the robustness of such fusion methods is rarely involved in the present literature. In this paper, we propose a training-free robust late-fusion method by exploiting conditional independenc...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Gao, Zhengqi Ren, Sucheng Xue, Zihui Li, Siting Zhao, Hang |
description | Multimodal fusion emerges as an appealing technique to improve model
performances on many tasks. Nevertheless, the robustness of such fusion methods
is rarely involved in the present literature. In this paper, we propose a
training-free robust late-fusion method by exploiting conditional independence
assumption and Jacobian regularization. Our key is to minimize the Frobenius
norm of a Jacobian matrix, where the resulting optimization problem is relaxed
to a tractable Sylvester equation. Furthermore, we provide a theoretical error
bound of our method and some insights about the function of the extra modality.
Several numerical experiments on AV-MNIST, RAVDESS, and VGGsound demonstrate
the efficacy of our method under both adversarial attacks and random
corruptions. |
doi_str_mv | 10.48550/arxiv.2204.02485 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2204_02485</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2204_02485</sourcerecordid><originalsourceid>FETCH-LOGICAL-a675-f5919299304a88ae0f2666a82f225dce4618c14b50fff46d9504b349a460c2ef3</originalsourceid><addsrcrecordid>eNotz81KxDAUBeBsXMjoA7gyL5CapklMljI4_lBRxoLLctveDBfSdkjbQX16ndHVgXPgwMfYVS4z7YyRN5A-6ZApJXUm1W91zt6qBDTQsBObhMi3Y7NMM39Z4kz92EHkJUI67vxAwN-h30cUHzQhf4Z2bAgGvsXdEiHRN8w0DhfsLECc8PI_V6za3FfrR1G-Pjyt70oB9taIYHzulfeF1OAcoAzKWgtOBaVM16K2uWtz3RgZQtC280bqptAetJWtwlCs2PXf7YlU7xP1kL7qI60-0YofJU5JLQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Training-Free Robust Multimodal Learning via Sample-Wise Jacobian Regularization</title><source>arXiv.org</source><creator>Gao, Zhengqi ; Ren, Sucheng ; Xue, Zihui ; Li, Siting ; Zhao, Hang</creator><creatorcontrib>Gao, Zhengqi ; Ren, Sucheng ; Xue, Zihui ; Li, Siting ; Zhao, Hang</creatorcontrib><description>Multimodal fusion emerges as an appealing technique to improve model
performances on many tasks. Nevertheless, the robustness of such fusion methods
is rarely involved in the present literature. In this paper, we propose a
training-free robust late-fusion method by exploiting conditional independence
assumption and Jacobian regularization. Our key is to minimize the Frobenius
norm of a Jacobian matrix, where the resulting optimization problem is relaxed
to a tractable Sylvester equation. Furthermore, we provide a theoretical error
bound of our method and some insights about the function of the extra modality.
Several numerical experiments on AV-MNIST, RAVDESS, and VGGsound demonstrate
the efficacy of our method under both adversarial attacks and random
corruptions.</description><identifier>DOI: 10.48550/arxiv.2204.02485</identifier><language>eng</language><subject>Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Learning ; Computer Science - Sound</subject><creationdate>2022-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2204.02485$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2204.02485$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Gao, Zhengqi</creatorcontrib><creatorcontrib>Ren, Sucheng</creatorcontrib><creatorcontrib>Xue, Zihui</creatorcontrib><creatorcontrib>Li, Siting</creatorcontrib><creatorcontrib>Zhao, Hang</creatorcontrib><title>Training-Free Robust Multimodal Learning via Sample-Wise Jacobian Regularization</title><description>Multimodal fusion emerges as an appealing technique to improve model
performances on many tasks. Nevertheless, the robustness of such fusion methods
is rarely involved in the present literature. In this paper, we propose a
training-free robust late-fusion method by exploiting conditional independence
assumption and Jacobian regularization. Our key is to minimize the Frobenius
norm of a Jacobian matrix, where the resulting optimization problem is relaxed
to a tractable Sylvester equation. Furthermore, we provide a theoretical error
bound of our method and some insights about the function of the extra modality.
Several numerical experiments on AV-MNIST, RAVDESS, and VGGsound demonstrate
the efficacy of our method under both adversarial attacks and random
corruptions.</description><subject>Computer Science - Computer Vision and Pattern Recognition</subject><subject>Computer Science - Learning</subject><subject>Computer Science - Sound</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81KxDAUBeBsXMjoA7gyL5CapklMljI4_lBRxoLLctveDBfSdkjbQX16ndHVgXPgwMfYVS4z7YyRN5A-6ZApJXUm1W91zt6qBDTQsBObhMi3Y7NMM39Z4kz92EHkJUI67vxAwN-h30cUHzQhf4Z2bAgGvsXdEiHRN8w0DhfsLECc8PI_V6za3FfrR1G-Pjyt70oB9taIYHzulfeF1OAcoAzKWgtOBaVM16K2uWtz3RgZQtC280bqptAetJWtwlCs2PXf7YlU7xP1kL7qI60-0YofJU5JLQ</recordid><startdate>20220405</startdate><enddate>20220405</enddate><creator>Gao, Zhengqi</creator><creator>Ren, Sucheng</creator><creator>Xue, Zihui</creator><creator>Li, Siting</creator><creator>Zhao, Hang</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220405</creationdate><title>Training-Free Robust Multimodal Learning via Sample-Wise Jacobian Regularization</title><author>Gao, Zhengqi ; Ren, Sucheng ; Xue, Zihui ; Li, Siting ; Zhao, Hang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a675-f5919299304a88ae0f2666a82f225dce4618c14b50fff46d9504b349a460c2ef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Computer Vision and Pattern Recognition</topic><topic>Computer Science - Learning</topic><topic>Computer Science - Sound</topic><toplevel>online_resources</toplevel><creatorcontrib>Gao, Zhengqi</creatorcontrib><creatorcontrib>Ren, Sucheng</creatorcontrib><creatorcontrib>Xue, Zihui</creatorcontrib><creatorcontrib>Li, Siting</creatorcontrib><creatorcontrib>Zhao, Hang</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gao, Zhengqi</au><au>Ren, Sucheng</au><au>Xue, Zihui</au><au>Li, Siting</au><au>Zhao, Hang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Training-Free Robust Multimodal Learning via Sample-Wise Jacobian Regularization</atitle><date>2022-04-05</date><risdate>2022</risdate><abstract>Multimodal fusion emerges as an appealing technique to improve model
performances on many tasks. Nevertheless, the robustness of such fusion methods
is rarely involved in the present literature. In this paper, we propose a
training-free robust late-fusion method by exploiting conditional independence
assumption and Jacobian regularization. Our key is to minimize the Frobenius
norm of a Jacobian matrix, where the resulting optimization problem is relaxed
to a tractable Sylvester equation. Furthermore, we provide a theoretical error
bound of our method and some insights about the function of the extra modality.
Several numerical experiments on AV-MNIST, RAVDESS, and VGGsound demonstrate
the efficacy of our method under both adversarial attacks and random
corruptions.</abstract><doi>10.48550/arxiv.2204.02485</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2204.02485 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2204_02485 |
source | arXiv.org |
subjects | Computer Science - Computer Vision and Pattern Recognition Computer Science - Learning Computer Science - Sound |
title | Training-Free Robust Multimodal Learning via Sample-Wise Jacobian Regularization |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-12T19%3A42%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Training-Free%20Robust%20Multimodal%20Learning%20via%20Sample-Wise%20Jacobian%20Regularization&rft.au=Gao,%20Zhengqi&rft.date=2022-04-05&rft_id=info:doi/10.48550/arxiv.2204.02485&rft_dat=%3Carxiv_GOX%3E2204_02485%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |