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

Christopher Hoang

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

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers
Reinforcement learning · 35% Video understanding and tracking · 34% Representation and self-supervised learning · 26%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › visual representation learning
dense representation learning
0.912025
PooDLe🐩: Pooled and dense self-supervised learning from naturalistic videos · ICLR 2025
Computer vision › Video understanding and tracking › video representation learning
self-supervised video representation learning
0.912025
PooDLe🐩: Pooled and dense self-supervised learning from naturalistic videos · ICLR 2025
Machine learning › Reinforcement learning
exploration
0.512021
Successor Feature Landmarks for Long-Horizon Goal-Conditioned Reinforcement Learning · NeurIPS 2021
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
0.512021
Successor Feature Landmarks for Long-Horizon Goal-Conditioned Reinforcement Learning · NeurIPS 2021
Machine learning › Reinforcement learning › goal-conditioned reinforcement learning
goal-conditioned policy
0.112021
Successor Feature Landmarks for Long-Horizon Goal-Conditioned Reinforcement Learning · NeurIPS 2021
Robotics › Motion planning and robot control
robot learning
0.112021
Successor Feature Landmarks for Long-Horizon Goal-Conditioned Reinforcement Learning · NeurIPS 2021

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

optical flow warping · 0.9invariance-based objective · 0.9dense SSL objective · 0.9successor features · 0.5landmark-based graph planning · 0.5
YearPublicationVenuePosition
2025 PooDLe🐩: Pooled and dense self-supervised learning from naturalistic videos
abstract
Self-supervised learning has driven significant progress in learning from single-subject, _iconic_ images. However, there are still unanswered questions about the use of minimally-curated, naturalistic video data, which contain _dense_ scenes with many independent objects, imbalanced class distributions, and varying object sizes. In this paper, we propose PooDLe, a self-supervised learning method that combines an invariance-based objective on pooled representations with a dense SSL objective that enforces equivariance to optical flow warping. Our results show that a unified objective applied at multiple feature scales is essential for learning effective image representations from naturalistic videos. We validate our method with experiments on the BDD100K driving video dataset and the Walking Tours first-person video dataset, demonstrating its ability to capture spatial understanding from a dense objective and semantic understanding via a pooled representation objective.
Alex N. Wang, Christopher Hoang, Yuwen Xiong, Yann LeCun, Mengye Ren
ICLR2
2021 Successor Feature Landmarks for Long-Horizon Goal-Conditioned Reinforcement Learning
abstract
Operating in the real-world often requires agents to learn about a complex environment and apply this understanding to achieve a breadth of goals. This problem, known as goal-conditioned reinforcement learning (GCRL), becomes especially challenging for long-horizon goals. Current methods have tackled this problem by augmenting goal-conditioned policies with graph-based planning algorithms. However, they struggle to scale to large, high-dimensional state spaces and assume access to exploration mechanisms for efficiently collecting training data. In this work, we introduce Successor Feature Landmarks (SFL), a framework for exploring large, high-dimensional environments so as to obtain a policy that is proficient for any goal. SFL leverages the ability of successor features (SF) to capture transition dynamics, using it to drive exploration by estimating state-novelty and to enable high-level planning by abstracting the state-space as a non-parametric landmark-based graph. We further exploit SF to directly compute a goal-conditioned policy for inter-landmark traversal, which we use to execute plans to "frontier" landmarks at the edge of the explored state space. We show in our experiments on MiniGrid and ViZDoom that SFL enables efficient exploration of large, high-dimensional state spaces and outperforms state-of-the-art baselines on long-horizon GCRL tasks.
Christopher Hoang, Sungryull Sohn, Wilka Carvalho, Honglak Lee
NeurIPS1