1. Jason Altschuler Jonathan Weed and Philippe Rigollet. 2017. Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In NeurIPS. 1961–1971. Jason Altschuler Jonathan Weed and Philippe Rigollet. 2017. Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In NeurIPS. 1961–1971.
2. Guillermo D Canas and Lorenzo A Rosasco. 2012. Learning probability measures with respect to optimal transport metrics. In NeurIPS. 2492–2500. Guillermo D Canas and Lorenzo A Rosasco. 2012. Learning probability measures with respect to optimal transport metrics. In NeurIPS. 2492–2500.
3. Jiangxia Cao Xixun Lin Shu Guo Luchen Liu Tingwen Liu and Bin Wang. 2021. Bipartite graph embedding via mutual information maximization. In WSDM. 635–643. Jiangxia Cao Xixun Lin Shu Guo Luchen Liu Tingwen Liu and Bin Wang. 2021. Bipartite graph embedding via mutual information maximization. In WSDM. 635–643.
4. Huiyuan Chen and Jing Li. 2020. Neural Tensor Model for Learning Multi-Aspect Factors in Recommender Systems.. In IJCAI. Huiyuan Chen and Jing Li. 2020. Neural Tensor Model for Learning Multi-Aspect Factors in Recommender Systems.. In IJCAI.
5. Huiyuan Chen Lan Wang Yusan Lin Chin-Chia Michael Yeh Fei Wang and Hao Yang. 2021. Structured graph convolutional networks with stochastic masks for recommender systems. In SIGIR. 614–623. Huiyuan Chen Lan Wang Yusan Lin Chin-Chia Michael Yeh Fei Wang and Hao Yang. 2021. Structured graph convolutional networks with stochastic masks for recommender systems. In SIGIR. 614–623.