Qiaomin Xie

Orcid: 0000-0003-2834-6866

Affiliations:
  • University of Wisconsin-Madison, WI, USA


According to our database1, Qiaomin Xie authored at least 58 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stable Offline Value Function Learning with Bisimulation-based Representations.
CoRR, 2024

Inception: Efficiently Computable Misinformation Attacks on Markov Games.
CoRR, 2024

Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning.
CoRR, 2024

When is exponential asymptotic optimality achievable in average-reward restless bandits?
CoRR, 2024

The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize.
CoRR, 2024

Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits.
CoRR, 2024

Prelimit Coupling and Steady-State Convergence of Constant-stepsize Nonsmooth Contractive SA.
Proceedings of the Abstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2024

Constant Stepsize Q-learning: Distributional Convergence, Bias and Extrapolation.
Proceedings of the 1st Reinforcement Learning Conference, 2024

Inception: Efficiently Computable Misinformation Attacks on Markov Games.
Proceedings of the 1st Reinforcement Learning Conference, 2024

Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Roping in Uncertainty: Robustness and Regularization in Markov Games.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

Data Poisoning to Fake a Nash Equilibria for Markov Games.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Optimal Attack and Defense for Reinforcement Learning.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Effectiveness of Constant Stepsize in Markovian LSA and Statistical Inference.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Exact Policy Recovery in Offline RL with Both Heavy-Tailed Rewards and Data Corruption.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes.
Proc. ACM Meas. Anal. Comput. Syst., December, 2023

Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium.
Math. Oper. Res., February, 2023

Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value.
CoRR, 2023

Reinforcement Learning for SBM Graphon Games with Re-Sampling.
CoRR, 2023

VISER: A Tractable Solution Concept for Games with Information Asymmetry.
CoRR, 2023

On Faking a Nash Equilibrium.
CoRR, 2023

Tackling Unbounded State Spaces in Continuing Task Reinforcement Learning.
CoRR, 2023

Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes.
Proceedings of the Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2023

Multi-task Representation Learning for Pure Exploration in Bilinear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Distributed Threshold-Based Offloading for Heterogeneous Mobile Edge Computing.
Proceedings of the 43rd IEEE International Conference on Distributed Computing Systems, 2023

Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Reward Poisoning Attacks on Offline Multi-Agent Reinforcement Learning.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Nonasymptotic Analysis of Monte Carlo Tree Search.
Oper. Res., November, 2022

RL-QN: A Reinforcement Learning Framework for Optimal Control of Queueing Systems.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2022

ORSuite: Benchmarking Suite for Sequential Operations Models.
SIGMETRICS Perform. Evaluation Rev., 2022

Maximizing Utilization under Time-Varying Resource Requirements.
CoRR, 2022

2021
Zero Queueing for Multi-Server Jobs.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.
Math. Oper. Res., 2021

Learning While Playing in Mean-Field Games: Convergence and Optimality.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.
Math. Oper. Res., 2020

Provable Fictitious Play for General Mean-Field Games.
CoRR, 2020

Non-Asymptotic Analysis of Monte Carlo Tree Search.
Proceedings of the Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems, 2020

POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Dynamic Regret of Policy Optimization in Non-Stationary Environments.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stable Reinforcement Learning with Unbounded State Space.
Proceedings of the 2nd Annual Conference on Learning for Dynamics and Control, 2020

On Reinforcement Learning for Turn-based Zero-sum Markov Games.
Proceedings of the FODS '20: ACM-IMS Foundations of Data Science Conference, 2020

2019
On Reinforcement Learning Using Monte Carlo Tree Search with Supervised Learning: Non-Asymptotic Analysis.
CoRR, 2019

Reinforcement Learning for Optimal Control of Queueing Systems.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Q-learning with Nearest Neighbors.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Pandas: Robust Locality-Aware Scheduling With Stochastic Delay Optimality.
IEEE/ACM Trans. Netw., 2017

Centralized Congestion Control and Scheduling in a Datacenter.
CoRR, 2017

Stochastic Online Scheduling on Unrelated Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Scheduling and resource allocation for clouds: novel algorithms, state space collapse and decay of tails
PhD thesis, 2016

Scheduling with multi-level data locality: Throughput and heavy-traffic optimality.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Power of <i>d</i> Choices for Large-Scale Bin Packing: A Loss Model.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2012
Degree-guided map-reduce task assignment with data locality constraint.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services.
Perform. Evaluation, 2011


  Loading...