Lemin Kong

According to our database, Lemin Kong authored at least 6 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Explicit Preference Optimization: No Need for an Implicit Reward Model.

Xiangkun Hu, Lemin Kong, Tong He, David Wipf

CoRR, June, 2025

Common Learning Constraints Alter Interpretations of Direct Preference Optimization.

Lemin Kong, Xiangkun Hu, Tong He, David Wipf

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2023

Outlier-Robust Gromov Wasserstein for Graph Data.

Lemin Kong, Jiajin Li, Anthony Man-Cho So

CoRR, 2023

Outlier-Robust Gromov-Wasserstein for Graph Data.

Lemin Kong, Jiajin Li, Jianheng Tang, Anthony Man-Cho So

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data.

Jiajin Li, Jianheng Tang, Lemin Kong, Huikang Liu, Jia Li, Anthony Man-Cho So, Jose H. Blanchet

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Learning.

Jiajin Li, Jianheng Tang, Lemin Kong, Huikang Liu, Jia Li, Anthony Man-Cho So, Jose H. Blanchet

CoRR, 2022