
A Finite Time Analysis of Two TimeScale Actor Critic Methods
Actorcritic (AC) methods have exhibited great empirical success compare...
read it

MOTS: Minimax Optimal Thompson Sampling
Thompson sampling is one of the most widely used algorithms for many onl...
read it

Double ExplorethenCommit: Asymptotic Optimality and Beyond
We study the twoarmed bandit problem with subGaussian rewards. The expl...
read it

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During HighDemand Hours
Rideshare platforms, when assigning requests to drivers, tend to maximiz...
read it

A FiniteTime Analysis of QLearning with Neural Network Function Approximation
Qlearning with neural network function approximation (neural Qlearning...
read it

Rank Aggregation via Heterogeneous Thurstone Preference Models
We propose the Heterogeneous Thurstone Model (HTM) for aggregating ranke...
read it

Mix and Match: Markov Chains Mixing Times for Matching in Rideshare
Rideshare platforms such as Uber and Lyft dynamically dispatch drivers t...
read it

Sample Efficient Policy Gradient Methods with Recursive Variance Reduction
Improving the sample efficiency in reinforcement learning has been a lon...
read it

An Improved Convergence Analysis of Stochastic VarianceReduced Policy Gradient
We revisit the stochastic variancereduced policy gradient (SVRPG) metho...
read it

Sample Efficient Stochastic VarianceReduced Cubic Regularization Method
We propose a sample efficient stochastic variancereduced cubic regulari...
read it

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
In bipartite matching problems, vertices on one side of a bipartite grap...
read it

Finding Local Minima via Stochastic Nested Variance Reduction
We propose two algorithms that can find local minima faster than the sta...
read it

Stochastic Nested Variance Reduction for Nonconvex Optimization
We study finitesum nonconvex optimization problems, where the objective...
read it

A PTAS for a Class of Stochastic Dynamic Programs
We develop a framework for obtaining polynomial time approximation schem...
read it

Attenuate Locally, Win Globally: An Attenuationbased Framework for Online Stochastic Matching with Timeouts
Online matching problems have garnered significant attention in recent y...
read it

Stochastic VarianceReduced Cubic Regularized Newton Method
We propose a stochastic variancereduced cubic regularized Newton method...
read it

Stochastic VarianceReduced Hamilton Monte Carlo Methods
We propose a fast stochastic Hamilton Monte Carlo (HMC) method, for samp...
read it

Onion Curve: A Space Filling Curve with NearOptimal Clustering
Space filling curves (SFCs) are widely used in the design of indexes for...
read it

Thirdorder Smoothness Helps: Even Faster Stochastic Optimization Algorithms for Finding Local Minima
We propose stochastic optimization algorithms that can find local minima...
read it

Allocation Problems in RideSharing Platforms: Online Matching with Offline Reusable Resources
Bipartite matching markets pair agents on one side of a market with agen...
read it

Algorithms to Approximate ColumnSparse Packing Problems
Columnsparse packing problems arise in several contexts in both determi...
read it

Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization
We present a unified framework to analyze the global convergence of Lang...
read it

Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimizations
We study the estimation of the latent variable Gaussian graphical model ...
read it

Communicationefficient Distributed Estimation and Inference for Transelliptical Graphical Models
We propose communicationefficient distributed estimation and inference ...
read it
Pan Xu
verfied profile