34 citations · 58 across the 22 of their papers we have counts for
4 papers · 1 filter
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…