<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-21T20:28:43Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/298048" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/298048</identifier><datestamp>2021-04-21T20:19:46Z</datestamp><setSpec>com_1810_213729</setSpec><setSpec>com_1810_256065</setSpec><setSpec>col_1810_219485</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
   <dc:title>Sample-Efficient Deep Reinforcement Learning for Continuous Control</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">10.17863/CAM.45105</dc:identifier>
   <dc:creator>Gu, Shixiang</dc:creator>
   <uketdterms:authoridentifier xsi:type="uketdterms:ORCID">0000000192460896</uketdterms:authoridentifier>
   <uketdterms:advisor>Turner, Richard E.</uketdterms:advisor>
   <uketdterms:advisor>Ghahramani, Zoubin</uketdterms:advisor>
   <uketdterms:advisor>Schoelkopf, Bernhard</uketdterms:advisor>
   <dcterms:abstract>Reinforcement learning (RL) is a powerful, generic approach to discovering optimal policies
in complex sequential decision-making problems. Recently, with flexible function approximators such as neural networks, RL has greatly expanded its realm of applications, from
playing computer games with pixel inputs, to mastering the game of Go, to learning parkour
movements by simulated humanoids. However, the common RL approaches are known
to be sample intensive, making them difficult to be applied to real-world problems such
as robotics. This thesis makes several contributions toward developing RL algorithms for
learning in the wild, where sample-efficiency and stability are critical. The key contributions
include Normalized Advantage Functions (NAF), extending Q-learning for continuous action problems; Interpolated Policy Gradient (IPG), unifying prior policy gradient algorithm
variants through theoretical analyses on bias and variance; and Temporal Difference Models
(TDM), interpreting a parameterized Q-function as a generalized dynamics model for novel
temporally abstracted model-based planning. Importantly, this thesis highlights that these
algorithms can be seen as bridging gaps between branches of RL – model-based with modelfree, and on-policy with off-policy. The proposed algorithms not only achieve substantial
improvements over the prior approaches, but also provide novel perspectives on how to mix
different branches of RL effectively to gain the best of both worlds. NAF has subsequently
been shown to be able to train two 7-DoF robot arms to open doors using only 2.5 hours of
real-world experience, making it one of the first demonstrations of deep RL approaches on
real robots.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2019-11-01</dcterms:issued>
   <dc:type>Thesis</dc:type>
   <uketdterms:qualificationlevel>Doctoral</uketdterms:qualificationlevel>
   <uketdterms:qualificationname>Doctor of Philosophy (PhD)</uketdterms:qualificationname>
   <dc:language>en</dc:language>
   <uketdterms:sponsor>- Cambridge-Tuebingen PhD Fellowship in Machine Learning
- Google Focused Research Award
- NSERC</uketdterms:sponsor>
   <dcterms:isReferencedBy xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/handle/1810/298048</dcterms:isReferencedBy>
   <dc:identifier xsi:type="dcterms:URI">https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/ef84fbcb-530b-4039-a3a4-955d963299ef/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">efacfd26b62dc0201d89abe01f079162</uketdterms:checksum>
   <dcterms:license>https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/42bb22d6-31b2-443b-8b1e-92f5d9a2bdfd/download</dcterms:license>
   <uketdterms:checksum xsi:type="uketdterms:MD5">87eda9de84448d1f82354d60eee3eb5f</uketdterms:checksum>
   <dc:rights>https://www.rioxx.net/licenses/all-rights-reserved/</dc:rights>
   <dc:subject>Reinforcement Learning</dc:subject>
   <dc:subject>Continuous Control</dc:subject>
   <dc:subject>Robotics</dc:subject>
   <dc:subject>Deep Learning</dc:subject>
   <dc:subject>Machine Learning</dc:subject>
   <dc:subject>Model-based Planning</dc:subject>
   <dc:subject>Model-free Reinforcement Learning</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>