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

Kyungeun Lee

dblp:230/3844 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
9since 2021 · last 2026
0000-0002-1674-7147ORCID · reported

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

Artificial intelligence and machine learning · 9 · 5 first-author · 9 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
6 papers
Representation and self-supervised learning · 34% 3D vision · 17% Transfer learning and domain adaptation · 15%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
data augmentation
0.912025
Representation Space Augmentation for Effective Self-Supervised Learning on Tabular Data · AAAI 2025
Machine learning › Generative modeling
diffusion model
0.912025
Diffusion-based Semantic Outlier Generation via Nuisance Awareness for Out-of-Distribution Detection · AAAI 2025
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.912025
Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark · KDD (2) 2025
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.912025
Diffusion-based Semantic Outlier Generation via Nuisance Awareness for Out-of-Distribution Detection · AAAI 2025
Machine learning › Representation and self-supervised learning
tabular data
0.912025
Representation Space Augmentation for Effective Self-Supervised Learning on Tabular Data · AAAI 2025
Machine learning › Transfer learning and domain adaptation › few-shot learning
tabular few-shot learning
0.912025
Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark · KDD (2) 2025
Machine learning › Representation and self-supervised learning › mutual information
mutual information estimation
0.812024
A Benchmark Suite for Evaluating Neural Mutual Information Estimators on Unstructured Datasets · NeurIPS 2024
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › pretext task
pretext task design
0.812024
Binning as a Pretext Task: Improving Self-Supervised Learning in Tabular Domains · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning
tabular representation learning
0.812024
Binning as a Pretext Task: Improving Self-Supervised Learning in Tabular Domains · ICML 2024
Computer vision › 3D vision
3d object detection
0.712023
Diversified and Realistic 3D Augmentation via Iterative Construction, Random Placement, and HPR Occlusion · AAAI 2023
Computer vision › 3D vision › 3d object detection › point cloud object detection
LiDAR-based 3D object detection
0.712023
Diversified and Realistic 3D Augmentation via Iterative Construction, Random Placement, and HPR Occlusion · AAAI 2023
Computer vision › Video understanding and tracking › object tracking
occlusion handling
0.712023
Diversified and Realistic 3D Augmentation via Iterative Construction, Random Placement, and HPR Occlusion · AAAI 2023
Computer vision › 3D vision
point cloud processing
0.712023
Diversified and Realistic 3D Augmentation via Iterative Construction, Random Placement, and HPR Occlusion · AAAI 2023
Machine learning › Trustworthy machine learning
robustness
0.312025
Diffusion-based Semantic Outlier Generation via Nuisance Awareness for Out-of-Distribution Detection · AAAI 2025
Machine learning › Deep learning architectures and training
tabular deep learning
0.312025
Representation Space Augmentation for Effective Self-Supervised Learning on Tabular Data · AAAI 2025
Data mining › predictive modeling › classification
tabular data classification
0.312025
Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark · KDD (2) 2025

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

few-shot learning · 1.7data augmentation · 1.7truncated SVD · 0.9region-specific guidance · 0.9matrix factorization · 0.9dropout · 0.9diffusion model · 0.9contrastive learning · 0.8binning · 0.8binary symmetric channel · 0.8
YearPublicationVenuePosition
2026 MultiTabPFN: Codebook-based extensions of TabPFN for high-class-count tabular classification
Kyungeun Lee
Neural Networks1
2025 Representation Space Augmentation for Effective Self-Supervised Learning on Tabular Data
abstract
Tabular data, widely used across industries, remains underexplored in deep learning. Self-supervised learning (SSL) shows promise for pre-training deep neural networks (DNNs) on tabular data, but its potential is hindered by challenges in designing suitable augmentations. Unlike image and text data, where SSL leverages inherent spatial or semantic structures, tabular data lacks such explicit structure. This makes traditional input-level augmentations, like modifying or removing features, less effective due to difficulties in balancing critical information preservation with variability. To address these challenges, we propose RaTab, a novel method that shifts augmentation from input-level to representation-level using matrix factorization, specifically truncated SVD. This approach preserves essential data structures while generating diverse representations by applying dropout at various stages of the representation, thereby significantly enhancing SSL performance for tabular data.
Moonjung Eo, Kyungeun Lee, Hye-Seung Cho, Ye Seul Sim, Woohyung Lim
AAAI2
2025 Diffusion-based Semantic Outlier Generation via Nuisance Awareness for Out-of-Distribution Detection
abstract
Out-of-distribution (OOD) detection, determining whether a given sample is part of the in-distribution (ID) or not, has been newly explored by a generative model-based outlier synthesizing approach, especially with diffusion models. Nonetheless, existing diffusion models often produce outliers that are considerably distant from the ID in pixel-space, showing limited efficacy for capturing subtle distinctions between ID and OOD. To address these issues, we propose a novel framework, Semantic Outlier generation via Nuisance Awareness (SONA), which directly utilizes informative pixel-space ID images in diffusion models. Thereby, the generated outliers achieve two crucial properties: (i) they closely resemble the ID mainly in nuisances, while (ii) represent discriminative semantic information. To facilitate the separate effect on semantics and nuisances, we introduce SONA guidance, providing region-specific guidance. Extensive experiments demonstrate the effectiveness of our framework, achieving an impressive AUROC of 87% on near-OOD datasets, which surpasses the performance of baseline methods by a significant margin of approximately 6%.
Suhee Yoon, Sanghyu Yoon, Ye Seul Sim, Sungik Choi, Kyungeun Lee, Hye-Seung Cho, Hankook Lee, Woohyung Lim
AAAI5
2025 Range-limited Augmentation for Few-shot Learning in Tabular Data with Comprehensive Benchmark
Kyungeun Lee, Moonjung Eo, Hye-Seung Cho, Min-Kook Suh, Seoyoon Kim, Ye Seul Sim, Suhee Yoon, Sanghyu Yoon, Woohyung Lim
KDD (2)1
2024 Binning as a Pretext Task: Improving Self-Supervised Learning in Tabular Domains
abstract
The ability of deep networks to learn superior representations hinges on leveraging the proper inductive biases, considering the inherent properties of datasets. In tabular domains, it is critical to effectively handle heterogeneous features (both categorical and numerical) in a unified manner and to grasp irregular functions like piecewise constant functions. To address the challenges in the self-supervised learning framework, we propose a novel pretext task based on the classical binning method. The idea is straightforward: reconstructing the bin indices (either orders or classes) rather than the original values. This pretext task provides the encoder with an inductive bias to capture the irregular dependencies, mapping from continuous inputs to discretized bins, and mitigates the feature heterogeneity by setting all features to have category-type targets. Our empirical investigations ascertain several advantages of binning: capturing the irregular function, compatibility with encoder architecture and additional modifications, standardizing all features into equal sets, grouping similar values within a feature, and providing ordering information. Comprehensive evaluations across diverse tabular datasets corroborate that our method consistently improves tabular representation learning performance for a wide range of downstream tasks. The codes are available in https://github.com/kyungeun-lee/tabularbinning.
Kyungeun Lee, Ye Seul Sim, Hye-Seung Cho, Moonjung Eo, Suhee Yoon, Sanghyu Yoon, Woohyung Lim
ICML1
2024 A Benchmark Suite for Evaluating Neural Mutual Information Estimators on Unstructured Datasets
abstract
Mutual Information (MI) is a fundamental metric for quantifying dependency between two random variables. When we can access only the samples, but not the underlying distribution functions, we can evaluate MI using sample-based estimators. Assessment of such MI estimators, however, has almost always relied on analytical datasets including Gaussian multivariates. Such datasets allow analytical calculations of the true MI values, but they are limited in that they do not reflect the complexities of real-world datasets. This study introduces a comprehensive benchmark suite for evaluating neural MI estimators on unstructured datasets, specifically focusing on images and texts. By leveraging same-class sampling for positive pairing and introducing a binary symmetric channel trick, we show that we can accurately manipulate true MI values of real-world datasets. Using the benchmark suite, we investigate seven challenging scenarios, shedding light on the reliability of neural MI estimators for unstructured datasets.
Kyungeun Lee, Wonjong Rhee
NeurIPS1
2024 Towards a rigorous analysis of mutual information in contrastive learning
Kyungeun Lee, Jaeill Kim, Suhyun Kang, Wonjong Rhee
Neural Networks1
2023 Diversified and Realistic 3D Augmentation via Iterative Construction, Random Placement, and HPR Occlusion
abstract
In autonomous driving, data augmentation is commonly used for improving 3D object detection. The most basic methods include insertion of copied objects and rotation and scaling of the entire training frame. Numerous variants have been developed as well. The existing methods, however, are considerably limited when compared to the variety of the real world possibilities. In this work, we develop a diversified and realistic augmentation method that can flexibly construct a whole-body object, freely locate and rotate the object, and apply self-occlusion and external-occlusion accordingly. To improve the diversity of the whole-body object construction, we develop an iterative method that stochastically combines multiple objects observed from the real world into a single object. Unlike the existing augmentation methods, the constructed objects can be randomly located and rotated in the training frame because proper occlusions can be reflected to the whole-body objects in the final step. Finally, proper self-occlusion at each local object level and external-occlusion at the global frame level are applied using the Hidden Point Removal (HPR) algorithm that is computationally efficient. HPR is also used for adaptively controlling the point density of each object according to the object's distance from the LiDAR. Experiment results show that the proposed DR.CPO algorithm is data-efficient and model-agnostic without incurring any computational overhead. Also, DR.CPO can improve mAP performance by 2.08% when compared to the best 3D detection result known for KITTI dataset.
Jungwook Shin, Jaeill Kim, Kyungeun Lee, Hyunghun Cho, Wonjong Rhee
AAAI3
2021 Statistical Characteristics of Deep Representations: An Empirical Investigation
Daeyoung Choi, Kyungeun Lee, Duhun Hwang, Wonjong Rhee
ICANN (5)2