Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1703.02629
Cited By
v1
v2 (latest)
Online Learning Without Prior Information
7 March 2017
Ashok Cutkosky
K. Boahen
ODL
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Online Learning Without Prior Information"
50 / 55 papers shown
Title
LightSAM: Parameter-Agnostic Sharpness-Aware Minimization
Yifei Cheng
Li Shen
Hao Sun
Nan Yin
Xiaochun Cao
Enhong Chen
AAML
44
0
0
30 May 2025
Never Start from Scratch: Expediting On-Device LLM Personalization via Explainable Model Selection
Haoming Wang
Boyuan Yang
Xiangyu Yin
Wei Gao
114
0
0
15 Apr 2025
Fully Unconstrained Online Learning
Ashok Cutkosky
Zakaria Mhammedi
CLL
74
2
0
30 May 2024
Universal Online Convex Optimization with
1
1
1
Projection per Round
Wenhao Yang
Yibo Wang
Peng Zhao
Lijun Zhang
76
4
0
30 May 2024
Which LLM to Play? Convergence-Aware Online Model Selection with Time-Increasing Bandits
Yu Xia
Fang-yuan Kong
Tong Yu
Liya Guo
Ryan Rossi
Sungchul Kim
Shuai Li
57
15
0
11 Mar 2024
Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model
Lin An
Andrew A. Li
Benjamin Moseley
Gabriel Visotsky
44
2
0
21 Feb 2024
The Price of Adaptivity in Stochastic Convex Optimization
Y. Carmon
Oliver Hinder
108
7
0
16 Feb 2024
Tuning-Free Stochastic Optimization
Ahmed Khaled
Chi Jin
64
9
0
12 Feb 2024
How Free is Parameter-Free Stochastic Optimization?
Amit Attia
Tomer Koren
ODL
103
8
0
05 Feb 2024
Parameter-Agnostic Optimization under Relaxed Smoothness
Florian Hübler
Junchi Yang
Xiang Li
Niao He
106
20
0
06 Nov 2023
An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits
Kiarash Banihashem
Mohammadtaghi Hajiaghayi
Suho Shin
Max Springer
117
1
0
29 Oct 2023
A simple uniformly optimal method without line search for convex optimization
Tianjiao Li
Guanghui Lan
107
25
0
16 Oct 2023
Normalized Gradients for All
Francesco Orabona
110
10
0
10 Aug 2023
Mechanic: A Learning Rate Tuner
Ashok Cutkosky
Aaron Defazio
Harsh Mehta
OffRL
134
18
0
31 May 2023
Parameter-free projected gradient descent
Evgenii Chzhen
Christophe Giraud
Gilles Stoltz
68
4
0
31 May 2023
Adaptive Stochastic Optimisation of Nonconvex Composite Objectives
Weijia Shao
F. Sivrikaya
S. Albayrak
76
0
0
21 Nov 2022
Parameter-free Regret in High Probability with Heavy Tails
Jiujia Zhang
Ashok Cutkosky
82
20
0
25 Oct 2022
Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives
Weijia Shao
S. Albayrak
50
1
0
09 Aug 2022
Optimistic Optimisation of Composite Objective with Exponentiated Update
Weijia Shao
F. Sivrikaya
S. Albayrak
111
3
0
08 Aug 2022
Making SGD Parameter-Free
Y. Carmon
Oliver Hinder
98
47
0
04 May 2022
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
Andrew Jacobsen
Ashok Cutkosky
119
34
0
26 Feb 2022
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
J. Mayo
Hédi Hadiji
T. Erven
86
13
0
11 Feb 2022
Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting
J. Jon Ryu
Alankrita Bhatt
Young-Han Kim
59
1
0
04 Feb 2022
PDE-Based Optimal Strategy for Unconstrained Online Learning
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
100
27
0
19 Jan 2022
Tight Concentrations and Confidence Sequences from the Regret of Universal Portfolio
Francesco Orabona
Kwang-Sung Jun
118
42
0
27 Oct 2021
Model Selection for Generic Contextual Bandits
Avishek Ghosh
Abishek Sankararaman
Kannan Ramchandran
79
6
0
07 Jul 2021
On the Initialization for Convex-Concave Min-max Problems
Mingrui Liu
Francesco Orabona
ODL
43
4
0
27 Feb 2021
Distributed Online Learning for Joint Regret with Communication Constraints
Dirk van der Hoeven
Hédi Hadiji
T. Erven
71
5
0
15 Feb 2021
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning
T. Erven
Wouter M. Koolen
Dirk van der Hoeven
ODL
109
23
0
12 Feb 2021
Pareto Optimal Model Selection in Linear Bandits
Yinglun Zhu
Robert D. Nowak
43
14
0
12 Feb 2021
Parameter-free Stochastic Optimization of Variationally Coherent Functions
Francesco Orabona
Dávid Pál
88
19
0
30 Jan 2021
Online Linear Optimization with Many Hints
Aditya Bhaskara
Ashok Cutkosky
Ravi Kumar
Manish Purohit
150
18
0
06 Oct 2020
Comparator-adaptive Convex Bandits
Dirk van der Hoeven
Ashok Cutkosky
Haipeng Luo
54
7
0
16 Jul 2020
Better Parameter-free Stochastic Optimization with ODE Updates for Coin-Betting
K. Chen
John Langford
Francesco Orabona
91
22
0
12 Jun 2020
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits
Avishek Ghosh
Abishek Sankararaman
Kannan Ramchandran
80
34
0
04 Jun 2020
Lipschitz and Comparator-Norm Adaptivity in Online Learning
Zakaria Mhammedi
Wouter M. Koolen
93
57
0
27 Feb 2020
Adaptive Online Learning with Varying Norms
Ashok Cutkosky
45
0
0
10 Feb 2020
Model selection for contextual bandits
Dylan J. Foster
A. Krishnamurthy
Haipeng Luo
OffRL
216
90
0
03 Jun 2019
Adaptive Online Learning for Gradient-Based Optimizers
Saeed Masoudian
A. Arabzadeh
M. J. Siavoshani
Milad Jalal
Alireza Amouzad
ODL
38
0
0
01 Jun 2019
Matrix-Free Preconditioning in Online Learning
Ashok Cutkosky
Tamás Sarlós
ODL
98
16
0
29 May 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning
Zakaria Mhammedi
Wouter M. Koolen
T. Erven
99
36
0
27 Feb 2019
Artificial Constraints and Lipschitz Hints for Unconstrained Online Learning
Ashok Cutkosky
37
3
0
24 Feb 2019
Adaptive scale-invariant online algorithms for learning linear models
Michal Kempka
W. Kotłowski
Manfred K. Warmuth
96
31
0
20 Feb 2019
Parameter-Free Online Convex Optimization with Sub-Exponential Noise
Kwang-Sung Jun
Francesco Orabona
108
43
0
05 Feb 2019
Minimizing Regret of Bandit Online Optimization in Unconstrained Action Spaces
T. Tatarenko
Maryam Kamgarpour
64
2
0
13 Jun 2018
AdaGrad stepsizes: Sharp convergence over nonconvex landscapes
Rachel A. Ward
Xiaoxia Wu
Léon Bottou
ODL
121
369
0
05 Jun 2018
Online Learning: Sufficient Statistics and the Burkholder Method
Dylan J. Foster
Alexander Rakhlin
Karthik Sridharan
63
27
0
20 Mar 2018
Black-Box Reductions for Parameter-free Online Learning in Banach Spaces
Ashok Cutkosky
Francesco Orabona
109
148
0
17 Feb 2018
1
2
Next