Search Results for author:
Found 13 papers, 0 papers with code
Best Arm Identification in Bandits with Limited Precision Sampling
The pulled arm and its instantaneous reward are revealed to the learner, whose goal is to find the best arm by minimising the expected stopping time, subject to an upper bound on the error probability.
ICQ: A Quantization Scheme for Best-Arm Identification Over Bit-Constrained Channels
We study the problem of best-arm identification in a distributed variant of the multi-armed bandit setting, with a central learner and multiple agents.
On the Regret of Online Edge Service Hosting
The total cost incurred by the system is modeled as a combination of the rent cost, the service cost incurred due to latency in serving customers, and the fetch cost incurred as a result of the bandwidth used to fetch the code/databases of the service from the cloud servers to host the service at the edge.
Sequential Community Mode Estimation
We propose and analyse novel algorithms for this problem, and also establish information theoretic lower bounds on the probability of error under any algorithm.
Online Partial Service Hosting at the Edge
We propose an online policy called $\alpha$-RetroRenting ($\alpha$-RR) which dynamically determines the fraction of the service to be hosted at the edge in any time-slot, based on the history of the request arrivals and the rent cost sequence.
Edge-computing
Networking and Internet Architecture
Fundamental Limits of Demand-Private Coded Caching
The memory-rate trade-off achieved using our schemes is shown to be within a multiplicative factor of 3 from the optimal when $K < N$ and of 8 when $N\leq K$.
Information Theory Information Theory
Greedy k-Center from Noisy Distance Samples
We study a variant of the canonical k-center problem over a set of vertices in a metric space, where the underlying distances are apriori unknown.
Query Complexity of k-NN based Mode Estimation
Motivated by the mode estimation problem of an unknown multivariate probability density function, we study the problem of identifying the point with the minimum k-th nearest neighbor distance for a given dataset of n points.
Query complexity of heavy hitter estimation
We consider the problem of identifying the subset $\mathcal{S}^{\gamma}_{\mathcal{P}}$ of elements in the support of an underlying distribution $\mathcal{P}$ whose probability value is larger than a given threshold $\gamma$, by actively querying an oracle to gain information about a sequence $X_1, X_2, \ldots$ of $i. i. d.$ samples drawn from $\mathcal{P}$.
Sequential Mode Estimation with Oracle Queries
We consider the problem of adaptively PAC-learning a probability distribution $\mathcal{P}$'s mode by querying an oracle for information about a sequence of i. i. d.
Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement
We study a multi-access variant of the popular coded caching framework, which consists of a central server with a catalog of $N$ files, $K$ caches with limited memory $M$, and $K$ users such that each user has access to $L$ consecutive caches with a cyclic wrap-around and requests one file from the central server's catalog.
Learning Recommendations While Influencing Interests
Many of these are based on learning algorithms where the RS uses the recommendation history and the user response to learn an optimal strategy.
Randomized Kaczmarz for Rank Aggregation from Pairwise Comparisons
We revisit the problem of inferring the overall ranking among entities in the framework of Bradley-Terry-Luce (BTL) model, based on available empirical data on pairwise preferences.
