Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 114 for “"Wasserstein Distance"”.
-
Distributionally robust binary classifier under Wasserstein distance
… with the radius calculated as per the Wasserstein distance. We derive the tractable formulation for the general problem. When focusing on the support vector machine (SVM), the general problem boils down to an easy-to-solve second- order cone programming problem. The robustified SVM is …
-
Generative modeling using the sliced Wasserstein distance
… to improve stability, for instance, by using the Wasserstein distance rather than the Jenson-Shannon divergence. Here, we consider an alternative formulation for generative modeling based on random projections which, in its simplest form, results in a single objective rather than a saddlepoint …
-
Algebraic statistics: Problems in phylogenetics and wasserstein distance optimization
… motion tree models, and the computation of Wasserstein distance to statistical models. The first contribution characterizes the phylogenetic invariants of group-based Cavender-Farris-Neyman (CFN) models on level-1 phylogenetic networks. Building on recent work that reduces the study of …
-
Reproducing-Kernel Hilbert space regression with notes on the Wasserstein Distance
… L2 error of our estimators with respect to a Wasserstein ball of probability measures centred at the covariate distribution. This leads us to investigate the extreme points of Wasserstein balls. In Chapter 3, we provide bounds on our estimators both when the regression function is unbounded …
-
Signed Wasserstein distance for granular process monitoring in Additive Friction Stir Deposition
… This thesis introduces the one-dimensional Wasserstein distance (W_1) as a statistical dissimilarity metric for granular AFSD process monitoring. By comparing empirical distributions rather than time-aligned signals, the metric eliminates phase shift penalties common in Euclidean based …
-
Graphical Analysis of Recurrent Surface Temperature Trends Using the Gromov-Wasserstein Distance Metric
… can then be analyzed like graphs and the Gromov-Wasserstein distance metric captures in a single metric how different a daily graph is from some standard reference graph. These daily snapshots into daily surface temperature trends can then be aggregated and analyzed for relative changes in …
-
The boundary method and general auction for optimal mass transportation and Wasserstein distance computation
Numerical optimal transport is an important area of research, but most problems are too large and complex for easy computation. Because continuous transport problems are generally solved by conversion to either discrete or semi-discrete forms, I focused on methods for those two. I developed a …
-
Using Wasserstein distance and conditionality for stable and selective data augmentation in pavement crack analysis
… Network (GAN) architectures based on the models Wasserstein GAN (WGAN), and Conditional WGAN (C-WGAN) developed in previous literature. These models aim to remedy the shortcomings of previous data augmentation methods used in pavement crack analysis. The research utilizes annotated images from …
-
Data-driven Distributionally Robust Stochastic Optimization via Wasserstein Distance with Applications to Portfolio Risk Management and Inventory Control
… the decision maker) from some ambiguity set. The Wasserstein distance metric is used to specify the ambiguity set which is known as a Wasserstein ball of some finite radius d. At the center of this ball, is the empirical distribution, which serves as a proxy for the true underlying distribution. …
-
Deep generative models via explicit Wasserstein minimization
… target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source randomness of the network is a continuous distribution (the “semi-discrete” setting), then the Wasserstein distance is realized by a …
-
Statistical and Computational Analysis of Adversarial Training
… there are two ways to define worst-case loss: Wasserstein-distance-based and perturbation-based. In this thesis, we present a statistical and computational analysis of adversarial training. For the Wasserstein-distance-based adversarial training problem—also known as Wasserstein …
-
Reliable Decision-Making Under Uncertainty Through The Lens of Statistics and Optimization
… In Chapter 2, we propose a kernelized projected Wasserstein distance for high-dimensional hypothesis testing, which finds the nonlinear mapping that maximizes the discrepancy between projected distributions. In Chapter 3, we provide an in-depth analysis of the computational and statistical …
-
Contributions to data science from an optimal transport perspective
… This advance led to the definition of the Wasserstein distance, a metric between probability distributions with an intuitive geometric interpretation and strong mathematical properties, which sparked significant interest within the scientific community. While early research focused on …
-
Essays in Machine Learning, Econometrics, and Computational Economics
… 2 Agent-based Model Parameter Estimation with Wasserstein Distance (Co-authored with Sebastiano Manzan): The goal of this chapter is to propose an estimation method that is accurate when the interest is to estimate the parameters of high-dimensional models, such as DSGE and ABM. In particular, …
-
Probabilistic Frames and Concepts from Optimal Transport
… and whose support spans $\mathbb{R}^n$. The p-Wasserstein distance with $p \geq 1$ from optimal transport is often used to compare probabilistic frames. It is particularly useful to compare frames of various cardinalities in the context of probabilistic frames. We show that the 2-Wasserstein …
-
Adapted Wasserstein distances and applications to distributionally robust optimization
This thesis studies adapted Wasserstein distances and their applications to distributionally robust optimization (DRO) problems in a dynamic context. In Chapter 3, we propose a transfer principle to study the adapted 2-Wasserstein distance between stochastic processes. We obtain an explicit formula …
-
Robust Exact Algorithms for the Euclidean Bipartite Matching Problem
… of this problem is the computation of the p-Wasserstein distance which we define next. Given a complete bipartite graph with two disjoint sets of n points in d-dimensional Euclidean space and an integer p ≥ 1, let the cost of an edge be the p-th power of the Euclidean distance between its …
-
qStorm : a Quantile STOchastic Regression Model for option pricing with arbitrary return distributions
… data. Evaluation using metrics such as Wasserstein distance, contentious ranked probability soce (CRPS), and value at risk (VaR) demonstrates the effectiveness of the qLSTM in capturing tail risks and broader distributional characteristics. qStorm's empirical results demonstrate …
-
Optimal transport algorithms and metrics for 3D point-cloud alignment with applications to cryogenic electron microscopy
… descent (SGD)-like algorithm operating on the Wasserstein distance to achieve fast and accurate alignment when initial map positions are relatively close. Next, we present EMPOT, an alignment method that utilizes the unbalanced Gromov-Wasserstein divergence to align partial density maps while …
Page 1 of 6