Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey of optimal transport for computer graphics and computer vision
Optimal transport is a long‐standing theory that has been studied in depth from both
theoretical and numerical point of views. Starting from the 50s this theory has also found a …
theoretical and numerical point of views. Starting from the 50s this theory has also found a …
[PDF][PDF] Extended ranking mechanisms for the m-capacitated facility location problem in bayesian mechanism design
G Auricchio, J Zhang, M Zhang - Proceedings of the 23rd International …, 2024 - ifaamas.org
Mechanism Design seeks to establish protocols for aggregating the private information of a
set of agents to optimize a global objective. Nonetheless, optimizing a communal goal solely …
set of agents to optimize a global objective. Nonetheless, optimizing a communal goal solely …
The equivalence of Fourier-based and Wasserstein metrics on imaging problems
We investigate properties of some extensions of a class of Fourier-based probability metrics,
originally introduced to study convergence to equilibrium for the solution to the spatially …
originally introduced to study convergence to equilibrium for the solution to the spatially …
HOT: An efficient Halpern accelerating algorithm for optimal transport problems
This paper proposes an efficient HOT algorithm for solving the optimal transport (OT)
problems with finite supports. We particularly focus on an efficient implementation of the …
problems with finite supports. We particularly focus on an efficient implementation of the …
Normalizing flows as approximations of optimal transport maps via linear-control neural odes
The term" Normalizing Flows" is related to the task of constructing invertible transport maps
between probability measures by means of deep neural networks. In this paper, we consider …
between probability measures by means of deep neural networks. In this paper, we consider …
Computing Wasserstein barycenters via linear programming
This paper presents a family of generative Linear Programming models that permit to
compute the exact Wasserstein Barycenter of a large set of two-dimensional images …
compute the exact Wasserstein Barycenter of a large set of two-dimensional images …
Adaptive online distributed optimal control of very-large-scale robotic systems
Autonomous systems comprised of many cooperative agents have the potential for enabling
long-duration tasks and data collection critical to the understanding of a wide range of …
long-duration tasks and data collection critical to the understanding of a wide range of …
Measures of equity for multi-capital accounting
Inequity is one of the primary economic and societal risks posed by the global food system,
yet measures of inequity are missing from prominent corporate tools that aim to account for …
yet measures of inequity are missing from prominent corporate tools that aim to account for …
The k-Facility Location Problem via Optimal Transport: A Bayesian Study of the Percentile Mechanisms
G Auricchio, J Zhang - International Symposium on Algorithmic Game …, 2024 - Springer
In this paper, we investigate the k-Facility Location Problem (k-FLP) within the Bayesian
Mechanism Design framework, in which agents' preferences are samples of a probability …
Mechanism Design framework, in which agents' preferences are samples of a probability …
A note on the Radiant formula and its relations to the sliced Wasserstein distance
G Auricchio - Aequationes mathematicae, 2024 - Springer
In this note, we show that the squared Wasserstein distance can be expressed as the
average over the sphere of one dimensional Wasserstein distances. We name this new …
average over the sphere of one dimensional Wasserstein distances. We name this new …