research
∙
04/11/2023
: Fair Multi-Armed Bandits with Guaranteed Rewards per Arm
Classic no-regret online prediction algorithms, including variants of th...
share
research
∙
03/11/2023
No-regret Algorithms for Fair Resource Allocation
We consider a fair resource allocation problem in the no-regret setting ...
research
∙
09/28/2022
Online Subset Selection using α-Core with no Augmented Regret
We consider the problem of sequential sparse subset selections in an onl...
research
∙
08/15/2022
Optimistic No-regret Algorithms for Discrete Caching
We take a systematic look at the problem of storing whole files in a cac...
research
∙
05/10/2022
Universal Caching
In the learning literature, the performance of an online policy is commo...
research
∙
03/31/2022
Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA
Non-orthogonal multiple access (NOMA) is a technology proposed for next ...
research
∙
11/23/2021
Status-quo policy gradient in Multi-Agent Reinforcement Learning
Individual rationality, which involves maximizing expected individual re...
research
∙
10/15/2021
k – Online Policies and Fundamental Limits
This paper introduces and studies the k problem – a generalization of th...
research
∙
09/25/2021
Optimizing Age-of-Information in Adversarial Environments with Channel State Information
This paper considers a multi-user downlink scheduling problem with acces...
research
∙
09/16/2021
Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
This paper considers the problem of secure packet routing at the maximum...
research
∙
06/12/2021
D2C: Diffusion-Denoising Models for Few-shot Conditional Generation
Conditional generative models of high-dimensional images have many appli...
research
∙
02/09/2021
Negative Data Augmentation
Data augmentation is often used to enlarge datasets with synthetic sampl...
research
∙
01/18/2021
Online Caching with Optimal Switching Regret
We consider the classical uncoded caching problem from an online learnin...
research
∙
11/10/2020
Optimizing the Age-of-Information for Mobile Users in Adversarial and Stochastic Environments
We study a multi-user downlink scheduling problem for optimizing the fre...
research
∙
09/17/2020
Caching in Networks without Regret
We consider the online problem where n users are connected to m caches ...
research
∙
05/12/2020
Competitive Algorithms for Minimizing the Maximum Age-of-Information
In this short paper, we consider the problem of designing a near-optimal...
research
∙
05/04/2020
On the Benefits of Models with Perceptually-Aligned Gradients
Adversarial robust models have been shown to learn more robust and inter...
research
∙
03/31/2020
Fundamental Limits of Online Network-Caching
Optimal caching of files in a content distribution network (CDN) is a pr...
research
∙
01/15/2020
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments
We study the multi-user scheduling problem for minimizing the Age of Inf...
research
∙
01/15/2020
Inducing Cooperation in Multi-Agent Games Through Status-Quo Loss
Social dilemma situations bring out the conflict between individual and ...
research
∙
01/15/2020
Inducing Cooperative behaviour in Sequential-Social dilemmas through Multi-Agent Reinforcement Learning using Status-Quo Loss
In social dilemma situations, individual rationality leads to sub-optima...
research
∙
12/06/2019
cFineGAN: Unsupervised multi-conditional fine-grained image generation
We propose an unsupervised multi-conditional image generation pipeline: ...
research
∙
12/01/2019
A Method for Computing Class-wise Universal Adversarial Perturbations
We present an algorithm for computing class-specific universal adversari...
research
∙
11/29/2019
On the Benefits of Attributional Robustness
Interpretability is an emerging area of research in trustworthy machine ...
research
∙
10/26/2019
Intrusion Detection using Sequential Hybrid Model
A large amount of work has been done on the KDD 99 dataset, most of whic...
research
∙
07/28/2019
Charting the Right Manifold: Manifold Mixup for Few-shot Learning
Few-shot learning algorithms aim to learn model parameters capable of ad...
research
∙
05/13/2019
Harnessing the Vulnerability of Latent Layers in Adversarially Trained Models
Neural networks are vulnerable to adversarial attacks -- small visually ...
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
∙
03/27/2019
Scheduling Algorithms for 5G Networks with Mid-haul Capacity Constraints
We consider a virtualized RAN architecture for 5G networks where the Rem...
research
∙
05/26/2018
Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows
Distributed computing networks, tasked with both packet transmission and...
research
∙
04/23/2018
Attention Based Natural Language Grounding by Navigating Virtual Environment
In this work, we focus on the problem of grounding language by training ...
research
∙
01/05/2018
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
We consider a wireless broadcast network with a base station sending tim...
research
∙
01/03/2018
Neural Networks in Adversarial Setting and Ill-Conditioned Weight Space
Recently, Neural networks have seen a huge surge in its adoption due to ...
research
∙
11/08/2017
Intelligent Fault Analysis in Electrical Power Grids
Power grids are one of the most important components of infrastructure i...
research
∙
11/08/2017
Deep Fault Analysis and Subset Selection in Solar Power Grids
Non-availability of reliable and sustainable electric power is a major p...
research
∙
09/08/2017