← Search

Minjae Kang

16 accepted papers

2026

Enhancing Instruction Following of LLMs via Activation Steering with Dynamic Rejection

ICLR 2026poster

Large Language Models (LLMs), despite advances in instruction tuning, often fail to follow complex user instructions. Activation steering techniques aim to mitigate this by manipulating model internals, but have a potential risk of oversteering, where excessive emphasis on the instruction degrades t…

Cited by 0SourcecodeScholar
2026

Playbook: Scalable Discrete Skill Discovery from Unstructured Datasets for Long-Horizon Decision-Making Problems

ICRA 2026poster

Skill discovery methods enable agents to tackle intricate tasks by acquiring diverse and useful skills from task-agnostic datasets in an unsupervised manner. To apply these methods to more general and everyday tasks, the skill set must be scalable. However, current approaches struggle with this scal…

Cited by 0SourceScholar
2026

Tidiness Score-Guided Monte Carlo Tree Search for Visual Tabletop Rearrangement

ICRA 2026poster

In this paper, we present the tidiness score-guided Monte Carlo tree search (TSMCTS), a novel framework designed to address the tabletop tidying up problem using only an RGB-D camera. We address two major problems for tabletop tidying up problem: (1) the lack of public datasets and benchmarks, and (…

2025

Automatic Real-to-Sim-to-Real System through Iterative Interactions for Robust Robot Manipulation Policy Learning with Unseen Objects

IROS 2025

Real-to-sim-to-real systems have been studied to overcome the challenges of robot policy learning in the real world by creating a virtual environment that mimics the actual workspace. However, previous studies have limitations, requiring human assistance, such as observing the workspace with a hand-

Cited by 0SourceScholar
2025

Playbook: Scalable Discrete Skill Discovery From Unstructured Datasets for Long-Horizon Decision-Making Problems

RA-L 2025

Skill discovery methods enable agents to tackle intricate tasks by acquiring diverse and useful skills from task-agnostic datasets in an unsupervised manner. To apply these methods to more general and everyday tasks, the skill set must be scalable. However, current approaches struggle with this scal

Cited by 0SourcecodeScholar
2025

Riemannian Optimization for LoRA on the Stiefel Manifold

EMNLP 2025

While powerful, large language models (LLMs) present significant fine-tuning challenges due to their size. Parameter-efficient fine-tuning (PEFT) methods like LoRA provide solutions, yet suffer from critical optimizer inefficiencies; notably basis redundancy in LoRA’s B matrix when using AdamW, whic

Cited by 0SourcePDFScholar
2025

Tidiness Score-Guided Monte Carlo Tree Search for Visual Tabletop Rearrangement

RA-L 2025

In this paper, we present the tidiness score-guided Monte Carlo tree search (TSMCTS), a novel framework designed to address the tabletop tidying up problem using only an RGB-D camera. We address two major problems for tabletop tidying up problem: (1) the lack of public datasets and benchmarks, and (

Cited by 2SourcecodeScholar
2024

Gradual Receptive Expansion Using Vision Transformer for Online 3D Bin Packing

IROS 2024poster

The bin packing problem (BPP) is a challenging combinatorial optimization problem with a number of practical applications. This paper focuses on online 3D-BPP, where the packer makes immediate decisions for a loading position as items continually arrive. We propose a novel reinforcement learning alg…

Cited by 0SourceScholar
2023

Object Rearrangement Planning for Target Retrieval in a Confined Space with Lateral View

IROS 2023poster

In this paper, we perform an object rearrangement task for target retrieval in an environment with a confined space and limited observation directions. The agent must create a collision-free path to bring out the target object by relocating the surrounding objects using the prehensile action, i.e.,…

Cited by 1SourceScholar
2023

SCAN: Socially-Aware Navigation Using Monte Carlo Tree Search

ICRA 2023poster

Designing a socially-aware navigation method for crowded environments has become a critical issue in robotics. In order to perform navigation in a crowded environment without causing discomfort to nearby pedestrians, it is necessary to design a global planner that is able to consider both human-robo…

Cited by 7SourceScholar
2023

SDF-Based Graph Convolutional Q-Networks for Rearrangement of Multiple Objects

ICRA 2023poster

In this paper, we propose a signed distance field (SDF)-based deep Q-learning framework for multi-object re-arrangement. Our method learns to rearrange objects with non-prehensile manipulation, e.g., pushing, in unstructured environments. To reliably estimate Q-values in various scenes, we train the…

Cited by 3SourceScholar
2022

Dynamics-Aware Metric Embedding: Metric Learning in a Latent Space for Visual Planning

RA-L 2022

In this letter, we consider vision-based control tasks of which the desired goals are given as target images. The problems are often addressed by an autonomous agent which optimizes a trajectory to minimize a manually designed cost function. However, it is challenging to design a suitable cost funct

Cited by 3SourceScholar
2022

Grasp Planning for Occluded Objects in a Confined Space with Lateral View Using Monte Carlo Tree Search

IROS 2022poster

In the lateral access environment, the robot be-havior should be planned considering surrounding objects and obstacles because object observation directions and approach angles are limited. To safely retrieve a partially occluded target object in these environments, we have to relocate objects using…

Cited by 6SourceScholar