Thibaut Le Gouic

Orcid: 0000-0001-6983-2794

According to our database1, Thibaut Le Gouic authored at least 16 papers between 2015 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Algorithmic Solution to the Blotto Game Using Multimarginal Couplings.
Oper. Res., 2024

2023
Recovering a Metric from Its Full Ordinal Information.
Discret. Comput. Geom., 2023

Bures-Wasserstein Barycenters and Low-Rank Matrix Recovery.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

The query complexity of sampling from strongly log-concave distributions in one dimension.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Rejection sampling from shape-constrained distributions in sublinear time.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
A probabilistic model for fast-to-evaluate 2D crack path prediction in heterogeneous materials.
CoRR, 2021

Sampling From the Wasserstein Barycenter.
CoRR, 2021

Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm.
Proceedings of the Conference on Learning Theory, 2021

Fast and Smooth Interpolation on Wasserstein Space.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
The price for fairness in a regression framework.
CoRR, 2020

Exponential ergodicity of mirror-Langevin diffusions.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergence.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation.
Discret. Comput. Geom., 2019

2018
A notion of stability for k-means clustering.
CoRR, 2018

2015
Barycenter in Wasserstein Spaces: Existence and Consistency.
Proceedings of the Geometric Science of Information - Second International Conference, 2015


  Loading...