{"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":"/method/adadelta","slug":"adadelta","name":"AdaDelta","full_name":"AdaDelta","full_name_withheld":false,"description_markdown":"**AdaDelta** is a stochastic optimization technique that allows for per-dimension learning rate method for [SGD](https://paperswithcode.com/method/sgd). It is an extension of [Adagrad](https://paperswithcode.com/method/adagrad) that seeks to reduce its aggressive, monotonically decreasing learning rate. Instead of accumulating all past squared gradients, Adadelta restricts the window of accumulated past gradients to a fixed size $w$.\r\n\r\nInstead of inefficiently storing $w$ previous squared gradients, the sum of gradients is recursively defined as a decaying average of all past squared gradients. The running average $E\\left[g^{2}\\right]\\_{t}$ at time step $t$ then depends only on the previous average and current gradient:\r\n\r\n$$E\\left[g^{2}\\right]\\_{t} = \\gamma{E}\\left[g^{2}\\right]\\_{t-1} + \\left(1-\\gamma\\right)g^{2}\\_{t}$$\r\n\r\nUsually $\\gamma$ is set to around $0.9$. Rewriting SGD updates in terms of the parameter update vector:\r\n\r\n$$ \\Delta\\theta_{t} = -\\eta\\cdot{g\\_{t, i}}$$\r\n$$\\theta\\_{t+1}  = \\theta\\_{t} + \\Delta\\theta_{t}$$\r\n\r\nAdaDelta takes the form:\r\n\r\n$$ \\Delta\\theta_{t} = -\\frac{\\eta}{\\sqrt{E\\left[g^{2}\\right]\\_{t} + \\epsilon}}g_{t} $$\r\n\r\nThe main advantage of AdaDelta is that we do not need to set a default learning rate.","description_state":"present","introduced_year":null,"introduced_by":{"title":"ADADELTA: An Adaptive Learning Rate Method","paper":"/paper/adadelta-an-adaptive-learning-rate-method","first_author":"Matthew D. Zeiler","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/adadelta-an-adaptive-learning-rate-method"},"source":{"url":"http://arxiv.org/abs/1212.5701v1","title":"ADADELTA: An Adaptive Learning Rate Method","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/pytorch/pytorch/blob/b7bda236d18815052378c88081f64935427d7716/torch/optim/adadelta.py#L6","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":17,"archive_num_papers":17,"papers_newest_first":[{"paper":null,"slug":"accelerating-energy-efficient-federated","title":"Accelerating Energy-Efficient Federated Learning in Cell-Free Networks with Adaptive Quantization","date":"2024-12-30","arxiv_id":"2412.20785","n_code_links":0,"syntology":null},{"paper":null,"slug":"new-insight-in-cervical-cancer-diagnosis","title":"New Insight in Cervical Cancer Diagnosis Using Convolution Neural Network Architecture","date":"2024-10-23","arxiv_id":"2410.17735","n_code_links":0,"syntology":null},{"paper":"/paper/a-parallelized-adam-based-solver-for-reserve","slug":"a-parallelized-adam-based-solver-for-reserve","title":"A Parallelized, Adam-Based Solver for Reserve and Security Constrained AC Unit Commitment","date":"2023-10-10","arxiv_id":"2310.06650","n_code_links":1,"syntology":null},{"paper":null,"slug":"elra-exponential-learning-rate-adaption","title":"ELRA: Exponential learning rate adaption gradient descent optimization method","date":"2023-09-12","arxiv_id":"2309.06274","n_code_links":0,"syntology":null},{"paper":null,"slug":"occupant-s-behavior-and-emotion-based-indoor","title":"Occupant's Behavior and Emotion Based Indoor Environment's Illumination Regulation","date":"2023-02-19","arxiv_id":"2302.09586","n_code_links":0,"syntology":null},{"paper":null,"slug":"bfe-and-adabfe-a-new-approach-in-learning","title":"BFE and AdaBFE: A New Approach in Learning Rate Automation for Stochastic Optimization","date":"2022-07-06","arxiv_id":"2207.02763","n_code_links":0,"syntology":null},{"paper":null,"slug":"gradient-descent-stochastic-optimization-and","title":"Gradient Descent, Stochastic Optimization, and Other Tales","date":"2022-05-02","arxiv_id":"2205.00832","n_code_links":0,"syntology":null},{"paper":"/paper/adasmooth-an-adaptive-learning-rate-method","slug":"adasmooth-an-adaptive-learning-rate-method","title":"AdaSmooth: An Adaptive Learning Rate Method based on Effective Ratio","date":"2022-04-02","arxiv_id":"2204.00825","n_code_links":0,"syntology":null},{"paper":"/paper/adaptively-customizing-activation-functions","slug":"adaptively-customizing-activation-functions","title":"Adaptively Customizing Activation Functions for Various Layers","date":"2021-12-17","arxiv_id":"2112.09442","n_code_links":1,"syntology":null},{"paper":"/paper/tom-leveraging-trend-of-the-observed","slug":"tom-leveraging-trend-of-the-observed","title":"Tom: Leveraging trend of the observed gradients for faster convergence","date":"2021-09-07","arxiv_id":"2109.03820","n_code_links":2,"syntology":null},{"paper":null,"slug":"exploiting-adam-like-optimization-algorithms","title":"Exploiting Adam-like Optimization Algorithms to Improve the Performance of Convolutional Neural Networks","date":"2021-03-26","arxiv_id":"2103.14689","n_code_links":0,"syntology":null},{"paper":"/paper/an-adaptive-and-momental-bound-method-for","slug":"an-adaptive-and-momental-bound-method-for","title":"An Adaptive and Momental Bound Method for Stochastic Learning","date":"2019-10-27","arxiv_id":"1910.12249","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lancopku/AdaMod"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/diffgrad-an-optimization-method-for","slug":"diffgrad-an-optimization-method-for","title":"diffGrad: An Optimization Method for Convolutional Neural Networks","date":"2019-09-12","arxiv_id":"1909.11015","n_code_links":1,"syntology":null},{"paper":"/paper/on-the-convergence-of-adam-and-beyond-1","slug":"on-the-convergence-of-adam-and-beyond-1","title":"On the Convergence of Adam and Beyond","date":"2019-04-19","arxiv_id":"1904.09237","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/adaptive-methods-for-nonconvex-optimization","slug":"adaptive-methods-for-nonconvex-optimization","title":"Adaptive Methods for Nonconvex Optimization","date":"2018-12-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/online-batch-selection-for-faster-training-of","slug":"online-batch-selection-for-faster-training-of","title":"Online Batch Selection for Faster Training of Neural Networks","date":"2015-11-19","arxiv_id":"1511.06343","n_code_links":1,"syntology":null},{"paper":"/paper/adadelta-an-adaptive-learning-rate-method","slug":"adadelta-an-adaptive-learning-rate-method","title":"ADADELTA: An Adaptive Learning Rate Method","date":"2012-12-22","arxiv_id":"1212.5701","n_code_links":12,"syntology":{"ran":3,"of":6,"n_ran_checked":3,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}}],"papers_shown":17,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":17,"with_a_code_link":9,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":17,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/method/adadelta/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/adadelta/papers/ran/1","json":"/method/adadelta/papers/ran/1.json","rows":3}],"tasks":[{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":6},{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":"/task/benchmarking","name":"Benchmarking","papers":1},{"task":"/task/cancer-classification","name":"Cancer Classification","papers":1},{"task":"/task/federated-learning","name":"Federated Learning","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/image-categorization","name":"Image Categorization","papers":1},{"task":"/task/multi-class-classification","name":"Multi-class Classification","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":11,"n_tasks":11,"usage_by_year":[{"year":"2012","papers":1},{"year":"2015","papers":1},{"year":"2018","papers":1},{"year":"2019","papers":3},{"year":"2021","papers":3},{"year":"2022","papers":3},{"year":"2023","papers":3},{"year":"2024","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/adadelta"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=AdaDelta","read_at":"2026-10-05T00:51:26+00:00","query":"AdaDelta","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1212.5701","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":1,"served":null,"leading_other_bearer":{"arxiv_id":"1212.5701","title":"ADADELTA: An Adaptive Learning Rate Method","citations":6893,"named_by":["title_prefix"],"bearer_name":"ADADELTA: An Adaptive Learning Rate Method","ask_with":"have('1212.5701')"},"n_other_bearers_listed":1,"note":"Nothing resolved to 'AdaDelta' by name, but 1 thing(s) here DECLARE that name -- most cited: the paper 'ADADELTA: An Adaptive Learning Rate Method' (arXiv:1212.5701, 6,893 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is the paper “ADADELTA: An Adaptive Learning Rate Method” (arXiv:1212.5701, 6,893 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"c1da04ee3f5704d9721c0e25e391f4d1490209fd6f3a46172ba041b81aed51be","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}