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. 2202.11461
  4. Cited By
Exponential Tail Local Rademacher Complexity Risk Bounds Without the
  Bernstein Condition

Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition

23 February 2022
Varun Kanade
Patrick Rebeschini
Tomas Vaskevicius
ArXivPDFHTML

Papers citing "Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition"

10 / 10 papers shown
Title
Reweighting Improves Conditional Risk Bounds
Reweighting Improves Conditional Risk Bounds
Yikai Zhang
Jiahe Lin
Fengpei Li
Songzhu Zheng
Anant Raj
Anderson Schneider
Yuriy Nevmyvaka
31
0
0
04 Jan 2025
On the Efficiency of ERM in Feature Learning
On the Efficiency of ERM in Feature Learning
Ayoub El Hanchi
Chris J. Maddison
Murat A. Erdogdu
69
0
0
18 Nov 2024
High-Probability Risk Bounds via Sequential Predictors
High-Probability Risk Bounds via Sequential Predictors
Dirk van der Hoeven
Nikita Zhivotovskiy
Nicolò Cesa-Bianchi
OffRL
36
2
0
15 Aug 2023
Local Risk Bounds for Statistical Aggregation
Local Risk Bounds for Statistical Aggregation
Jaouad Mourtada
Tomas Vavskevivcius
Nikita Zhivotovskiy
29
1
0
29 Jun 2023
Exploring Local Norms in Exp-concave Statistical Learning
Exploring Local Norms in Exp-concave Statistical Learning
Nikita Puchkin
Nikita Zhivotovskiy
81
2
0
21 Feb 2023
A Regret-Variance Trade-Off in Online Learning
A Regret-Variance Trade-Off in Online Learning
Dirk van der Hoeven
Nikita Zhivotovskiy
Nicolò Cesa-Bianchi
14
6
0
06 Jun 2022
Exponential Savings in Agnostic Active Learning through Abstention
Exponential Savings in Agnostic Active Learning through Abstention
Nikita Puchkin
Nikita Zhivotovskiy
24
20
0
31 Jan 2021
The Statistical Complexity of Early-Stopped Mirror Descent
The Statistical Complexity of Early-Stopped Mirror Descent
Tomas Vaskevicius
Varun Kanade
Patrick Rebeschini
17
23
0
01 Feb 2020
Learning without Concentration for General Loss Functions
Learning without Concentration for General Loss Functions
S. Mendelson
63
65
0
13 Oct 2014
Learning without Concentration
Learning without Concentration
S. Mendelson
85
333
0
01 Jan 2014
1