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

Seojun Heo

dblp:405/4420 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 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
1 paper
Learning paradigms · 50% Trustworthy machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › open-world recognition
open-set recognition
1.012026
Let the Void Be Void: Robust Open-Set Semi-Supervised Learning via Selective Non-Alignment · AAAI 2026
Machine learning › Learning paradigms › semi-supervised learning
open-set semi-supervised learning
1.012026
Let the Void Be Void: Robust Open-Set Semi-Supervised Learning via Selective Non-Alignment · AAAI 2026
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
1.012026
Let the Void Be Void: Robust Open-Set Semi-Supervised Learning via Selective Non-Alignment · AAAI 2026
Machine learning › Learning paradigms
semi-supervised learning
1.012026
Let the Void Be Void: Robust Open-Set Semi-Supervised Learning via Selective Non-Alignment · AAAI 2026

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

selective non-alignment · 1.0contrastive learning · 1.0
YearPublicationVenuePosition
2026 Let the Void Be Void: Robust Open-Set Semi-Supervised Learning via Selective Non-Alignment
abstract
Open-set semi-supervised learning (OSSL) leverages unlabeled data containing both in-distribution (ID) and unknown out-of-distribution (OOD) samples, aiming simultaneously to improve closed-set accuracy and detect novel OOD instances. Existing methods either discard valuable information from uncertain samples or force-align every unlabeled sample into one or a few synthetic “catch-all” representations, resulting in geometric collapse and overconfidence on only seen OODs. To address the limitations, we introduce selective non-alignment, adding a novel “skip” operator into conventional pull and push operations of contrastive learning. Our framework, SkipAlign, selectively skips alignment (pulling) for low-confidence unlabeled samples, retaining only gentle repulsion against ID prototypes. This approach transforms uncertain samples into a pure repulsion signal, resulting in tighter ID clusters and naturally dispersed OOD features. Extensive experiments demonstrate that SkipAlign significantly outperforms state-of-the-art methods in detecting unseen OOD data without sacrificing ID classification accuracy.
You Rim Choi, Subeom Park, Seojun Heo, Eunchung Noh, Hyung-Sin Kim
AAAI3