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. 1801.00101
  4. Cited By
Parameter-free online learning via model selection

Parameter-free online learning via model selection

30 December 2017
Dylan J. Foster
Satyen Kale
M. Mohri
Karthik Sridharan
ArXivPDFHTML

Papers citing "Parameter-free online learning via model selection"

11 / 11 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
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
39
4
0
26 May 2024
Budgeted Online Model Selection and Fine-Tuning via Federated Learning
Budgeted Online Model Selection and Fine-Tuning via Federated Learning
P. M. Ghari
Yanning Shen
FedML
50
1
0
19 Jan 2024
Anytime Model Selection in Linear Bandits
Anytime Model Selection in Linear Bandits
Parnian Kassraie
N. Emmenegger
Andreas Krause
Aldo Pacchiano
49
2
0
24 Jul 2023
Improved Regret Bounds for Online Kernel Selection under Bandit Feedback
Improved Regret Bounds for Online Kernel Selection under Bandit Feedback
Junfan Li
Shizhong Liao
21
1
0
09 Mar 2023
Unconstrained Dynamic Regret via Sparse Coding
Unconstrained Dynamic Regret via Sparse Coding
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
34
7
0
31 Jan 2023
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
20
8
0
23 May 2022
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and
  Known Transition
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition
Liyu Chen
Haipeng Luo
Chen-Yu Wei
23
32
0
07 Dec 2020
Online Learning with Imperfect Hints
Online Learning with Imperfect Hints
Aditya Bhaskara
Ashok Cutkosky
Ravi Kumar
Manish Purohit
30
58
0
11 Feb 2020
Model selection for contextual bandits
Model selection for contextual bandits
Dylan J. Foster
A. Krishnamurthy
Haipeng Luo
OffRL
29
89
0
03 Jun 2019
Best of many worlds: Robust model selection for online supervised
  learning
Best of many worlds: Robust model selection for online supervised learning
Vidya Muthukumar
Mitas Ray
A. Sahai
Peter L. Bartlett
OffRL
40
8
0
22 May 2018
1