Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Adaptive Robust Learning using Latent Bernoulli Variables
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.ORCID iD: 0000-0002-6698-0166
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science. Uppsala University, Science for Life Laboratory, SciLifeLab.ORCID iD: 0000-0002-3123-3478
2024 (English)In: Proceedings of the 41st International Conference on Machine Learning / [ed] Ruslan Salakhutdinov; Zico Kolter; Katherine Heller, Adrian Weller; Nuria Oliver; Jonathan Scarlett; Felix Berkenkamp, PLMR -Proceedings of Machine Learning Research , 2024, p. 23105-23122Conference paper, Published paper (Refereed)
Abstract [en]

We present an adaptive approach for robust learning from corrupted training sets. We identify corrupted and non-corrupted samples with latent Bernoulli variables and thus formulate the learning problem as maximization of the likelihood where latent variables are marginalized. The resulting problem is solved via variational inference, using an efficient Expectation-Maximization based method. The proposed approach improves over the state-of-the-art by automatically inferring the corruption level, while adding minimal computational overhead. We demonstrate our robust learning method and its parameter-free nature on a wide variety of machine learning tasks including online learning and deep learning where it adapts to different levels of noise and maintains high prediction accuracy.

Place, publisher, year, edition, pages
PLMR -Proceedings of Machine Learning Research , 2024. p. 23105-23122
Series
Proceedings of Machine Learning Research, ISSN 2640-3498 ; 235
Keywords [en]
robustness, statistical learning, adaptive method, probabilistic method, latent variables, variational inference
National Category
Probability Theory and Statistics
Research subject
Machine learning
Identifiers
URN: urn:nbn:se:uu:diva-535364OAI: oai:DiVA.org:uu-535364DiVA, id: diva2:1885926
Conference
The 41st International Conference on Machine Learning, Vienna, Austria, 21-27 July, 2024
Projects
eSSENCE - An eScience Collaboration
Funder
Swedish Research Council, 2018-05040Swedish Research Council, 2023-05593Available from: 2024-07-27 Created: 2024-07-27 Last updated: 2025-01-07Bibliographically approved

Open Access in DiVA

fulltext(7482 kB)528 downloads
File information
File name FULLTEXT01.pdfFile size 7482 kBChecksum SHA-512
ce3724528808edc3074308e1a952645aecc9f2a5e2761828207136fb969fb9656728e49e5fbbc7259333aeae8a83d8f67b3ee125a25a425a1b67de0390b1ab9e
Type fulltextMimetype application/pdf

Other links

Paper in fulltextpreprint at arXiv

Search in DiVA

By author/editor
Karakulev, AleksandrZachariah, DaveSingh, Prashant
By organisation
Division of Scientific ComputingComputational ScienceDivision of Systems and ControlAutomatic controlScience for Life Laboratory, SciLifeLab
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 530 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 523 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf