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. 1802.06293
  4. Cited By
Black-Box Reductions for Parameter-free Online Learning in Banach Spaces
v1v2 (latest)

Black-Box Reductions for Parameter-free Online Learning in Banach Spaces

17 February 2018
Ashok Cutkosky
Francesco Orabona
ArXiv (abs)PDFHTML

Papers citing "Black-Box Reductions for Parameter-free Online Learning in Banach Spaces"

50 / 58 papers shown
Title
The Sample Complexity of Parameter-Free Stochastic Convex Optimization
The Sample Complexity of Parameter-Free Stochastic Convex Optimization
Jared Lawrence
Ari Kalinsky
Hannah Bradfield
Y. Carmon
Oliver Hinder
28
0
0
12 Jun 2025
A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections nor Strong Convexity
A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections nor Strong Convexity
Wei-Cheng Lee
Francesco Orabona
28
0
0
01 Jun 2025
STaR-Bets: Sequential Target-Recalculating Bets for Tighter Confidence Intervals
STaR-Bets: Sequential Target-Recalculating Bets for Tighter Confidence Intervals
Václav Voráček
Francesco Orabona
37
0
0
28 May 2025
Efficiently Solving Discounted MDPs with Predictions on Transition Matrices
Efficiently Solving Discounted MDPs with Predictions on Transition Matrices
Lixing Lyu
Jiashuo Jiang
Wang Chi Cheung
85
1
0
24 Feb 2025
Best of Both Worlds: Regret Minimization versus Minimax Play
Best of Both Worlds: Regret Minimization versus Minimax Play
Adrian Müller
Jon Schneider
Stratis Skoulakis
Luca Viano
Volkan Cevher
OffRL
30
0
0
17 Feb 2025
Online Detection of LLM-Generated Texts via Sequential Hypothesis Testing by Betting
Online Detection of LLM-Generated Texts via Sequential Hypothesis Testing by Betting
Can Chen
Jun-Kun Wang
DeLMO
167
0
0
29 Oct 2024
An Equivalence Between Static and Dynamic Regret Minimization
An Equivalence Between Static and Dynamic Regret Minimization
Andrew Jacobsen
Francesco Orabona
102
4
0
03 Jun 2024
Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement
  Learning
Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning
Aneesh Muppidi
Zhiyu Zhang
Heng Yang
78
6
0
26 May 2024
A simple uniformly optimal method without line search for convex
  optimization
A simple uniformly optimal method without line search for convex optimization
Tianjiao Li
Guanghui Lan
107
25
0
16 Oct 2023
On the near-optimality of betting confidence sets for bounded means
On the near-optimality of betting confidence sets for bounded means
S. Shekhar
Aaditya Ramdas
65
9
0
02 Oct 2023
Efficient Methods for Non-stationary Online Learning
Efficient Methods for Non-stationary Online Learning
Peng Zhao
Yan-Feng Xie
Lijun Zhang
Zhi Zhou
126
22
0
16 Sep 2023
Normalized Gradients for All
Normalized Gradients for All
Francesco Orabona
108
10
0
10 Aug 2023
Mechanic: A Learning Rate Tuner
Mechanic: A Learning Rate Tuner
Ashok Cutkosky
Aaron Defazio
Harsh Mehta
OffRL
127
18
0
31 May 2023
Parameter-free projected gradient descent
Parameter-free projected gradient descent
Evgenii Chzhen
Christophe Giraud
Gilles Stoltz
68
4
0
31 May 2023
Learning Rate Free Sampling in Constrained Domains
Learning Rate Free Sampling in Constrained Domains
Louis Sharrock
Lester W. Mackey
Christopher Nemeth
78
2
0
24 May 2023
Unconstrained Dynamic Regret via Sparse Coding
Unconstrained Dynamic Regret via Sparse Coding
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
139
9
0
31 Jan 2023
Sequential Kernelized Independence Testing
Sequential Kernelized Independence Testing
Aleksandr Podkopaev
Patrick Blobaum
S. Kasiviswanathan
Aaditya Ramdas
98
21
0
14 Dec 2022
Quasi-Newton Steps for Efficient Online Exp-Concave Optimization
Quasi-Newton Steps for Efficient Online Exp-Concave Optimization
Zakaria Mhammedi
Khashayar Gatmiry
57
7
0
02 Nov 2022
Parameter-free Regret in High Probability with Heavy Tails
Parameter-free Regret in High Probability with Heavy Tails
Jiujia Zhang
Ashok Cutkosky
75
20
0
25 Oct 2022
Adaptive Oracle-Efficient Online Learning
Adaptive Oracle-Efficient Online Learning
Guanghui Wang
Zihao Hu
Vidya Muthukumar
Jacob D. Abernethy
64
4
0
17 Oct 2022
On Accelerated Perceptrons and Beyond
On Accelerated Perceptrons and Beyond
Guanghui Wang
Rafael Hanashiro
E. Guha
Jacob D. Abernethy
76
7
0
17 Oct 2022
Optimal Dynamic Regret in LQR Control
Optimal Dynamic Regret in LQR Control
Dheeraj Baby
Yu Wang
67
17
0
18 Jun 2022
AdaTask: Adaptive Multitask Online Learning
Pierre Laforgue
Andrea Della Vecchia
Nicolò Cesa-Bianchi
Lorenzo Rosasco
59
2
0
31 May 2022
Exploiting the Curvature of Feasible Sets for Faster Projection-Free
  Online Learning
Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning
Zakaria Mhammedi
103
9
0
23 May 2022
Making SGD Parameter-Free
Making SGD Parameter-Free
Y. Carmon
Oliver Hinder
98
47
0
04 May 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Lijun Zhang
Wei Jiang
Jinfeng Yi
Tianbao Yang
92
7
0
02 May 2022
Implicit Parameter-free Online Learning with Truncated Linear Models
Implicit Parameter-free Online Learning with Truncated Linear Models
Keyi Chen
Ashok Cutkosky
Francesco Orabona
80
10
0
19 Mar 2022
Parameter-free Mirror Descent
Parameter-free Mirror Descent
Andrew Jacobsen
Ashok Cutkosky
117
34
0
26 Feb 2022
Stochastic linear optimization never overfits with quadratically-bounded
  losses on general data
Stochastic linear optimization never overfits with quadratically-bounded losses on general data
Matus Telgarsky
90
12
0
14 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 Zhou
84
17
0
12 Feb 2022
Scale-free Unconstrained Online Learning for Curved Losses
Scale-free Unconstrained Online Learning for Curved Losses
J. Mayo
Hédi Hadiji
T. Erven
82
13
0
11 Feb 2022
Robust Linear Regression for General Feature Distribution
Robust Linear Regression for General Feature Distribution
Tom Norman
Nir Weinberger
Kfir Y. Levy
OOD
88
2
0
04 Feb 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex
  Losses and Beyond
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
Dheeraj Baby
Yu Wang
95
28
0
21 Jan 2022
PDE-Based Optimal Strategy for Unconstrained Online Learning
PDE-Based Optimal Strategy for Unconstrained Online Learning
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
100
27
0
19 Jan 2022
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for
  Online Convex Optimization
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
Peng Zhao
Yu Zhang
Lijun Zhang
Zhi Zhou
122
50
0
29 Dec 2021
Nonparametric Two-Sample Testing by Betting
Nonparametric Two-Sample Testing by Betting
S. Shekhar
Aaditya Ramdas
108
30
0
16 Dec 2021
Tight Concentrations and Confidence Sequences from the Regret of
  Universal Portfolio
Tight Concentrations and Confidence Sequences from the Regret of Universal Portfolio
Francesco Orabona
Kwang-Sung Jun
118
42
0
27 Oct 2021
Off-policy Confidence Sequences
Off-policy Confidence Sequences
Nikos Karampatziakis
Paul Mineiro
Aaditya Ramdas
OffRL
89
16
0
18 Feb 2021
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning
T. Erven
Wouter M. Koolen
Dirk van der Hoeven
ODL
107
23
0
12 Feb 2021
Adversarial Tracking Control via Strongly Adaptive Online Learning with
  Memory
Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
94
15
0
02 Feb 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its
  Applications
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications
Liyu Chen
Haipeng Luo
Chen-Yu Wei
115
45
0
01 Feb 2021
Estimating means of bounded random variables by betting
Estimating means of bounded random variables by betting
Ian Waudby-Smith
Aaditya Ramdas
203
163
0
19 Oct 2020
Online Linear Optimization with Many Hints
Online Linear Optimization with Many Hints
Aditya Bhaskara
Ashok Cutkosky
Ravi Kumar
Manish Purohit
147
18
0
06 Oct 2020
The Advantage of Conditional Meta-Learning for Biased Regularization and
  Fine-Tuning
The Advantage of Conditional Meta-Learning for Biased Regularization and Fine-Tuning
Giulia Denevi
Massimiliano Pontil
C. Ciliberto
104
41
0
25 Aug 2020
Online Parameter-Free Learning of Multiple Low Variance Tasks
Online Parameter-Free Learning of Multiple Low Variance Tasks
Giulia Denevi
Dimitris Stamos
Massimiliano Pontil
96
0
0
11 Jul 2020
Better Parameter-free Stochastic Optimization with ODE Updates for
  Coin-Betting
Better Parameter-free Stochastic Optimization with ODE Updates for Coin-Betting
K. Chen
John Langford
Francesco Orabona
89
22
0
12 Jun 2020
Lipschitz and Comparator-Norm Adaptivity in Online Learning
Lipschitz and Comparator-Norm Adaptivity in Online Learning
Zakaria Mhammedi
Wouter M. Koolen
93
57
0
27 Feb 2020
Online Learning with Imperfect Hints
Online Learning with Imperfect Hints
Aditya Bhaskara
Ashok Cutkosky
Ravi Kumar
Manish Purohit
121
58
0
11 Feb 2020
Adaptive Online Learning with Varying Norms
Adaptive Online Learning with Varying Norms
Ashok Cutkosky
40
0
0
10 Feb 2020
Matrix-Free Preconditioning in Online Learning
Matrix-Free Preconditioning in Online Learning
Ashok Cutkosky
Tamás Sarlós
ODL
96
16
0
29 May 2019
12
Next