{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/tadam-a-robust-stochastic-gradient-optimizer","title":"TAdam: A Robust Stochastic Gradient Optimizer","arxiv_id":"2003.00179","date":"2020-02-29","proceeding":null,"authors":["Wendyam Eric Lionel Ilboudo","Taisuke Kobayashi","Kenji Sugimoto"],"abstract":"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","url_abs":"https://arxiv.org/abs/2003.00179v2","url_pdf":"https://arxiv.org/pdf/2003.00179v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"tadam-a-robust-stochastic-gradient-optimizer","repo_url":"https://github.com/Mahoumaru/TAdam","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"tadam-a-robust-stochastic-gradient-optimizer","repo_url":"https://github.com/Mahoumaru/t-momentum","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"tadam-a-robust-stochastic-gradient-optimizer","repo_url":"https://github.com/frgfm/Holocron","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[{"method_slug":"adam","method_name":"Adam"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Mahoumaru/TAdam","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Mahoumaru/t-momentum","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"frgfm/Holocron","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1505.04597","1708.03888","1807.10165","1901.05555","2101.03697","2201.03545"],"harvested_for_calls":[{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"},{"arxiv_id":"1708.03888","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1708.03888"},"call":"get_harvested_code_for_paper(arxiv_id=\"1708.03888\")"},{"arxiv_id":"1807.10165","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1807.10165"},"call":"get_harvested_code_for_paper(arxiv_id=\"1807.10165\")"},{"arxiv_id":"1901.05555","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.05555"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.05555\")"},{"arxiv_id":"2101.03697","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2101.03697"},"call":"get_harvested_code_for_paper(arxiv_id=\"2101.03697\")"},{"arxiv_id":"2201.03545","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.03545"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.03545\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c22ff4ec226071e0d17d715f73a230c1c7abf70d6dcabb331364862bf15a063d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}