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

Bill Zheng 0001

dblp:386/2313 · also Bill Chunyuan Zheng · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 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
1 paper
Robot manipulation · 30% Language models and text generation · 30% Reinforcement learning · 30%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
compositional generalization
0.912025
Temporal Representation Alignment: Successor Features Enable Emergent Compositionality in Robot Instruction Following · NeurIPS 2025
Robotics › Robot manipulation › human-robot interaction
robot instruction following
0.912025
Temporal Representation Alignment: Successor Features Enable Emergent Compositionality in Robot Instruction Following · NeurIPS 2025
Machine learning › Reinforcement learning › function approximation › representation learning for reinforcement learning
successor features
0.912025
Temporal Representation Alignment: Successor Features Enable Emergent Compositionality in Robot Instruction Following · NeurIPS 2025
Robotics › Motion planning and robot control
robot learning
0.312025
Temporal Representation Alignment: Successor Features Enable Emergent Compositionality in Robot Instruction Following · NeurIPS 2025

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

temporal alignment loss · 0.9
YearPublicationVenuePosition
2025 Temporal Representation Alignment: Successor Features Enable Emergent Compositionality in Robot Instruction Following
abstract
Effective task representations should facilitate compositionality, such that after learning a variety of basic tasks, an agent can perform compound tasks consisting of multiple steps simply by composing the representations of the constituent steps together. While this is conceptually simple and appealing, it is not clear how to automatically learn representations that enable this sort of compositionality. We show that learning to associate the representations of current and future states with a temporal alignment loss can improve compositional generalization, even in the absence of any explicit subtask planning or reinforcement learning. We evaluate our approach across diverse robotic manipulation tasks as well as in simulation, showing substantial improvements for tasks specified with either language or goal images.
Vivek Myers, Bill Zheng 0001, Anca D. Dragan, Kuan Fang, Sergey Levine
NeurIPS2
2025 Offline Goal-conditioned Reinforcement Learning with Quasimetric Representations
abstract
Approaches for goal-conditioned reinforcement learning (GCRL) often use learned state representations to extract goal-reaching policies. Two frameworks for representation structure have yielded particularly effective GCRL algorithms: (1) *contrastive representations*, in which methods learn "successor features" with a contrastive objective that performs inference over future outcomes, and (2) *temporal distances*, which link the (quasimetric) distance in representation space to the transit time from states to goals. We propose an approach that unifies these two frameworks, using the structure of a quasimetric representation space (triangle inequality) with the right additional constraints to learn successor representations that enable optimal goal-reaching. Unlike past work, our approach is able to exploit a **quasimetric** distance parameterization to learn **optimal** goal-reaching distances, even with **suboptimal** data and in **stochastic** environments. This gives us the best of both worlds: we retain the stability and long-horizon capabilities of Monte Carlo contrastive RL methods, while getting the free stitching capabilities of quasimetric network parameterizations. On existing offline GCRL benchmarks, our representation learning objective improves performance on stitching tasks where methods based on contrastive learning struggle, and on noisy, high-dimensional environments where methods based on quasimetric networks struggle.
Vivek Myers, Bill Zheng 0001, Benjamin Eysenbach, Sergey Levine
NeurIPS2