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.

Arth Shukla

dblp:377/2250 · 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
Robot manipulation · 31% Reinforcement learning · 30% Learning paradigms · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
imitation learning
1.622025
ManiSkill-HAB: A Benchmark for Low-Level Manipulation in Home Rearrangement Tasks · ICLR 2025
Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency · ICLR 2024
Robotics › Robot manipulation
object rearrangement
0.912025
ManiSkill-HAB: A Benchmark for Low-Level Manipulation in Home Rearrangement Tasks · ICLR 2025
Robotics › Motion planning and robot control
robot learning
0.912025
ManiSkill-HAB: A Benchmark for Low-Level Manipulation in Home Rearrangement Tasks · ICLR 2025
Machine learning › Learning paradigms
curriculum learning
0.812024
Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency · ICLR 2024
Robotics › Robot manipulation
learning from demonstration
0.812024
Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency · ICLR 2024
Machine learning › Learning paradigms › curriculum learning
reverse curriculum learning
0.812024
Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency · ICLR 2024
Machine learning › Reinforcement learning
sample efficiency
0.212024
Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency · ICLR 2024

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

trajectory filtering · 0.9reinforcement learning · 0.9imitation learning · 0.9state resets · 0.8reverse curriculum · 0.8forward curriculum · 0.8
YearPublicationVenuePosition
2025 ManiSkill-HAB: A Benchmark for Low-Level Manipulation in Home Rearrangement Tasks
abstract
High-quality benchmarks are the foundation for embodied AI research, enabling significant advancements in long-horizon navigation, manipulation and rearrangement tasks. However, as frontier tasks in robotics get more advanced, they require faster simulation speed, more intricate test environments, and larger demonstration datasets. To this end, we present MS-HAB, a holistic benchmark for low-level manipulation and in-home object rearrangement. First, we provide a GPU-accelerated implementation of the Home Assistant Benchmark (HAB). We support realistic low-level control and achieve over 3x the speed of prior magical grasp implementations at a fraction of the GPU memory usage. Second, we train extensive reinforcement learning (RL) and imitation learning (IL) baselines for future work to compare against. Finally, we develop a rule-based trajectory filtering system to sample specific demonstrations from our RL policies which match predefined criteria for robot behavior and safety. Combining demonstration filtering with our fast environments enables efficient, controlled data generation at scale.
Arth Shukla, Stone Tao, Hao Su 0001
ICLR1
2024 Reverse Forward Curriculum Learning for Extreme Sample and Demo Efficiency
abstract
Reinforcement learning (RL) presents a promising framework to learn policies through environment interaction, but often requires an infeasible amount of interaction data to solve complex tasks from sparse rewards. One direction includes augmenting RL with offline data demonstrating desired tasks, but past work often require a lot of high-quality demonstration data that is difficult to obtain, especially for domains such as robotics. Our approach consists of a reverse curriculum followed by a forward curriculum. Unique to our approach compared to past work is the ability to efficiently leverage more than one demonstration via a per-demonstration reverse curriculum generated via state resets. The result of our reverse curriculum is an initial policy that performs well on a narrow initial state distribution and helps overcome difficult exploration problems. A forward curriculum is then used to accelerate the training of the initial policy to perform well on the full initial state distribution of the task and improve demonstration and sample efficiency. We show how the combination of a reverse curriculum and forward curriculum in our method, RFCL, enables significant improvements in demonstration and sample efficiency compared against various state-of-the-art learning-from-demonstration baselines, even solving previously unsolvable tasks that require high precision and control. Website with code and visualizations are here: https://reverseforward-cl.github.io/
Stone Tao, Arth Shukla, Tse-kai Chan, Hao Su 0001
ICLR2