Papers › TAdam: A Robust Stochastic Gradient Optimizer

TAdam: A Robust Stochastic Gradient Optimizer

29 Feb 2020arXiv:2003.00179archive 2025-07-28

Wendyam Eric Lionel Ilboudo, Taisuke Kobayashi, Kenji Sugimoto

Machine learning algorithms aim to find patterns from observations, which may include some noise, especially in robotics domain. To perform well even with such noise, we expect them to be able to detect outliers and discard them when needed. We therefore propose a new stochastic gradient optimization method, whose robustness is directly built in the algorithm, using the robust student-t distribution as its core idea. Adam, the popular optimization method, is modified with our method and the resultant optimizer, so-called TAdam, is shown to effectively outperform Adam in terms of robustness against noise on diverse task, ranging from regression and classification to reinforcement learning problems. The implementation of our algorithm can be found at https://github.com/Mahoumaru/TAdam.git

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

Mahoumaru/TAdam officialmentioned in papermentioned on GitHubpytorchSyntology: not harvested report
Mahoumaru/t-momentum mentioned on GitHubpytorchSyntology: not harvested report
frgfm/Holocron mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to U-Net: Convolutional Networks for Biomedical Image Segmentation (arXiv:1505.04597; that paper's own run record: 530 ran (of which 247 constructed an object rather than computing a result; 378 with no instrument failure: 18 honoured, 10 violated, 350 with no contract checked; 152 where Syntology's instrument failed) · 227 unverified), Large Batch Training of Convolutional Networks (arXiv:1708.03888; that paper's own run record: 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result), UNet++: A Nested U-Net Architecture for Medical Image Segmentation (arXiv:1807.10165; that paper's own run record: 21 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 1 violated, 16 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Reinforcement LearningReinforcement Learning (RL)

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Adam

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections