Karakulev A; Zachariah D; Singh P
Adaptive Parameter-Free Robust Learning using Latent Bernoulli Variables Conference
Proceedings of the 41st International Conference on Machine Learning (ICML 2024), 2024.
Abstract | Links | BibTeX | Tags: Bayesian Inference, Deep Learning, Optimization, Robust Learning
@conference{nokey,
title = {Adaptive Parameter-Free Robust Learning using Latent Bernoulli Variables},
author = {Aleksandr Karakulev and Dave Zachariah and Prashant Singh},
url = {https://icml.cc/virtual/2024/poster/32797},
doi = {https://doi.org/10.48550/arXiv.2312.00585},
year = {2024},
date = {2024-07-25},
urldate = {2024-07-25},
booktitle = {Proceedings of the 41st International Conference on Machine Learning (ICML 2024)},
abstract = {We present an efficient parameter-free approach for statistical learning from corrupted training sets. We identify corrupted and non-corrupted samples using latent Bernoulli variables, and therefore formulate the robust learning problem as maximization of the likelihood where latent variables are marginalized out. The resulting optimization 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 and identifying outliers, while adding minimal computational overhead. We demonstrate our robust learning method on a wide variety of machine learning tasks including online learning and deep learning where it exhibits ability to adapt to different levels of noise and attain high prediction accuracy.},
keywords = {Bayesian Inference, Deep Learning, Optimization, Robust Learning},
pubstate = {published},
tppubtype = {conference}
}
We present an efficient parameter-free approach for statistical learning from corrupted training sets. We identify corrupted and non-corrupted samples using latent Bernoulli variables, and therefore formulate the robust learning problem as maximization of the likelihood where latent variables are marginalized out. The resulting optimization 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 and identifying outliers, while adding minimal computational overhead. We demonstrate our robust learning method on a wide variety of machine learning tasks including online learning and deep learning where it exhibits ability to adapt to different levels of noise and attain high prediction accuracy.
Adaptive Parameter-Free Robust Learning using Latent Bernoulli Variables Conference
Proceedings of the 41st International Conference on Machine Learning (ICML 2024), 2024.