Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

203406608811 · Jun 202019922001200920172026
48 results for Semi-Discrete Optimal Transport

Proves hardness of semi-discrete optimal transport and proposes regularization methods.

problem Computing Wasserstein distance between discrete and non-discrete probability measures.
method Proves hardness, introduces distributionally robust dual optimal transport, regularizes primal objective, uses stochastic gradient descent.
result Regularization schemes and improved convergence guarantees for semi-discrete optimal transport problems.

Stochastic optimization improves semi-discrete OT map estimation with a minimax rate.

problem Empirical success of SGD in semi-discrete OT, but lack of theoretical guarantees.
method Averaged projected SGD with a minimax convergence rate of O(1/√n).
result SGD methods can estimate the OT map with a minimax convergence rate of O(1/√n).

AlignFlow improves FGMs by optimizing noise and data alignment.

problem Optimal Transport methods for FGMs are limited by scalability issues.
method Introduces Semi-Discrete Optimal Transport (SDOT) to enhance FGM training.
result AlignFlow scales well to large datasets and model architectures.

Framework uses optimal transport for neural architecture search.

problem Optimizing neural architectures in deep learning.
method Semi-discrete optimization using optimal transport.
result Gradient flow and minimizing movement scheme converge to reaction-diffusion equations.

DRAG decreases regularization to accelerate semi-discrete OT convergence.

problem Mitigating bias in semi-discrete OT problems with entropic regularization.
method DRAG: Decreasing Regularization Averaged Gradient, a stochastic gradient descent algorithm.
result DRAG achieves unbiased O(1/t)\mathcal{O}(1/t) sample and iteration complexity for OT cost and potential estimation, and O(1/t)\mathcal{O}(1/\sqrt{t}) rate for OT map.

Estimates discontinuous optimal transport maps between a discrete and continuous distribution.

problem Estimating discontinuous optimal transport maps between a discrete and continuous distribution.
method Entropic optimal transport estimator, computationally efficient.
result The estimator converges at the minimax-optimal rate n1/2n^{-1/2} in the semi-discrete setting.

New algorithm improves OT map estimation for semi-discrete settings.

problem Improving estimation of OT maps in semi-discrete settings.
method Stochastic Gradient Descent with adaptive entropic regularization and averaging acceleration.
result Achieves nearly minimax rate of O(t1)\mathcal{O}(t^{-1}) for OT map estimation.

The paper analyzes rates of convergence for optimal transport map estimators using barycentric projections.

problem Estimating optimal transport maps from data sampled according to two distributions.
method Comprehensive analysis of rates of convergence for plug-in estimators defined via barycentric projections.
result New stability estimate for barycentric projections under minimal smoothness assumptions.

New findings on optimal transport gradient for generative models, addressing numerical instabilities.

problem Numerical instabilities in training Wasserstein Generative Adversarial Networks (WGAN).
method Valid differentiation theorem for entropic regularized transport, semi-discrete gradient formulation, and optimization algorithm.
result Existence of optimal transport gradient for generative models under specified conditions.

Optimal transport reformulates multiple quantile hedging problem.

problem Multiple quantile hedging problem in incomplete markets.
method Reformulated as Monge optimal transport problem, introduced Kantorovitch version, proved no duality gap.
result Multiple quantile hedging problem can be seen as semi-discrete optimal transport problem.

Two new algorithms improve neural architecture search efficiency.

problem Optimizing neural architecture search for faster and more accurate models.
method Introduces NASGD and NASAGD using accelerated gradient descent on a semi-discrete space.
result Achieves comparable accuracy with 40x fewer architectures in 12 hours.

Optimal transport simplifies machine learning by comparing probability measures.

problem Comparing and manipulating probability distributions in machine learning.
method Uses optimal transport to compare and manipulate probability distributions, combining statistical and geometric perspectives.
result Optimal transport provides a unified framework for various machine learning tasks.

Variational problems that involve Wasserstein distances and more generally optimal transport (OT) theory are playing an increasingly important role in data sciences. Such problems can be used to form an examplar measure out of various probability measures, as in the Wasserstein barycenter problem, or to carry out param…

2018-11-13abs ↗pdf ↗

New scalable methods for unbalanced optimal transport improve efficiency and applicability.

problem Scalable algorithms for unbalanced optimal transport remain underexplored.
method Analysis of semi-dual formulation and adaptive gradient methods.
result SGD methods achieve a convergence rate of O(n/εT) for large-scale applications.

Simple constructions of semi-discrete and discrete surfaces using Jacobi elliptic functions.

problem Constructing semi-discrete and discrete surfaces explicitly.
method Using Jacobi elliptic functions and τ-functions.
result Explicit constructions and periodicities of semi-discrete and discrete surfaces.

A Darboux transformation for polarized space curves is introduced and its properties are studied, in particular, Bianchi permutability. Semi-discrete isothermic surfaces are described as sequences of Darboux transforms of polarized curves in the conformal n-sphere and their transformation theory is studied. Semi-discre…

2015-06-15abs ↗pdf ↗

Deep convolutional neural networks have led to breakthrough results in practical feature extraction applications. The mathematical analysis of these networks was pioneered by Mallat, 2012. Specifically, Mallat considered so-called scattering networks based on identical semi-discrete wavelet frames in each network layer…

2015-04-21abs ↗pdf ↗

Efficiently aggregating data from different sources is a challenging problem, particularly when samples from each source are distributed differently. These differences can be inherent to the inference task or present for other reasons: sensors in a sensor network may be placed far apart, affecting their individual meas…

2017-05-21abs ↗pdf ↗

Deep neural networks can approximate any target probability distribution given certain conditions.

problem Approximating complex probability distributions with deep neural networks.
method Proving the existence of a deep neural network mapping that approximates a target distribution under various integral probability metrics.
result Upper bounds on the size of the neural network in terms of dimension and approximation error for different metrics.

Paper explores folding patterns of curved creases preserving their geometric properties.

problem Investigating rigid-ruling folding motions of curved crease-rule patterns.
method Deriving conditions for rigid-ruling foldability and analyzing combinations of creases.
result Constant fold-angle creases are only compatible with other constant fold-angle creases.

New methods estimate transport-growth pairs in unbalanced optimal transport.

problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.

New algorithm solves unbalanced optimal transport on trees in quasi-linear time.

problem Efficiently solving unbalanced optimal transport problems on trees.
method Proposed an algorithm that solves a more general unbalanced optimal transport problem exactly in quasi-linear time on a tree metric.
result Solves unbalanced optimal transport on trees in quasi-linear time (less than one second for a tree with one million nodes).

Extends optimal transport to dynamic and martingale settings.

problem Dynamic and martingale relaxation of optimal transport problems.
method Extends Benamou-Brenier formula to weak optimal transport and introduces barycentric optimal transport.
result Relates barycentric optimal transport to martingale Benamou-Brenier formula.

Paper relaxes optimal transport using convex functions for data science.

problem Optimal transport problem on finite spaces.
method Relaxation via strictly convex functions (Kullback-Leibler divergence, Bregman divergences). Gradient descent iterative process.
result Mathematical foundations and iterative process for the relaxed optimal transport problem.

In this paper, we present a novel and principled approach to learn the optimal transport between two distributions, from samples. Guided by the optimal transport theory, we learn the optimal Kantorovich potential which induces the optimal transport map. This involves learning two convex functions, by solving a novel mi…

2019-08-28abs ↗pdf ↗

Review of modern computational optimal transport methods for biomedical applications.

problem Efficient computation of optimal transport for big data.
method Regularization-based and projection-based computational methods.
result Advancements in computational optimal transport methods for biomedical research.

Paper investigates optimal transport map estimation in infinite-dimensional spaces.

problem Estimating optimal transport maps in infinite-dimensional spaces is challenging.
method Characterizes γγ-smoothness for optimal transport maps and develops a polynomial-rate estimator.
result Shows polynomial-order minimax risk for optimal transport map estimation.

Study shows how optimal transport behaves in higher dimensions.

problem Characterizing optimal transport in higher dimensions with Euclidean distance.
method Investigates the small regularization limit of entropic optimal transport.
result The limiting transport plan is supported on transport rays and uniquely minimizes a relative entropy functional.

A new model corrects inhomogeneity in Optimal Transport with Boundary.

problem Inhomogeneity in UROT models for Optimal Transport with Boundary.
method Proposed a modified entropic regularization term to make UROT models homogeneous.
result Homogeneous UROT model preserves properties of standard UROT while correcting inhomogeneity.

Study optimal transport for robust optimization, showing how adversary's strategy relates to regularization.

problem Optimizing under uncertain parameters with a fictitious adversary reshaping a reference distribution.
method Introduces optimal transport and regularization to relate robustification to variation and Lipschitz norms.
result Conditions for existence and computability of Nash equilibrium between decision-maker and adversary.