← Search

Huiyuan Chen

12 accepted papers

2025

A Large-scale Training Paradigm for Graph Generative Models

ICLR 2025poster

Large Generative Models (LGMs) such as GPT, Stable Diffusion, Sora, and Suno are trained on a huge amount of texts, images, videos, and audio that are extremely diverse from numerous domains. This large-scale training paradigm on diverse well-curated data enhances the creativity and diversity of the…

2025

Understanding and Mitigating Memorization in Diffusion Models for Tabular Data

ICML 2025poster

Tabular data generation has attracted significant research interest in recent years, with the tabular diffusion models greatly improving the quality of synthetic data. However, while memorization—where models inadvertently replicate exact or near-identical training data—has been thoroughly investiga…

2024

Discrete-state Continuous-time Diffusion for Graph Generation

NeurIPS 2024poster

Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks. Overall, according to the space of states and time steps, diffusion…

2024

Enhancing Hyperbolic Knowledge Graph Embeddings via Lorentz Transformations

ACL 2024findings

Knowledge Graph Embedding (KGE) is a powerful technique for predicting missing links in Knowledge Graphs (KGs) by learning the entities and relations. Hyperbolic space has emerged as a promising embedding space for KGs due to its ability to represent hierarchical data. Nevertheless, most existing hy…

2024

Fairness without Demographics through Shared Latent Space-Based Debiasing

AAAI 2024technical

Ensuring fairness in machine learning (ML) is crucial, particularly in applications that impact diverse populations. The majority of existing works heavily rely on the availability of protected features like race and gender. However, practical challenges such as privacy concerns and regulatory restr…

Cited by 5SourcePDFScholar
2024

LLM Maybe LongLM: SelfExtend LLM Context Window Without Tuning

ICML 2024spotlight

It is well known that LLMs cannot generalize well to long contexts whose lengths are larger than the training sequence length. This poses challenges when employing LLMs for processing long input sequences during inference. In this work, we argue that LLMs themselves have inherent capabilities to han…

2024

TabLog: Test-Time Adaptation for Tabular Data Using Logic Rules

ICML 2024poster

We consider the problem of test-time adaptation of predictive models trained on tabular data. Effective solution of this problem requires adaptation of predictive models trained on the source domain to a target domain, using only unlabeled target domain data, without access to source domain data. Ex…

2023

From Trainable Negative Depth to Edge Heterophily in Graphs

NeurIPS 2023poster

Finding the proper depth $d$ of a graph convolutional network (GCN) that provides strong representation ability has drawn significant attention, yet nonetheless largely remains an open problem for the graph learning community. Although noteworthy progress has been made, the depth or the number of…

Cited by 27SourcePDFScholar
2023

Interpretable Debiasing of Vectorized Language Representations with Iterative Orthogonalization

ICLR 2023poster

We propose a new mechanism to augment a word vector embedding representation that offers improved bias removal while retaining the key information—resulting in improved interpretability of the representation. Rather than removing the information associated with a concept that may induce bias, our pr…

Cited by 7SourcePDFScholar
2023

Probabilistic Masked Attention Networks for Explainable Sequential Recommendation

IJCAI 2023poster

Transformer-based models are powerful for modeling temporal dynamics of user preference in sequential recommendation. Most of the variants adopt the Softmax transformation in the self-attention layers to generate dense attention probabilities. However, real-world item sequences are often noisy, cont…

Cited by 11SourcePDFScholar