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. 1107.1744
  4. Cited By
Stochastic convex optimization with bandit feedback

Stochastic convex optimization with bandit feedback

8 July 2011
Alekh Agarwal
Dean Phillips Foster
Daniel J. Hsu
Sham Kakade
Alexander Rakhlin
ArXivPDFHTML

Papers citing "Stochastic convex optimization with bandit feedback"

33 / 33 papers shown
Title
A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
Jingxin Zhan
Yuchen Xin
Kaicheng Jin
Zhihua Zhang
44
0
0
19 Jan 2025
Online Newton Method for Bandit Convex Optimisation
Online Newton Method for Bandit Convex Optimisation
Hidde Fokkema
Dirk van der Hoeven
Tor Lattimore
Jack J. Mayo
46
5
0
10 Jun 2024
Fast Submodular Function Maximization
Fast Submodular Function Maximization
Lianke Qin
Zhao Song
Yitan Wang
40
10
0
15 May 2023
Bandit Convex Optimisation Revisited: FTRL Achieves O~(t1/2)\tilde{O}(t^{1/2})O~(t1/2) Regret
David Young
D. Leith
Georgios Iosifidis
26
0
0
01 Feb 2023
Gradient-Free Methods for Deterministic and Stochastic Nonsmooth
  Nonconvex Optimization
Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization
Tianyi Lin
Zeyu Zheng
Michael I. Jordan
62
52
0
12 Sep 2022
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex
  Optimization
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization
François Bachoc
Tommaso Cesari
Roberto Colomboni
Andrea Paudice
32
2
0
13 Aug 2022
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
Asaf B. Cassel
Alon Cohen
Google Research
34
9
0
03 Jun 2022
A gradient estimator via L1-randomization for online zero-order
  optimization with two point feedback
A gradient estimator via L1-randomization for online zero-order optimization with two point feedback
A. Akhavan
Evgenii Chzhen
Massimiliano Pontil
Alexandre B. Tsybakov
38
19
0
27 May 2022
Efficient Online Linear Control with Stochastic Convex Costs and Unknown
  Dynamics
Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics
Asaf B. Cassel
Alon Cohen
Google Research
28
5
0
02 Mar 2022
Optimal Order Simple Regret for Gaussian Process Bandits
Optimal Order Simple Regret for Gaussian Process Bandits
Sattar Vakili
N. Bouziani
Sepehr Jalali
A. Bernacchia
Da-shan Shiu
39
51
0
20 Aug 2021
Who Leads and Who Follows in Strategic Classification?
Who Leads and Who Follows in Strategic Classification?
Tijana Zrnic
Eric Mazumdar
S. Shankar Sastry
Michael I. Jordan
31
51
0
23 Jun 2021
Algorithmic Challenges in Ensuring Fairness at the Time of Decision
Algorithmic Challenges in Ensuring Fairness at the Time of Decision
Jad Salem
Swati Gupta
Vijay Kamble
FaML
26
4
0
16 Mar 2021
Learner-Private Convex Optimization
Learner-Private Convex Optimization
Jiaming Xu
Kuang Xu
Dana Yang
FedML
19
2
0
23 Feb 2021
Learning-NUM: Network Utility Maximization with Unknown Utility
  Functions and Queueing Delay
Learning-NUM: Network Utility Maximization with Unknown Utility Functions and Queueing Delay
Xinzhe Fu
E. Modiano
23
18
0
16 Dec 2020
Adaptive Discretization for Adversarial Lipschitz Bandits
Adaptive Discretization for Adversarial Lipschitz Bandits
Chara Podimata
Aleksandrs Slivkins
20
16
0
22 Jun 2020
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic
  Optimality
Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality
Kwang-Sung Jun
Chicheng Zhang
31
10
0
15 Jun 2020
Reserve Price Optimization for First Price Auctions
Reserve Price Optimization for First Price Auctions
Zhe Feng
Sébastien Lahaie
Jon Schneider
Jinchao Ye
19
14
0
11 Jun 2020
A Dimension-free Algorithm for Contextual Continuum-armed Bandits
A Dimension-free Algorithm for Contextual Continuum-armed Bandits
Wenhao Li
Ningyuan Chen
L. Jeff Hong
20
2
0
15 Jul 2019
Exploration by Optimisation in Partial Monitoring
Exploration by Optimisation in Partial Monitoring
Tor Lattimore
Csaba Szepesvári
33
38
0
12 Jul 2019
Learning in structured MDPs with convex cost functions: Improved regret
  bounds for inventory management
Learning in structured MDPs with convex cost functions: Improved regret bounds for inventory management
Shipra Agrawal
Randy Jia
24
59
0
10 May 2019
Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach
  to Stochastic Convex Optimization
Stochastic Gradient Descent on a Tree: an Adaptive and Robust Approach to Stochastic Convex Optimization
Sattar Vakili
Sudeep Salgia
Qing Zhao
25
7
0
17 Jan 2019
Risk-Averse Stochastic Convex Bandit
Risk-Averse Stochastic Convex Bandit
Adrian Rivera Cardoso
Huan Xu
ODL
17
33
0
01 Oct 2018
An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated
  Multinomial Logit Models
An Optimal Policy for Dynamic Assortment Planning Under Uncapacitated Multinomial Logit Models
Xi Chen
Yining Wang
Yuanshuo Zhou
22
4
0
12 May 2018
Minimal Exploration in Structured Stochastic Bandits
Minimal Exploration in Structured Stochastic Bandits
Richard Combes
Stefan Magureanu
Alexandre Proutiere
44
115
0
01 Nov 2017
Stochastic Zeroth-order Optimization in High Dimensions
Stochastic Zeroth-order Optimization in High Dimensions
Yining Wang
S. Du
Sivaraman Balakrishnan
Aarti Singh
29
105
0
29 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
24
12
0
09 Aug 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
Quentin Berthet
Vianney Perchet
40
31
0
22 Feb 2017
Highly-Smooth Zero-th Order Online Optimization Vianney Perchet
Highly-Smooth Zero-th Order Online Optimization Vianney Perchet
Francis R. Bach
Vianney Perchet
22
83
0
26 May 2016
Escaping the Local Minima via Simulated Annealing: Optimization of
  Approximately Convex Functions
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions
A. Belloni
Tengyuan Liang
Hariharan Narayanan
Alexander Rakhlin
40
77
0
28 Jan 2015
Unimodal Bandits without Smoothness
Unimodal Bandits without Smoothness
Richard Combes
Alexandre Proutiere
41
18
0
28 Jun 2014
On Zeroth-Order Stochastic Convex Optimization via Random Walks
On Zeroth-Order Stochastic Convex Optimization via Random Walks
Tengyuan Liang
Hariharan Narayanan
Alexander Rakhlin
39
24
0
11 Feb 2014
Query Complexity of Derivative-Free Optimization
Query Complexity of Derivative-Free Optimization
Kevin G. Jamieson
Robert D. Nowak
Benjamin Recht
34
159
0
11 Sep 2012
On the Complexity of Bandit and Derivative-Free Stochastic Convex
  Optimization
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization
Ohad Shamir
49
190
0
11 Sep 2012
1