Borja Rodríguez Gálvez

Orcid: 0000-0002-0862-1333

According to our database1, Borja Rodríguez Gálvez authored at least 19 papers between 2020 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
An Information-Theoretic Approach to Generalization Theory.
PhD thesis, 2024

More PAC-Bayes bounds: From bounded losses, to losses with general tail behaviors, to anytime validity.
J. Mach. Learn. Res., 2024

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality.
CoRR, 2024

An Information-Theoretic Approach to Generalization Theory.
CoRR, 2024

On Information Theoretic Fairness: Compressed Representations With Perfect Demographic Parity.
CoRR, 2024

A Coding-Theoretic Analysis of Hyperspherical Prototypical Learning Geometry.
CoRR, 2024

Chained Information-Theoretic bounds and Tight Regret Rate for Linear Bandit Problems.
CoRR, 2024

A Note on Generalization Bounds for Losses with Finite Moments.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards.
Proceedings of the IEEE International Symposium on Information Theory, 2023

The Role of Entropy and Reconstruction in Multi-View Self-Supervised Learning.
Proceedings of the International Conference on Machine Learning, 2023

Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
An Information-Theoretic Analysis of Bayesian Reinforcement Learning.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021
Upper Bounds on the Generalization Error of Private Algorithms for Discrete Data.
IEEE Trans. Inf. Theory, 2021

Enforcing fairness in private federated learning via the modified method of differential multipliers.
CoRR, 2021

Tighter Expected Generalization Error Bounds via Wasserstein Distance.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Variational Approach to Privacy and Fairness.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
The Convex Information Bottleneck Lagrangian.
Entropy, 2020

Upper Bounds on the Generalization Error of Private Algorithms.
CoRR, 2020

On Random Subset Generalization Error Bounds and the Stochastic Gradient Langevin Dynamics Algorithm.
Proceedings of the IEEE Information Theory Workshop, 2020


  Loading...