Paul Viallard

Orcid: 0000-0003-4836-0809

According to our database1, Paul Viallard authored at least 10 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A general framework for the practical disintegration of PAC-Bayesian bounds.
Mach. Learn., February, 2024

Leveraging PAC-Bayes Theory and Gibbs Distributions for Generalization Bounds with Complexity Measures.
CoRR, 2024

A PAC-Bayesian Link Between Generalisation and Flat Minima.
CoRR, 2024

Tighter Generalisation Bounds via Interpolation.
CoRR, 2024

2023
From Mutual Information to Expected Dynamics: New Generalization Bounds for Heavy-Tailed SGD.
CoRR, 2023

Learning via Wasserstein-Based High Probability Generalisation Bounds.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2021
A General Framework for the Derandomization of PAC-Bayesian Bounds.
CoRR, 2021

Self-bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2021

Learning Stochastic Majority Votes by Minimizing a PAC-Bayes Generalization Bound.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A PAC-Bayes Analysis of Adversarial Robustness.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021


  Loading...