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

Gyuseok Lee

dblp:378/4867 · DBLP profile ↗
in reviewer pool ← Back
4ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0008-7537-1494ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 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.

Databases, data mining, and information retrieval
4 papers
Recommender systems · 67% Machine learning and data management · 33%
Artificial intelligence
3 papers
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.122026
Continual Collaborative Distillation for Recommender System · KDD 2024
SPRINT: Scalable and Predictive Intent Refinement for LLM-Enhanced Session-based Recommendation · SIGIR 2026
Recommender systems
sequential recommendation
1.012026
Capturing User Interests from Data Streams for Continual Sequential Recommendation · WSDM 2026
Recommender systems
session-based recommendation
1.012026
SPRINT: Scalable and Predictive Intent Refinement for LLM-Enhanced Session-based Recommendation · SIGIR 2026
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.812024
Continual Collaborative Distillation for Recommender System · KDD 2024
Machine learning › Efficient and distributed learning
data-efficient learning
0.312026
Harmonic Dataset Distillation for Time Series Forecasting · AAAI 2026
Machine learning › Efficient and distributed learning
dataset distillation
0.312026
Harmonic Dataset Distillation for Time Series Forecasting · AAAI 2026

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

continual learning · 2.5large language model · 2.0intent predictor · 2.0intent pool · 2.0harmonic matching · 2.0frequency-domain distillation · 2.0FFT · 2.0collaborative distillation · 1.5transformer · 1.0linear attention · 1.0
YearPublicationVenuePosition
2026 Harmonic Dataset Distillation for Time Series Forecasting
abstract
Time Series forecasting (TSF) in the modern era faces significant computational and storage cost challenges due to the massive scale of real-world data. Dataset Distillation (DD), a paradigm that synthesizes a small, compact dataset to achieve training performance comparable to that of the original dataset, has emerged as a promising solution. However, conventional DD methods are not tailored for time series and suffer from architectural overfitting and limited scalability. To address these issues, we propose Harmonic Dataset Distillation for Time Series Forecasting (HDT). HDT decomposes the time series into its sinusoidal basis through the FFT and aligns the core periodic structure by Harmonic Matching. Since this process operates in the frequency domain, all updates during distillation are applied globally without disrupting temporal dependencies of time series. Extensive experiments demonstrate that HDT achieves strong cross-architecture generalization and scalability, validating its practicality for large-scale, real-world applications.
Seungha Hong, Sanghwan Jang, Wonbin Kweon, Su Yeon Kim, Gyuseok Lee, Hwanjo Yu
AAAI5
2026 SPRINT: Scalable and Predictive Intent Refinement for LLM-Enhanced Session-based Recommendation
abstract
Large language models (LLMs) have enhanced conventional recommendation models via user profiling, which generates representative textual profiles from users' historical interactions. However, their direct application to session-based recommendation (SBR) remains challenging due to severe session context scarcity and poor scalability. In this paper, we propose SPRINT, a scalable SBR framework that incorporates reliable and informative intents while ensuring high efficiency in both training and inference. SPRINT constrains LLM-based profiling with a global intent pool and validates inferred intents based on recommendation performance to mitigate noise and hallucinations under limited context. To ensure scalability, LLMs are selectively invoked only for uncertain sessions during training, while a lightweight intent predictor generalizes intent prediction to all sessions without LLM dependency at inference time. Experiments on real-world datasets show that SPRINT consistently outperforms state-of-the-art methods while providing more explainable recommendations.
Gyuseok Lee, Wonbin Kweon, Zhenrui Yue, Yaokun Liu, Yifan Liu 0019, Susik Yoon, Dong Wang 0002, Seongku Kang
SIGIR1
2026 Capturing User Interests from Data Streams for Continual Sequential Recommendation
abstract
Transformer-based sequential recommendation (SR) models excel at modeling long-range dependencies, but suffer from high computational costs and catastrophic forgetting during continuous updates. Although continual learning has been applied to recommendation, existing methods gradually forget long-term user preferences and remain underexplored in SR. In this paper, we introduce Continual Sequential Transformer for Recommendation (CSTRec), which effectively adapt to current interests by leveraging preserved historical knowledge. Its core is Continual Sequential Attention (CSA), a linear attention tailored for continual SR, which partially retain historical knowledge without direct access to prior data. CSA features: (1) Cauchy-Schwarz Normalization to stabilize learning over time under uneven user interaction frequencies, and (2) Collaborative Interest Enrichment via shared, learnable interest pools to mitigate forgetting. We also introduce a new technique for new user adaptation by transferring historical knowledge from existing users with similar interests. Extensive experiments show CSTRec's superior performance in both knowledge retention and acquisition. Our code is available at https://github.com/Gyu-Seok0/CSTRec_WSDM26.
Gyuseok Lee, Hyunsik Yoo, Junyoung Hwang, Seongku Kang, Hwanjo Yu
WSDM1
2024 Continual Collaborative Distillation for Recommender System
abstract
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.
Gyuseok Lee, Seongku Kang, Wonbin Kweon, Hwanjo Yu
KDD1