Related papers: Reparametrizations with given stop data
Many advanced techniques have been developed, tested and implemented in the last decades in almost all circular accelerators across the world to measure the linear optics. However, the greater availability and accuracy of beam diagnostics…
This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…
First, we consider the problem of hedging in complete binomial models. Using the discrete-time F\"ollmer-Schweizer decomposition, we demonstrate the equivalence of the backward induction and sequential regression approaches. Second, in…
Path-following algorithms are frequently used in composite optimization problems where a series of subproblems, with varying regularization hyperparameters, are solved sequentially. By reusing the previous solutions as initialization,…
We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…
Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…
Three aspects of applying homotopy continuation, which is commonly used to solve parameterized systems of polynomial equations, are investigated. First, for parameterized systems which are homogeneous, we investigate options for performing…
This paper presents some startpoint (endpoint, fixed point) theorems for mutli-valued maps that generalize recent results proved by Y. U. Gaba \cite{rico, ricoo}.
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a…
In this paper the space of images is considered as a Riemannian manifold using the metamorphosis approach, where the underlying Riemannian metric simultaneously measures the cost of image transport and intensity variation. A robust and…
The problem of reconstructing a function from the magnitudes of its frame coefficients has recently been shown to be never uniformly stable in infinite-dimensional spaces [5]. This result also holds for frames that are possibly continuous…
This paper comments on the published work dealing with robustness and regularization of support vector machines (Journal of Machine Learning Research, vol. 10, pp. 1485-1510, 2009) [arXiv:0803.3490] by H. Xu, etc. They proposed a theorem to…
In this note, we demonstrate that an incorrect statement has been propagated in multiple papers, stemming from the substitution of ``lim'' with ``limsup'' for a sequence in Lemma 1.3 of the paper [J. Schu: Weak and strong convergence to…
In this article, the author provides full details of the proof of the concordance/isotopy problem. The first published proof, [5], accomplished this task only partially since there was an error, see the erratum [6], which damaged the main…
Three-dimensional (3D) reconstruction from two-dimensional images is an active research field in computer vision, with applications ranging from navigation and object tracking to segmentation and three-dimensional modeling. Traditionally,…
Many modern data analysis algorithms either assume that or are considerably more efficient if the distances between the data points satisfy a metric. These algorithms include metric learning, clustering, and dimensionality reduction.…
After the publication of [Compos. Math. 156 (2020), no. 4, 822-861], Andrew Putman pointed out a mistake in our paper and helped us fix it. In this note, we will explain what this mistake is and how to fix it.
Following our previous work of 1905.10745 [hep-th], 2003.11217 [hep-th], we study heterotic interpolating models $D$ dimensionally compactified with constant background fields that include the full set of Wilson lines and radii. Focusing on…
We present a new general framework for metrization of Gromov-Hausdorff-type topologies on non-compact metric spaces. We also give easy-to-check conditions for separability and completeness and hence the measure theoretic requirements are…
This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…