Related papers: Reducing the Sign Problem with simple Contour Defo…
Retinal implants aim to restore functional vision despite photoreceptor degeneration, yet are fundamentally constrained by low resolution electrode arrays and patient-specific perceptual distortions. Most deployed encoders rely on…
The fermion sign problem appearing in the mean-field approximation is considered, and the systematic computational scheme of the free energy is devised by using the Lefschetz-thimble method. We show that the Lefschetz-thimble method…
In this paper, we address the problem of feature selection in the context of multi-label learning, by using a new estimator based on implicit regularization and label embedding. Unlike the sparse feature selection methods that use a…
Several ways to accelerate the solution of 2D/3D linear min-max problems in $n$ constraints are discussed. We also present an algorithm for solving such problems in the 2D case, which is superior to CGAL's linear programming solver, both in…
Inspired by the recent paper (L. Ying, Mirror descent algorithms for minimizing interacting free energy, Journal of Scientific Computing, 84 (2020), pp. 1-14),we explore the relationship between the mirror descent and the variable metric…
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…
Quantum Monte Carlo belongs to the most accurate simulation techniques for quantum many-particle systems. However, for fermions, these simulations are hampered by the sign problem that prohibits simulations in the regime of strong…
Removing undesired reflections from images taken through the glass is of great importance in computer vision. It serves as a means to enhance the image quality for aesthetic purposes as well as to preprocess images in machine learning and…
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for…
We study one-dimensional QCD at finite quark density by using the sign optimization framework. The fermion sign problem is mitigated by deforming the path integral domain, $SU(3)$ to a complexified one ${\cal M} \subset SL(3)$, explicitly…
Based on the ideas of arXiv:1710.06612, we consider the problem of minimization of the Holder-continuous non-smooth functional $f$ with non-positive convex (generally, non-smooth) Lipschitz-continuous functional constraint. We propose some…
In this work, we theoretically and numerically discuss the time fractional subdiffusion-normal transport equation, which depicts a crossover from sub-diffusion (as $t\rightarrow 0$) to normal diffusion (as $t\rightarrow \infty$). Firstly,…
While road obstacle detection techniques have become increasingly effective, they typically ignore the fact that, in practice, the apparent size of the obstacles decreases as their distance to the vehicle increases. In this paper, we…
Ab initio path integral Monte Carlo (PIMC) simulations constitute the gold standard for the estimation of a broad range of equilibrium properties of a host of interacting quantum many-body systems spanning conditions from ultracold atoms to…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univariate representations describing the…
The sign problem of relativistic field theories at finite fermion chemical potential has been approached by deforming the domain of integration into complex field space. We present a method for selecting a deformed manifold of integration…
To accelerate the HMC with field transformation, we consider a variant of the trivializing map, the decimation map, which can be regarded as a coarse-graining transformation. Using the 2D $U(1)$ pure gauge model, combined with the guided…
CSP sparsification, introduced by Kogan and Krauthgamer (ITCS 2015), considers the following question: how much can an instance of a constraint satisfaction problem be sparsified (by retaining a reweighted subset of the constraints) while…