中文
相关论文

相关论文: Exploiting Heterogeneity in Robust Federated Best-…

200 篇论文

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. Each agent is associated with an arm of the bandit, generating stochastic rewards…

机器学习 · 计算机科学 2023-05-02 Fathima Zarin Faizal , Adway Girish , Manjesh Kumar Hanawal , Nikhil Karamchandani

We consider the decentralized exploration problem: a set of players collaborate to identify the best arm by asynchronously interacting with the same stochastic environment. The objective is to insure privacy in the best arm identification…

机器学习 · 计算机科学 2023-01-18 Raphaël Féraud , Réda Alami , Romain Laroche

We consider the best arm identification (BAI) problem in the $K-$armed bandit framework with a modification - the agent is allowed to play a subset of arms at each time slot instead of one arm. Consequently, the agent observes the sample…

机器学习 · 计算机科学 2026-01-30 Siddhartha Parupudi , Gourab Ghatak

Federated learning is a privacy-preserving machine learning technique that learns a shared model across decentralized clients. It can alleviate privacy concerns of personal re-identification, an important computer vision task. In this work,…

计算机视觉与模式识别 · 计算机科学 2020-10-12 Weiming Zhuang , Yonggang Wen , Xuesen Zhang , Xin Gan , Daiying Yin , Dongzhan Zhou , Shuai Zhang , Shuai Yi

We consider the best-arm identification problem in multi-armed bandits, which focuses purely on exploration. A player is given a fixed budget to explore a finite set of arms, and the rewards of each arm are drawn independently from a fixed,…

机器学习 · 统计学 2017-08-02 Shahin Shahrampour , Mohammad Noshad , Vahid Tarokh

We study best-arm identification in stochastic multi-armed bandits under the fixed-confidence setting, focusing on instances with multiple optimal arms. Unlike prior work that addresses the unknown-number-of-optimal-arms case, we consider…

机器学习 · 计算机科学 2026-03-05 Lan V. Truong

Federated learning (FL) is a distributed machine learning paradigm where multiple clients conduct local training based on their private data, then the updated models are sent to a central server for global aggregation. The practical…

机器学习 · 计算机科学 2025-04-03 Harsh Vardhan , Xiaofan Yu , Tajana Rosing , Arya Mazumdar

We consider a multi-armed bandit setting with finitely many arms, in which each arm yields an $M$-dimensional vector reward upon selection. We assume that the reward of each dimension (a.k.a. {\em objective}) is generated independently of…

机器学习 · 计算机科学 2025-01-24 Zhirui Chen , P. N. Karthik , Yeow Meng Chee , Vincent Y. F. Tan

Federated Learning (FL) provides a privacy-preserving framework for training machine learning models on mobile edge devices. Traditional FL algorithms, e.g., FedAvg, impose a heavy communication workload on these devices. To mitigate this…

机器学习 · 计算机科学 2024-10-01 Zhidong Gao , Yu Zhang , Yanmin Gong , Yuanxiong Guo

Sampling from distributions to find the one with the largest mean arises in a broad range of applications, and it can be mathematically modeled as a multi-armed bandit problem in which each distribution is associated with an arm. This paper…

机器学习 · 统计学 2013-06-18 Kevin Jamieson , Matthew Malloy , Robert Nowak , Sebastien Bubeck

We investigate the sample complexity of learning the optimal arm for multi-task bandit problems. Arms consist of two components: one that is shared across tasks (that we call representation) and one that is task-specific (that we call…

机器学习 · 统计学 2022-11-29 Alessio Russo , Alexandre Proutiere

This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, where each arm pull has probability $\varepsilon$ of…

统计理论 · 数学 2021-11-16 Jason Altschuler , Victor-Emmanuel Brunel , Alan Malek

We study the problem of best arm identification in linearly parameterised multi-armed bandits. Given a set of feature vectors $\mathcal{X}\subset\mathbb{R}^d,$ a confidence parameter $\delta$ and an unknown vector $\theta^*,$ the goal is to…

机器学习 · 计算机科学 2020-06-16 Mohammadi Zaki , Avi Mohan , Aditya Gopalan

Federated learning (FL) commonly involves clients with diverse communication and computational capabilities. Such heterogeneity can significantly distort the optimization dynamics and lead to objective inconsistency, where the global model…

机器学习 · 计算机科学 2026-02-24 Shudi Weng , Chao Ren , Ming Xiao , Mikael Skoglund

We define and analyze a multi-agent multi-armed bandit problem in which decision-making agents can observe the choices and rewards of their neighbors. Neighbors are defined by a network graph with heterogeneous and stochastic…

最优化与控制 · 数学 2019-05-22 Udari Madhushani , Naomi Ehrich Leonard

The statistical heterogeneity of the non-independent and identically distributed (non-IID) data in local clients significantly limits the performance of federated learning. Previous attempts like FedProx, SCAFFOLD, MOON, FedNova and FedDyn…

机器学习 · 计算机科学 2022-12-15 Ziqing Fan , Yanfeng Wang , Jiangchao Yao , Lingjuan Lyu , Ya Zhang , Qi Tian

Federated Learning is an emerging learning paradigm that allows training models from samples distributed across a large network of clients while respecting privacy and communication restrictions. Despite its success, federated learning…

机器学习 · 计算机科学 2022-06-07 Isidoros Tziotis , Zebang Shen , Ramtin Pedarsani , Hamed Hassani , Aryan Mokhtari

We consider the best arm identification problem in the stochastic multi-armed bandit framework where each arm has a tiny probability of realizing large rewards while with overwhelming probability the reward is zero. A key application of…

机器学习 · 计算机科学 2023-03-15 Anirban Bhattacharjee , Sushant Vijayan , Sandeep K Juneja

Federated learning (FL) is a rapidly growing privacy-preserving collaborative machine learning paradigm. In practical FL applications, local data from each data silo reflect local usage patterns. Therefore, there exists heterogeneity of…

机器学习 · 计算机科学 2022-02-01 Shenglai Zeng , Zonghang Li , Hongfang Yu , Yihong He , Zenglin Xu , Dusit Niyato , Han Yu

We study the problem of learning a linear system model from the observations of $M$ clients. The catch: Each client is observing data from a different dynamical system. This work addresses the question of how multiple clients…

机器学习 · 计算机科学 2022-11-29 Han Wang , Leonardo F. Toso , James Anderson