MBGDT:Robust Mini-Batch Gradient Descent
Not on the map. Why?
Abstract (arXiv)
In high dimensions, most machine learning method perform fragile even there are a little outliers. To address this, we hope to introduce a new method with the base learner, such as Bayesian regression or stochastic gradient descent to solve the problem of the vulnerability in the model. Because the mini-batch gradient descent allows for a more robust convergence than the batch gradient descent, we work a method with the mini-batch gradient descent, called Mini-Batch Gradient Descent with Trimming (MBGDT). Our method show state-of-art performance and have greater robustness than several baselines when we apply our method in designed dataset.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 6 references that are in the map. First posted on arXiv 14 Jun 2022.
Builds on
5 of 6 references.
References · 5
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
- 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 125
- 2019On Robustness to Adversarial Examples and Polynomial Optimizationcited by 14
- 2016Robust Learning of Fixed-Structure Bayesian Networkscited by 8
Built on by
Not cited yet.