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. 1902.09917
  4. Cited By
Efficient online learning with kernels for adversarial large scale
  problems

Efficient online learning with kernels for adversarial large scale problems

26 February 2019
Rémi Jézéquel
Pierre Gaillard
Alessandro Rudi
ArXivPDFHTML

Papers citing "Efficient online learning with kernels for adversarial large scale problems"

4 / 4 papers shown
Title
Nearly Optimal Algorithms with Sublinear Computational Complexity for
  Online Kernel Regression
Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression
Junfan Li
Shizhong Liao
24
0
0
14 Jun 2023
Provably Efficient Kernelized Q-Learning
Provably Efficient Kernelized Q-Learning
Shuang Liu
H. Su
MLT
25
4
0
21 Apr 2022
Efficient Kernel UCB for Contextual Bandits
Efficient Kernel UCB for Contextual Bandits
Houssam Zenati
A. Bietti
Eustache Diemert
Julien Mairal
Matthieu Martin
Pierre Gaillard
18
3
0
11 Feb 2022
Efficient improper learning for online logistic regression
Efficient improper learning for online logistic regression
Rémi Jézéquel
Pierre Gaillard
Alessandro Rudi
25
23
0
18 Mar 2020
1