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.

Siyeol Kim

dblp:390/9411 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 2 · 2 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 · 19% Trustworthy machine learning · 19% Transfer learning and domain adaptation · 19%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
domain generalization
0.912025
FlickerFusion: Intra-trajectory Domain Generalizing Multi-agent Reinforcement Learning · ICLR 2025
Machine learning › Optimization for machine learning
gradient flow
0.912025
Revisiting Residual Connections: Orthogonal Updates for Stable and Efficient Deep Networks · NeurIPS 2025
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.912025
FlickerFusion: Intra-trajectory Domain Generalizing Multi-agent Reinforcement Learning · ICLR 2025
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.912025
FlickerFusion: Intra-trajectory Domain Generalizing Multi-agent Reinforcement Learning · ICLR 2025
Machine learning › Deep learning architectures and training › skip connections
residual connection
0.912025
Revisiting Residual Connections: Orthogonal Updates for Stable and Efficient Deep Networks · NeurIPS 2025
Computer vision › Image recognition and object detection
image classification
0.312025
Revisiting Residual Connections: Orthogonal Updates for Stable and Efficient Deep Networks · NeurIPS 2025

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

residual learning · 0.9orthogonal decomposition · 0.9observation dropout augmentation · 0.9
YearPublicationVenuePosition
2025 FlickerFusion: Intra-trajectory Domain Generalizing Multi-agent Reinforcement Learning
abstract
Multi-agent reinforcement learning has demonstrated significant potential in addressing complex cooperative tasks across various real-world applications. However, existing MARL approaches often rely on the restrictive assumption that the number of entities (e.g., agents, obstacles) remains constant between training and inference. This overlooks scenarios where entities are dynamically removed or $\textit{added}$ $\textit{during}$ the inference trajectory—a common occurrence in real-world environments like search and rescue missions and dynamic combat situations. In this paper, we tackle the challenge of intra-trajectory dynamic entity composition under zero-shot out-of-domain (OOD) generalization, where such dynamic changes cannot be anticipated beforehand. Our empirical studies reveal that existing MARL methods suffer $\textit{significant}$ performance degradation and increased uncertainty in these scenarios. In response, we propose FlickerFusion, a novel OOD generalization method that acts as a $\textit{universally}$ applicable augmentation technique for MARL backbone methods. FlickerFusion stochastically drops out parts of the observation space, emulating being in-domain when inferenced OOD. The results show that FlickerFusion not only achieves superior inference rewards but also $\textit{uniquely}$ reduces uncertainty vis-à-vis the backbone, compared to existing methods. Benchmarks, implementations, and model weights are organized and open-sourced at $\texttt{\href{flickerfusion305.github.io}{\textbf{flickerfusion305.github.io}}}$, accompanied by ample demo video renderings.
Woosung Koh, Wonbeen Oh, Siyeol Kim, Suhin Shin, Jaein Jang, Se-Young Yun
ICLR3
2025 Revisiting Residual Connections: Orthogonal Updates for Stable and Efficient Deep Networks
abstract
Residual connections are pivotal for deep neural networks, enabling greater depth by mitigating vanishing gradients. However, in standard residual updates, the module’s output is directly added to the input stream. This can lead to updates that predominantly reinforce or modulate the existing stream direction, potentially underutilizing the module’s capacity for learning entirely novel features. In this work, we introduce _Orthogonal Residual Update_: we decompose the module’s output relative to the input stream and add only the component orthogonal to this stream. This design aims to guide modules to contribute primarily new representa-tional directions, fostering richer feature learning while promoting more efficient training. We demonstrate that our orthogonal update strategy improves generalization accuracy and training stability across diverse architectures (ResNetV2, Vision Transformers) and datasets (CIFARs, TinyImageNet, ImageNet-1k), achieving, for instance, a +3.78 pp Acc@1 gain for ViT-B on ImageNet-1k. Code and models are available at https://github.com/BootsofLagrangian/ortho-residual.
Giyeong Oh, Woohyun Cho, Siyeol Kim, Suhwan Choi, Youngjae Yu
NeurIPS3