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

Mohammad Sami Nur Islam

dblp:367/5437 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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 · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › reward design
reward shaping
0.812024
Code as Reward: Empowering Reinforcement Learning with VLMs · ICML 2024
Machine learning › Reinforcement learning › reward learning
vision-language model reward
0.812024
Code as Reward: Empowering Reinforcement Learning with VLMs · ICML 2024
Compilers and program optimization
code generation
0.812024
Code as Reward: Empowering Reinforcement Learning with VLMs · ICML 2024

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

vision-language model · 1.5code generation · 1.5
YearPublicationVenuePosition
2024 Code as Reward: Empowering Reinforcement Learning with VLMs
abstract
Pre-trained Vision-Language Models (VLMs) are able to understand visual concepts, describe and decompose complex tasks into sub-tasks, and provide feedback on task completion. In this paper, we aim to leverage these capabilities to support the training of reinforcement learning (RL) agents. In principle, VLMs are well suited for this purpose, as they can naturally analyze image-based observations and provide feedback (reward) on learning progress. However, inference in VLMs is computationally expensive, so querying them frequently to compute rewards would significantly slowdown the training of an RL agent. To address this challenge, we propose a framework named Code as Reward (VLM-CaR). VLM-CaR produces dense reward functions from VLMs through code generation, thereby significantly reducing the computational burden of querying the VLM directly. We show that the dense rewards generated through our approach are very accurate across a diverse set of discrete and continuous environments, and can be more effective in training RL policies than the original sparse environment rewards.
David Venuto, Mohammad Sami Nur Islam, Martin Klissarov, Doina Precup, Sherry Yang 0001, Ankit Anand
ICML2