ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1607.03084
  4. Cited By
Kernel-based methods for bandit convex optimization

Kernel-based methods for bandit convex optimization

Symposium on the Theory of Computing (STOC), 2016
11 July 2016
Sébastien Bubeck
Ronen Eldan
Y. Lee
ArXiv (abs)PDFHTML

Papers citing "Kernel-based methods for bandit convex optimization"

39 / 89 papers shown
Title
Quantum Algorithm for Online Convex Optimization
Quantum Algorithm for Online Convex OptimizationQuantum Science and Technology (QST), 2020
Jianhao He
Feidiao Yang
Jialin Zhang
Lvzhou Li
415
7
0
29 Jul 2020
Comparator-adaptive Convex Bandits
Comparator-adaptive Convex BanditsNeural Information Processing Systems (NeurIPS), 2020
Dirk van der Hoeven
Ashok Cutkosky
Haipeng Luo
137
8
0
16 Jul 2020
Fair Algorithms for Multi-Agent Multi-Armed Bandits
Fair Algorithms for Multi-Agent Multi-Armed BanditsNeural Information Processing Systems (NeurIPS), 2020
Safwan Hossain
Evi Micha
Nisarg Shah
FaML
175
59
0
13 Jul 2020
Corralling Stochastic Bandit Algorithms
Corralling Stochastic Bandit Algorithms
R. Arora
T. V. Marinov
M. Mohri
225
35
0
16 Jun 2020
Bias no more: high-probability data-dependent regret bounds for
  adversarial bandits and MDPs
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPsNeural Information Processing Systems (NeurIPS), 2020
Chung-Wei Lee
Haipeng Luo
Chen-Yu Wei
Mengxiao Zhang
314
58
0
14 Jun 2020
Exploiting Higher Order Smoothness in Derivative-free Optimization and
  Continuous Bandits
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous BanditsNeural Information Processing Systems (NeurIPS), 2020
A. Akhavan
Massimiliano Pontil
Alexandre B. Tsybakov
250
46
0
14 Jun 2020
Locally Differentially Private (Contextual) Bandits Learning
Locally Differentially Private (Contextual) Bandits LearningNeural Information Processing Systems (NeurIPS), 2020
Kai Zheng
Tianle Cai
Weiran Huang
Zhenguo Li
Liwei Wang
316
68
0
01 Jun 2020
Improved Regret for Zeroth-Order Adversarial Bandit Convex Optimisation
Improved Regret for Zeroth-Order Adversarial Bandit Convex Optimisation
Tor Lattimore
383
45
0
31 May 2020
Efficient and Robust Algorithms for Adversarial Linear Contextual
  Bandits
Efficient and Robust Algorithms for Adversarial Linear Contextual BanditsAnnual Conference Computational Learning Theory (COLT), 2020
Gergely Neu
Julia Olkhovskaya
335
52
0
01 Feb 2020
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved
  Complexities
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved ComplexitiesJournal of Global Optimization (JGO), 2020
Zhongruo Wang
Krishnakumar Balasubramanian
Shiqian Ma
Meisam Razaviyayn
282
31
0
22 Jan 2020
Distributed Online Optimization with Long-Term Constraints
Distributed Online Optimization with Long-Term ConstraintsIEEE Transactions on Automatic Control (IEEE TAC), 2019
Deming Yuan
Alexandre Proutiere
Guodong Shi
137
69
0
20 Dec 2019
Learning Strategy-Aware Linear Classifiers
Learning Strategy-Aware Linear Classifiers
Yiling Chen
Yang Liu
Chara Podimata
357
9
0
10 Nov 2019
Online Continuous Submodular Maximization: From Full-Information to
  Bandit Feedback
Online Continuous Submodular Maximization: From Full-Information to Bandit FeedbackNeural Information Processing Systems (NeurIPS), 2019
Mingrui Zhang
Lin Chen
Hamed Hassani
Amin Karbasi
100
60
0
28 Oct 2019
Minimax Regret of Switching-Constrained Online Convex Optimization: No
  Phase Transition
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase TransitionNeural Information Processing Systems (NeurIPS), 2019
Lin Chen
Qian-long Yu
Hannah Lawrence
Amin Karbasi
265
22
0
24 Oct 2019
Derivative-Free & Order-Robust Optimisation
Derivative-Free & Order-Robust OptimisationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2019
Victor Gabillon
Rasul Tutunov
Michal Valko
Haitham Bou-Ammar
194
6
0
09 Oct 2019
Improved Regret Bounds for Projection-free Bandit Convex Optimization
Improved Regret Bounds for Projection-free Bandit Convex OptimizationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2019
Dan Garber
Ben Kretzu
129
28
0
08 Oct 2019
No-Regret Learning in Unknown Games with Correlated Payoffs
No-Regret Learning in Unknown Games with Correlated PayoffsNeural Information Processing Systems (NeurIPS), 2019
Pier Giuseppe Sessa
Ilija Bogunovic
Maryam Kamgarpour
Andreas Krause
OffRL
253
43
0
18 Sep 2019
Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex
  Optimization
Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex Optimization
Abhishek Roy
Krishnakumar Balasubramanian
Saeed Ghadimi
P. Mohapatra
OffRL
192
16
0
31 Jul 2019
Bandit Convex Optimization in Non-stationary Environments
Bandit Convex Optimization in Non-stationary EnvironmentsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2019
Peng Zhao
G. Wang
Lijun Zhang
Zhi Zhou
166
53
0
29 Jul 2019
Competing Against Equilibria in Zero-Sum Games with Evolving Payoffs
Competing Against Equilibria in Zero-Sum Games with Evolving Payoffs
Adrian Rivera Cardoso
Jacob D. Abernethy
He Wang
Huan Xu
150
8
0
17 Jul 2019
Introduction to Multi-Armed Bandits
Introduction to Multi-Armed Bandits
Aleksandrs Slivkins
1.1K
1,153
0
15 Apr 2019
Distributed Online Linear Regression
Distributed Online Linear RegressionIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2019
Deming Yuan
Alexandre Proutiere
Guodong Shi
117
35
0
13 Feb 2019
Adversarial Bandits with Knapsacks
Adversarial Bandits with Knapsacks
Nicole Immorlica
Karthik Abinav Sankararaman
Robert Schapire
Aleksandrs Slivkins
398
126
0
28 Nov 2018
Online Newton Step Algorithm with Estimated Gradient
Online Newton Step Algorithm with Estimated Gradient
Binbin Liu
Jundong Li
Yunquan Song
Xijun Liang
Ling Jian
Huan Liu
134
4
0
25 Nov 2018
Risk-Averse Stochastic Convex Bandit
Risk-Averse Stochastic Convex Bandit
Adrian Rivera Cardoso
Huan Xu
ODL
189
34
0
01 Oct 2018
The Online Saddle Point Problem and Online Convex Optimization with
  Knapsacks
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks
Adrian Rivera Cardoso
He Wang
Huan Xu
196
15
0
21 Jun 2018
Projection-Free Bandit Convex Optimization
Projection-Free Bandit Convex Optimization
Lin Chen
Mingrui Zhang
Amin Karbasi
172
34
0
18 May 2018
Optimization of Smooth Functions with Noisy Observations: Local Minimax
  Rates
Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates
Yining Wang
Sivaraman Balakrishnan
Aarti Singh
108
28
0
22 Mar 2018
Online learning with kernel losses
Online learning with kernel lossesInternational Conference on Machine Learning (ICML), 2018
Aldo Pacchiano
Niladri S. Chatterji
Peter L. Bartlett
117
17
0
27 Feb 2018
Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing
Low-Rank Bandit Methods for High-Dimensional Dynamic Pricing
Jonas W. Mueller
Vasilis Syrgkanis
Matt Taddy
168
35
0
30 Jan 2018
More Adaptive Algorithms for Adversarial Bandits
More Adaptive Algorithms for Adversarial Bandits
Chen-Yu Wei
Haipeng Luo
459
193
0
10 Jan 2018
Stochastic Zeroth-order Optimization in High Dimensions
Stochastic Zeroth-order Optimization in High DimensionsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2017
Yining Wang
S. Du
Sivaraman Balakrishnan
Aarti Singh
244
118
0
29 Oct 2017
Strategic Classification from Revealed Preferences
Strategic Classification from Revealed Preferences
Jinshuo Dong
Aaron Roth
Zachary Schutzman
Bo Waggoner
Zhiwei Steven Wu
181
193
0
22 Oct 2017
Non-stationary Stochastic Optimization under $L_{p,q}$-Variation
  Measures
Non-stationary Stochastic Optimization under Lp,qL_{p,q}Lp,q​-Variation Measures
Xi Chen
Yining Wang
Yu Wang
263
11
0
09 Aug 2017
Asynchronous Parallel Empirical Variance Guided Algorithms for the
  Thresholding Bandit Problem
Asynchronous Parallel Empirical Variance Guided Algorithms for the Thresholding Bandit Problem
Jie Zhong
Yijun Huang
Ji Liu
142
13
0
15 Apr 2017
Algorithmic Chaining and the Role of Partial Feedback in Online
  Nonparametric Learning
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning
Nicolò Cesa-Bianchi
Pierre Gaillard
Claudio Gentile
Sébastien Gerchinovitz
126
0
0
27 Feb 2017
Bandits with Movement Costs and Adaptive Pricing
Bandits with Movement Costs and Adaptive PricingAnnual Conference Computational Learning Theory (COLT), 2017
Tomer Koren
Roi Livni
Yishay Mansour
128
20
0
24 Feb 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
Fast Rates for Bandit Optimization with Upper-Confidence Frank-WolfeNeural Information Processing Systems (NeurIPS), 2017
Quentin Berthet
Vianney Perchet
226
31
0
22 Feb 2017
Corralling a Band of Bandit Algorithms
Corralling a Band of Bandit AlgorithmsAnnual Conference Computational Learning Theory (COLT), 2016
Alekh Agarwal
Haipeng Luo
Behnam Neyshabur
Robert Schapire
301
165
0
19 Dec 2016
Previous
12