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. 1508.05170
  4. Cited By
Adaptive Online Learning

Adaptive Online Learning

21 August 2015
Dylan J. Foster
Alexander Rakhlin
Karthik Sridharan
ArXivPDFHTML

Papers citing "Adaptive Online Learning"

15 / 15 papers shown
Title
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
23
0
0
01 Jul 2024
Unconstrained Online Learning with Unbounded Losses
Unconstrained Online Learning with Unbounded Losses
Andrew Jacobsen
Ashok Cutkosky
32
16
0
08 Jun 2023
Online Prediction in Sub-linear Space
Online Prediction in Sub-linear Space
Binghui Peng
Fred Zhang
23
16
0
16 Jul 2022
Online PAC-Bayes Learning
Online PAC-Bayes Learning
Maxime Haddouche
Benjamin Guedj
24
21
0
31 May 2022
Parameter-free Mirror Descent
Parameter-free Mirror Descent
Andrew Jacobsen
Ashok Cutkosky
20
32
0
26 Feb 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret
  for Linear Bandits
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits
Haipeng Luo
Mengxiao Zhang
Peng Zhao
Zhi-Hua Zhou
34
17
0
12 Feb 2022
Parameter-free Online Linear Optimization with Side Information via
  Universal Coin Betting
Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting
Jeonghun Ryu
Alankrita Bhatt
Young-Han Kim
26
1
0
04 Feb 2022
Efficient First-Order Contextual Bandits: Prediction, Allocation, and
  Triangular Discrimination
Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination
Dylan J. Foster
A. Krishnamurthy
48
43
0
05 Jul 2021
Adaptive Gradient Methods for Constrained Convex Optimization and
  Variational Inequalities
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities
Alina Ene
Huy Le Nguyen
Adrian Vladu
ODL
30
28
0
17 Jul 2020
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning
Zakaria Mhammedi
Wouter M. Koolen
T. Erven
23
33
0
27 Feb 2019
Parameter-free online learning via model selection
Parameter-free online learning via model selection
Dylan J. Foster
Satyen Kale
M. Mohri
Karthik Sridharan
32
58
0
30 Dec 2017
Following the Leader and Fast Rates in Linear Prediction: Curved
  Constraint Sets and Other Regularities
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities
Ruitong Huang
Tor Lattimore
András Gyorgy
Csaba Szepesvári
18
31
0
10 Feb 2017
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
Alexander Rakhlin
Karthik Sridharan
OffRL
14
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
12
47
0
13 Oct 2015
Learning without Concentration
Learning without Concentration
S. Mendelson
92
333
0
01 Jan 2014
1