Imagen de Portada

Semi-Discrete Optimal Transport: Nearly Minimax Estimation With Stochastic Gradient Descent and Adaptive Entropic Regularization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Genans, Ferdinand, Godichon-Baggioni, Antoine, Vialard, François-Xavier, Wintenberger, Olivier
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport
por: Genans, Ferdinand, et al.
Publicado: (2025)

Stochastic Optimization in Semi-Discrete Optimal Transport: Convergence Analysis and Minimax Rate
por: Genans, Ferdinand, et al.
Publicado: (2025)

Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation
por: Genans, Ferdinand, et al.
Publicado: (2026)

Fast and Large-Scale Unbalanced Optimal Transport via its Semi-Dual and Adaptive Gradient Methods
por: Genans, Ferdinand
Publicado: (2026)

Non-asymptotic Analysis of Biased Adaptive Stochastic Approximation
por: Surendran, Sobihan, et al.
Publicado: (2024)

High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch
por: Liautaud, Paul, et al.
Publicado: (2026)

Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
por: Godichon-Baggioni, Antoine, et al.
Publicado: (2024)

A Full Adagrad algorithm with O(Nd) operations
por: Godichon-Baggioni, Antoine, et al.
Publicado: (2024)

Online and Offline Robust Multivariate Linear Regression
por: Godichon-Baggioni, Antoine, et al.
Publicado: (2024)

Theoretical Convergence Guarantees for Variational Autoencoders
por: Surendran, Sobihan, et al.
Publicado: (2024)

Minimax Adaptive Online Nonparametric Regression over Besov Spaces
por: Liautaud, Paul, et al.
Publicado: (2025)

On Adaptive Stochastic Optimization for Streaming Data: A Newton's Method with O(dN) Operations
por: Godichon-Baggioni, Antoine, et al.
Publicado: (2023)

Increasing Missingness to Reduce Bias: Richardson-SGD with Missing Data
por: Genans, Ferdinand, et al.
Publicado: (2026)

Entropic Semi-Martingale Optimal Transport
por: Benamou, Jean-David, et al.
Publicado: (2024)

Convergence in quadratic mean of averaged stochastic gradient algorithms without strong convexity nor bounded gradient
por: Godichon-Baggioni, Antoine
Publicado: (2021)

Understanding the training of infinitely deep and wide ResNets with Conditional Optimal Transport
por: Barboni, Raphaël, et al.
Publicado: (2024)

Stochastic Adaptive Gradient Descent Without Descent
por: Aujol, Jean-François, et al.
Publicado: (2025)

Minimax-optimal and Locally-adaptive Online Nonparametric Regression
por: Liautaud, Paul, et al.
Publicado: (2024)

Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
por: Chen, Lesi, et al.
Publicado: (2022)

Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes
por: Zhang, Ruiqi, et al.
Publicado: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
por: Shen, Wei, et al.
Publicado: (2023)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
por: Gao, Hongchang
Publicado: (2022)

Entering the Era of Discrete Diffusion Models: A Benchmark for Schrödinger Bridges and Entropic Optimal Transport
por: Carrasco, Xavier Aramayo, et al.
Publicado: (2025)

Sliced ReLU attention: Quasi-linear contextual expressivity via sorting
por: Vialard, François-Xavier, et al.
Publicado: (2025)

On the Efficiency of Sinkhorn-Knopp for Entropically Regularized Optimal Transport
por: He, Kun
Publicado: (2026)

Convergence of Multi-Level Markov Chain Monte Carlo Adaptive Stochastic Gradient Algorithms
por: Godichon-Baggioni, Antoine, et al.
Publicado: (2026)

Neural Estimation for Scaling Entropic Multimarginal Optimal Transport
por: Tsur, Dor, et al.
Publicado: (2025)

A penalized criterion for selecting the number of clusters for K-medians
por: Godichon-Baggioni, Antoine, et al.
Publicado: (2022)

Stochastic Gradient Descent with Adaptive Data
por: Che, Ethan, et al.
Publicado: (2024)

Gradient Descent with Projection Finds Over-Parameterized Neural Networks for Learning Low-Degree Polynomials with Nearly Minimax Optimal Rate
por: Yang, Yingzhen, et al.
Publicado: (2026)

Variational Entropic Optimal Transport
por: Dyachenko, Roman, et al.
Publicado: (2026)

Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probability
por: van der Hoeven, Dirk, et al.
Publicado: (2025)

Adaptive Heavy-Tailed Stochastic Gradient Descent
por: Gong, Bodu, et al.
Publicado: (2025)

Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport
por: Ponnoprat, Donlapark, et al.
Publicado: (2026)

Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path
por: Di, Qiwei, et al.
Publicado: (2024)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
por: Zhu, Yuchen, et al.
Publicado: (2024)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
por: Lin, Tianyi, et al.
Publicado: (2019)

Weighted Averaged Stochastic Gradient Descent: Asymptotic Normality and Optimality
por: Wei, Ziyang, et al.
Publicado: (2023)

Progressive Entropic Optimal Transport Solvers
por: Kassraie, Parnian, et al.
Publicado: (2024)

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
por: Köhne, Frederik, et al.
Publicado: (2023)