Romain Cosson

CoRR, 2024

Ariadne and Theseus: Exploration and Rendezvous with Two Mobile Agents in an Unknown Graph.

[BibT_eX]

[DOI]

CoRR, 2024

Breaking the <i>k</i>/ log <i>k</i> Barrier in Collective Tree Exploration via Tree-Mining.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Collective Tree Exploration via Potential Function Method.

[BibT_eX]

[DOI]

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

Asynchronous Collective Tree Exploration by Tree-Mining.

[BibT_eX]

[DOI]

CoRR, 2023

Breadth-First Depth-Next: Optimal Collaborative Exploration of Trees with Low Diameter.

[BibT_eX]

[DOI]

Laurent Viennot

CoRR, 2023

Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.

[BibT_eX]

[DOI]

Laurent Viennot

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next.

[BibT_eX]

[DOI]

Laurent Viennot

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Gradient Descent with Low-Rank Objective Functions.

[BibT_eX]

[DOI]

Ali Jadbabaie

Anuran Makur

Amirhossein Reisizadeh

Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022

Gradient Descent for Low-Rank Functions.

[BibT_eX]

[DOI]

Ali Jadbabaie

Anuran Makur

Amirhossein Reisizadeh

CoRR, 2022

Universal Online Learning with Bounded Loss: Reduction to Binary Classification.

[BibT_eX]

[DOI]

Moïse Blanchard

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Universal Online Learning with Unbounded Losses: Memory Is All You Need.

[BibT_eX]

[DOI]

Moïse Blanchard

Steve Hanneke

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021

Approximating the Log-Partition Function.

[BibT_eX]

[DOI]

CoRR, 2021

Quantifying Variational Approximation for Log-Partition Function.

[BibT_eX]

[DOI]