{"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/active-exploration-in-parameterized","title":"Active exploration in parameterized reinforcement learning","arxiv_id":"1610.01986","date":"2016-10-06","proceeding":null,"authors":["Mehdi Khamassi","Costas Tzafestas"],"abstract":"Online model-free reinforcement learning (RL) methods with continuous actions\nare playing a prominent role when dealing with real-world applications such as\nRobotics. However, when confronted to non-stationary environments, these\nmethods crucially rely on an exploration-exploitation trade-off which is rarely\ndynamically and automatically adjusted to changes in the environment. Here we\npropose an active exploration algorithm for RL in structured (parameterized)\ncontinuous action space. This framework deals with a set of discrete actions,\neach of which is parameterized with continuous variables. Discrete exploration\nis controlled through a Boltzmann softmax function with an inverse temperature\n$\\beta$ parameter. In parallel, a Gaussian exploration is applied to the\ncontinuous action parameters. We apply a meta-learning algorithm based on the\ncomparison between variations of short-term and long-term reward running\naverages to simultaneously tune $\\beta$ and the width of the Gaussian\ndistribution from which continuous action parameters are drawn. When applied to\na simple virtual human-robot interaction task, we show that this algorithm\noutperforms continuous parameterized RL both without active exploration and\nwith active exploration based on uncertainty variations measured by a\nKalman-Q-learning algorithm.","url_abs":"http://arxiv.org/abs/1610.01986v1","url_pdf":"http://arxiv.org/pdf/1610.01986v1.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":"active-exploration-in-parameterized","repo_url":"https://github.com/MehdiKhamassi/SocialMetaLearning","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"meta-learning","task_name":"Meta-Learning"},{"task_slug":"q-learning","task_name":"Q-Learning"},{"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":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"},{"method_slug":"q-learning","method_name":"Q-Learning"},{"method_slug":"softmax","method_name":"Softmax"}],"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":"MehdiKhamassi/SocialMetaLearning","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":"b7603a4e7ba71d394f85b26f42ac4f922d8066baba06f1bce5bb47845583dc95","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}