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. 2104.13626
  4. Cited By
Self-Bounding Majority Vote Learning Algorithms by the Direct
  Minimization of a Tight PAC-Bayesian C-Bound

Self-Bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound

28 April 2021
Paul Viallard
Pascal Germain
Amaury Habrard
Emilie Morvant
ArXivPDFHTML

Papers citing "Self-Bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound"

10 / 10 papers shown
Title
Multi-View Majority Vote Learning Algorithms: Direct Minimization of PAC-Bayesian Bounds
Multi-View Majority Vote Learning Algorithms: Direct Minimization of PAC-Bayesian Bounds
Mehdi Hennequin
Abdelkrim Zitouni
K. Benabdeslem
H. Elghazel
Yacine Gaci
45
0
0
09 Nov 2024
Second Order PAC-Bayesian Bounds for the Weighted Majority Vote
Second Order PAC-Bayesian Bounds for the Weighted Majority Vote
A. Masegosa
S. Lorenzen
Christian Igel
Yevgeny Seldin
77
40
0
01 Jul 2020
PyTorch: An Imperative Style, High-Performance Deep Learning Library
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Adam Paszke
Sam Gross
Francisco Massa
Adam Lerer
James Bradbury
...
Sasank Chilamkurthy
Benoit Steiner
Lu Fang
Junjie Bai
Soumith Chintala
ODL
265
42,038
0
03 Dec 2019
Constrained Deep Networks: Lagrangian Optimization via Log-Barrier
  Extensions
Constrained Deep Networks: Lagrangian Optimization via Log-Barrier Extensions
H. Kervadec
Jose Dolz
Jing Yuan
Christian Desrosiers
Eric Granger
Ismail Ben Ayed
29
55
0
08 Apr 2019
Learning Gaussian Processes by Minimizing PAC-Bayesian Generalization
  Bounds
Learning Gaussian Processes by Minimizing PAC-Bayesian Generalization Bounds
David Reeb
Andreas Doerr
S. Gerwinn
Barbara Rakitsch
GP
22
34
0
29 Oct 2018
On PAC-Bayesian Bounds for Random Forests
On PAC-Bayesian Bounds for Random Forests
S. Lorenzen
Christian Igel
Yevgeny Seldin
21
13
0
23 Oct 2018
Towards Deep Learning Models Resistant to Adversarial Attacks
Towards Deep Learning Models Resistant to Adversarial Attacks
Aleksander Madry
Aleksandar Makelov
Ludwig Schmidt
Dimitris Tsipras
Adrian Vladu
SILM
OOD
229
11,962
0
19 Jun 2017
Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural
  Networks with Many More Parameters than Training Data
Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data
Gintare Karolina Dziugaite
Daniel M. Roy
82
808
0
31 Mar 2017
Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a
  Learning Algorithm
Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm
Pascal Germain
A. Lacasse
François Laviolette
M. Marchand
Jean-Francis Roy
39
142
0
28 Mar 2015
Adam: A Method for Stochastic Optimization
Adam: A Method for Stochastic Optimization
Diederik P. Kingma
Jimmy Ba
ODL
842
149,474
0
22 Dec 2014
1