paper-with-me

Papers

Learning Value Functions from Undirected State-only Experience

2022-04-26 · ICLR 2022 4 · Matthew Chang, Arjun Gupta, Saurabh Gupta

This paper tackles the problem of learning value functions from undirected state-only experience (state transitions without action labels i.e. (s,s',r) tuples). We first theoretically characterize the applicability of Q-learning in this setting. We show that tabular Q-learning in discrete Markov decision processes (MDPs) learns the same value function under any arbitrary refinement of the action space. This theoretical result motivates the design of Latent Action Q-learning or LAQ, an offline RL method that can learn effective value functions from state-only experience. Latent Action Q-learning (LAQ) learns value functions using Q-learning on discrete latent actions obtained through a latent-variable future prediction model. We show that LAQ can recover value functions that have high correlation with value functions learned using ground truth actions. Value functions learned using LAQ lead to sample efficient acquisition of goal-directed behavior, can be used with domain-specific low-level controllers, and facilitate transfer across embodiments. Our experiments in 5 environments ranging from 2D grid world to 3D visual navigation in realistic environments demonstrate the benefits of LAQ over simpler alternatives, imitation learning oracles, and competing methods.

📄 PDF Abstract BibTeX arXiv:2204.12458

Code (0)

등록된 구현이 없습니다.

Tasks

Future predictionImitation LearningOffline RLQ-LearningVisual Navigation

Methods 이 논문이 사용한 방법론

Q-Learning Q-Learning is an off-policy temporal difference control algorithm: $$Q\left(S\_{t}, A\_{t}\right) \leftarrow Q\left(S\_{t}, A\_{t}\right) + \alpha\left[R_{t+1} +…

Similar Papers 제목 키워드 기반

Deep Intrinsically Motivated Exploration in Continuous Control

2022-10-01 · Baturay Saglam, Suleyman S. Kozat

In continuous control, exploration is often performed through undirected strategies in which parameters of the networks or selected actions are perturbed by random noise. Although the deep setting of undirected explorati…

continuous-controlContinuous ControlDeep Reinforcement Learningreinforcement-learning+2

On Robustness of Consensus over Pseudo-Undirected Path Graphs

2025-09-24 · Abhinav Sinha, Dwaipayan Mukherjee, Shashi Ranjan Kumar arxiv

Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states,…

Hermitian matrices for clustering directed graphs: insights and applications

2019-08-06 · Mihai Cucuringu, Huan Li, He Sun, Luca Zanetti

Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance …

ClusteringGraph ClusteringStochastic Block Model

Graph Learning in 4D: a Quaternion-valued Laplacian to Enhance Spectral GCNs

2023-12-28 · Stefano Fiorini, Stefano Coniglio, Michele Ciavotta, Enza Messina

We introduce QuaterGCN, a spectral Graph Convolutional Network (GCN) with quaternion-valued weights at whose core lies the Quaternionic Laplacian, a quaternion-valued Laplacian matrix by whose proposal we generalize two …

Graph Learning

Contour Integration using Graph-Cut and Non-Classical Receptive Field

2020-10-27 · Zahra Mousavi Kouzehkanan, Reshad Hosseini, Babak Nadjar Araabi

Many edge and contour detection algorithms give a soft-value as an output and the final binary map is commonly obtained by applying an optimal threshold. In this paper, we propose a novel method to detect image contours …

Contour Detection