Xu, Pan
65 publications
JAIR
2025
Optimizing Relevance and Diversity in Online Matching Markets: A Time-Adaptive Attenuation Approach
ICML
2025
Robust Offline Reinforcement Learning with Linearly Structured $f$-Divergence Regularization
AISTATS
2024
Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximation
JAIR
2024
Exploring the Tradeoff Between System Profit and Income Equality Among Ride-Hailing Drivers
AAAI
2024
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
NeurIPS
2024
Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
NeurIPS
2024
Off-Dynamics Reinforcement Learning via Domain Adaptation and Reward Augmented Imitation
NeurIPSW
2024
Pre-Trained Language Models Improve the Few-Shot Prompt Ability of Decision Transformer
ICML
2024
Promoting External and Internal Equities Under Ex-Ante/Ex-Post Metrics in Online Resource Allocation
NeurIPS
2024
Promoting Fairness Among Dynamic Agents in Online-Matching Markets Under Known Stationary Arrival Distributions
ICLR
2024
Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
NeurIPS
2022
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
AAAI
2020
Balancing the Tradeoff Between Profit and Fairness in Rideshare Platforms During High-Demand Hours
AAAI
2019
Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach
AISTATS
2019
Sampling from Non-Log-Concave Distributions via Variance-Reduced Gradient Langevin Dynamics
AISTATS
2018
Accelerated Stochastic Mirror Descent: From Continuous-Time Dynamics to Discrete-Time Algorithms
AAAI
2018
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources
ICML
2018
Continuous and Discrete-Time Accelerated Stochastic Mirror Descent for Strongly Convex Functions
NeurIPS
2018
Third-Order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima
AISTATS
2017
Efficient Algorithm for Sparse Tensor-Variate Gaussian Graphical Models via Gradient Descent
NeurIPS
2017
Speeding up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimization