Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ruibo Guo

dblp:404/7235 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 75% Representation and self-supervised learning · 25%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › deep reinforcement learning › visual reinforcement learning
generalization in visual reinforcement learning
0.912025
Learning Robust Representations with Long-Term Information for Generalization in Visual Reinforcement Learning · ICLR 2025
Machine learning › Representation and self-supervised learning › representation learning
robust representation learning
0.912025
Learning Robust Representations with Long-Term Information for Generalization in Visual Reinforcement Learning · ICLR 2025
Machine learning › Reinforcement learning › deep reinforcement learning
visual reinforcement learning
0.912025
Learning Robust Representations with Long-Term Information for Generalization in Visual Reinforcement Learning · ICLR 2025

Methods — techniques the papers use, named apart from their topics

mutual information · 0.9information bottleneck · 0.9
YearPublicationVenuePosition
2025 Learning Robust Representations with Long-Term Information for Generalization in Visual Reinforcement Learning
abstract
Generalization in visual reinforcement learning (VRL) aims to learn agents that can adapt to test environments with unseen visual distractions. Despite advances in robust representations learning, many methods do not take into account the essential downstream task of sequential decision-making. This leads to representations that lack critical long-term information, impairing decision-making abilities in test environments. To tackle this problem, we propose a novel robust action-value representation learning (ROUSER) under the information bottleneck (IB) framework. ROUSER learns robust representations to capture long-term information from the decision-making objective (i.e., action values). Specifically, ROUSER uses IB to encode robust representations by maximizing their mutual information with action values for long-term information, while minimizing mutual information with state-action pairs to discard irrelevant features. As action values are unknown, ROUSER proposes to decompose robust representations of state-action pairs into one-step rewards and robust representations of subsequent pairs. Thus, it can use known rewards to compute the loss for robust representation learning. Moreover, we show that ROUSER accurately estimates action values using learned robust representations, making it applicable to various VRL algorithms. Experiments demonstrate that ROUSER outperforms several state-of-the-art methods in eleven out of twelve tasks, across both unseen background and color distractions.
Rui Yang 0031, Jie Wang 0005, Qijie Peng, Ruibo Guo, Guoping Wu, Bin Li 0025
ICLR4