research
∙
08/07/2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions
Bilevel optimization has become a powerful tool in a wide variety of mac...
share
research
∙
06/22/2023
Achieving Sample and Computational Efficient Reinforcement Learning by Action Space Reduction via Grouping
Reinforcement learning often needs to deal with the exponential growth o...
research
∙
06/14/2023
Theoretical Hardness and Tractability of POMDPs in RL with Partial Hindsight State Information
Partially observable Markov decision processes (POMDPs) have been widely...
research
∙
03/10/2023
Provably Efficient Model-Free Algorithms for Non-stationary CMDPs
We study model-free reinforcement learning (RL) algorithms in episodic n...
research
∙
02/12/2023
Theory on Forgetting and Generalization of Continual Learning
Continual learning (CL), which aims to learn a sequence of tasks, has at...
research
∙
02/08/2023
A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints
In many applications of Reinforcement Learning (RL), it is critically im...
research
∙
02/08/2023
Near-Optimal Adversarial Reinforcement Learning with Switching Costs
Switching costs, which capture the costs for changing policies, are rega...
research
∙
06/23/2022
Provably Efficient Model-Free Constrained RL with Linear Function Approximation
We study the constrained reinforcement learning problem, in which an age...
research
∙
08/26/2021
Adaptive Control of Differentially Private Linear Quadratic Systems
In this paper, we study the problem of regret minimization in reinforcem...
research
∙
07/06/2021
Weighted Gaussian Process Bandits for Non-stationary Environments
In this paper, we consider the Gaussian process (GP) bandit optimization...
research
∙
02/11/2021
No-Regret Algorithms for Time-Varying Bayesian Optimization
In this paper, we consider the time-varying Bayesian optimization proble...
research
∙
10/28/2020
Bandit Policies for Reliable Cellular Network Handovers in Extreme Mobility
The demand for seamless Internet access under extreme user mobility, suc...
research
∙
10/13/2020
Multi-Armed Bandits with Dependent Arms
We study a variant of the classical multi-armed bandit problem (MABP) wh...
research
∙
06/23/2020
ACOUSTIC-TURF: Acoustic-based Privacy-Preserving COVID-19 Contact Tracing
In this paper, we propose a new privacy-preserving, automated contact tr...
research
∙
06/06/2020
Contextual Bandits with Side-Observations
We investigate contextual bandits in the presence of side-observations a...
research
∙
04/20/2020
A Note on Load Balancing in Many-Server Heavy-Traffic Regime
In this note, we apply Stein's method to analyze the performance of gene...
research
∙
03/13/2020
A Note on Stein's Method for Heavy-Traffic Analysis
In this note, we apply Stein's method to analyze the steady-state distri...
research
∙
02/20/2020
Asymptotically Optimal Load Balancing in Large-scale Heterogeneous Systems with Multiple Dispatchers
We consider the load balancing problem in large-scale heterogeneous syst...
research
∙
02/15/2020
Is Deadline Oblivious Scheduling Efficient for Controlling Real-Time Traffic in Cellular Downlink Systems?
The emergence of bandwidth-intensive latency-critical traffic in 5G Netw...
research
∙
12/28/2019
On the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization
In this paper, we prove that under mild stochastic assumptions, work-con...
research
∙
12/28/2019
A Note on the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization
In this paper, we prove that under mild stochastic assumptions, work-con...
research
∙
05/16/2019
Data Poisoning Attacks on Stochastic Bandits
Stochastic multi-armed bandits form a class of online learning problems ...
research
∙
02/20/2019
Balance Queueing and Retransmission: Latency-Optimal Massive MIMO Design
One fundamental challenge in 5G URLLC is how to optimize massive MIMO co...
research
∙
02/03/2019
A Faster FPTAS for Knapsack Problem With Cardinality Constraint
We study the K-item knapsack problem (, 1.5-dimensional KP), which is a ...
research
∙
02/03/2019
Knapsack Problem With Cardinality Constraint: A Faster FPTAS Through the Lens of Numerical Analysis and Applications
We study the K-item knapsack problem (, 1.5-dimensional knapsack problem...
research
∙
01/23/2019
Fundamental Limits of Approximate Gradient Coding
It has been established that when the gradient coding problem is distrib...
research
∙
10/28/2018
Exploring k out of Top ρ Fraction of Arms in Stochastic Bandits
This paper studies the problem of identifying any k distinct arms among ...
research
∙
08/21/2018
Heavy-traffic Delay Optimality in Pull-based Load Balancing Systems: Necessary and Sufficient Conditions
In this paper, we consider a load balancing system under a general pull-...
research
∙
06/08/2018
Flexible Load Balancing with Multi-dimensional State-space Collapse: Throughput and Heavy-traffic Delay Optimality
Heavy traffic analysis for load balancing policies has relied heavily on...
research
∙
05/23/2018
Analysis of Thompson Sampling for Graphical Bandits Without the Graphs
We study multi-armed bandit problems with graph feedback, in which the d...
research
∙
04/25/2018
Fundamental Limits of Coded Linear Transform
In large scale distributed linear transform problems, coded computation ...
research
∙
04/22/2018
Towards Practical Constrained Monotone Submodular Maximization
We design new algorithms for maximizing a monotone non-negative submodul...
research
∙
04/16/2018
UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits
In this work, we address the open problem of finding low-complexity near...
research
∙
03/20/2018
An Online Algorithm for Power-proportional Data Centers with Switching Cost
Recent works show that power-proportional data centers can save energy c...
research
∙
02/09/2018
Coded Sparse Matrix Multiplication
In a large-scale and distributed matrix multiplication problem C=A^B, wh...
research
∙
11/08/2017
A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problem
The multi-armed bandit problem has been extensively studied under the st...
research
∙
11/08/2017
Information Directed Sampling for Stochastic Bandits with Graph Feedback
We consider stochastic multi-armed bandit problems with graph feedback, ...
research
∙
10/12/2017
Designing Low-Complexity Heavy-Traffic Delay-Optimal Load Balancing Schemes: Theory to Algorithms
We establish a unified analytical framework for load balancing systems, ...
research
∙
08/04/2017
