SeongKu Kang

SeongKu Kang

Auto-generated profile, based on publicly available information

SeongKu Kang

Korea University, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2023
Verified
Conference Paper
Open access
SKSeongKu Kang
SeongKu Kang
WKWonbin Kweon
Wonbin Kweon
DLDongha Lee
Dongha Lee
JLJianxun Lian
Jianxun Lian
XXXing Xie
Xing Xie
HYHwanjo Yu
Hwanjo Yu
Recent recommender systems have shown remarkable performance by using an ensemble of heterogeneous models. However, it is exceedingly costly because it requires resources and inference latency proportional to the number of models, which remains the bottleneck for production. Our work aims to transfer the ensemble knowledge of heterogeneous teachers to a lightweight student model using knowledge distillation (KD), to reduce the huge inference costs while retaining high accuracy. Through an empirical study, we find that the efficacy of distillation severely drops when transferring knowledge from heterogeneous teachers. Nevertheless, we show that an important signal to ease the difficulty can be obtained from the teacher’s training trajectory. This paper proposes a new KD framework, named HetComp, that guides the student model by transferring easy-to-hard sequences of knowledge generated from the teachers’ trajectories. To provide guidance according to the student’s learning state, HetComp uses dynamic knowledge construction to provide progressively difficult ranking knowledge and adaptive knowledge transfer to gradually transfer finer-grained ranking information. Our comprehensive experiments show that HetComp significantly improves the distillation quality and the generalization of the student model.

13 July 2025
Verified
Conference Paper
Open access
JKJieyong Kim
Jieyong Kim
HKHyunseo Kim
Hyunseo Kim
HCHyunjin Cho
Hyunjin Cho
SKSeongKu Kang
SeongKu Kang
BCBuru Chang
Buru Chang
DLDongha Lee
Dongha Lee

1 March 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
SKSeongKu Kang
SeongKu Kang
DLDongha Lee
Dongha Lee
WKWonbin Kweon
Wonbin Kweon
HYHwanjo Yu
Hwanjo Yu

24 August 2024
Verified
Conference Paper
Open access
GLGyuseok Lee
Gyuseok Lee
SKSeongKu Kang
SeongKu Kang
WKWonbin Kweon
Wonbin Kweon
HYHwanjo Yu
Hwanjo Yu
Knowledge distillation (KD) has emerged as a promising technique for addressing the computational challenges associated with deploying large-scale recommender systems. KD transfers the knowledge of a massive teacher system to a compact student model, to reduce the huge computational burdens for inference while retaining high accuracy. The existing KD studies primarily focus on one-time distillation in static environments, leaving a substantial gap in their applicability to real-world scenarios dealing with continuously incoming users, items, and their interactions. In this work, we delve into a systematic approach to operating the teacher-student KD in a non-stationary data stream. Our goal is to enable efficient deployment through a compact student, which preserves the high performance of the massive teacher, while effectively adapting to continuously incoming data. We propose Continual Collaborative Distillation (CCD) framework, where both the teacher and the student continually and collaboratively evolve along the data stream. CCD facilitates the student in effectively adapting to new data, while also enabling the teacher to fully leverage accumulated knowledge. We validate the effectiveness of CCD through extensive quantitative, ablative, and exploratory experiments on two real-world datasets. We expect this research direction to contribute to narrowing the gap between existing KD studies and practical applications, thereby enhancing the applicability of KD in real-world systems.

13 May 2024
Verified
Conference Paper
Open access
SKSeongKu Kang
SeongKu Kang
SAShivam Agarwal
Shivam Agarwal
BJBowen Jin
Bowen Jin
DLDongha Lee
Dongha Lee
HYHwanjo Yu
Hwanjo Yu
JHJiawei Han
Jiawei Han
Document retrieval has greatly benefited from the advancements of large-scale pre-trained language models (PLMs). However, their effectiveness is often limited in theme-specific applications for specialized areas or industries, due to unique terminologies, incomplete contexts of user queries, and specialized search intents. To capture the theme-specific information and improve retrieval, we propose to use a corpus topical taxonomy, which outlines the latent topic structure of the corpus while reflecting user-interested aspects. We introduce ToTER (Topical Taxonomy Enhanced Retrieval) framework, which identifies the central topics of queries and documents with the guidance of the taxonomy, and exploits their topical relatedness to supplement missing contexts. As a plug-and-play framework, ToTER can be flexibly employed to enhance various PLM-based retrievers. Through extensive quantitative, ablative, and exploratory experiments on two real-world datasets, we ascertain the benefits of using topical taxonomy for retrieval in theme-specific applications and demonstrate the effectiveness of ToTER.

21 October 2023
Verified
Conference Paper
Open access
YLYoungjune Lee
Youngjune Lee
YJYeongjong Jeong
Yeongjong Jeong
KPKeunchan Park
Keunchan Park
SKSeongKu Kang
SeongKu Kang
Feature selection, which is a technique to select key features in recommender systems, has received increasing research attention. Recently, Adaptive Feature Selection (AdaFS) has shown remarkable performance by adaptively selecting features for each data instance, considering that the importance of a given feature field can vary significantly across data. However, this method still has limitations in that its selection process could be easily biased to major features that frequently occur. To address these problems, we propose Multi-view Feature Selection (MvFS), which selects informative features for each instance more effectively. Most importantly, MvFS employs a multi-view network consisting of multiple sub-networks, each of which learns to measure the feature importance of a part of data with different feature patterns. By doing so, MvFS mitigates the bias problem towards dominant patterns and promotes a more balanced feature selection process. Moreover, MvFS adopts an effective importance score modeling strategy which is applied independently to each field without incurring dependency among features. Experimental results on real-world datasets demonstrate the effectiveness of MvFS compared to state-of-the-art baselines.