34 citations · 58 across the 22 of their papers we have counts for
32 papers
BanditQ: Fair Bandits with Guaranteed Rewards
Abhishek Sinha
Classic no-regret multi-armed bandit algorithms, including the Upper Confidence Bound (UCB), Hedge, and EXP3, are inherently unfair by design. Their unfairness stems from their obj…
No-regret Algorithms for Fair Resource Allocation
Abhishek Sinha, Ativ Joshi, Rajarshi Bhattacharjee +2
We consider a fair resource allocation problem in the no-regret setting against an unrestricted adversary. The objective is to allocate resources equitably among several agents in…
Online Subset Selection using -Core with no Augmented Regret
Sourav Sahoo, Siddhant Chaudhary, Samrat Mukhopadhyay +1
We revisit the classic problem of optimal subset selection in the online learning set-up. Assume that the set consists of distinct elements. On the th round, an advers…
Optimistic No-regret Algorithms for Discrete Caching
Naram Mhaisen, Abhishek Sinha, Georgios Paschos +1
We take a systematic look at the problem of storing whole files in a cache with limited capacity in the context of optimistic learning, where the caching policy has access to a pre…
Universal Caching
Ativ Joshi, Abhishek Sinha
In learning theory, the performance of an online policy is commonly measured in terms of the static regret metric, which compares the cumulative loss of an online policy to that of…
Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA
Subhankar Banerjee, Chung Shue Chen, Marceau Coupechoux +1
Non-orthogonal multiple access (NOMA) is a technology proposed for next generation cellular networks because of its high spectral efficiency and enhanced user connectivity. However…
Optimizing Age-of-Information in Adversarial Environments with Channel State Information
Avijit Mandal, Rajarshi Bhattacharjee, Abhishek Sinha
This paper considers a multi-user downlink scheduling problem with access to the channel state information at the transmitter (CSIT) to minimize the Age-of-Information (AoI) in a n…
-- Online Policies and Fundamental Limits
Samrat Mukhopadhyay, Sourav Sahoo, Abhishek Sinha
We introduce the $\texttt{$k$-experts}$ problem - a generalization of the classic Prediction with Expert's Advice framework. Unlike the classic version, where the learner selects e…
Fast and Secure Routing Algorithms for Quantum Key Distribution Networks
Shahbaz Akhtar, Krishnakumar G, Vishnu B +1
We consider the problem of secure packet routing at the maximum achievable rate in Quantum Key Distribution (QKD) networks. Assume that a QKD protocol generates symmetric private k…
Online Caching with Optimal Switching Regret
Samrat Mukhopadhyay, Abhishek Sinha
We consider the classical uncoded caching problem from an online learning point-of-view. A cache of limited storage capacity can hold files at a time from a large catalog. A us…
Optimizing Age-of-Information in Adversarial and Stochastic Environments
Abhishek Sinha, Rajarshi Bhattacharjee
We design efficient online scheduling policies to maximize the freshness of information delivered to the users in a cellular network under both adversarial and stochastic channel a…
LeadCache: Regret-Optimal Caching in Networks
Debjit Paria, Abhishek Sinha
We consider an online prediction problem in the context of network caching. Assume that multiple users are connected to several caches via a bipartite network. At any time slot, ea…
Competitive Algorithms for Minimizing the Maximum Age-of-Information
Rajarshi Bhattacharjee, Abhishek Sinha
In this short paper, we consider the problem of designing a near-optimal competitive scheduling policy for mobile users, to maximize the freshness of available information unif…
Fundamental Limits of Online Network-Caching
Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha
Optimal caching of files in a content distribution network (CDN) is a problem of fundamental and growing commercial interest. Although many different caching algorithms are in use…
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments
Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha
We study the multi-user scheduling problem for minimizing the Age of Information (AoI) in cellular wireless networks under stationary and non-stationary regimes. We derive fundamen…
On Minimizing the Maximum Age-of-Information For Wireless Erasure Channels
Arunabh Srivastava, Abhishek Sinha, Krishna Jagannathan
Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1…
Scheduling Algorithms for 5G Networks with Mid-haul Capacity Constraints
Abhishek Sinha, Matthew Andrews, Prasanth Ananth
We consider a virtualized RAN architecture for 5G networks where the Remote Units are connected to a central unit via a mid-haul. To support high data rates, the midhaul is realize…
Optimal Control of Distributed Computing Networks with Mixed-Cast Traffic Flows
Jianan Zhang, Abhishek Sinha, Jaime Llorca +2
Distributed computing networks, tasked with both packet transmission and processing, require the joint optimization of communication and computation resources. We develop a dynamic…
Network Utility Maximization with Heterogeneous Traffic Flows
Abhishek Sinha, Eytan Modiano
We consider the Network Utility Maximization (NUM) problem for wireless networks in the presence of arbitrary types of flows, including unicast, broadcast, multicast, and anycast t…
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
Igor Kadota, Abhishek Sinha, Elif Uysal-Biyikoglu +2
We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), na…
Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model
Arpan Chattopadhyay, Abhishek Sinha, Marceau Coupechoux +1
We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for…
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
Abhishek Sinha, Eytan Modiano
We consider the problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves th…
Optimal Control for Generalized Network-Flow Problems
Abhishek Sinha, Eytan Modiano
We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast and anycast traffic, in a general wireless…
Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology
Abhishek Sinha, Leandros Tassiulas, Eytan Modiano
We consider the problem of throughput-optimal broadcast- ing in time-varying wireless networks, whose underlying topology is restricted to Directed Acyclic Graphs (DAG). Previous b…