research
∙
05/07/2023
Capacity Achieving Codes for an Erasure Queue-Channel
We consider a queue-channel model that captures the waiting time-depende...
share
research
∙
11/01/2022
Towards Maximizing Nonlinear Delay Sensitive Rewards in Queuing Systems
We consider maximizing the long-term average reward in a single server q...
research
∙
06/09/2022
The Classical Capacity of Quantum Jackson Networks with Waiting Time-Dependent Erasures
We study the fundamental limits of classical communication using quantum...
research
∙
05/12/2022
A Survey of Risk-Aware Multi-Armed Bandits
In several applications such as clinical trials and financial portfolio ...
research
∙
11/16/2021
Online Estimation and Optimization of Utility-Based Shortfall Risk
Utility-Based Shortfall Risk (UBSR) is a risk metric that is increasingl...
research
∙
10/06/2021
Unital Qubit Queue-channels: Classical Capacity and Product Decoding
Quantum queue-channels arise naturally in the context of buffering in qu...
research
∙
07/28/2021
Queue-Channel Capacities with Generalized Amplitude Damping
The generalized amplitude damping channel (GADC) is considered an import...
research
∙
08/28/2020
Statistically Robust, Risk-Averse Best Arm Identification in Multi-Armed Bandits
Traditional multi-armed bandit (MAB) formulations usually make certain a...
research
∙
06/22/2020
Bandit algorithms: Letting go of logarithmic regret for statistical robustness
We study regret minimization in a stochastic multi-armed bandit setting ...
research
∙
06/17/2020
Constrained regret minimization for multi-criterion multi-armed bandits
We consider a stochastic multi-armed bandit setting and study the proble...
research
∙
11/20/2019
A Framework for End-to-End Deep Learning-Based Anomaly Detection in Transportation Networks
We develop an end-to-end deep learning-based anomaly detection model for...
research
∙
09/13/2019
LSTM-Based Anomaly Detection: Detection Rules from Extreme Value Theory
In this paper, we explore various statistical techniques for anomaly det...
research
∙
06/04/2019
The Classical Capacity of a Quantum Erasure Queue-Channel
We consider a setting where a stream of qubits is processed sequentially...
research
∙
06/03/2019
Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards
Classical multi-armed bandit problems use the expected value of an arm a...
research
∙
04/01/2019
On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels
Age-of-Information (AoI) is a recently proposed metric for quantifying t...
research
∙
02/18/2019
Grids versus Graphs: Partitioning Space for Improved Taxi Demand-Supply Forecasts
Accurate taxi demand-supply forecasting is a challenging application of ...
research
∙
01/04/2019
Risk-aware Multi-armed Bandits Using Conditional Value-at-Risk
Traditional multi-armed bandit problems are geared towards finding the a...
research
∙
12/10/2018
Taxi Demand-Supply Forecasting: Impact of Spatial Partitioning on the Performance of Neural Networks
In this paper, we investigate the significance of choosing an appropriat...
research
∙
08/06/2018
Concentration bounds for empirical conditional value-at-risk: The unbounded case
In several real-world applications involving decision making under uncer...
research
∙
05/17/2018
Taxi demand forecasting: A HEDGE based tessellation strategy for improved accuracy
A key problem in location-based modeling and forecasting lies in identif...
research
∙
04/03/2018
Qubits through Queues: The Capacity of Channels with Waiting Time Dependent Errors
We consider a setting where qubits are processed sequentially, and deriv...
research
∙
12/28/2017
Caching under Content Freshness Constraints
Several real-time delay-sensitive applications pose varying degrees of f...
research
∙
02/29/2016
