Combining two local searches with crossover: an efficient hybrid algorithm for the traveling salesman problem. - Weichen Liu; Thomas Weise 001; Yuezhong Wu; Qi Qi 006 (GECCO, 2017)

Modeling optimization algorithm runtime behavior and its applications. - Qi Qi 006; Thomas Weise 001; Bin Li 025 (GECCO (Companion), 2017)

Optimization algorithm behavior modeling: A study on the traveling salesman problem. - Qi Qi 006; Thomas Weise 001; Bin Li 025 (ICACI, 2018)

Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features. - Thomas Weise 001; Xiaofeng Wang 009; Qi Qi 006; Bin Li 025; Ke Tang 001 (Appl. Soft Comput., 2018)

Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergence. - Yi Xu 008; Qi Qi 006; Qihang Lin; Rong Jin 001; Tianbao Yang (ICML, 2019)

A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem. - Thomas Weise 001; Yan Jiang; Qi Qi 006; Weichen Liu (Int. J. Cogn. Informatics Nat. Intell., 2019)

A Simple and Effective Framework for Pairwise Deep Metric Learning. - Qi Qi 006; Yan Yan 006; Zixuan Wu; Xiaoyu Wang 002; Tianbao Yang (ECCV (27), 2020)

A Practical Online Method for Distributionally Deep Robust Optimization. - Qi Qi 006; Zhishuai Guo; Yi Xu 008; Rong Jin 001; Tianbao Yang (CoRR, 2020)

Variance-Reduced Off-Policy Memory-Efficient Policy Search. - Daoming Lyu; Qi Qi 006; Mohammad Ghavamzadeh; Hengshuai Yao; Tianbao Yang; Bo Liu 006 (CoRR, 2020)

Attentional Biased Stochastic Gradient for Imbalanced Classification. - Qi Qi 006; Yi Xu 008; Rong Jin 001; Wotao Yin; Tianbao Yang (CoRR, 2020)

An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives. - Qi Qi 006; Zhishuai Guo; Yi Xu 008; Rong Jin 001; Tianbao Yang (NeurIPS, 2021)

Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence. - Qi Qi 006; Youzhi Luo; Zhao Xu 005; Shuiwang Ji; Tianbao Yang (NeurIPS, 2021)

Stochastic Optimization of Area Under Precision-Recall Curve for Deep Learning with Provable Convergence. - Qi Qi 006; Youzhi Luo; Zhao Xu 005; Shuiwang Ji; Tianbao Yang (CoRR, 2021)

Advanced graph and sequence neural networks for molecular property prediction and drug discovery. - Zhengyang Wang; Meng Liu 015; Youzhi Luo; Zhao Xu 005; Yaochen Xie; Limei Wang; Lei Cai; Qi Qi 006; Zhuoning Yuan; Tianbao Yang; Shuiwang Ji (Bioinform., 2022)

Fairness via Adversarial Attribute Neighbourhood Robust Learning. - Qi Qi 006; Shervin Ardeshir; Yi Xu 008; Tianbao Yang (CoRR, 2022)

Improving Identity-Robustness for Face Models. - Qi Qi 006; Shervin Ardeshir (CoRR, 2023)

Stochastic Constrained DRO with a Complexity Independent of Sample Size. - Qi Qi 006; Jiameng Lyu; Kung-Sik Chan; Er-Wei Bai; Tianbao Yang (Trans. Mach. Learn. Res., 2023)

Attentional-Biased Stochastic Gradient Descent. - Qi Qi 006; Yi Xu 008; Wotao Yin; Rong Jin 001; Tianbao Yang (Trans. Mach. Learn. Res., 2023)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions. - Quanqi Hu; Qi Qi 006; Zhaosong Lu; Tianbao Yang (NeurIPS, 2024)

Provable Optimization for Adversarial Fair Self-supervised Contrastive Learning. - Qi Qi 006; Quanqi Hu; Qihang Lin; Tianbao Yang (CoRR, 2024)