ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2006.00701
  4. Cited By
Locally Differentially Private (Contextual) Bandits Learning

Locally Differentially Private (Contextual) Bandits Learning

1 June 2020
Kai Zheng
Tianle Cai
Weiran Huang
Zhenguo Li
Liwei Wang
ArXivPDFHTML

Papers citing "Locally Differentially Private (Contextual) Bandits Learning"

22 / 22 papers shown
Title
Private Selection with Heterogeneous Sensitivities
Private Selection with Heterogeneous Sensitivities
Daniela Antonova
Allegra Laro
Audra McMillan
Lorenz Wolf
102
0
0
10 Jan 2025
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
108
1,922
0
07 Sep 2019
Differential Privacy for Multi-armed Bandits: What Is It and What Is Its
  Cost?
Differential Privacy for Multi-armed Bandits: What Is It and What Is Its Cost?
D. Basu
Christos Dimitrakakis
Aristide C. Y. Tossou
46
44
0
29 May 2019
An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private
  Stopping Rule
An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rule
Touqir Sajed
Or Sheffet
35
48
0
22 May 2019
Differentially Private Contextual Linear Bandits
Differentially Private Contextual Linear Bandits
R. Shariff
Or Sheffet
43
119
0
28 Sep 2018
Combinatorial Pure Exploration with Continuous and Separable Reward
  Functions and Its Applications (Extended Version)
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (Extended Version)
Weiran Huang
Jungseul Ok
Liang-Sheng Li
Wei Chen
89
61
0
04 May 2018
Empirical Risk Minimization in Non-interactive Local Differential
  Privacy: Efficiency and High Dimensional Case
Empirical Risk Minimization in Non-interactive Local Differential Privacy: Efficiency and High Dimensional Case
Di Wang
Marco Gaboardi
Jinhui Xu
64
61
0
12 Feb 2018
Collect at Once, Use Effectively: Making Non-interactive Locally Private
  Learning Possible
Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible
Kai Zheng
Wenlong Mou
Liwei Wang
75
41
0
11 Jun 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing
Scalable Generalized Linear Bandits: Online Computation and Hashing
Kwang-Sung Jun
Aniruddha Bhargava
Robert D. Nowak
Rebecca Willett
54
124
0
01 Jun 2017
The Price of Differential Privacy For Online Learning
The Price of Differential Privacy For Online Learning
Naman Agarwal
Karan Singh
FedML
120
96
0
27 Jan 2017
Achieving Privacy in the Adversarial Multi-Armed Bandit
Achieving Privacy in the Adversarial Multi-Armed Bandit
Aristide C. Y. Tossou
Christos Dimitrakakis
41
56
0
16 Jan 2017
Kernel-based methods for bandit convex optimization
Kernel-based methods for bandit convex optimization
Sébastien Bubeck
Ronen Eldan
Y. Lee
296
165
0
11 Jul 2016
Algorithms for Differentially Private Multi-Armed Bandits
Algorithms for Differentially Private Multi-Armed Bandits
Aristide C. Y. Tossou
Christos Dimitrakakis
FedML
51
111
0
27 Nov 2015
On the Complexity of Best Arm Identification in Multi-Armed Bandit
  Models
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
E. Kaufmann
Olivier Cappé
Aurélien Garivier
140
1,021
0
16 Jul 2014
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Bandits
Kevin Jamieson
Matthew Malloy
Robert D. Nowak
Sébastien Bubeck
82
411
0
27 Dec 2013
Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation
Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation
John C. Duchi
Michael I. Jordan
Martin J. Wainwright
62
147
0
26 May 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex
  Optimization
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization
Ohad Shamir
251
191
0
11 Sep 2012
Online Bandit Learning against an Adaptive Adversary: from Regret to
  Policy Regret
Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret
R. Arora
O. Dekel
Ambuj Tewari
OffRL
63
194
0
27 Jun 2012
Stochastic convex optimization with bandit feedback
Stochastic convex optimization with bandit feedback
Alekh Agarwal
Dean Phillips Foster
Daniel J. Hsu
Sham Kakade
Alexander Rakhlin
133
239
0
08 Jul 2011
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
Aurélien Garivier
Olivier Cappé
128
613
0
12 Feb 2011
A Contextual-Bandit Approach to Personalized News Article Recommendation
A Contextual-Bandit Approach to Personalized News Article Recommendation
Lihong Li
Wei Chu
John Langford
Robert Schapire
317
2,935
0
28 Feb 2010
What Can We Learn Privately?
What Can We Learn Privately?
S. Kasiviswanathan
Homin K. Lee
Kobbi Nissim
Sofya Raskhodnikova
Adam D. Smith
101
1,459
0
06 Mar 2008
1