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. 1711.03639
  4. Cited By
Small-loss bounds for online learning with partial information

Small-loss bounds for online learning with partial information

9 November 2017
Thodoris Lykouris
Karthik Sridharan
Éva Tardos
ArXivPDFHTML

Papers citing "Small-loss bounds for online learning with partial information"

23 / 23 papers shown
Title
The Central Role of the Loss Function in Reinforcement Learning
The Central Role of the Loss Function in Reinforcement Learning
Kaiwen Wang
Nathan Kallus
Wen Sun
OffRL
180
10
0
19 Sep 2024
Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis
Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis
Junfan Li
Shizhong Liao
46
0
0
01 Jul 2024
Stability and Learning in Strategic Queuing Systems
Stability and Learning in Strategic Queuing Systems
J. Gaitonde
Éva Tardos
16
22
0
16 Mar 2020
Make the Minority Great Again: First-Order Regret Bound for Contextual
  Bandits
Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits
Zeyuan Allen-Zhu
Sébastien Bubeck
Yuanzhi Li
LRM
101
30
0
09 Feb 2018
Thompson Sampling For Stochastic Bandits with Graph Feedback
Thompson Sampling For Stochastic Bandits with Graph Feedback
Aristide C. Y. Tossou
Christos Dimitrakakis
Devdatt Dubhashi
28
28
0
16 Jan 2017
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Vasilis Syrgkanis
Haipeng Luo
A. Krishnamurthy
Robert Schapire
102
42
0
01 Jun 2016
Online Learning with Feedback Graphs Without the Graphs
Online Learning with Feedback Graphs Without the Graphs
Alon Cohen
Tamir Hazan
Tomer Koren
55
59
0
23 May 2016
Efficient Algorithms for Adversarial Contextual Learning
Efficient Algorithms for Adversarial Contextual Learning
Vasilis Syrgkanis
A. Krishnamurthy
Robert Schapire
92
79
0
08 Feb 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
Alexander Rakhlin
Karthik Sridharan
OffRL
192
72
0
06 Feb 2016
On Equivalence of Martingale Tail Bounds and Deterministic Regret
  Inequalities
On Equivalence of Martingale Tail Bounds and Deterministic Regret Inequalities
Alexander Rakhlin
Karthik Sridharan
43
48
0
13 Oct 2015
Explore no more: Improved high-probability regret bounds for
  non-stochastic bandits
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
Gergely Neu
207
182
0
10 Jun 2015
Importance weighting without importance weights: An efficient algorithm
  for combinatorial semi-bandits
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits
Gergely Neu
Gábor Bartók
42
36
0
17 Mar 2015
Online Learning with Feedback Graphs: Beyond Bandits
Online Learning with Feedback Graphs: Beyond Bandits
N. Alon
Nicolò Cesa-Bianchi
O. Dekel
Tomer Koren
64
158
0
26 Feb 2015
Strongly Adaptive Online Learning
Strongly Adaptive Online Learning
Amit Daniely
Alon Gonen
Shai Shalev-Shwartz
ODL
120
177
0
25 Feb 2015
First-order regret bounds for combinatorial semi-bandits
First-order regret bounds for combinatorial semi-bandits
Gergely Neu
115
58
0
23 Feb 2015
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
N. Alon
Nicolò Cesa-Bianchi
Claudio Gentile
Shie Mannor
Yishay Mansour
Ohad Shamir
OffRL
161
130
0
30 Sep 2014
Online Nonparametric Regression
Online Nonparametric Regression
Alexander Rakhlin
Karthik Sridharan
131
100
0
11 Feb 2014
From Bandits to Experts: A Tale of Domination and Independence
From Bandits to Experts: A Tale of Domination and Independence
N. Alon
Nicolò Cesa-Bianchi
Claudio Gentile
Yishay Mansour
112
79
0
17 Jul 2013
An efficient algorithm for learning with semi-bandit feedback
An efficient algorithm for learning with semi-bandit feedback
Gergely Neu
Gábor Bartók
68
80
0
13 May 2013
Online Learning with Predictable Sequences
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
131
355
0
18 Aug 2012
From Bandits to Experts: On the Value of Side-Observations
From Bandits to Experts: On the Value of Side-Observations
Shie Mannor
Ohad Shamir
OffRL
143
220
0
13 Jun 2011
Online Learning via Sequential Complexities
Online Learning via Sequential Complexities
Alexander Rakhlin
Karthik Sridharan
Ambuj Tewari
91
101
0
06 Jun 2010
Contextual Bandit Algorithms with Supervised Learning Guarantees
Contextual Bandit Algorithms with Supervised Learning Guarantees
A. Beygelzimer
John Langford
Lihong Li
L. Reyzin
Robert Schapire
OffRL
154
324
0
22 Feb 2010
1