Khang Tran

dblp:47/7216 · DBLP profile ↗
← Back
3ranked-venue papers in the field
2as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Big Data, Cloud & Distributed Data Systems · 2 (1 first)Data Mining & Knowledge Discovery · 1 (1 first)
YearPublicationVenuePosition
2026 MELCOT: A Hybrid Learning Architecture with Marginal Preservation for Matrix-Valued Regression
abstract
Regression is essential across many domains but remains challenging in high-dimensional settings, where existing methods often lose spatial structure or demand heavy storage. In this work, we address the problem of matrix-valued regression, where each sample is naturally represented as a matrix. We propose MELCOT, a hybrid model that integrates a classical machine–learning–based Marginal Estimation (ME) block with a deep-learning–based Learnable-Cost Optimal Transport (LCOT) block. The ME block estimates data marginals to preserve spatial information, while the LCOT block learns complex global features. This design enables MELCOT to inherit the strengths of both classical and deep learning methods. Extensive experiments across diverse datasets and domains demonstrate that MELCOT consistently outperforms all baselines while remaining highly efficient and provides potential applications in various domains, including high-content imaging (HCI).
Khang Tran, Hieu Cao, Thinh Pham, Nghiem Diep, Tri Cao
WSDM1
2025 SGFusion: Stochastic Geographic Gradient Fusion in Federated Learning
Khang Tran, NhatHai Phan, Cristian Borcea, Ruoming Jin, Issa M. Khalil
IEEE Big Data2
2022 Heterogeneous Randomized Response for Differential Privacy in Graph Neural Networks
abstract
Graph neural networks (GNNs) are susceptible to privacy inference attacks (PIAS) given their ability to learn joint representation from features and edges among nodes in graph data. To prevent privacy leakages in GNNs, we propose a novel heterogeneous randomized response (HeteroRR) mechanism to protect nodes’ features and edges against PIAS under differential privacy (DP) guarantees, without an undue cost of data and model utility in training GNNs. Our idea is to balance the importance and sensitivity of nodes’ features and edges in redistributing the privacy budgets since some features and edges are more sensitive or important to the model utility than others. As a result, we derive significantly better randomization probabilities and tighter error bounds at both levels of nodes’ features and edges departing from existing approaches, thus enabling us to maintain high data utility for training GNNs. An extensive theoretical and empirical analysis using benchmark datasets shows that HeteroRR significantly outperforms various baselines in terms of model utility under rigorous privacy protection for both nodes’ features and edges. That enables us to defend PIAs in DP-preserving GNNs effectively.
Khang Tran, Phung Lai, NhatHai Phan, Issa M. Khalil, Yao Ma 0001, Abdallah Khreishah, My T. Thai, Xintao Wu
IEEE Big Data1