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. 2205.13056
  4. Cited By
Efficient and Near-Optimal Smoothed Online Learning for Generalized
  Linear Functions

Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions

25 May 2022
Adam Block
Max Simchowitz
ArXivPDFHTML

Papers citing "Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions"

7 / 7 papers shown
Title
Majorizing Measures, Sequential Complexities, and Online Learning
Majorizing Measures, Sequential Complexities, and Online Learning
Adam Block
Y. Dagan
Alexander Rakhlin
40
13
0
02 Feb 2021
Smoothed Analysis of Online and Differentially Private Learning
Smoothed Analysis of Online and Differentially Private Learning
Nika Haghtalab
Tim Roughgarden
Abhishek Shetty
70
50
0
17 Jun 2020
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression
  Oracles
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles
Dylan J. Foster
Alexander Rakhlin
365
207
0
12 Feb 2020
Online Nonparametric Regression
Online Nonparametric Regression
Alexander Rakhlin
Karthik Sridharan
174
101
0
11 Feb 2014
Online Learning with Predictable Sequences
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
207
359
0
18 Aug 2012
Rates of convergence in active learning
Rates of convergence in active learning
Steve Hanneke
121
153
0
09 Mar 2011
Online Learning via Sequential Complexities
Online Learning via Sequential Complexities
Alexander Rakhlin
Karthik Sridharan
Ambuj Tewari
112
103
0
06 Jun 2010
1