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.

Shih-Min Yang

dblp:291/8152 · DBLP profile ↗
← Back
3ranked-venue papers
3as 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 · 3 · 3 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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 · 64% Robot manipulation · 36%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.912025
KEA: Keeping Exploration Alive by Proactively Coordinating Exploration Strategies · ICML 2025
Machine learning › Reinforcement learning › exploration
novelty-based exploration
0.912025
KEA: Keeping Exploration Alive by Proactively Coordinating Exploration Strategies · ICML 2025
Machine learning › Reinforcement learning › actor-critic methods
soft actor-critic
0.912025
KEA: Keeping Exploration Alive by Proactively Coordinating Exploration Strategies · ICML 2025
Machine learning › Reinforcement learning › exploration › exploration in markov decision processes
sparse reward exploration
0.912025
KEA: Keeping Exploration Alive by Proactively Coordinating Exploration Strategies · ICML 2025
Robotics › Robot manipulation
grasping
0.812024
Learning Extrinsic Dexterity with Parameterized Manipulation Primitives · ICRA 2024
Robotics › Robot manipulation
manipulation primitives
0.812024
Learning Extrinsic Dexterity with Parameterized Manipulation Primitives · ICRA 2024
Robotics › Robot manipulation › grasping
multifingered grasping
0.812024
Learning Extrinsic Dexterity with Parameterized Manipulation Primitives · ICRA 2024
Machine learning › Reinforcement learning
continuous control
0.312025
KEA: Keeping Exploration Alive by Proactively Coordinating Exploration Strategies · ICML 2025
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.212024
Learning Extrinsic Dexterity with Parameterized Manipulation Primitives · ICRA 2024

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

switching mechanism · 0.9novelty-augmented SAC · 0.9hierarchical reinforcement learning · 0.8depth perception · 0.8
YearPublicationVenuePosition
2025 KEA: Keeping Exploration Alive by Proactively Coordinating Exploration Strategies
abstract
Soft Actor-Critic (SAC) has achieved notable success in continuous control tasks but struggles in sparse reward settings, where infrequent rewards make efficient exploration challenging. While novelty-based exploration methods address this issue by encouraging the agent to explore novel states, they are not trivial to apply to SAC. In particular, managing the interaction between novelty-based exploration and SAC’s stochastic policy can lead to inefficient exploration and redundant sample collection. In this paper, we propose KEA (Keeping Exploration Alive) which tackles the inefficiencies in balancing exploration strategies when combining SAC with novelty-based exploration. KEA integrates a novelty-augmented SAC with a standard SAC agent, proactively coordinated via a switching mechanism. This coordination allows the agent to maintain stochasticity in high-novelty regions, enhancing exploration efficiency and reducing repeated sample collection. We first analyze this potential issue in a 2D navigation task, and then evaluate KEA on the DeepSea hard-exploration benchmark as well as sparse reward control tasks from the DeepMind Control Suite. Compared to state-of-the-art novelty-based exploration baselines, our experiments show that KEA significantly improves learning efficiency and robustness in sparse reward setups.
Shih-Min Yang, Martin Magnusson 0002, Johannes A. Stork, Todor Stoyanov
ICML1
2024 Learning Extrinsic Dexterity with Parameterized Manipulation Primitives
abstract
Many practically relevant robot grasping problems feature a target object for which all grasps are occluded, e.g., by the environment. Single-shot grasp planning invariably fails in such scenarios. Instead, it is necessary to first manipulate the object into a configuration that affords a grasp. We solve this problem by learning a sequence of actions that utilize the environment to change the object’s pose. Concretely, we employ hierarchical reinforcement learning to combine a sequence of learned parameterized manipulation primitives. By learning the low-level manipulation policies, our approach can control the object’s state through exploiting interactions between the object, the gripper, and the environment. Designing such a complex behavior analytically would be infeasible under uncontrolled conditions, as an analytic approach requires accurate physical modeling of the interaction and contact dynamics. In contrast, we learn a hierarchical policy model that operates directly on depth perception data, without the need for object detection, pose estimation, or manual design of controllers. We evaluate our approach on picking box-shaped objects of various weight, shape, and friction properties from a constrained table-top workspace. Our method transfers to a real robot and is able to successfully complete the object picking task in 98% of experimental trials.
Shih-Min Yang, Martin Magnusson 0002, Johannes A. Stork, Todor Stoyanov
ICRA1
2020 Unsupervised Multi-Task Domain Adaptation
abstract
With abundant labeled data, deep convolutional neural networks have shown great success in various image recognition tasks. However, these models are often less powerful when applied to novel datasets due to a phenomenon known as domain shift. Unsupervised domain adaptation methods aim to address this problem, allowing deep models trained on the labeled source domain to be used on a different target domain (without labels). In this paper, we investigate whether the generalization ability of an unsupervised domain adaptation method can be improved through multi-task learning, with learned features required to be both domain invariant and discriminative for multiple different but relevant tasks. Experiments evaluating two fundamental recognition tasks-image recognition and segmentation-show that the generalization ability empowered by multi-task learning may not benefit recognition when the model is directly applied on the target domain, but the multi-task learning setting can boost the performance of state-of-the-art unsupervised domain adaptation methods by a non-negligible margin.
Shih-Min Yang, Mei-Chen Yeh
ICPR1