Hady Wirawan Lauw
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hady Wirawan Lauw has a total of 198 co-authors. Here are the top co-authors by number of shared publications:
- Ee-Peng Lim
Singapore Management University, Singapore, Singapore
18 shared publications Ke Wang
Simon Fraser University, Canada
7 shared publications- Yuan Fang
Singapore Management University, Singapore, Singapore
7 shared publications Maksim Tkachenko
Singapore Management University
6 shared publications- Nhu-Thuat Tran
School of Computing and Information Systems, Singapore Management University, Singapore, Singapore
6 shared publications - Quoc-Tuan Truong
Amazon, Seattle, WA, USA
6 shared publications
Latest Publications
- Open Access
- 13 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1401-1409
GuidedRec: Behaviourally Constrained Portfolio Recommendation with Certified Slate Optimisation
- 13 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1401-1409
Open AccessGuidedRec: Behaviourally Constrained Portfolio Recommendation with Certified Slate Optimisation
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Management Information Systems
Mining Utility-Maximizing Prices for Mixed Bundles
We study a data-driven bundle pricing problem with the following objective: given a predefined set of bundles, determine prices that maximize revenue under utility-maximizing consumer behavior. Classical mixed bundling models either assume a complete bundle menu with single-bundle choice or impose simplified pricing structures to ensure scalability. In contrast, we consider a setting in which the seller offers a restricted and potentially overlapping bundle catalog, allowing consumers to optimally select multiple non-overlapping bundles. This setting necessitates addressing two tightly coupled challenges: determining the price of each bundle and computing the revenue it generates under dependent consumer choice. Together, these challenges introduce additional combinatorial complexity in consumer decision-making and preserve strong price interdependencies across bundles. To address these challenges, we propose the Integrated Price Mining Method (IPMM), a scalable approach that approximates fully conditional pricing while explicitly accounting for dependent demand. We formalize consumer response as a utility maximization problem and show that it corresponds to a weighted set packing formulation. For price determination, IPMM combines balanced partitioning, sequential price search guided by competitive independence, dominance-based pruning, and cross-partition refinement to manage price dependence efficiently. Extensive experiments on synthetic instances and curated real-world bundle catalogs demonstrate that IPMM consistently achieves higher revenue coverage than classical and modern pricing baselines while remaining computationally tractable.
- 6 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Management Information Systems
Open AccessMining Utility-Maximizing Prices for Mixed Bundles
We study a data-driven bundle pricing problem with the following objective: given a predefined set of bundles, determine prices that maximize revenue under utility-maximizing consumer behavior. Classical mixed bundling models either assume a complete bundle menu with single-bundle choice or impose simplified pricing structures to ensure scalability. In contrast, we consider a setting in which the seller offers a restricted and potentially overlapping bundle catalog, allowing consumers to optimally select multiple non-overlapping bundles. This setting necessitates addressing two tightly coupled challenges: determining the price of each bundle and computing the revenue it generates under dependent consumer choice. Together, these challenges introduce additional combinatorial complexity in consumer decision-making and preserve strong price interdependencies across bundles. To address these challenges, we propose the Integrated Price Mining Method (IPMM), a scalable approach that approximates fully conditional pricing while explicitly accounting for dependent demand. We formalize consumer response as a utility maximization problem and show that it corresponds to a weighted set packing formulation. For price determination, IPMM combines balanced partitioning, sequential price search guided by competitive independence, dominance-based pruning, and cross-partition refinement to manage price dependence efficiently. Extensive experiments on synthetic instances and curated real-world bundle catalogs demonstrate that IPMM consistently achieves higher revenue coverage than classical and modern pricing baselines while remaining computationally tractable.
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (5) , 5791-5804
Real-Time Gaining Subscribers by Messaging
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (5) , 5791-5804
Real-Time Gaining Subscribers by Messaging
- Open Access
- 10 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Enhancing Review-Augmented Contrastive Recommendation with LLM-based Generation
Learning effective latent representations for users and items is the cornerstone of recommender systems. Traditional approaches rely on user-item interaction data to map users and items into a shared latent space, but the sparsity of interactions often poses challenges. While leveraging user reviews could mitigate this sparsity, existing review-aware recommendation models often exhibit two key limitations. First, they typically rely on reviews as additional features, but reviews are not universal, with many users and items lacking them. Second, such approaches do not integrate reviews into the user-item space, leading to potential divergence or inconsistency among user, item, and review representations. To overcome these limitations, our work introduces a Review-centric Contrastive Alignment Framework for Recommendation (ReCAFR), which incorporates reviews into the core learning process, ensuring alignment among user, item, and review representations within a unified space. Specifically, we leverage two self-supervised contrastive strategies that not only exploit review-based augmentation to alleviate sparsity, but also align the tripartite representations to enhance robustness. Moreover, we enhance ReCAFR with LLM-based contrastive strategies to not only improve robustness to varying review quality, but also reduce information loss during view aggregation. Empirical studies on public benchmark datasets demonstrate the effectiveness and robustness of ReCAFR.
- 10 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Open AccessEnhancing Review-Augmented Contrastive Recommendation with LLM-based Generation
Learning effective latent representations for users and items is the cornerstone of recommender systems. Traditional approaches rely on user-item interaction data to map users and items into a shared latent space, but the sparsity of interactions often poses challenges. While leveraging user reviews could mitigate this sparsity, existing review-aware recommendation models often exhibit two key limitations. First, they typically rely on reviews as additional features, but reviews are not universal, with many users and items lacking them. Second, such approaches do not integrate reviews into the user-item space, leading to potential divergence or inconsistency among user, item, and review representations. To overcome these limitations, our work introduces a Review-centric Contrastive Alignment Framework for Recommendation (ReCAFR), which incorporates reviews into the core learning process, ensuring alignment among user, item, and review representations within a unified space. Specifically, we leverage two self-supervised contrastive strategies that not only exploit review-based augmentation to alleviate sparsity, but also align the tripartite representations to enhance robustness. Moreover, we enhance ReCAFR with LLM-based contrastive strategies to not only improve robustness to varying review quality, but also reduce information loss during view aggregation. Empirical studies on public benchmark datasets demonstrate the effectiveness and robustness of ReCAFR.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1393-1403
Verbalizing LightGCN: Direct Learning of Textual Representations from User-Item Interaction Graph via LLMs
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1393-1403
Open AccessVerbalizing LightGCN: Direct Learning of Textual Representations from User-Item Interaction Graph via LLMs
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1756-1766
Bridging LLM Embeddings and VAE Parameters for Disentangled Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1756-1766
Open AccessBridging LLM Embeddings and VAE Parameters for Disentangled Recommendation
- Open Access
- 18 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
VARIUM+: Semantic Expert-Structured Memory-Augmented Variational Autoencoder for Multi-Interest Recommendation
Variational autoencoder (VAE) frameworks for multi-interest discovery have demonstrated strong recommendation performance. However, because VAEs model users independently, they fail to capture shared interest patterns among like-minded users, a key limitation of existing approaches. The previous work, Varium [41], addressed this by introducing a flat structured memory with iterative refinement to capture reusable interest patterns across users. In this paper, we extend Varium into Varium+, a novel semantic expert-structured memory-augmented VAE that fundamentally rethinks how shared interests are organized and retrieved. Unlike its predecessor, Varium+ organizes memory as a mixture of semantically-grounded experts, each dedicated to a different modality (textual, visual, collaborative) and composed of multiple prototypes representing fine-grained interest groups. For each user, we first discover multiple intra-user interest factors behind their item adoptions. Intra-user interest factors next attend to these expert memories via cross-attention to retrieve relevant inter-user signals, then pass through self-attention to model interactions among retrieved interests. The resulting shared interest representations are integrated back into each user’s multi-interest profile, enriching personal preferences with collaborative wisdom. Experiments on real-world datasets demonstrate that Varium+ consistently outperforms both its predecessor and a comprehensive set of baselines, with particularly strong gains when leveraging semantic knowledge. Qualitative analysis further reveals that our expert-structured memory organizes the latent interest space into well-separated clusters, validating its ability to discover meaningful shared patterns among users.
- 18 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Intelligent Systems and Technology
Open AccessVARIUM+: Semantic Expert-Structured Memory-Augmented Variational Autoencoder for Multi-Interest Recommendation
Variational autoencoder (VAE) frameworks for multi-interest discovery have demonstrated strong recommendation performance. However, because VAEs model users independently, they fail to capture shared interest patterns among like-minded users, a key limitation of existing approaches. The previous work, Varium [41], addressed this by introducing a flat structured memory with iterative refinement to capture reusable interest patterns across users. In this paper, we extend Varium into Varium+, a novel semantic expert-structured memory-augmented VAE that fundamentally rethinks how shared interests are organized and retrieved. Unlike its predecessor, Varium+ organizes memory as a mixture of semantically-grounded experts, each dedicated to a different modality (textual, visual, collaborative) and composed of multiple prototypes representing fine-grained interest groups. For each user, we first discover multiple intra-user interest factors behind their item adoptions. Intra-user interest factors next attend to these expert memories via cross-attention to retrieve relevant inter-user signals, then pass through self-attention to model interactions among retrieved interests. The resulting shared interest representations are integrated back into each user’s multi-interest profile, enriching personal preferences with collaborative wisdom. Experiments on real-world datasets demonstrate that Varium+ consistently outperforms both its predecessor and a comprehensive set of baselines, with particularly strong gains when leveraging semantic knowledge. Qualitative analysis further reveals that our expert-structured memory organizes the latent interest space into well-separated clusters, validating its ability to discover meaningful shared patterns among users.
- 9 May 2026
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 40 (4) , 39
Consistent attributions for transformer-based reversible comparison classifiers
- 9 May 2026
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 40 (4) , 39
Consistent attributions for transformer-based reversible comparison classifiers
- Open Access
- 16 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Recommender Systems
- Vol. 4 (3) , 1-27
Compositions of Variant Experts for Integrating Short-Term and Long-Term Preferences
In the online digital realm, recommendation systems are ubiquitous and play a crucial role in enhancing user experience. These systems leverage user preferences to provide personalized recommendations, thereby helping users navigate through the paradox of choice. This work focuses on personalized sequential recommendation, where the system considers not only a user’s immediate, evolving session context, but also their cumulative historical behavior to provide highly relevant and timely recommendations. Through an empirical study conducted on diverse real-world datasets, we have observed and quantified the existence and impact of both short-term (immediate and transient) and long-term (enduring and stable) preferences on users’ historical interactions. Building on these insights, we propose a framework that combines short- and long-term preferences to enhance recommendation performance, namely Compositions of Variant Experts ( CoVE ). This novel framework dynamically integrates short- and long-term preferences through the use of different specialized recommendation models (i.e., experts). Extensive experiments showcase the effectiveness of the proposed methods and ablation studies further investigate the impact of variant expert types.
- 16 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Recommender Systems
- Vol. 4 (3) , 1-27
Open AccessCompositions of Variant Experts for Integrating Short-Term and Long-Term Preferences
In the online digital realm, recommendation systems are ubiquitous and play a crucial role in enhancing user experience. These systems leverage user preferences to provide personalized recommendations, thereby helping users navigate through the paradox of choice. This work focuses on personalized sequential recommendation, where the system considers not only a user’s immediate, evolving session context, but also their cumulative historical behavior to provide highly relevant and timely recommendations. Through an empirical study conducted on diverse real-world datasets, we have observed and quantified the existence and impact of both short-term (immediate and transient) and long-term (enduring and stable) preferences on users’ historical interactions. Building on these insights, we propose a framework that combines short- and long-term preferences to enhance recommendation performance, namely Compositions of Variant Experts ( CoVE ). This novel framework dynamically integrates short- and long-term preferences through the use of different specialized recommendation models (i.e., experts). Extensive experiments showcase the effectiveness of the proposed methods and ablation studies further investigate the impact of variant expert types.
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (3) , 3730-3744
The $\mathsf{Feelit}$ System: Application Content-Aware Perspectives and Challenges on Understanding User Likes in Social Network PostsIn a series of our prior works, we study influence and subscription maximization problems in social networks that are based on posts having influential content; as content we consider a set of features where each feature corresponds to a specific social network page, whereas influence and subscription relate to gaining the postlike and subscription-to-brand page of targeted users, respectively; subscription is conceptually achieved as repetitive influence on users. So, both influence and subscription depend on content that gains the likes of users; however, to be realistic, modeling and estimating such likes is a complex problem that has not been adequately studied via a computational way. In this article, we propose a novel perspective on the mentioned content-aware research that has the potential to really understand the user likes to social network posts. By the term $\mathsf{feelit}$ system, we refer to the combined result of this proposal with our previous content-aware research, so as to estimate the user likes in a much more analytical way than before. We provide realistic examples to clarify the operation of $\mathsf{feelit}$ , and we discuss a number of technical challenges associated with it. Our contributions are beneficial to several formulations of influence maximization in the literature since $\mathsf{feelit}$ provides an accurate and advanced way for brands to estimate the user likes to their posts.
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (3) , 3730-3744
The $\mathsf{Feelit}$ System: Application Content-Aware Perspectives and Challenges on Understanding User Likes in Social Network PostsIn a series of our prior works, we study influence and subscription maximization problems in social networks that are based on posts having influential content; as content we consider a set of features where each feature corresponds to a specific social network page, whereas influence and subscription relate to gaining the postlike and subscription-to-brand page of targeted users, respectively; subscription is conceptually achieved as repetitive influence on users. So, both influence and subscription depend on content that gains the likes of users; however, to be realistic, modeling and estimating such likes is a complex problem that has not been adequately studied via a computational way. In this article, we propose a novel perspective on the mentioned content-aware research that has the potential to really understand the user likes to social network posts. By the term $\mathsf{feelit}$ system, we refer to the combined result of this proposal with our previous content-aware research, so as to estimate the user likes in a much more analytical way than before. We provide realistic examples to clarify the operation of $\mathsf{feelit}$ , and we discuss a number of technical challenges associated with it. Our contributions are beneficial to several formulations of influence maximization in the literature since $\mathsf{feelit}$ provides an accurate and advanced way for brands to estimate the user likes to their posts.