{"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/feature-selection-as-monte-carlo-search-in","title":"Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification","arxiv_id":"1811.07531","date":"2018-11-19","proceeding":null,"authors":["Aurelien Pelissier","Atsuyoshi Nakamura","Koji Tabata"],"abstract":"Monte Carlo tree search (MCTS) has received considerable interest due to its\nspectacular success in the difficult problem of computer Go and also proved\nbeneficial in a range of other domains. A major issue that has received little\nattention in the MCTS literature is the fact that, in most games, different\nactions can lead to the same state, that may lead to a high degree of\nredundancy in tree representation and unnecessary additional computational\ncost. We extend MCTS to single rooted directed acyclic graph (SR-DAG), and\nconsider the Best Arm Identification (BAI) and the Best Leaf Identification\n(BLI) problem of an expanding SR-DAG of arbitrary depth. We propose algorithms\nthat are (epsilon, delta)-correct in the fixed confidence setting, and prove an\nasymptotic upper bounds of sample complexity for our BAI algorithm. As a major\napplication for our BLI algorithm, a novel approach for Feature Selection is\nproposed by representing the feature set space as a SR-DAG and repeatedly\nevaluating feature subsets until a candidate for the best leaf is returned, a\nproof of concept is shown on benchmark data sets.","url_abs":"http://arxiv.org/abs/1811.07531v2","url_pdf":"http://arxiv.org/pdf/1811.07531v2.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":"feature-selection-as-monte-carlo-search-in","repo_url":"https://github.com/Aurelien-Pelissier/Feature-Selection-as-Reinforcement-Learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"feature-selection","task_name":"feature selection"}],"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":"Aurelien-Pelissier/Feature-Selection-as-Reinforcement-Learning","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":"a9c66bbaf9fbe1e2eaa78ed9d6e9afbbe0ae7633f392ab3800e80626d9554239","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}