{"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/online-abstraction-with-mdp-homomorphisms-for","title":"Online Abstraction with MDP Homomorphisms for Deep Learning","arxiv_id":"1811.12929","date":"2018-11-30","proceeding":null,"authors":["Ondrej Biza","Robert Platt"],"abstract":"Abstraction of Markov Decision Processes is a useful tool for solving complex\nproblems, as it can ignore unimportant aspects of an environment, simplifying\nthe process of learning an optimal policy. In this paper, we propose a new\nalgorithm for finding abstract MDPs in environments with continuous state\nspaces. It is based on MDP homomorphisms, a structure-preserving mapping\nbetween MDPs. We demonstrate our algorithm's ability to learn abstractions from\ncollected experience and show how to reuse the abstractions to guide\nexploration in new tasks the agent encounters. Our novel task transfer method\noutperforms baselines based on a deep Q-network in the majority of our\nexperiments. The source code is at https://github.com/ondrejba/aamas_19.","url_abs":"http://arxiv.org/abs/1811.12929v2","url_pdf":"http://arxiv.org/pdf/1811.12929v2.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":"online-abstraction-with-mdp-homomorphisms-for","repo_url":"https://github.com/ondrejba/aamas_19","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.12929","atlas_url":"https://app.syntology.ai/?focus=1811.12929","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1811.12929"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.12929\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.12929"},"call":"get_concepts_for_paper(arxiv_id=\"1811.12929\")"}],"by_repo":[{"repo":"ondrejba/aamas_19","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":"84b9251506d5be67f7aaa9b3030462e5e3d070d374baa985643e92bb5136695a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}