{"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/nonparametric-stochastic-compositional","title":"Nonparametric Stochastic Compositional Gradient Descent for Q-Learning in Continuous Markov Decision Problems","arxiv_id":"1804.07323","date":"2018-04-19","proceeding":null,"authors":["Alec Koppel","Ekaterina Tolstaya","Ethan Stump","Alejandro Ribeiro"],"abstract":"We consider Markov Decision Problems defined over continuous state and action\nspaces, where an autonomous agent seeks to learn a map from its states to\nactions so as to maximize its long-term discounted accumulation of rewards. We\naddress this problem by considering Bellman's optimality equation defined over\naction-value functions, which we reformulate into a nested non-convex\nstochastic optimization problem defined over a Reproducing Kernel Hilbert Space\n(RKHS). We develop a functional generalization of stochastic quasi-gradient\nmethod to solve it, which, owing to the structure of the RKHS, admits a\nparameterization in terms of scalar weights and past state-action pairs which\ngrows proportionately with the algorithm iteration index. To ameliorate this\ncomplexity explosion, we apply Kernel Orthogonal Matching Pursuit to the\nsequence of kernel weights and dictionaries, which yields a controllable error\nin the descent direction of the underlying optimization method. We prove that\nthe resulting algorithm, called KQ-Learning, converges with probability 1 to a\nstationary point of this problem, yielding a fixed point of the Bellman\noptimality operator under the hypothesis that it belongs to the RKHS. Under\nconstant learning rates, we further obtain convergence to a small Bellman error\nthat depends on the chosen learning rates. Numerical evaluation on the\nContinuous Mountain Car and Inverted Pendulum tasks yields convergent\nparsimonious learned action-value functions, policies that are competitive with\nthe state of the art, and exhibit reliable, reproducible learning behavior.","url_abs":"http://arxiv.org/abs/1804.07323v1","url_pdf":"http://arxiv.org/pdf/1804.07323v1.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":"nonparametric-stochastic-compositional","repo_url":"https://github.com/katetolstaya/kernelrl","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"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":"katetolstaya/kernelrl","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":"7c9bc1b8f0893b192d1503269604773048d40e7c91048c81ef32662698919d15","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}