research
∙
09/16/2023
Two-Sided Capacitated Submodular Maximization in Gig Platforms
In this paper, we propose three generic models of capacitated coverage a...
share
research
∙
09/16/2023
New bounds for b-Symbol Distances of Matrix Product Codes
Matrix product codes are generalizations of some well-known construction...
research
∙
09/15/2023
Wasserstein Distributionally Robust Policy Evaluation and Learning for Contextual Bandits
Off-policy evaluation and learning are concerned with assessing a given ...
research
∙
05/29/2023
Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
We present a scalable and effective exploration strategy based on Thomps...
research
∙
03/29/2023
Queer In AI: A Case Study in Community-Led Participatory AI
We present Queer in AI as a case study for community-led participatory d...
research
∙
11/30/2022
Global Convergence of Localized Policy Iteration in Networked Multi-Agent Reinforcement Learning
We study a multi-agent reinforcement learning (MARL) problem where the a...
research
∙
11/26/2022
Equity Promotion in Public Transportation
There are many news articles reporting the obstacles confronting poverty...
research
∙
09/15/2022
Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets
In this paper, we propose an online-matching-based model to study the as...
research
∙
06/22/2022
Langevin Monte Carlo for Contextual Bandits
We study the efficiency of Thompson sampling for contextual bandits. Exi...
research
∙
06/07/2022
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
We study the regret of Thompson sampling (TS) algorithms for exponential...
research
∙
12/09/2021
Online minimum matching with uniform metric and random arrivals
We consider Online Minimum Bipartite Matching under the uniform metric. ...
research
∙
12/08/2021
Equity Promotion in Online Resource Allocation
We consider online resource allocation under a typical non-profit settin...
research
∙
10/08/2021
Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons
In heterogeneous rank aggregation problems, users often exhibit various ...
research
∙
09/18/2021
Fairness Maximization among Offline Agents in Online-Matching Markets
Matching markets involve heterogeneous agents (typically from two partie...
research
∙
12/12/2020
Trading the System Efficiency for the Income Equality of Drivers in Rideshare
Several scientific studies have reported the existence of the income gap...
research
∙
12/12/2020
A Unified Model for the Two-stage Offline-then-Online Resource Allocation
With the popularity of the Internet, traditional offline resource alloca...
research
∙
12/03/2020
Neural Contextual Bandits with Deep Representation and Shallow Exploration
We study a general class of contextual bandits, where each context-actio...
research
∙
11/27/2020
Group-level Fairness Maximization in Online Bipartite Matching
In typical online matching problems, the goal is to maximize the number ...
research
∙
10/19/2020
Faster Convergence of Stochastic Gradient Langevin Dynamics for Non-Log-Concave Sampling
We establish a new convergence analysis of stochastic gradient Langevin ...
research
∙
10/14/2020
Improved Approximation Algorithms for Stochastic-Matching Problems
We consider the Stochastic Matching problem, which is motivated by appli...
research
∙
05/04/2020
A Finite Time Analysis of Two Time-Scale Actor Critic Methods
Actor-critic (AC) methods have exhibited great empirical success compare...
research
∙
03/03/2020
MOTS: Minimax Optimal Thompson Sampling
Thompson sampling is one of the most widely used algorithms for many onl...
research
∙
02/21/2020
Double Explore-then-Commit: Asymptotic Optimality and Beyond
We study the two-armed bandit problem with subGaussian rewards. The expl...
research
∙
12/18/2019
Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours
Rideshare platforms, when assigning requests to drivers, tend to maximiz...
research
∙
12/10/2019
A Finite-Time Analysis of Q-Learning with Neural Network Function Approximation
Q-learning with neural network function approximation (neural Q-learning...
research
∙
12/03/2019
Rank Aggregation via Heterogeneous Thurstone Preference Models
We propose the Heterogeneous Thurstone Model (HTM) for aggregating ranke...
research
∙
11/30/2019
Mix and Match: Markov Chains Mixing Times for Matching in Rideshare
Rideshare platforms such as Uber and Lyft dynamically dispatch drivers t...
research
∙
09/18/2019
Sample Efficient Policy Gradient Methods with Recursive Variance Reduction
Improving the sample efficiency in reinforcement learning has been a lon...
research
∙
05/29/2019
An Improved Convergence Analysis of Stochastic Variance-Reduced Policy Gradient
We revisit the stochastic variance-reduced policy gradient (SVRPG) metho...
research
∙
11/29/2018
Sample Efficient Stochastic Variance-Reduced Cubic Regularization Method
We propose a sample efficient stochastic variance-reduced cubic regulari...
research
∙
11/13/2018
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
In bipartite matching problems, vertices on one side of a bipartite grap...
research
∙
06/22/2018
Finding Local Minima via Stochastic Nested Variance Reduction
We propose two algorithms that can find local minima faster than the sta...
research
∙
06/20/2018
Stochastic Nested Variance Reduction for Nonconvex Optimization
We study finite-sum nonconvex optimization problems, where the objective...
research
∙
05/20/2018
A PTAS for a Class of Stochastic Dynamic Programs
We develop a framework for obtaining polynomial time approximation schem...
research
∙
04/22/2018
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts
Online matching problems have garnered significant attention in recent y...
research
∙
02/13/2018
Stochastic Variance-Reduced Cubic Regularized Newton Method
We propose a stochastic variance-reduced cubic regularized Newton method...
research
∙
02/13/2018
Stochastic Variance-Reduced Hamilton Monte Carlo Methods
We propose a fast stochastic Hamilton Monte Carlo (HMC) method, for samp...
research
∙
01/23/2018
Onion Curve: A Space Filling Curve with Near-Optimal Clustering
Space filling curves (SFCs) are widely used in the design of indexes for...
research
∙
12/18/2017
Third-order Smoothness Helps: Even Faster Stochastic Optimization Algorithms for Finding Local Minima
We propose stochastic optimization algorithms that can find local minima...
research
∙
11/22/2017
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources
Bipartite matching markets pair agents on one side of a market with agen...
research
∙
11/07/2017
Algorithms to Approximate Column-Sparse Packing Problems
Column-sparse packing problems arise in several contexts in both determi...
research
∙
07/20/2017
Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimization
We present a unified framework to analyze the global convergence of Lang...
research
∙
02/28/2017
Speeding Up Latent Variable Gaussian Graphical Model Estimation via Nonconvex Optimizations
We study the estimation of the latent variable Gaussian graphical model ...
research
∙
12/29/2016