conftrace_

Qiaomin Xie

24 papers · 2018–2025 · 6 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+12 more ↓ πŸƒ Academic Marathon (7) 🧭 Keyword Pioneer 🌍 Conference Polyglot (6) πŸŒ‰ Interdisciplinary Bridge 🐝 Cross-Pollinator (12)
🐝 Cross-Pollinator (12) 🌈 Renaissance Researcher (5) πŸ—ΊοΈ Taxonomy Completionist (40) 🧬 Topic Evolution πŸ† Keyword Champion (6) 🌱 Topic Pioneer 🀝 Dynamic Duo (10) πŸ’Ž Century Club (24) πŸ—ƒοΈ Keyword Collector (107) πŸ“ˆ Trend Setter ⚑ Prolific Year (5) πŸš€ Conference Pioneer

Conferences

NIPS (7) AAAI (6) ICML (5) AISTATS (3) COLT (2) L4DC (1)

Research topics

Papers

Stable Offline Value Function Learning with Bisimulation-based Representations ICML 2025 Two-Timescale Linear Stochastic Approximation: Constant Stepsizes Go a Long Way AISTATS 2025 Coupling-based Convergence Diagnostic and Stepsize Scheme for Stochastic Gradient Descent AAAI 2025 Roping in Uncertainty: Robustness and Regularization in Markov Games ICML 2024 SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits AISTATS 2024 Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces ICML 2024 Exact Policy Recovery in Offline RL with Both Heavy-Tailed Rewards and Data Corruption AAAI 2024 Optimal Attack and Defense for Reinforcement Learning AAAI 2024 Data Poisoning to Fake a Nash Equilibria for Markov Games AAAI 2024 Effectiveness of Constant Stepsize in Markovian LSA and Statistical Inference AAAI 2024 The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize NIPS 2024 Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements AISTATS 2024 Minimally Modifying a Markov Game to Achieve Any Nash Equilibrium and Value ICML 2024 Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes COLT 2023 Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NIPS 2023 Reward Poisoning Attacks on Offline Multi-Agent Reinforcement Learning AAAI 2023 Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption NIPS 2023 Learning While Playing in Mean-Field Games: Convergence and Optimality ICML 2021 Stable Reinforcement Learning with Unbounded State Space L4DC 2020 POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis NIPS 2020 Dynamic Regret of Policy Optimization in Non-Stationary Environments NIPS 2020 Risk-Sensitive Reinforcement Learning: Near-Optimal Risk-Sample Tradeoff in Regret NIPS 2020 Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium COLT 2020 Q-learning with Nearest Neighbors NIPS 2018