default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiaomin Xie
Person information
- affiliation: University of Wisconsin-Madison, WI, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Yiding Chen, Xuezhou Zhang, Qiaomin Xie, Xiaojin Zhu:
Exact Policy Recovery in Offline RL with Both Heavy-Tailed Rewards and Data Corruption. AAAI 2024: 11416-11424- [c32]Jeremy McMahan, Young Wu, Xiaojin Zhu, Qiaomin Xie:
Optimal Attack and Defense for Reinforcement Learning. AAAI 2024: 14332-14340 - [c31]Young Wu, Jeremy McMahan, Xiaojin Zhu, Qiaomin Xie:
Data Poisoning to Fake a Nash Equilibria for Markov Games. AAAI 2024: 15979-15987 - [c30]Dongyan Lucy Huo
, Yudong Chen, Qiaomin Xie:
Effectiveness of Constant Stepsize in Markovian LSA and Statistical Inference. AAAI 2024: 20447-20455 - [c29]Subhojyoti Mukherjee, Qiaomin Xie, Josiah P. Hanna, Robert D. Nowak:
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits. AISTATS 2024: 2962-2970 - [c28]Emmanouil-Vasileios Vlatakis-Gkaragkounis, Angeliki Giannou, Yudong Chen, Qiaomin Xie:
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements. AISTATS 2024: 4123-4131 - [c27]Jeremy McMahan, Giovanni Artiglio, Qiaomin Xie:
Roping in Uncertainty: Robustness and Regularization in Markov Games. ICML 2024 - [c26]Brahma S. Pavse, Matthew Zurek, Yudong Chen, Qiaomin Xie, Josiah P. Hanna:
Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces. ICML 2024 - [c25]Young Wu, Jeremy McMahan, Yiding Chen, Yudong Chen, Jerry Zhu, Qiaomin Xie:
Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value. ICML 2024 - [c24]Yixuan Zhang, Dongyan Lucy Huo, Yudong Chen, Qiaomin Xie:
Prelimit Coupling and Steady-State Convergence of Constant-stepsize Nonsmooth Contractive SA. SIGMETRICS/Performance (Abstracts) 2024: 35-36 - [c23]Yige Hong, Qiaomin Xie, Weina Wang:
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes. SIGMETRICS/Performance (Abstracts) 2024: 93-94 - [i36]Yixuan Zhang, Qiaomin Xie:
Constant Stepsize Q-learning: Distributional Convergence, Bias and Extrapolation. CoRR abs/2401.13884 (2024) - [i35]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits. CoRR abs/2402.05689 (2024) - [i34]Yixuan Zhang, Dongyan Huo, Yudong Chen, Qiaomin Xie:
Prelimit Coupling and Steady-State Convergence of Constant-stepsize Nonsmooth Contractive SA. CoRR abs/2404.06023 (2024) - [i33]Dongyan Huo, Yixuan Zhang, Yudong Chen, Qiaomin Xie:
The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize. CoRR abs/2405.16732 (2024) - [i32]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
When is exponential asymptotic optimality achievable in average-reward restless bandits? CoRR abs/2405.17882 (2024) - [i31]Subhojyoti Mukherjee, Josiah P. Hanna, Qiaomin Xie, Robert D. Nowak:
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning. CoRR abs/2406.05064 (2024) - [i30]Jeremy McMahan, Giovanni Artiglio, Qiaomin Xie:
Roping in Uncertainty: Robustness and Regularization in Markov Games. CoRR abs/2406.08847 (2024) - [i29]Jeremy McMahan, Young Wu, Yudong Chen, Xiaojin Zhu, Qiaomin Xie:
Inception: Efficiently Computable Misinformation Attacks on Markov Games. CoRR abs/2406.17114 (2024) - 2023
- [j10]Qiaomin Xie, Yudong Chen, Zhaoran Wang, Zhuoran Yang:
Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium. Math. Oper. Res. 48(1): 433-462 (2023) - [j9]Yige Hong, Qiaomin Xie, Weina Wang:
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes. Proc. ACM Meas. Anal. Comput. Syst. 7(3): 48:1-48:46 (2023) - [c22]Young Wu, Jeremy McMahan, Xiaojin Zhu, Qiaomin Xie:
Reward Poisoning Attacks on Offline Multi-Agent Reinforcement Learning. AAAI 2023: 10426-10434 - [c21]Zihan Zhang, Qiaomin Xie:
Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes. COLT 2023: 5476-5477 - [c20]Xudong Qin, Qiaomin Xie, Bin Li:
Distributed Threshold-Based Offloading for Heterogeneous Mobile Edge Computing. ICDCS 2023: 202-213 - [c19]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption. NeurIPS 2023 - [c18]Subhojyoti Mukherjee, Qiaomin Xie, Josiah Hanna, Robert D. Nowak:
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits. NeurIPS 2023 - [c17]Dongyan Lucy Huo, Yudong Chen, Qiaomin Xie:
Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes. SIGMETRICS (Abstracts) 2023: 81-82 - [i28]Subhojyoti Mukherjee, Qiaomin Xie, Josiah Hanna, Robert D. Nowak:
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits. CoRR abs/2301.12357 (2023) - [i27]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption. CoRR abs/2306.00196 (2023) - [i26]Brahma S. Pavse, Yudong Chen, Qiaomin Xie, Josiah P. Hanna:
Tackling Unbounded State Spaces in Continuing Task Reinforcement Learning. CoRR abs/2306.01896 (2023) - [i25]Young Wu, Jeremy McMahan, Xiaojin Zhu, Qiaomin Xie:
On Faking a Nash Equilibrium. CoRR abs/2306.08041 (2023) - [i24]Zihan Zhang, Qiaomin Xie:
Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes. CoRR abs/2306.16394 (2023) - [i23]Emmanouil V. Vlatakis-Gkaragkounis, Angeliki Giannou, Yudong Chen, Qiaomin Xie:
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements. CoRR abs/2306.16502 (2023) - [i22]Jeremy McMahan, Young Wu, Yudong Chen, Xiaojin Zhu, Qiaomin Xie:
VISER: A Tractable Solution Concept for Games with Information Asymmetry. CoRR abs/2307.09652 (2023) - [i21]Peihan Huo, Oscar Peralta, Junyu Guo, Qiaomin Xie, Andreea Minca:
Reinforcement Learning for SBM Graphon Games with Re-Sampling. CoRR abs/2310.16326 (2023) - [i20]Subhojyoti Mukherjee, Qiaomin Xie, Josiah P. Hanna, Robert D. Nowak:
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits. CoRR abs/2311.00327 (2023) - [i19]Young Wu, Jeremy McMahan, Yiding Chen, Yudong Chen, Xiaojin Zhu, Qiaomin Xie:
Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value. CoRR abs/2311.00582 (2023) - [i18]Jeremy McMahan, Young Wu, Xiaojin Zhu, Qiaomin Xie:
Optimal Attack and Defense for Reinforcement Learning. CoRR abs/2312.00198 (2023) - [i17]Dongyan Huo, Yudong Chen, Qiaomin Xie:
Effectiveness of Constant Stepsize in Markovian LSA and Statistical Inference. CoRR abs/2312.10894 (2023) - 2022
- [j8]Devavrat Shah, Qiaomin Xie, Zhi Xu:
Nonasymptotic Analysis of Monte Carlo Tree Search. Oper. Res. 70(6): 3234-3260 (2022) - [j7]Christopher Archer, Siddhartha Banerjee, Mayleen Cortez, Carrie Rucker, Sean R. Sinclair, Max Solberg, Qiaomin Xie, Christina Lee Yu:
ORSuite: Benchmarking Suite for Sequential Operations Models. SIGMETRICS Perform. Evaluation Rev. 49(2): 57-61 (2022) - [j6]Bai Liu, Qiaomin Xie, Eytan H. Modiano:
RL-QN: A Reinforcement Learning Framework for Optimal Control of Queueing Systems. ACM Trans. Model. Perform. Evaluation Comput. Syst. 7(1): 2:1-2:35 (2022) - [i16]Young Wu, Jeremy McMahan, Xiaojin Zhu, Qiaomin Xie:
Reward Poisoning Attacks on Offline Multi-Agent Reinforcement Learning. CoRR abs/2206.01888 (2022) - [i15]Yige Hong, Qiaomin Xie, Weina Wang:
Maximizing Utilization under Time-Varying Resource Requirements. CoRR abs/2209.04123 (2022) - [i14]Dongyan Huo, Yudong Chen, Qiaomin Xie:
Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes. CoRR abs/2210.00953 (2022) - 2021
- [j5]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. Math. Oper. Res. 46(3): 1230-1234 (2021) - [j4]Weina Wang, Qiaomin Xie, Mor Harchol-Balter:
Zero Queueing for Multi-Server Jobs. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 07:1-07:25 (2021) - [c16]Qiaomin Xie, Zhuoran Yang, Zhaoran Wang, Andreea Minca:
Learning While Playing in Mean-Field Games: Convergence and Optimality. ICML 2021: 11436-11447 - [c15]Weina Wang, Qiaomin Xie, Mor Harchol-Balter:
Zero Queueing for Multi-Server Jobs. SIGMETRICS (Abstracts) 2021: 13-14 - 2020
- [j3]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. Math. Oper. Res. 45(2): 497-516 (2020) - [c14]Qiaomin Xie, Yudong Chen, Zhaoran Wang, Zhuoran Yang:
Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium. COLT 2020: 3674-3682 - [c13]Devavrat Shah, Varun Somani, Qiaomin Xie, Zhi Xu:
On Reinforcement Learning for Turn-based Zero-sum Markov Games. FODS 2020: 139-148 - [c12]Devavrat Shah, Qiaomin Xie, Zhi Xu:
Stable Reinforcement Learning with Unbounded State Space. L4DC 2020: 581 - [c11]Yingjie Fei, Zhuoran Yang, Yudong Chen, Zhaoran Wang, Qiaomin Xie:
Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret. NeurIPS 2020 - [c10]Yingjie Fei, Zhuoran Yang, Zhaoran Wang, Qiaomin Xie:
Dynamic Regret of Policy Optimization in Non-Stationary Environments. NeurIPS 2020 - [c9]Weichao Mao, Kaiqing Zhang, Qiaomin Xie, Tamer Basar:
POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis. NeurIPS 2020 - [c8]Devavrat Shah, Qiaomin Xie, Zhi Xu:
Non-Asymptotic Analysis of Monte Carlo Tree Search. SIGMETRICS (Abstracts) 2020: 31-32 - [i13]Qiaomin Xie, Yudong Chen, Zhaoran Wang, Zhuoran Yang:
Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium. CoRR abs/2002.07066 (2020) - [i12]Devavrat Shah, Varun Somani, Qiaomin Xie, Zhi Xu:
On Reinforcement Learning for Turn-based Zero-sum Markov Games. CoRR abs/2002.10620 (2020) - [i11]Devavrat Shah, Qiaomin Xie, Zhi Xu:
Stable Reinforcement Learning with Unbounded State Space. CoRR abs/2006.04353 (2020) - [i10]Weichao Mao, Kaiqing Zhang, Qiaomin Xie, Tamer Basar:
POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis. CoRR abs/2006.04672 (2020) - [i9]Yingjie Fei, Zhuoran Yang, Yudong Chen, Zhaoran Wang, Qiaomin Xie:
Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret. CoRR abs/2006.13827 (2020) - [i8]Yingjie Fei, Zhuoran Yang, Zhaoran Wang, Qiaomin Xie:
Dynamic Regret of Policy Optimization in Non-stationary Environments. CoRR abs/2007.00148 (2020) - [i7]Qiaomin Xie, Zhuoran Yang, Zhaoran Wang, Andreea Minca:
Provable Fictitious Play for General Mean-Field Games. CoRR abs/2010.04211 (2020) - [i6]Bai Liu, Qiaomin Xie, Eytan H. Modiano:
RL-QN: A Reinforcement Learning Framework for Optimal Control of Queueing Systems. CoRR abs/2011.07401 (2020) - [i5]Weina Wang, Qiaomin Xie, Mor Harchol-Balter:
Zero Queueing for Multi-Server Jobs. CoRR abs/2011.10521 (2020)
2010 – 2019
- 2019
- [c7]Bai Liu, Qiaomin Xie, Eytan H. Modiano:
Reinforcement Learning for Optimal Control of Queueing Systems. Allerton 2019: 663-670 - [i4]Devavrat Shah, Qiaomin Xie, Zhi Xu:
On Reinforcement Learning Using Monte Carlo Tree Search with Supervised Learning: Non-Asymptotic Analysis. CoRR abs/1902.05213 (2019) - 2018
- [c6]Devavrat Shah, Qiaomin Xie:
Q-learning with Nearest Neighbors. NeurIPS 2018: 3115-3125 - [i3]Devavrat Shah, Qiaomin Xie:
Q-learning with Nearest Neighbors. CoRR abs/1802.03900 (2018) - 2017
- [j2]Qiaomin Xie, Mayank Pundir, Yi Lu, Cristina L. Abad, Roy H. Campbell:
Pandas: Robust Locality-Aware Scheduling With Stochastic Delay Optimality. IEEE/ACM Trans. Netw. 25(2): 662-675 (2017) - [c5]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. IPCO 2017: 228-240 - [i2]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. CoRR abs/1703.01634 (2017) - [i1]Devavrat Shah, Qiaomin Xie:
Centralized Congestion Control and Scheduling in a Datacenter. CoRR abs/1710.02548 (2017) - 2016
- [b1]Qiaomin Xie:
Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails. University of Illinois Urbana-Champaign, USA, 2016 - [c4]Qiaomin Xie, Ali Yekkehkhany, Yi Lu:
Scheduling with multi-level data locality: Throughput and heavy-traffic optimality. INFOCOM 2016: 1-9 - 2015
- [c3]Qiaomin Xie, Yi Lu:
Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality. INFOCOM 2015: 963-972 - [c2]Qiaomin Xie, Xiaobo Dong, Yi Lu, Rayadurgam Srikant:
Power of d Choices for Large-Scale Bin Packing: A Loss Model. SIGMETRICS 2015: 321-334 - 2012
- [c1]Qiaomin Xie, Yi Lu:
Degree-guided map-reduce task assignment with data locality constraint. ISIT 2012: 985-989 - 2011
- [j1]Yi Lu, Qiaomin Xie, Gabriel Kliot, Alan Geller, James R. Larus, Albert G. Greenberg:
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services. Perform. Evaluation 68(11): 1056-1071 (2011)
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:24 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:
