Hwanjo Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hwanjo Yu has a total of 154 co-authors. Here are the top co-authors by number of shared publications:
- SeongKu Kang
Korea University, Seoul, Republic of Korea
16 shared publications - Wonbin Kweon
Sungkyunkwan University, Suwon, Republic of Korea
12 shared publications - Jiawei Han
University of Illinois Urbana-Champaign, Urbana, Illinois, USA
11 shared publications - Dongha Lee
Department of Artificial Intelligence, Yonsei University, Seoul, Republic of Korea
8 shared publications - Dongha Lee
Yonsei University
6 shared publications - JaeHyung Lim
Pohang University of Science and Technology, Pohang, Republic of Korea
5 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2174-2185
From Overlooked to Explored: Recovering Item Relations via Mixture of Perspectives for Sequential Recommendation
Capturing user preference from a user's interaction sequence is the central challenge of Sequential Recommendation (SR). This preference intuitively emerges from inter-item relations: each item transition reflects a preference embedded in the relations between items, making the faithful capture of these relations essential for accurate recommendation. For this reason, self-attention is dominant in sequential recommendation for its ability to compute pairwise item interactions, yet our empirical analysis reveals that it consistently suffers from similarity bias across various types of transformer-based SR models: dot-product attention scores disproportionately favor similar items, systematically overlooking heterogeneous relations with meaningful preference signals and directly limiting recommendation performance. To address this, we propose PRISM (Perspective-based Relational Insight Synthesis Module), a module that re-examines item relations from multiple perspectives. PRISM employs K Perspective Lenses to calibrate attention from distinct viewpoints, combining an Affinity View that refines homogeneous relations and a Contrast View that exposes heterogeneous ones suppressed by similarity bias, enabling the model to capture the full spectrum of user preferences. Extensive experiments on seven real-world benchmarks demonstrate that PRISM consistently outperforms state-of-the-art baselines. Our code is available at https://github.com/327aem/PRISM/.
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2174-2185
Open AccessFrom Overlooked to Explored: Recovering Item Relations via Mixture of Perspectives for Sequential Recommendation
Capturing user preference from a user's interaction sequence is the central challenge of Sequential Recommendation (SR). This preference intuitively emerges from inter-item relations: each item transition reflects a preference embedded in the relations between items, making the faithful capture of these relations essential for accurate recommendation. For this reason, self-attention is dominant in sequential recommendation for its ability to compute pairwise item interactions, yet our empirical analysis reveals that it consistently suffers from similarity bias across various types of transformer-based SR models: dot-product attention scores disproportionately favor similar items, systematically overlooking heterogeneous relations with meaningful preference signals and directly limiting recommendation performance. To address this, we propose PRISM (Perspective-based Relational Insight Synthesis Module), a module that re-examines item relations from multiple perspectives. PRISM employs K Perspective Lenses to calibrate attention from distinct viewpoints, combining an Affinity View that refines homogeneous relations and a Contrast View that exposes heterogeneous ones suppressed by similarity bias, enabling the model to capture the full spectrum of user preferences. Extensive experiments on seven real-world benchmarks demonstrate that PRISM consistently outperforms state-of-the-art baselines. Our code is available at https://github.com/327aem/PRISM/.
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2244-2255
TRACER: Balancing Stability-Plasticity-Cognitivity Trilemma for LLM Enhanced Continual Recommendation
Continual recommendation aims to capture evolving user interests from streaming data but struggles with sparsity. LLM enhancers mitigate this with semantic knowledge, but naive integration creates a new conflict. We identify this as the Stability-Plasticity-Cognitivity (SPC) Trilemma, where generalized LLM semantic priors (Cognitivity) conflict with retaining personalized historical preferences (Stability) and adapting to individual interest shifts (Plasticity). To address this, we propose Trilemma-Responsive Adaptive Continual Enhancement for Recommendation (TRACER). TRACER synergistically combines three specialized modules, each targeting stability, plasticity, or cognitivity, while preventing any single lemma from dominating. This holistic design enables semantic knowledge to support history retention and adaptation to evolving interests without disrupting continual learning. Across five real-world datasets, TRACER effectively harmonizes the SPC trilemma and outperforms state-of-the-art baselines by up to 14.38%. Our code is available at https://github.com/woo-joo/TRACER_CIKM26.
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2244-2255
Open AccessTRACER: Balancing Stability-Plasticity-Cognitivity Trilemma for LLM Enhanced Continual Recommendation
Continual recommendation aims to capture evolving user interests from streaming data but struggles with sparsity. LLM enhancers mitigate this with semantic knowledge, but naive integration creates a new conflict. We identify this as the Stability-Plasticity-Cognitivity (SPC) Trilemma, where generalized LLM semantic priors (Cognitivity) conflict with retaining personalized historical preferences (Stability) and adapting to individual interest shifts (Plasticity). To address this, we propose Trilemma-Responsive Adaptive Continual Enhancement for Recommendation (TRACER). TRACER synergistically combines three specialized modules, each targeting stability, plasticity, or cognitivity, while preventing any single lemma from dominating. This holistic design enables semantic knowledge to support history retention and adaptation to evolving interests without disrupting continual learning. Across five real-world datasets, TRACER effectively harmonizes the SPC trilemma and outperforms state-of-the-art baselines by up to 14.38%. Our code is available at https://github.com/woo-joo/TRACER_CIKM26.
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2232-2243
GOD: Enhancing Generalization via Deep Grafting for Sequential Recommendation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2232-2243
Open AccessGOD: Enhancing Generalization via Deep Grafting for Sequential Recommendation
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2480-2490
Dynamic Spectral Decoupling for Time-Series Forecasting
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2480-2490
Open AccessDynamic Spectral Decoupling for Time-Series Forecasting
- Open Access
- 1 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Improving Scientific Document Retrieval with Academic Concept Index
Adapting general-domain retrievers to scientific domains is challenging due to the scarcity of large-scale domain-specific relevance annotations and the substantial mismatch in vocabulary and information needs. Recent approaches address these issues through two independent directions that leverage large language models (LLMs): (1) generating synthetic queries for fine-tuning, and (2) generating auxiliary contexts to support relevance matching. However, both directions overlook the diverse academic concepts embedded within scientific documents, often producing redundant or conceptually narrow queries and contexts. To address this limitation, we introduce an academic concept index , which extracts key concepts from papers and organizes them guided by an academic taxonomy. This structured index serves as a foundation for improving both directions. First, we enhance the synthetic query generation with concept coverage-based generation ( CCQGen ), which adaptively conditions LLMs on uncovered concepts to generate complementary queries with broader concept coverage. Second, we strengthen the context augmentation with concept-focused auxiliary contexts ( CCExpand ), which leverages a set of document snippets that serve as concise responses to the concept-aware CCQGen queries. Extensive experiments show that incorporating the academic concept index into both query generation and context augmentation leads to higher-quality queries, better conceptual alignment, and improved retrieval performance.
- 1 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Open AccessImproving Scientific Document Retrieval with Academic Concept Index
Adapting general-domain retrievers to scientific domains is challenging due to the scarcity of large-scale domain-specific relevance annotations and the substantial mismatch in vocabulary and information needs. Recent approaches address these issues through two independent directions that leverage large language models (LLMs): (1) generating synthetic queries for fine-tuning, and (2) generating auxiliary contexts to support relevance matching. However, both directions overlook the diverse academic concepts embedded within scientific documents, often producing redundant or conceptually narrow queries and contexts. To address this limitation, we introduce an academic concept index , which extracts key concepts from papers and organizes them guided by an academic taxonomy. This structured index serves as a foundation for improving both directions. First, we enhance the synthetic query generation with concept coverage-based generation ( CCQGen ), which adaptively conditions LLMs on uncovered concepts to generate complementary queries with broader concept coverage. Second, we strengthen the context augmentation with concept-focused auxiliary contexts ( CCExpand ), which leverages a set of document snippets that serve as concise responses to the concept-aware CCQGen queries. Extensive experiments show that incorporating the academic concept index into both query generation and context augmentation leads to higher-quality queries, better conceptual alignment, and improved retrieval performance.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 823-833
FLAME: Condensing Ensemble Diversity into a Single Network for Efficient Sequential Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 823-833
Open AccessFLAME: Condensing Ensemble Diversity into a Single Network for Efficient Sequential Recommendation
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 891-901
Filling the Gaps: Selective Knowledge Augmentation for LLM Recommenders
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 891-901
Open AccessFilling the Gaps: Selective Knowledge Augmentation for LLM Recommenders
- Open Access
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1787-1792
On the Effectiveness of Integration Methods for Multimodal Dialogue Response Retrieval
- 15 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1787-1792
Open AccessOn the Effectiveness of Integration Methods for Multimodal Dialogue Response Retrieval
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 7669-7678
Dynamic Multi-period Experts for Online Time Series Forecasting
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 7669-7678
Open AccessDynamic Multi-period Experts for Online Time Series Forecasting
- Top Cited PapersOpen Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 313-323
Capturing User Interests from Data Streams for Continual Sequential Recommendation
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 C ontinual S equential T ransformer for Rec ommendation (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.
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 313-323
Top Cited PapersOpen AccessCapturing User Interests from Data Streams for Continual Sequential Recommendation
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 C ontinual S equential T ransformer for Rec ommendation (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.