Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQi Qi 0006
Person information
- unicode name: 齐琪
- affiliation: University of Iowa, Department of Computer Science, Iowa City, IA, USA
- affiliation: University of Science and Technology of China, Hefei, China
Other persons with the same name
- Qi Qi — disambiguation page
- Qi Qi 0001
![[0000-0003-0829-4624]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0829-4624")
— Beijing University of Posts and Telecommunications, State Key Laboratory of Networking and Switching Technology, China - Qi Qi 0002 — LSI corporation, Milpitas, CA, USA (and 1 more)
- Qi Qi 0003 — Hong Kong University of Science and Technology, Department of Industrial Engineering and Logistics Management, Hong Kong (and 1 more)
- Qi Qi 0004 — Hainan University, Haikou, China (and 1 more)
- Qi Qi 0005 — Xiamen University, School of Information Science and Engineering / Fujian Key Laboratory of Sensing and Computing for Smart City, China
- Qi Qi 0007 — Southeast University, School of Electrical Engineering, Nanjing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Quanqi Hu, Qi Qi, Zhaosong Lu, Tianbao Yang:
Single-loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions. CoRR abs/2405.18577 (2024)- [i9]Qi Qi, Quanqi Hu, Qihang Lin, Tianbao Yang:
Provable Optimization for Adversarial Fair Self-supervised Contrastive Learning. CoRR abs/2406.05686 (2024) - 2023
- [i8]Qi Qi, Shervin Ardeshir:
Improving Identity-Robustness for Face Models. CoRR abs/2304.03838 (2023) - 2022
- [i7]Qi Qi, Jiameng Lyu, Kung-Sik Chan, Er-Wei Bai, Tianbao Yang:
Stochastic Constrained DRO with a Complexity Independent of Sample Size. CoRR abs/2210.05740 (2022) - [i6]Qi Qi, Shervin Ardeshir, Yi Xu, Tianbao Yang:
Fairness via Adversarial Attribute Neighbourhood Robust Learning. CoRR abs/2210.06630 (2022) - 2021
- [c7]Qi Qi, Youzhi Luo, Zhao Xu, Shuiwang Ji, Tianbao Yang:
Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence. NeurIPS 2021: 1752-1765 - [c6]Qi Qi, Zhishuai Guo, Yi Xu, Rong Jin, Tianbao Yang:
An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives. NeurIPS 2021: 10067-10080 - [i5]Qi Qi, Youzhi Luo, Zhao Xu, Shuiwang Ji, Tianbao Yang:
Stochastic Optimization of Area Under Precision-Recall Curve for Deep Learning with Provable Convergence. CoRR abs/2104.08736 (2021) - 2020
- [c5]Qi Qi, Yan Yan, Zixuan Wu, Xiaoyu Wang, Tianbao Yang:
A Simple and Effective Framework for Pairwise Deep Metric Learning. ECCV (27) 2020: 375-391 - [i4]Qi Qi, Zhishuai Guo, Yi Xu, Rong Jin, Tianbao Yang:
A Practical Online Method for Distributionally Deep Robust Optimization. CoRR abs/2006.10138 (2020) - [i3]Daoming Lyu, Qi Qi, Mohammad Ghavamzadeh, Hengshuai Yao, Tianbao Yang, Bo Liu:
Variance-Reduced Off-Policy Memory-Efficient Policy Search. CoRR abs/2009.06548 (2020) - [i2]Qi Qi, Yi Xu, Rong Jin, Wotao Yin, Tianbao Yang:
Attentional Biased Stochastic Gradient for Imbalanced Classification. CoRR abs/2012.06951 (2020)
2010 – 2019
- 2019
- [j2]Thomas Weise, Yan Jiang, Qi Qi, Weichen Liu:
A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem. Int. J. Cogn. Informatics Nat. Intell. 13(3): 1-18 (2019) - [c4]Yi Xu, Qi Qi, Qihang Lin, Rong Jin, Tianbao Yang:
Stochastic Optimization for DC Functions and Non-smooth Non-convex Regularizers with Non-asymptotic Convergence. ICML 2019: 6942-6951 - [i1]Qi Qi, Yan Yan, Zixuan Wu, Xiaoyu Wang, Tianbao Yang:
a simple and effective framework for pairwise deep metric learning. CoRR abs/1912.11194 (2019) - 2018
- [j1]Thomas Weise, Xiaofeng Wang, Qi Qi, Bin Li, Ke Tang:
Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features. Appl. Soft Comput. 73: 366-382 (2018) - [c3]Qi Qi, Thomas Weise, Bin Li:
Optimization algorithm behavior modeling: A study on the traveling salesman problem. ICACI 2018: 861-866 - 2017
- [c2]Qi Qi, Thomas Weise, Bin Li:
Modeling optimization algorithm runtime behavior and its applications. GECCO (Companion) 2017: 115-116 - [c1]Weichen Liu, Thomas Weise, Yuezhong Wu, Qi Qi:
Combining two local searches with crossover: an efficient hybrid algorithm for the traveling salesman problem. GECCO 2017: 298-305
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-19 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
