Bum Jun Kim
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
Research Subjects
Bum Jun Kim has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Sang Woo Kim
Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, South Korea
17 shared publications - Hyeyeon Choi
Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, South Korea
10 shared publications - Hyeonah Jang
Department of Electrical Engineering, Pohang University of Science and Technology, Pohang, South Korea
9 shared publications - Anastasis Kratsios
Department of Mathematics, McMaster University, Canada; Vector Institute, Canada
1 shared publication - Dong Gu Lee
Department of Integrative Plant Science, Chung-Ang University, Anseong 17546, Korea
1 shared publication - Gyogwon Koo
Division of Intelligent Robot
1 shared publication
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9411-9414
Beyond Benchmarks: Robustness for Real-World Information Systems
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9411-9414
Open AccessBeyond Benchmarks: Robustness for Real-World Information Systems
- 4 June 2026
- Published by Elsevier in Neural Networks
- Vol. 204, 109222
Temperature-free loss function for contrastive learning
- 4 June 2026
- Published by Elsevier in Neural Networks
- Vol. 204, 109222
Temperature-free loss function for contrastive learning
- 5 March 2026
- Published by Elsevier in Neural Networks
- Vol. 200, 108797
Approximation rates in Besov norms and sample-complexity of Kolmogorov-Arnold networks with residual connections
- 5 March 2026
- Published by Elsevier in Neural Networks
- Vol. 200, 108797
Approximation rates in Besov norms and sample-complexity of Kolmogorov-Arnold networks with residual connections
- 12 January 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 190
Stochastic subsampling with average pooling
- 12 January 2026
- Published by Elsevier in Applied Soft Computing
- Vol. 190
Stochastic subsampling with average pooling
- 31 December 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 166
Resolution-aware design of atrous rates for semantic segmentation networks
- 31 December 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 166
Resolution-aware design of atrous rates for semantic segmentation networks
- 8 December 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 130
Noise-robust anomaly detection framework using temporal features for industrial applications
- 8 December 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 130
Noise-robust anomaly detection framework using temporal features for industrial applications
- 10 October 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 185
Analysis of NaN divergence in training monocular depth estimation model
- 10 October 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 185
Analysis of NaN divergence in training monocular depth estimation model
- Open Access
Stochastic Subsampling With Average Pooling
Regularization of deep neural networks has been an important issue to achieve higher generalization performance without overfitting problems. Although the popular method of Dropout provides a regularization effect, it causes inconsistent properties in the output, which may degrade the performance of deep neural networks. In this study, we propose a new module called stochastic average pooling, which incorporates Dropout-like stochasticity in pooling. We describe the properties of stochastic subsampling and average pooling and leverage them to design a module without any inconsistency problem. The stochastic average pooling achieves a regularization effect without any potential performance degradation due to the inconsistency issue and can easily be plugged into existing architectures of deep neural networks. Experiments demonstrate that replacing existing average pooling with stochastic average pooling yields consistent improvements across a variety of tasks, datasets, and models.
Open AccessStochastic Subsampling With Average Pooling
Regularization of deep neural networks has been an important issue to achieve higher generalization performance without overfitting problems. Although the popular method of Dropout provides a regularization effect, it causes inconsistent properties in the output, which may degrade the performance of deep neural networks. In this study, we propose a new module called stochastic average pooling, which incorporates Dropout-like stochasticity in pooling. We describe the properties of stochastic subsampling and average pooling and leverage them to design a module without any inconsistency problem. The stochastic average pooling achieves a regularization effect without any potential performance degradation due to the inconsistency issue and can easily be plugged into existing architectures of deep neural networks. Experiments demonstrate that replacing existing average pooling with stochastic average pooling yields consistent improvements across a variety of tasks, datasets, and models.
- Open Access
The Disappearance of Timestep Embedding in Modern Time-Dependent Neural Networks
Dynamical systems are often time-varying, whose modeling requires a function that evolves with respect to time. Recent studies such as the neural ordinary differential equation proposed a time-dependent neural network, which provides a neural network varying with respect to time. However, we claim that the architectural choice to build a time-dependent neural network significantly affects its time-awareness but still lacks sufficient validation in its current states. In this study, we conduct an in-depth analysis of the architecture of modern time-dependent neural networks. Here, we report a vulnerability of vanishing timestep embedding, which disables the time-awareness of a time-dependent neural network. Furthermore, we find that this vulnerability can also be observed in diffusion models because they employ a similar architecture that incorporates timestep embedding to discriminate between different timesteps during a diffusion process. Our analysis provides a detailed description of this phenomenon as well as several solutions to address the root cause. Through experiments on neural ordinary differential equations and diffusion models, we observed that ensuring alive time-awareness via proposed solutions boosted their performance, which implies that their current implementations lack sufficient time-dependency.
Open AccessThe Disappearance of Timestep Embedding in Modern Time-Dependent Neural Networks
Dynamical systems are often time-varying, whose modeling requires a function that evolves with respect to time. Recent studies such as the neural ordinary differential equation proposed a time-dependent neural network, which provides a neural network varying with respect to time. However, we claim that the architectural choice to build a time-dependent neural network significantly affects its time-awareness but still lacks sufficient validation in its current states. In this study, we conduct an in-depth analysis of the architecture of modern time-dependent neural networks. Here, we report a vulnerability of vanishing timestep embedding, which disables the time-awareness of a time-dependent neural network. Furthermore, we find that this vulnerability can also be observed in diffusion models because they employ a similar architecture that incorporates timestep embedding to discriminate between different timesteps during a diffusion process. Our analysis provides a detailed description of this phenomenon as well as several solutions to address the root cause. Through experiments on neural ordinary differential equations and diffusion models, we observed that ensuring alive time-awareness via proposed solutions boosted their performance, which implies that their current implementations lack sufficient time-dependency.
- Open Access
Configuring Data Augmentations to Reduce Variance Shift in Positional Embedding of Vision Transformers
Vision transformers (ViTs) have demonstrated remarkable performance in a variety of vision tasks. Despite their promising capabilities, training a ViT requires a large amount of diverse data. Several studies empirically found that using rich data augmentations, such as Mixup, Cutmix, and random erasing, is critical to the successful training of ViTs. Now, the use of rich data augmentations has become a standard practice in the current state. However, we report a vulnerability to this practice: Certain data augmentations such as Mixup cause a variance shift in the positional embedding of ViT, which has been a hidden factor that degrades the performance of ViT during the test phase. We claim that achieving a stable effect from positional embedding requires a specific condition on the image, which is often broken for the current data augmentation methods. We provide a detailed analysis of this problem as well as the correct configuration for these data augmentations to remove the side effects of variance shift. Experiments showed that adopting our guidelines improves the performance of ViTs compared with the current configuration of data augmentations.
Open AccessConfiguring Data Augmentations to Reduce Variance Shift in Positional Embedding of Vision Transformers
Vision transformers (ViTs) have demonstrated remarkable performance in a variety of vision tasks. Despite their promising capabilities, training a ViT requires a large amount of diverse data. Several studies empirically found that using rich data augmentations, such as Mixup, Cutmix, and random erasing, is critical to the successful training of ViTs. Now, the use of rich data augmentations has become a standard practice in the current state. However, we report a vulnerability to this practice: Certain data augmentations such as Mixup cause a variance shift in the positional embedding of ViT, which has been a hidden factor that degrades the performance of ViT during the test phase. We claim that achieving a stable effect from positional embedding requires a specific condition on the image, which is often broken for the current data augmentation methods. We provide a detailed analysis of this problem as well as the correct configuration for these data augmentations to remove the side effects of variance shift. Experiments showed that adopting our guidelines improves the performance of ViTs compared with the current configuration of data augmentations.