Searcharxiv⌕ Search

arXiv subjects

Alexey Kroshnin

Publications and source records attributed to Alexey Kroshnin.

21 records · Page 2Linked to original sources

Image Registration and Predictive Modeling: Learning the Metric on the Space of Diffeomorphisms

We present a method for metric optimization in the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, by treating the induced Riemannian metric on the space of diffeomorphisms as a kernel in a machine learning context. For simplicity, we choose the kernel Fischer Linear Discriminant Analysis (KLDA) as the framework. Optimizing the kernel parameters in an Expectation-Maximization framework, we define model fidelity via the hinge loss of the decision function. The resulting algorithm optimizes the parameters of the LDDMM norm-inducing differential operator as a solution to a group-wise registration and classification problem. In practice, this may lead to a biology-aware registration, focusing its attention on the predictive task at hand such as identifying the effects of disease. We first tested our algorithm on a synthetic dataset, showing that our parameter selection improves registration quality and classification accuracy. We then tested the algorithm on 3D subcortical shapes from the Schizophrenia cohort Schizconnect. Our Schizpohrenia-Control predictive model showed significant improvement in ROC AUC compared to baseline parameters.

cs.CV↗

Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm

We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's algorithm, we prove the complexity bound $\widetilde{O}\left({n^2/\varepsilon^2}\right)$ arithmetic operations. For the second one, which is based on our novel Adaptive Primal-Dual Accelerated Gradient Descent (APDAGD) algorithm, we prove the complexity bound $\widetilde{O}\left(\min\left\{n^{9/4}/\varepsilon, n^{2}/\varepsilon^2 \right\}\right)$ arithmetic operations. Both bounds have better dependence on $\varepsilon$ than the state-of-the-art result given by $\widetilde{O}\left({n^2/\varepsilon^3}\right)$. Our second algorithm not only has better dependence on $\varepsilon$ in the complexity bound, but also is not specific to entropic regularization and can solve the OT problem with different regularizers.

cs.DS↗

Fréchet Barycenters and a Law of Large Numbers for Measures on the Real Line

Endow the space $\mathcal{P}(\mathbb{R})$ of probability measures on $\mathbb{R}$ with a transportation cost $J(μ, ν)$ generated by a translation-invariant convex cost function. For a probability distribution on $\mathcal{P}(\mathbb{R})$ we formulate a notion of average with respect to this transportation cost, called here the Fréchet barycenter, prove a version of the law of large numbers for Fréchet barycenters, and briefly discuss the structure of $\mathcal{P}(\mathbb{R})$ related to the transportation cost $J$.

math.PR↗