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

Sungtae Lee

dblp:198/1249 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 since 2021Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › exploration
intrinsic motivation
0.812024
Unsupervised Object Interaction Learning with Counterfactual Dynamics Models · AAAI 2024
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
skill discovery
0.812024
Unsupervised Object Interaction Learning with Counterfactual Dynamics Models · AAAI 2024
Machine learning › Reinforcement learning
constrained reinforcement learning
0.512021
Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks · ICML 2021
Machine learning › Reinforcement learning › exploration › efficient exploration
sample-efficient exploration
0.512021
Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks · ICML 2021
Machine learning › Reinforcement learning
sparse reward reinforcement learning
0.512021
Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks · ICML 2021

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

successor features · 0.8counterfactual dynamics models · 0.8proximal policy optimization · 0.5count-based exploration · 0.5
YearPublicationVenuePosition
2024 Unsupervised Object Interaction Learning with Counterfactual Dynamics Models
abstract
We present COIL (Counterfactual Object Interaction Learning), a novel way of learning skills of object interactions on entity-centric environments. The goal is to learn primitive behaviors that can induce interactions without external reward or any supervision. Existing skill discovery methods are limited to locomotion, simple navigation tasks, or single-object manipulation tasks, mostly not inducing interaction between objects. Unlike a monolithic representation usually used in prior skill learning methods, we propose to use a structured goal representation that can query and scope which objects to interact with, which can serve as a basis for solving more complex downstream tasks. We design a novel counterfactual intrinsic reward through the use of either a forward model or successor features that can learn an interaction skill between a pair of objects given as a goal. Through experiments on continuous control environments such as Magnetic Block and 2.5-D Stacking Box, we demonstrate that an agent can learn object interaction behaviors (e.g., attaching or stacking one block to another) without any external rewards or domain-specific knowledge.
Sungtae Lee, Sungryull Sohn, Honglak Lee
AAAI2
2021 Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks
abstract
We propose the k-Shortest-Path (k-SP) constraint: a novel constraint on the agent’s trajectory that improves the sample efficiency in sparse-reward MDPs. We show that any optimal policy necessarily satisfies the k-SP constraint. Notably, the k-SP constraint prevents the policy from exploring state-action pairs along the non-k-SP trajectories (e.g., going back and forth). However, in practice, excluding state-action pairs may hinder the convergence of RL algorithms. To overcome this, we propose a novel cost function that penalizes the policy violating SP constraint, instead of completely excluding it. Our numerical experiment in a tabular RL setting demonstrates that the SP-constraint can significantly reduce the trajectory space of policy. As a result, our constraint enables more sample efficient learning by suppressing redundant exploration and exploitation. Our experiments on MiniGrid, DeepMind Lab, Atari, and Fetch show that the proposed method significantly improves proximal policy optimization (PPO) and outperforms existing novelty-seeking exploration methods including count-based exploration even in continuous control tasks, indicating that it improves the sample efficiency by preventing the agent from taking redundant actions.
Sungryull Sohn, Sungtae Lee, Harm van Seijen, Mehdi Fatemi, Honglak Lee
ICML2
2020 Efficient precise weight tuning protocol considering variation of the synaptic devices and target accuracy
Hyeongsu Kim, Jong-Ho Bae, Suhwan Lim, Sungtae Lee, Young-Tak Seo, Dongseok Kwon, Byung-Gook Park, Jong-Ho Lee 0002
Neurocomputing4
2019 Investigation of Neural Networks Using Synapse Arrays Based on Gated Schottky Diodes
abstract
A synapse device array based on the gated Schottky diodes (GSDs) is fabricated. This GSD operates in reverse mode, so the synapse current is considerably low, helping to implement a low-power hardware-based neural networks (HNNs). The reverse Schottky diode current, which represents the synaptic weight, is modulated by applying program or erase pulses. In this GSD, the reverse diode current is used as the synapse current, but the forward diode current is cut off. This is an important feature to prevent the sneak path problem in the crossbar array. A synapse array consisting of fabricated 200 GSDs shows a variation (σ/μ) of 0.34, 0.22, and 0.14 for three different synaptic weight states. By using this GSD array, we perform the vector-by-matrix multiplication, and evaluate the inference accuracy of MNIST. As a baseline accuracy for MNIST classification, a convolutional neural network similar to Lenet-5 is designed and gives an accuracy of 99.53%. Normalization method is applied to the weights trained in the network to map the weights into the conductance range of synapse device. The adaptive weight quantization is then applied to the normalized weights. We verify that the HNN using GSDs works well in comparison to the baseline network even in the presence of non-ideal characteristics of synapse devices.
Suhwan Lim, Dongseok Kwon, Sungtae Lee, Hyeongsu Kim, Jong-Ho Bae, Jong-Ho Lee 0002
IJCNN3
2019 Adaptive learning rule for hardware-based deep neural networks using electronic synapse devices
Suhwan Lim, Jong-Ho Bae, Jai-Ho Eum, Sungtae Lee, Chul-Heung Kim, Dongseok Kwon, Byung-Gook Park, Jong-Ho Lee 0002
Neural Comput. Appl.4
2018 Hardware-based Neural Networks using a Gated Schottky Diode as a Synapse Device
abstract
A gated Schottky diode is proposed for high-performance synapse devices and a means of designing a neural network using this device is described. The proposed gated Schottky diode operates in the saturation region with respect to the input voltage and is therefore immune to input noise and enables accurate vector-by-matrix multiplication. Moreover, by applying identical pulses to the bottom gate to store charges in a storage layer, the reverse saturation current increases almost linearly. Considering these special characteristics, we propose an architecture that uses a time-modulated input pulse and a learning rule based on a single conductance step. A three-layer perceptron network is trained using the conductance response of the synapse device and unidirectional weight-updating methods. In simulations using this network, the classification accuracy rate of MNIST training sets was found to be 94.50%. Compared to memristive devices, the improved linearity of the conductance response in our device is evidence of its higher accuracy.
Suhwan Lim, Jong-Ho Bae, Jai-Ho Eum, Sungtae Lee, Chul-Heung Kim, Dongseok Kwon, Jong-Ho Lee 0002
ISCAS4