default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeiqiang Zheng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Yang Cai, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng:
Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games. AISTATS 2024: 3889-3897- [c10]Jiahao Zhang, Tao Lin, Weiqiang Zheng, Zhe Feng, Yifeng Teng, Xiaotie Deng:
Learning Thresholds with Latent Values and Censored Feedback. ICLR 2024 - [c9]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion. ICML 2024 - [i13]Yang Cai, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng:
Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games. CoRR abs/2401.15240 (2024) - [i12]Yang Cai, Constantinos Daskalakis, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng:
Tractable Local Equilibria in Non-Concave Games. CoRR abs/2403.08171 (2024) - [i11]Yang Cai, Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Weiqiang Zheng:
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms. CoRR abs/2406.10631 (2024) - 2023
- [c8]Yang Cai
, Weiqiang Zheng:
Accelerated Single-Call Methods for Constrained Min-Max Optimization. ICLR 2023 - [c7]Yang Cai, Weiqiang Zheng:
Doubly Optimal No-Regret Learning in Monotone Games. ICML 2023: 3507-3524 - [c6]Yang Cai, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng:
Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback. NeurIPS 2023 - [i10]Yang Cai, Weiqiang Zheng:
Doubly Optimal No-Regret Learning in Monotone Games. CoRR abs/2301.13120 (2023) - [i9]Yang Cai, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng:
Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games. CoRR abs/2303.02738 (2023) - [i8]Yang Cai, Gabriele Farina, Julien Grand-Clément, Christian Kroer, Chung-Wei Lee, Haipeng Luo, Weiqiang Zheng:
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games. CoRR abs/2311.00676 (2023) - [i7]Jiahao Zhang, Tao Lin, Weiqiang Zheng, Zhe Feng, Yifeng Teng, Xiaotie Deng:
Learning Thresholds with Latent Values and Censored Feedback. CoRR abs/2312.04653 (2023) - 2022
- [c5]Dezhi Ran, Weiqiang Zheng, Yunqi Li, Kaigui Bian, Jie Zhang, Xiaotie Deng:
Revenue and User Traffic Maximization in Mobile Short-Video Advertising. AAMAS 2022: 1092-1100 - [c4]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Finite-Time Last-Iterate Convergence for Learning in Multi-Player Games. NeurIPS 2022 - [c3]Lirong Xia, Weiqiang Zheng:
Beyond the Worst Case: Semi-random Complexity Analysis of Winner Determination. WINE 2022: 330-347 - [c2]Xiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang Zheng:
Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions. WWW 2022: 141-150 - [i6]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Tight Last-Iterate Convergence of the Extragradient Method for Constrained Monotone Variational Inequalities. CoRR abs/2204.09228 (2022) - [i5]Yang Cai, Argyris Oikonomou, Weiqiang Zheng:
Accelerated Algorithms for Monotone Inclusions and Constrained Nonconvex-Nonconcave Min-Max Optimization. CoRR abs/2206.05248 (2022) - [i4]Yang Cai, Weiqiang Zheng:
Accelerated Single-Call Methods for Constrained Min-Max Optimization. CoRR abs/2210.03096 (2022) - [i3]Lirong Xia, Weiqiang Zheng:
Beyond the Worst Case: Semi-Random Complexity Analysis of Winner Determination. CoRR abs/2210.08173 (2022) - 2021
- [c1]Lirong Xia, Weiqiang Zheng:
The Smoothed Complexity of Computing Kemeny and Slater Rankings. AAAI 2021: 5742-5750 - [i2]Xiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang Zheng:
Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions. CoRR abs/2110.03906 (2021) - 2020
- [i1]Lirong Xia, Weiqiang Zheng:
The Smoothed Complexity of Computing Kemeny and Slater Rankings. CoRR abs/2010.13020 (2020)
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-09-04 01:20 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:
