arXiv Machine Learning By Thabo Samakhoana, Benjamin Grimmer

An Elementary Proof of the Near Optimality of LogSumExp Smoothing

Read the original on arXiv Machine Learning →

arXiv:2512. 10825v3 Announce Type: replace-cross Abstract: We consider the design of smoothings of the (coordinate-wise) max function in $\mathbb{R}^d$ in the infinity norm.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 19

Improved Stochastic Optimization of LogSumExp

arXiv:2509. 24894v4 Announce Type: replace-cross Abstract: The LogSumExp function, dual to the Kullback-Leibler (KL) divergence, plays a central role in many important optimization problems, including entropy-regularized optimal transport (OT) and distributionally robust optimization (DRO).

By Egor Gladin, Alexey Kroshnin, Jia-Jie Zhu, Pavel Dvurechensky
arXiv AI
Jun 8

A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space

arXiv:2606. 07325v1 Announce Type: cross Abstract: We study the minimax rate of estimating a future value $\mu_{t_n+h}$ of a curve $t\mapsto\mu_t$ in the $2$-Wasserstein space $\mathcal{P}_2(\mathbb{R}^d)$ from finitely many noisy snapshots of its past, under an adiabatic bound $\|\nabla_t^k v\|\le\varepsilon$ on the $k$-th covariant derivative of the velocity field.

By Munsik Kim