{"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/mirror-descent-search-and-its-acceleration","title":"Mirror Descent Search and its Acceleration","arxiv_id":"1709.02535","date":"2017-09-08","proceeding":null,"authors":["Megumi Miyashita","Shiro Yano","Toshiyuki Kondo"],"abstract":"In recent years, attention has been focused on the relationship between\nblack-box optimiza- tion problem and reinforcement learning problem. In this\nresearch, we propose the Mirror Descent Search (MDS) algorithm which is\napplicable both for black box optimization prob- lems and reinforcement\nlearning problems. Our method is based on the mirror descent method, which is a\ngeneral optimization algorithm. The contribution of this research is roughly\ntwofold. We propose two essential algorithms, called MDS and Accelerated Mirror\nDescent Search (AMDS), and two more approximate algorithms: Gaussian Mirror\nDescent Search (G-MDS) and Gaussian Accelerated Mirror Descent Search (G-AMDS).\nThis re- search shows that the advanced methods developed in the context of the\nmirror descent research can be applied to reinforcement learning problem. We\nalso clarify the relationship between an existing reinforcement learning\nalgorithm and our method. With two evaluation experiments, we show our proposed\nalgorithms converge faster than some state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1709.02535v2","url_pdf":"http://arxiv.org/pdf/1709.02535v2.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":"mirror-descent-search-and-its-acceleration","repo_url":"https://github.com/mmilk1231/MirrorDescentSearch","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"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":"mmilk1231/MirrorDescentSearch","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"1788fa7c0e8375deb176d9a35fa049b78728230ff096a3078e56e2dad5e09eea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}