activity
20172025
most citedDropout Q-Functions for Doubly Efficient Reinforcement Learning

19 citations · 31 across the 14 of their papers we have counts for

collaborators

14 papers

cs.AI2025

Consistency Trajectory Planning: High-Quality and Efficient Trajectory Optimization for Offline Model-Based Reinforcement Learning

Guanquan Wang, Takuya Hiraoka, Yoshimasa Tsuruoka

This paper introduces Consistency Trajectory Planning (CTP), a novel offline model-based reinforcement learning method that leverages the recently proposed Consistency Trajectory M…

cs.LG2024

Which Experiences Are Influential for RL Agents? Efficiently Estimating The Influence of Experiences

Takuya Hiraoka, Guanquan Wang, Takashi Onishi +1

In reinforcement learning (RL) with experience replay, experiences stored in a replay buffer influence the RL agent's performance. Information about how these experiences influence…

cs.LG2023

Efficient Sparse-Reward Goal-Conditioned Reinforcement Learning with a High Replay Ratio and Regularization

Takuya Hiraoka

Reinforcement learning (RL) methods with a high replay ratio (RR) and regularization have gained interest due to their superior sample efficiency. However, these methods have mainl…

cs.LG2023

Unsupervised Discovery of Continuous Skills on a Sphere

Takahisa Imagawa, Takuya Hiraoka, Yoshimasa Tsuruoka

Recently, methods for learning diverse skills to generate various behaviors without external rewards have been actively studied as a form of unsupervised reinforcement learning. Ho…

cs.LG2023

Which Experiences Are Influential for Your Agent? Policy Iteration with Turn-over Dropout

Takuya Hiraoka, Takashi Onishi, Yoshimasa Tsuruoka

In reinforcement learning (RL) with experience replay, experiences stored in a replay buffer influence the RL agent's performance. Information about the influence is valuable for v…

cs.LG2021★ 19 cited

Dropout Q-Functions for Doubly Efficient Reinforcement Learning

Takuya Hiraoka, Takahisa Imagawa, Taisei Hashimoto +2

Randomized ensembled double Q-learning (REDQ) (Chen et al., 2021b) has recently achieved state-of-the-art sample efficiency on continuous-action reinforcement learning benchmarks.…

cs.AI2021★ 2 cited

Off-Policy Meta-Reinforcement Learning Based on Feature Embedding Spaces

Takahisa Imagawa, Takuya Hiraoka, Yoshimasa Tsuruoka

Meta-reinforcement learning (RL) addresses the problem of sample inefficiency in deep RL by using experience obtained in past tasks for a new task to be solved. However, most meta-…

cs.LG2020★ 4 cited

Meta-Model-Based Meta-Policy Optimization

Takuya Hiraoka, Takahisa Imagawa, Voot Tangkaratt +3

Model-based meta-reinforcement learning (RL) methods have recently been shown to be a promising approach to improving the sample efficiency of RL in multi-task settings. However, t…

cs.LG2019★ 1 cited

Optimistic Proximal Policy Optimization

Takahisa Imagawa, Takuya Hiraoka, Yoshimasa Tsuruoka

Reinforcement Learning, a machine learning framework for training an autonomous agent based on rewards, has shown outstanding results in various domains. However, it is known that…

cs.LG2019★ 2 cited

Learning Robust Options by Conditional Value at Risk Optimization

Takuya Hiraoka, Takahisa Imagawa, Tatsuya Mori +2

Options are generally learned by using an inaccurate environment model (or simulator), which contains uncertain model parameters. While there are several methods to learn options t…

cs.AI2018★ 2 cited

Optimization of Information-Seeking Dialogue Strategy for Argumentation-Based Dialogue System

Hisao Katsumi, Takuya Hiraoka, Koichiro Yoshino +4

Argumentation-based dialogue systems, which can handle and exchange arguments through dialogue, have been widely researched. It is required that these systems have sufficient suppo…

cs.AI2018★ 1 cited

Refining Manually-Designed Symbol Grounding and High-Level Planning by Policy Gradients

Takuya Hiraoka, Takashi Onishi, Takahisa Imagawa +1

Hierarchical planners that produce interpretable and appropriate plans are desired, especially in its application to supporting human decision making. In the typical development of…

cs.AI2018

Monte Carlo Tree Search with Scalable Simulation Periods for Continuously Running Tasks

Seydou Ba, Takuya Hiraoka, Takashi Onishi +2

Monte Carlo Tree Search (MCTS) is particularly adapted to domains where the potential actions can be represented as a tree of sequential decisions. For an effective action selectio…

cs.AI2017

Deep Reinforcement Learning for Inquiry Dialog Policies with Logical Formula Embeddings

Takuya Hiraoka, Masaaki Tsuchida, Yotaro Watanabe

This paper is the first attempt to learn the policy of an inquiry dialog system (IDS) by using deep reinforcement learning (DRL). Most IDS frameworks represent dialog states and di…