{"id":{"repo_id":"uts","oai_identifier":"oai:opus.lib.uts.edu.au:10453/195964"},"canonical_url":"https://search.dev.ndltd.org/etd/uts/oai:opus.lib.uts.edu.au:10453/195964","repository":{"repo_id":"uts","name":"University of Technology Sydney","base_url":"https://opus.lib.uts.edu.au/oai/request"},"display":{"title":"Adaptive Successor Features for Transfer Reinforcement Learning","abstract":"Reinforcement Learning has demonstrated remarkable results as a paradigm for machine learning, learning from trial-and-error interactions with an environment. Nevertheless, this paradigm requires an extensive number of samples to perform a specific task, and for a new, unseen task the learning process must start from scratch. Transfer Reinforcement Learning (TRL) is an emerging paradigm that aims to improve sample efficiency by reusing and adapting previously learnt knowledge in new tasks. In recent years, Successor Features (SFs) have been a widely studied framework for TRL. SFs are a robust mechanism for transfer learning that excel in scenarios where rewards are a linear combination of features. They achieve transfer by decoupling transition dynamics from rewards. Moreover, together with Generalised policy improvement (GPI), they form a powerful framework able to compose and transfer solutions to new tasks. This framework has shown promising results in diverse applications such as neuroscience, robotics, autonomous driving, and control. Despite these outstanding results and applications, SFs and GPI present two main limitations. First, they assume that transition dynamics are fixed and shared across tasks, an assumption that hinders knowledge transfer in realistic scenarios where subtle variations in physical or environmental factors can lead to significantly different dynamics. Second, the performance of SFs and GPI on target tasks is theoretically tied to their distance from the source tasks, which limits their ability to guarantee optimal policies for more distant tasks. These challenges highlight the need for new composition mechanisms. This thesis explores mechanisms to enhance SFs and GPI, addressing their current limitations and making the framework more suitable for complex real-world applications. Furthermore, it considers a novel setting in which Reinforcement Learning (RL) is not feasible, showing how SFs can make RL applicable to support human learning.","abstract_html":"Reinforcement Learning has demonstrated remarkable results as a paradigm for machine learning, learning from trial-and-error interactions with an environment. Nevertheless, this paradigm requires an extensive number of samples to perform a specific task, and for a new, unseen task the learning process must start from scratch. Transfer Reinforcement Learning (TRL) is an emerging paradigm that aims to improve sample efficiency by reusing and adapting previously learnt knowledge in new tasks. In recent years, Successor Features (SFs) have been a widely studied framework for TRL. SFs are a robust mechanism for transfer learning that excel in scenarios where rewards are a linear combination of features. They achieve transfer by decoupling transition dynamics from rewards. Moreover, together with Generalised policy improvement (GPI), they form a powerful framework able to compose and transfer solutions to new tasks. This framework has shown promising results in diverse applications such as neuroscience, robotics, autonomous driving, and control. Despite these outstanding results and applications, SFs and GPI present two main limitations. First, they assume that transition dynamics are fixed and shared across tasks, an assumption that hinders knowledge transfer in realistic scenarios where subtle variations in physical or environmental factors can lead to significantly different dynamics. Second, the performance of SFs and GPI on target tasks is theoretically tied to their distance from the source tasks, which limits their ability to guarantee optimal policies for more distant tasks. These challenges highlight the need for new composition mechanisms. This thesis explores mechanisms to enhance SFs and GPI, addressing their current limitations and making the framework more suitable for complex real-world applications. Furthermore, it considers a novel setting in which Reinforcement Learning (RL) is not feasible, showing how SFs can make RL applicable to support human learning.","abstract_has_math":false,"creators":["Garces Aparicio, Oscar Kiyoshige"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-08-21T16:50:26Z","subjects":[],"languages":["en_US"],"rights":["info:eu-repo/semantics/openAccess","The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.","© 2025 Oscar Kiyoshige Garces Aparicio","au.edu.uts.lib/cph"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10453/195964","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"source_record":{"url":"https://opus.lib.uts.edu.au/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.lib.uts.edu.au%3A10453%2F195964","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Garces Aparicio, Oscar Kiyoshige"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-08-10T04:38:55Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-08-10T04:38:55Z"]},{"key":"dc:date.issued","label":"Date","values":["2025"]},{"key":"dc:relation","label":"Dc Relation","values":["https://opus.lib.uts.edu.au/bitstream/10453/195964/1/thesis.pdf"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess","The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.","© 2025 Oscar Kiyoshige Garces Aparicio","au.edu.uts.lib/cph"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10453/195964"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["University of Technology Sydney. Faculty of Engineering and Information Technology."]},{"key":"dc:description.abstract","label":"Abstract","values":["Reinforcement Learning has demonstrated remarkable results as a paradigm for machine learning, learning from trial-and-error interactions with an environment. Nevertheless, this paradigm requires an extensive number of samples to perform a specific task, and for a new, unseen task the learning process must start from scratch. Transfer Reinforcement Learning (TRL) is an emerging paradigm that aims to improve sample efficiency by reusing and adapting previously learnt knowledge in new tasks. In recent years, Successor Features (SFs) have been a widely studied framework for TRL. SFs are a robust mechanism for transfer learning that excel in scenarios where rewards are a linear combination of features. They achieve transfer by decoupling transition dynamics from rewards. Moreover, together with Generalised policy improvement (GPI), they form a powerful framework able to compose and transfer solutions to new tasks. This framework has shown promising results in diverse applications such as neuroscience, robotics, autonomous driving, and control. Despite these outstanding results and applications, SFs and GPI present two main limitations. First, they assume that transition dynamics are fixed and shared across tasks, an assumption that hinders knowledge transfer in realistic scenarios where subtle variations in physical or environmental factors can lead to significantly different dynamics. Second, the performance of SFs and GPI on target tasks is theoretically tied to their distance from the source tasks, which limits their ability to guarantee optimal policies for more distant tasks. These challenges highlight the need for new composition mechanisms. This thesis explores mechanisms to enhance SFs and GPI, addressing their current limitations and making the framework more suitable for complex real-world applications. Furthermore, it considers a novel setting in which Reinforcement Learning (RL) is not feasible, showing how SFs can make RL applicable to support human learning."]},{"key":"dc:format","label":"Dc Format","values":["Thesis (PhD)"]},{"key":"dc:title","label":"Title","values":["Adaptive Successor Features for Transfer Reinforcement Learning"]}]}],"canonical_facts":{"dc:creator":["Garces Aparicio, Oscar Kiyoshige"],"dc:date.accessioned":["2026-08-10T04:38:55Z"],"dc:date.available":["2026-08-10T04:38:55Z"],"dc:date.issued":["2025"],"dc:description":["University of Technology Sydney. Faculty of Engineering and Information Technology."],"dc:description.abstract":["Reinforcement Learning has demonstrated remarkable results as a paradigm for machine learning, learning from trial-and-error interactions with an environment. Nevertheless, this paradigm requires an extensive number of samples to perform a specific task, and for a new, unseen task the learning process must start from scratch. Transfer Reinforcement Learning (TRL) is an emerging paradigm that aims to improve sample efficiency by reusing and adapting previously learnt knowledge in new tasks. In recent years, Successor Features (SFs) have been a widely studied framework for TRL. SFs are a robust mechanism for transfer learning that excel in scenarios where rewards are a linear combination of features. They achieve transfer by decoupling transition dynamics from rewards. Moreover, together with Generalised policy improvement (GPI), they form a powerful framework able to compose and transfer solutions to new tasks. This framework has shown promising results in diverse applications such as neuroscience, robotics, autonomous driving, and control. Despite these outstanding results and applications, SFs and GPI present two main limitations. First, they assume that transition dynamics are fixed and shared across tasks, an assumption that hinders knowledge transfer in realistic scenarios where subtle variations in physical or environmental factors can lead to significantly different dynamics. Second, the performance of SFs and GPI on target tasks is theoretically tied to their distance from the source tasks, which limits their ability to guarantee optimal policies for more distant tasks. These challenges highlight the need for new composition mechanisms. This thesis explores mechanisms to enhance SFs and GPI, addressing their current limitations and making the framework more suitable for complex real-world applications. Furthermore, it considers a novel setting in which Reinforcement Learning (RL) is not feasible, showing how SFs can make RL applicable to support human learning."],"dc:format":["Thesis (PhD)"],"dc:identifier.uri":["http://hdl.handle.net/10453/195964"],"dc:language.iso":["en_US"],"dc:relation":["https://opus.lib.uts.edu.au/bitstream/10453/195964/1/thesis.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess","The author owns the copyright in this thesis including all reproduction and reuse rights for the work. The work may not be altered without the permission of the copyright owner. Attribution is essential when quoting or paraphrasing from this thesis.","© 2025 Oscar Kiyoshige Garces Aparicio","au.edu.uts.lib/cph"],"dc:title":["Adaptive Successor Features for Transfer Reinforcement Learning"],"dc:type":["Thesis"]},"updated_at":"2026-08-21T16:50:26Z"}