Tomas Vaskevicius

According to our database, Tomas Vaskevicius authored at least 9 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Sharper exponential convergence rates for Sinkhorn's algorithm in continuous settings.

Lénaïc Chizat, Alex Delalande, Tomas Vaskevicius

Math. Program., January, 2026

2024

Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition.

Varun Kanade, Patrick Rebeschini, Tomas Vaskevicius

J. Mach. Learn. Res., 2024

2023

Computational Guarantees for Doubly Entropic Wasserstein Barycenters via Damped Sinkhorn Iterations.

Lénaïc Chizat, Tomas Vaskevicius

CoRR, 2023

Computational Guarantees for Doubly Entropic Wasserstein Barycenters.

Tomas Vaskevicius, Lénaïc Chizat

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Local Risk Bounds for Statistical Aggregation.

Jaouad Mourtada, Tomas Vaskevicius, Nikita Zhivotovskiy

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2021

Distribution-Free Robust Linear Regression.

Jaouad Mourtada, Tomas Vaskevicius, Nikita Zhivotovskiy

CoRR, 2021

2020

Suboptimality of Constrained Least Squares and Improvements via Non-Linear Predictors.

Tomas Vaskevicius, Nikita Zhivotovskiy

CoRR, 2020

The Statistical Complexity of Early-Stopped Mirror Descent.

Tomas Vaskevicius, Varun Kanade, Patrick Rebeschini

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Implicit Regularization for Optimal Sparse Recovery.

Tomas Vaskevicius, Varun Kanade, Patrick Rebeschini

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019