Jiezhong Qiu, Yuxiao Dong, Hao Ma, Jian Li, Chi Wang, Kuansan Wang and Jie Tang. NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization. , WWW 2019.
Jianhao Yan, Lin He, Ruqin Huang, Jian Li and Ying Liu. Relation Extraction with Temporal Reasoning Based on Memory Augmented Distant Supervision. , NAACL-HLT 2019.
Haotian Jiang, Jian Li, Daogao Liu, Sahil Singla. Algorithms and Adaptivity Gaps for Stochastic k-TSP. , ITCS 2020.
Chuheng Zhang, Yuanqi Li, and Jian Li. Policy Search by Target Distribution Learning for Continuous Control. .
Jin Xu, Jingbo Zhou, Yongpo Jia, Jian Li, Xiong Hui. An Adaptive Master-Slave Regularized Model for Unexpected Revenue Prediction Enhanced with Alternative Data. .
Yu Shi, Jian Li and Zhize Li. Gradient Boosting with Piece-Wise Linear Regression Trees. .
Zhize Li, Tianyi Zhang, Shuyu Cheng, Jun Zhu, Jian Li. Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference. , Machine Learning, 2019.
Jin Xu, Jingbo Zhou, Yongpo Jia, Jian Li，Hui Xiong. Graph Neural Network Enhanced Adaptive Model for Revenue Prediction with Alternative Data. , ICDE 2020.
Yue Yu, Jiaxiang Wu and Longbo Huang. Double Quantization for Communication-Efficient Distributed Optimization. , NeurIPS 2019.
Ran Duan, Haoqing He, Tianyi Zhang. A Scaling Algorithm for Weighted f-Factors in General Graphs. .
Duan, Ran; He, Haoqing; Zhang, Tianyi. Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees. , https://arxiv.org/abs/1712.09166.
Cen Ruoxu; Duan, Ran. Roundtrip Spanners with (2k-1) stretch. , https://arxiv.org/abs/1911.12411.
Ran Duan, Haoqing He, Tianyi Zhang. Dynamic edge-coloring with improved approximation. , Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang. An improved algorithm for incremental DFS tree in undirected graphs. , SWAT 2018.
Ran Duan, Tianyi Zhang. Improved distance sensitivity oracles via tree partitioning. , WADS 2017.
Ran Duan, Yong Gu, Hanlin Ren. Approximate Distance Oracles Subject to Multiple Vertex Failures. .
Ran Duan, Ce Jin, Hongxun Wu. Faster Algorithms for All Pairs Non-decreasing Paths Problem. , Leibniz International Proceedings in Informatics, LIPIcs.
Shuya Li, Fangping Wan, Hantao Shu, Tao Jiang, Dan Zhao, and Jianyang Zeng. MONN: a Multi-Objective Neural Network for Predicting Pairwise Non-Covalent Interactions and Binding Affinities between Compounds and Proteins. , RECOMB 2019.