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. 1606.00922
  4. Cited By
Localization of VC Classes: Beyond Local Rademacher Complexities
v1v2v3 (latest)

Localization of VC Classes: Beyond Local Rademacher Complexities

2 June 2016
Nikita Zhivotovskiy
Steve Hanneke
ArXiv (abs)PDFHTML

Papers citing "Localization of VC Classes: Beyond Local Rademacher Complexities"

22 / 22 papers shown
Title
Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Ability
Lijia Yu
Yibo Miao
Yifan Zhu
Xiao-Shan Gao
Lijun Zhang
88
0
0
06 Mar 2025
Reweighting Improves Conditional Risk Bounds
Reweighting Improves Conditional Risk Bounds
Yikai Zhang
Jiahe Lin
Fengpei Li
Songzhu Zheng
Anant Raj
Anderson Schneider
Yuriy Nevmyvaka
70
1
0
04 Jan 2025
Revisiting Agnostic PAC Learning
Revisiting Agnostic PAC Learning
Steve Hanneke
Kasper Green Larsen
Nikita Zhivotovskiy
35
2
0
29 Jul 2024
Local Risk Bounds for Statistical Aggregation
Local Risk Bounds for Statistical Aggregation
Jaouad Mourtada
Tomas Vavskevivcius
Nikita Zhivotovskiy
64
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
149
2
0
21 Feb 2023
Tighter Information-Theoretic Generalization Bounds from Supersamples
Tighter Information-Theoretic Generalization Bounds from Supersamples
Ziqiao Wang
Yongyi Mao
109
19
0
05 Feb 2023
The One-Inclusion Graph Algorithm is not Always Optimal
The One-Inclusion Graph Algorithm is not Always Optimal
Ishaq Aden-Ali
Yeshwanth Cherapanamjeri
Abhishek Shetty
Nikita Zhivotovskiy
100
7
0
19 Dec 2022
Exponential Tail Local Rademacher Complexity Risk Bounds Without the
  Bernstein Condition
Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition
Varun Kanade
Patrick Rebeschini
Tomas Vaskevicius
78
10
0
23 Feb 2022
Improving Generalization Bounds for VC Classes Using the Hypergeometric
  Tail Inversion
Improving Generalization Bounds for VC Classes Using the Hypergeometric Tail Inversion
Jean-Samuel Leboeuf
F. Leblanc
M. Marchand
49
0
0
29 Oct 2021
Non-asymptotic Excess Risk Bounds for Classification with Deep
  Convolutional Neural Networks
Non-asymptotic Excess Risk Bounds for Classification with Deep Convolutional Neural Networks
Guohao Shen
Yuling Jiao
Yuanyuan Lin
Jian Huang
51
3
0
01 May 2021
Exponential Savings in Agnostic Active Learning through Abstention
Exponential Savings in Agnostic Active Learning through Abstention
Nikita Puchkin
Nikita Zhivotovskiy
79
20
0
31 Jan 2021
Risk-Monotonicity in Statistical Learning
Risk-Monotonicity in Statistical Learning
Zakaria Mhammedi
132
8
0
28 Nov 2020
Towards Optimal Problem Dependent Generalization Error Bounds in
  Statistical Learning Theory
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory
Yunbei Xu
A. Zeevi
130
17
0
12 Nov 2020
Instance-Dependent Complexity of Contextual Bandits and Reinforcement
  Learning: A Disagreement-Based Perspective
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective
Dylan J. Foster
Alexander Rakhlin
D. Simchi-Levi
Yunzong Xu
161
78
0
07 Oct 2020
Proper Learning, Helly Number, and an Optimal SVM Bound
Proper Learning, Helly Number, and an Optimal SVM Bound
Olivier Bousquet
Steve Hanneke
Shay Moran
Nikita Zhivotovskiy
123
53
0
24 May 2020
Theoretical Analysis of Divide-and-Conquer ERM: Beyond Square Loss and
  RKHS
Theoretical Analysis of Divide-and-Conquer ERM: Beyond Square Loss and RKHS
Yong Liu
Lizhong Ding
Weiping Wang
36
0
0
09 Mar 2020
The Statistical Complexity of Early-Stopped Mirror Descent
The Statistical Complexity of Early-Stopped Mirror Descent
Tomas Vaskevicius
Varun Kanade
Patrick Rebeschini
86
23
0
01 Feb 2020
Fast classification rates without standard margin assumptions
Fast classification rates without standard margin assumptions
Olivier Bousquet
Nikita Zhivotovskiy
57
19
0
28 Oct 2019
Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher
  Processes
Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes
Jun Yang
Shengyang Sun
Daniel M. Roy
90
28
0
20 Aug 2019
When are epsilon-nets small?
When are epsilon-nets small?
A. Kupavskii
Nikita Zhivotovskiy
41
7
0
28 Nov 2017
A Tight Excess Risk Bound via a Unified
  PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity
A Tight Excess Risk Bound via a Unified PAC-Bayesian-Rademacher-Shtarkov-MDL Complexity
Peter Grünwald
Nishant A. Mehta
61
35
0
21 Oct 2017
Optimal learning via local entropies and sample compression
Optimal learning via local entropies and sample compression
Nikita Zhivotovskiy
95
15
0
04 Jun 2017
1