Junseok Park
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Junseok Park has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Byoung-Tak Zhang
Seoul National University
1 shared publication Hyejeong Lee
Ewha University, Seoul, South Korea
1 shared publication- Hyeonseo Yang
Department of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea
1 shared publication - Hyokyung Bahn
Department of Computer Engineering, Ewha University, Seoul 03760, Republic of Korea
1 shared publication Kern Koh
Seoul National University, Seoul, South Korea
1 shared publication- Min Whoo Lee
Department of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive and Developmental Systems
- Vol. 18 (3) , 637-654
From Sparse to Dense: Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning
Reinforcement learning (RL) agents face fundamental challenges in balancing exploration and exploitation, particularly when sparse or dense rewards bias learning toward sub–optimal behaviors. Biological systems, notably human toddlers, naturally navigate this balance through developmental transitions from free exploration to goal-directed behavior. Inspired by this progression, we propose the Sparse-to-Dense (S2D) reward transition for goal-oriented RL tasks. Our approach transitions from sparse rewards encouraging broad exploration to dense rewards guiding efficient exploitation, while preserving optimal policies via potential-based reward shaping throughout. Through extensive experiments on robotic manipulation and egocentric 3D navigation tasks, we demonstrate that S2D transitions significantly enhance sample efficiency, and generalization compared to static reward schemes and intrinsic motivation baselines. Using a novel Cross-Density Visualizer, we reveal that S2D transitions smooth the policy loss landscape, resulting in wider minima associated with improved generalization. Furthermore, reinterpreting Tolman’s maze experiments in modern RL contexts, we show that early sparse-reward exploration establishes robust initial parameters analogous to cognitive maps, facilitating stable learning under subsequent dense rewards. Our findings bridge developmental psychology and machine learning, offering a principled framework for designing adaptive reward structures in complex RL environments.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive and Developmental Systems
- Vol. 18 (3) , 637-654
Open AccessFrom Sparse to Dense: Toddler-Inspired Reward Transition in Goal-Oriented Reinforcement Learning
Reinforcement learning (RL) agents face fundamental challenges in balancing exploration and exploitation, particularly when sparse or dense rewards bias learning toward sub–optimal behaviors. Biological systems, notably human toddlers, naturally navigate this balance through developmental transitions from free exploration to goal-directed behavior. Inspired by this progression, we propose the Sparse-to-Dense (S2D) reward transition for goal-oriented RL tasks. Our approach transitions from sparse rewards encouraging broad exploration to dense rewards guiding efficient exploitation, while preserving optimal policies via potential-based reward shaping throughout. Through extensive experiments on robotic manipulation and egocentric 3D navigation tasks, we demonstrate that S2D transitions significantly enhance sample efficiency, and generalization compared to static reward schemes and intrinsic motivation baselines. Using a novel Cross-Density Visualizer, we reveal that S2D transitions smooth the policy loss landscape, resulting in wider minima associated with improved generalization. Furthermore, reinterpreting Tolman’s maze experiments in modern RL contexts, we show that early sparse-reward exploration establishes robust initial parameters analogous to cognitive maps, facilitating stable learning under subsequent dense rewards. Our findings bridge developmental psychology and machine learning, offering a principled framework for designing adaptive reward structures in complex RL environments.
- Open Access
- 12 October 2009
- Published by Association for Computing Machinery (ACM)
- p. 315-324
A cost-aware page replacement algorithm for NAND flash based mobile embedded systems
NAND flash memory is widely used as secondary storage in mobile embedded systems such as cellular phones and digital cameras. These systems usually employ a compressed file system (CFS) to store system files which are fixed during the design phase, in combination with a normal file system to store data files. Since retrieving pages from a CFS requires additional decompression time, it is reasonable to grant them higher priorities when making a page replacement decision. In this paper, we present a new page replacement algorithm for NAND flash memory based embedded systems that considers asymmetric operation cost of each page. The proposed algorithm considers the decompression cost of a page from CFS as well as the asymmetric I/O costs of reads and writes in flash memory. To do this, the algorithm partitions the memory space into a read area, a write area, and a compressed area depending on different operation costs. The size of each area is then dynamically adjusted based on the change of access patterns and the contribution to reducing the I/O costs. Trace-driven simulations show that the proposed algorithm improves the I/O performance of mobile embedded systems significantly. Specifically, it reduces I/O time by 4.8-53.3% compared to widely acknowledged algorithms such as CLOCK, CAR, and CFLRU.
- 12 October 2009
- Published by Association for Computing Machinery (ACM)
- p. 315-324
Open AccessA cost-aware page replacement algorithm for NAND flash based mobile embedded systems
NAND flash memory is widely used as secondary storage in mobile embedded systems such as cellular phones and digital cameras. These systems usually employ a compressed file system (CFS) to store system files which are fixed during the design phase, in combination with a normal file system to store data files. Since retrieving pages from a CFS requires additional decompression time, it is reasonable to grant them higher priorities when making a page replacement decision. In this paper, we present a new page replacement algorithm for NAND flash memory based embedded systems that considers asymmetric operation cost of each page. The proposed algorithm considers the decompression cost of a page from CFS as well as the asymmetric I/O costs of reads and writes in flash memory. To do this, the algorithm partitions the memory space into a read area, a write area, and a compressed area depending on different operation costs. The size of each area is then dynamically adjusted based on the change of access patterns and the contribution to reducing the I/O costs. Trace-driven simulations show that the proposed algorithm improves the I/O performance of mobile embedded systems significantly. Specifically, it reduces I/O time by 4.8-53.3% compared to widely acknowledged algorithms such as CLOCK, CAR, and CFLRU.