Wee Sun Lee lists you as their PhD student. Claim this profile to confirm it and keep the rest of your record right.

Claim this profile

Academic lineage

View as a tree

Advisors

Works13 from public data

TitleCited by
  • Tell2Design: A Dataset for Language-Guided Floor Plan Generation

    Sicong Leng, Yang Min Zhou, Mohammed Haroon Dupty, Wee Sun Lee, Sam Conrad Joyce, Jane W. Z. Lu

    Annual Meeting of the Association for Computational Linguistics (ACL) · 2023

    This work considers the task of generating designs directly from natural language descriptions, and considers floor plan generation as the initial research area, and introduces a novel dataset, Tell2Design, which contains more than 80k floor plan designs associated with natural language instructions.

    51
  • Hierarchical Neural Constructive Solver for Real-world TSP Scenarios

    Yong Liang Goh, Zhiguang Cao, Yining Ma, Yanfei Dong, Mohammed Haroon Dupty, Wee Sun Lee

    ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 2024

    This paper introduces realistic Traveling Salesman Problem (TSP) scenarios relevant to industrial settings and proposes integrating a learnable choice layer inspired by Hypernetworks to prioritize choices based on the current location, and a learnable approximate clustering algorithm inspired by the Expectation-Maximization algorithm to facilitate grouping the unvisited cities.

    17
  • Constrained Layout Generation with Factor Graphs

    Mohammed Haroon Dupty, Yanfei Dong, Sicong Leng, Guoji Fu, Yong Liang Goh, Wei Lu, Wee Sun Lee

    IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · 2024

    This paper addresses the challenge of object-centric lay-out generation under spatial constraints, seen in multi-ple domains including floorplan design process, with a factor graph based approach with four latent variable nodes for each room, and a factor node for each constraint.

    14
  • PF-GNN: Differentiable particle filtering based approximation of universal graph representations

    Mohammed Haroon Dupty, Yanfei Dong, Wee Sun Lee

    arXiv · 2024

    This work proposes to make GNNs universal by guiding the learning process with exact isomorphism solver techniques which operate on the paradigm of Individualization and Refinement (IR), a method to artificially introduce asymmetry and further refine the coloring when 1-WL stops.

    14
  • SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy

    Yong Liang Goh, Zhiguang Cao, Yining Ma, Jianan Zhou, Mohammed Haroon Dupty, Wee Sun Lee

    arXiv · 2025

    This work advances the Multi-Task VRP setting to the more realistic yet challenging Multi-Task Multi-Distribution VRP setting, and introduces SHIELD, a novel model that leverages both sparsity and hierarchy principles.

    9
  • Visual Relationship Detection with Low Rank Non-Negative Tensor Decomposition

    Mohammed Haroon Dupty, Zhen Zhang, Wee Sun Lee

    AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · 2020

    A novel technique of learning conditional triplet distributions in the form of their normalized low rank non-negative tensor decompositions is introduced to efficiently learn higher order discrete multimodal distributions and at the same time keep the parameter size manageable.

    9
  • Graph Representation Learning with Individualization and Refinement

    Mohammed Haroon Dupty, Wee Sun Lee

    arXiv · 2022

    This work follows the classical approach of Individualization and Refinement (IR), a technique followed by most practical isomorphism solvers and outperforms prominent 1-WL GNN models as well as competitive higher-order baselines on several benchmark synthetic and real datasets.

    4
  • Differentiable Cluster Graph Neural Network

    Yanfei Dong, Mohammed Haroon Dupty, Lambert Deng, Zhuang‐Hua Liu, Yong Liang Goh, Wee Sun Lee

    arXiv · 2024

    This work adopts an entropy regularized objective function and proposes an iterative optimization process, alternating between solving for the cluster assignments and updating the node/cluster-node embeddings, that can effectively capture both local and global information.

    3
  • Neuralizing Efficient Higher-order Belief Propagation

    Mohammed Haroon Dupty, Wee Sun Lee

    arXiv · 2020

    1
  • Improving Molecular Force Fields with Minimal Temporal Information

    Ali Mollahosseini, Mohammed Haroon Dupty, Wee Sun Lee

    arXiv · 2026

    This work presents a novel training strategy called FRAMES, that use an auxiliary loss function for exploiting the temporal relationships within MD trajectories to improve the accuracy of the model, and provides evidence that for distilling physical priors of atomic systems, more temporal data is not always better.

    –
  • Efficient Global Message Passing for Heterophilous Graphs

    Yanfei Dong, Mohammed Haroon Dupty, Lambert Deng, Yong Liang Goh, Wee Sun Lee

    ACM International Conference on Information and Knowledge Management (CIKM) · 2024

    The proposed Prototype Mediated GNN (PM-GNN), a novel framework which efficiently captures global feature information using class prototypes, is proposed, which can scale to large graphs, outperforming strong baselines on multiple heterophilous datasets.

    –
  • Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing

    Guoji Fu, Mohammed Haroon Dupty, Yanfei Dong, Lee Wee Sun

    arXiv · 2023

    –
  • Scheduling Under Power and Energy Constraints

    Mohammed Haroon Dupty, Pragati Agrawal, Shrisha Rao

    arXiv · 2016

    –

Publication data from OpenAlex; citation counts are the higher of OpenAlex and Semantic Scholar, last synced 2026-10-11. One-sentence summaries under some papers are written by Semantic Scholar’s model. Citation counts may be lower than on Google Scholar, which indexes more sources.

Report an error

Wrong papers, two people merged into one, or a profile that should not be here? Tell us and we will fix or hide it. You will be asked to sign in.