1 citations · 1 across the 7 of their papers we have counts for
8 papers
Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy
Ishank Juneja, Carlee Joe-Wong, Osman Yağan
The classic multi-armed bandit (MAB) problem tackles the challenge of accruing maximum reward while making decisions under uncertainty. However, in applications, often the goal is…
Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
Anupam Nayak, Tong Yang, Osman Yagan +2
Reverse Kullback-Leibler (KL) divergence-based regularization with respect to a fixed reference policy is widely used in modern reinforcement learning to preserve the desired trait…
On Balancing Sparsity with Reliable Connectivity in Distributed Network Design with Random K-out Graphs
Mansi Sood, Eray Can Elumar, Osman Yagan
In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliabl…
Cost-aware LLM-based Online Dataset Annotation
Eray Can Elumar, Cem Tekin, Osman Yagan
Recent advances in large language models (LLMs) have enabled automated dataset labeling with minimal human supervision. While majority voting across multiple LLMs can improve label…
Bandits with Anytime Knapsacks
Eray Can Elumar, Cem Tekin, Osman Yagan
We consider bandits with anytime knapsacks (BwAK), a novel version of the BwK problem where there is an \textit{anytime} cost constraint instead of a total cost budget. This proble…
On the Interplay of Clustering and Evolution in the Emergence of Epidemic Outbreaks
Mansi Sood, Hejin Gu, Rashad Eletreby +3
In an increasingly interconnected world, a key scientific challenge is to examine mechanisms that lead to the widespread propagation of contagions, such as misinformation and patho…
On the Robustness, Connectivity and Giant Component Size of Random K-out Graphs
Eray Can Elumar, Mansi Sood, Osman Yağan
Random K-out graphs are garnering interest in designing distributed systems including secure sensor networks, anonymous crypto-currency networks, and differentially-private decentr…
On the Strength of Connectivity of Inhomogeneous Random K-out Graphs
Mansi Sood, Osman Yağan
Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as…