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.

Sehyun Lee

dblp:219/7257 · 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 2021Graphics, 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
Representation and self-supervised learning · 45% Trustworthy machine learning · 40% Generative modeling · 15%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
circuit discovery
0.912025
Granular Concept Circuits: Toward a Fine-Grained Circuit Discovery for Concept Representations · ICCV 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Granular Concept Circuits: Toward a Fine-Grained Circuit Discovery for Concept Representations · ICCV 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Implicit Contrastive Representation Learning with Guided Stop-gradient · NeurIPS 2023
Machine learning › Generative modeling › generative adversarial network
mode collapse mitigation
0.712023
Implicit Contrastive Representation Learning with Guided Stop-gradient · NeurIPS 2023
Machine learning › Representation and self-supervised learning › contrastive learning
negative-free contrastive learning
0.712023
Implicit Contrastive Representation Learning with Guided Stop-gradient · NeurIPS 2023
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning
0.712023
Implicit Contrastive Representation Learning with Guided Stop-gradient · NeurIPS 2023

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

semantic alignment · 0.9neuron connectivity analysis · 0.9circuit discovery · 0.9stop-gradient · 0.7siamese network · 0.7asymmetric encoder · 0.7
YearPublicationVenuePosition
2025 Granular Concept Circuits: Toward a Fine-Grained Circuit Discovery for Concept Representations
abstract
Deep vision models have achieved remarkable classification performance by leveraging a hierarchical architecture in which human-interpretable concepts emerge through the composition of individual neurons across layers. Given the distributed nature of representations, pinpointing where specific visual concepts are encoded within a model remains a crucial yet challenging task. In this paper, we introduce an effective circuit discovery method, called Granular Concept Circuit (GCC), in which each circuit represents a concept relevant to a given query. To construct each circuit, our method iteratively assesses inter-neuron connectivity, focusing on both functional dependencies and semantic alignment. By automatically discovering multiple circuits, each capturing specific concepts within that query, our approach offers a profound, concept-wise interpretation of models and is the first to identify circuits tied to specific visual concepts at a fine-grained level. We validate the versatility and effectiveness of GCCs across various deep image classification models.
Dahee Kwon, Sehyun Lee, Jaesik Choi
ICCV2
2023 Implicit Contrastive Representation Learning with Guided Stop-gradient
abstract
In self-supervised representation learning, Siamese networks are a natural architecture for learning transformation-invariance by bringing representations of positive pairs closer together. But it is prone to collapse into a degenerate solution. To address the issue, in contrastive learning, a contrastive loss is used to prevent collapse by moving representations of negative pairs away from each other. But it is known that algorithms with negative sampling are not robust to a reduction in the number of negative samples. So, on the other hand, there are algorithms that do not use negative pairs. Many positive-only algorithms adopt asymmetric network architecture consisting of source and target encoders as a key factor in coping with collapse. By exploiting the asymmetric architecture, we introduce a methodology to implicitly incorporate the idea of contrastive learning. As its implementation, we present a novel method guided stop-gradient. We apply our method to benchmark algorithms SimSiam and BYOL and show that our method stabilizes training and boosts performance. We also show that the algorithms with our method work well with small batch sizes and do not collapse even when there is no predictor. The code is available in the supplementary material.
Byeongchan Lee 0001, Sehyun Lee
NeurIPS2