Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Moharir, Sharayu"'
We consider a non stationary multi-armed bandit in which the population preferences are positively and negatively reinforced by the observed rewards. The objective of the algorithm is to shape the population preferences to maximize the fraction of th
Externí odkaz:
http://arxiv.org/abs/2403.00036
We consider the problem of service hosting where a service provider can dynamically rent edge resources via short term contracts to ensure better quality of service to its customers. The service can also be partially hosted at the edge, in which case
Externí odkaz:
http://arxiv.org/abs/2303.06851
We consider the online caching problem for a cache of limited size. In a time-slotted system, a user requests one file from a large catalog in each slot. If the requested file is cached, the policy receives a unit reward and zero rewards otherwise. W
Externí odkaz:
http://arxiv.org/abs/2211.16051
We consider the setting where a service is hosted on a third-party edge server deployed close to the users and a cloud server at a greater distance from the users. Due to the proximity of the edge servers to the users, requests can be served at the e
Externí odkaz:
http://arxiv.org/abs/2207.14690
Federated Learning (FL) is a variant of distributed learning where edge devices collaborate to learn a model without sharing their data with the central server or each other. We refer to the process of training multiple independent models simultaneou
Externí odkaz:
http://arxiv.org/abs/2207.04330
Autor:
Bhuyan, Neelkamal, Moharir, Sharayu
Publikováno v:
2022 14th International Conference on COMmunication Systems & NETworkS (COMSNETS)
Federated learning is a form of distributed learning with the key challenge being the non-identically distributed nature of the data in the participating clients. In this paper, we extend federated learning to the setting where multiple unrelated mod
Externí odkaz:
http://arxiv.org/abs/2201.02582
Autor:
Narayana, V S Ch Lakshmi, Agarwala, Mohit, Prakash, R Sri, Karamchandani, Nikhil, Moharir, Sharayu
We consider the problem of service hosting where an application provider can dynamically rent edge computing resources and serve user requests from the edge to deliver a better quality of service. A key novelty of this work is that we allow the servi
Externí odkaz:
http://arxiv.org/abs/2103.00555
We consider a system composed of a sensor node tracking a time varying quantity. In every discretized time slot, the node attempts to send an update to a central monitoring station through one of K communication channels. We consider the setting wher
Externí odkaz:
http://arxiv.org/abs/2011.05032
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. Instead, we can query an oracle which provides noisy/incomplete estimates of the distance between any p
Externí odkaz:
http://arxiv.org/abs/2011.01973
Age-of-Information (AoI) is a performance metric for scheduling systems that measures the freshness of the data available at the intended destination. AoI is formally defined as the time elapsed since the destination received the recent most update f
Externí odkaz:
http://arxiv.org/abs/2009.12961