中文
相关论文

相关论文: Concentrated Differential Privacy for Bandits

200 篇论文

This work investigates the impact of ensuring local differential privacy in the thresholding bandit problem. We consider both the fixed budget and fixed confidence settings. We propose methods that utilize private responses, obtained…

机器学习 · 计算机科学 2025-08-26 Annalisa Barbara , Joseph Lazzaro , Ciara Pike-Burke

Best Arm Identification (BAI) problems are progressively used for data-sensitive applications, such as designing adaptive clinical trials, tuning hyper-parameters, and conducting user studies. Motivated by the data privacy concerns invoked…

机器学习 · 统计学 2026-04-09 Achraf Azize , Marc Jourdan , Aymen Al Marjani , Debabrota Basu

We consider stochastic sequential learning problems where the learner can observe the \textit{average reward of several actions}. Such a setting is interesting in many applications involving monitoring and surveillance, where the set of the…

机器学习 · 计算机科学 2015-06-22 Manjesh Kumar Hanawal , Venkatesh Saligrama , Michal Valko , R\' emi Munos

Multiplayer bandits have recently been extensively studied because of their application to cognitive radio networks. While the literature mostly considers synchronous players, radio networks (e.g. for IoT) tend to have asynchronous devices.…

机器学习 · 计算机科学 2023-06-01 Hugo Richard , Etienne Boursier , Vianney Perchet

Recently, several studies (Zhou et al., 2021a; Zhang et al., 2021b; Kim et al., 2021; Zhou and Gu, 2022) have provided variance-dependent regret bounds for linear contextual bandits, which interpolates the regret for the worst-case regime…

机器学习 · 计算机科学 2023-02-22 Heyang Zhao , Jiafan He , Dongruo Zhou , Tong Zhang , Quanquan Gu

As data-driven technologies advance swiftly, maintaining strong privacy measures becomes progressively difficult. Conventional $(\epsilon, \delta)$-differential privacy, while prevalent, exhibits limited adaptability for many applications.…

密码学与安全 · 计算机科学 2025-07-03 Yifeng Liu , Zehua Wang

In privacy-preserving machine learning, differentially private stochastic gradient descent (DP-SGD) performs worse than SGD due to per-sample gradient clipping and noise addition. A recent focus in private learning research is improving the…

计算机视觉与模式识别 · 计算机科学 2023-11-01 Xinyu Tang , Ashwinee Panda , Vikash Sehwag , Prateek Mittal

We consider three different variants of differential privacy (DP), namely approximate DP, R\'enyi DP (RDP), and hypothesis test DP. In the first part, we develop a machinery for optimally relating approximate DP to RDP based on the joint…

信息论 · 计算机科学 2021-01-26 Shahab Asoodeh , Jiachun Liao , Flavio P. Calmon , Oliver Kosut , Lalitha Sankar

Composition is one of the most important properties of differential privacy (DP), as it allows algorithm designers to build complex private algorithms from DP primitives. We consider precise composition bounds of the overall privacy loss…

密码学与安全 · 计算机科学 2020-06-26 Jinshuo Dong , David Durfee , Ryan Rogers

Best Arm Identification (BAI) problems are progressively used for data-sensitive applications, such as designing adaptive clinical trials, tuning hyper-parameters, and conducting user studies to name a few. Motivated by the data privacy…

机器学习 · 统计学 2023-09-06 Achraf Azize , Marc Jourdan , Aymen Al Marjani , Debabrota Basu

We study differentially private (DP) machine learning algorithms as instances of noisy fixed-point iterations, in order to derive privacy and utility results from this well-studied framework. We show that this new perspective recovers…

机器学习 · 计算机科学 2023-07-13 Edwige Cyffers , Aurélien Bellet , Debabrota Basu

Contextual bandit algorithms are commonly used in recommender systems, where content popularity can change rapidly. These algorithms continuously learn latent mappings between users and items, based on contexts associated with them both.…

分布式、并行与集群计算 · 计算机科学 2020-07-17 Kanak Mahadik , Qingyun Wu , Shuai Li , Amit Sabne

A contextual bandit problem is studied in a highly non-stationary environment, which is ubiquitous in various recommender systems due to the time-varying interests of users. Two models with disjoint and hybrid payoffs are considered to…

机器学习 · 计算机科学 2020-03-03 Xiao Xu , Fang Dong , Yanghua Li , Shaojian He , Xin Li

In this paper, we use differential privacy as a lens to examine online learning in both full and partial information settings. The differential privacy framework is, at heart, less about privacy and more about algorithmic stability, and…

机器学习 · 计算机科学 2019-10-30 Jacob Abernethy , Young Hun Jung , Chansoo Lee , Audra McMillan , Ambuj Tewari

Multi-armed bandit problems provide a framework to identify the optimal intervention over a sequence of repeated experiments. Without additional assumptions, minimax optimal performance (measured by cumulative regret) is well-understood.…

机器学习 · 统计学 2022-10-28 Blair Bilodeau , Linbo Wang , Daniel M. Roy

Differentially Private Stochastic Gradient Descent with Gradient Clipping (DPSGD-GC) is a powerful tool for training deep learning models using sensitive data, providing both a solid theoretical privacy guarantee and high efficiency.…

机器学习 · 计算机科学 2024-04-18 Xinwei Zhang , Zhiqi Bu , Zhiwei Steven Wu , Mingyi Hong

Many applications require a learner to make sequential decisions given uncertainty regarding both the system's payoff function and safety constraints. In safety-critical systems, it is paramount that the learner's actions do not violate the…

机器学习 · 计算机科学 2020-05-06 Sanae Amani , Mahnoosh Alizadeh , Christos Thrampoulidis

Deep learning techniques based on neural networks have shown significant success in a wide range of AI tasks. Large-scale training datasets are one of the critical factors for their success. However, when the training datasets are…

密码学与安全 · 计算机科学 2019-12-23 Lei Yu , Ling Liu , Calton Pu , Mehmet Emre Gursoy , Stacey Truex

Large language models (LLMs) frequently memorize sensitive or personal information, raising significant privacy concerns. Existing variants of differential privacy stochastic gradient descent (DPSGD) inject uniform noise into every gradient…

机器学习 · 计算机科学 2025-09-30 Manjiang Yu , Priyanka Singh , Xue Li , Yang Cao

We study a decentralized cooperative stochastic multi-armed bandit problem with $K$ arms on a network of $N$ agents. In our model, the reward distribution of each arm is the same for each agent and rewards are drawn independently across…

机器学习 · 计算机科学 2019-10-25 David Martínez-Rubio , Varun Kanade , Patrick Rebeschini