| CARVIEW |
Select Language
HTTP/2 200
cache-control: max-age=3600
last-modified: Wed, 12 Nov 2025 01:45:14 GMT
content-type: text/html; charset=utf-8
server: Google Frontend
via: 1.1 google, 1.1 varnish, 1.1 varnish, 1.1 varnish
x-frame-options: SAMEORIGIN
x-cloud-trace-context: a9dfd3d44920557cbc9279c62ffb5fcb
content-security-policy: frame-ancestors 'none'
accept-ranges: bytes
age: 572408
date: Thu, 01 Jan 2026 01:51:18 GMT
x-served-by: cache-lga21946-LGA, cache-lga21973-LGA, cache-bom-vanm7210046-BOM
x-cache: MISS, HIT, MISS
x-timer: S1767232278.950918,VS0,VE209
content-length: 48095
[2102.12192] Multiplicative Reweighting for Robust Neural Network Optimization
Skip to main content
[v1] Wed, 24 Feb 2021 10:40:25 UTC (180 KB)
[v2] Sat, 19 Jun 2021 19:03:57 UTC (220 KB)
[v3] Mon, 29 Nov 2021 10:04:07 UTC (316 KB)
[v4] Sun, 26 May 2024 12:27:35 UTC (347 KB)
[v5] Tue, 11 Nov 2025 12:45:28 UTC (185 KB)
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors.
Donate
Computer Science > Machine Learning
arXiv:2102.12192 (cs)
[Submitted on 24 Feb 2021 (v1), last revised 11 Nov 2025 (this version, v5)]
Title:Multiplicative Reweighting for Robust Neural Network Optimization
View a PDF of the paper titled Multiplicative Reweighting for Robust Neural Network Optimization, by Noga Bar and 2 other authors
View PDF
HTML (experimental)
Abstract:Neural networks are widespread due to their powerful performance. Yet, they degrade in the presence of noisy labels at training time. Inspired by the setting of learning with expert advice, where multiplicative weights (MW) updates were recently shown to be robust to moderate data corruptions in expert advice, we propose to use MW for reweighting examples during neural networks optimization. We theoretically establish the convergence of our method when used with gradient descent and prove its advantages in 1d cases. We then validate empirically our findings for the general case by showing that MW improves neural networks' accuracy in the presence of label noise on CIFAR-10, CIFAR-100 and Clothing1M. We also show the impact of our approach on adversarial robustness.
| Comments: | Our code is publicly available in this https URL |
| Subjects: | Machine Learning (cs.LG); Cryptography and Security (cs.CR) |
| Cite as: | arXiv:2102.12192 [cs.LG] |
| (or arXiv:2102.12192v5 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2102.12192
arXiv-issued DOI via DataCite
|
|
| Related DOI: | https://doi.org/10.1137/25M1734816
DOI(s) linking to related resources
|
Submission history
From: Noga Bar [view email][v1] Wed, 24 Feb 2021 10:40:25 UTC (180 KB)
[v2] Sat, 19 Jun 2021 19:03:57 UTC (220 KB)
[v3] Mon, 29 Nov 2021 10:04:07 UTC (316 KB)
[v4] Sun, 26 May 2024 12:27:35 UTC (347 KB)
[v5] Tue, 11 Nov 2025 12:45:28 UTC (185 KB)
Full-text links:
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
View a PDF of the paper titled Multiplicative Reweighting for Robust Neural Network Optimization, by Noga Bar and 2 other authors
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.