Related papers: Inverse algorithm and triple point diagrams
One can see deep-learning models as compositions of functions within the so-called tame geometry. In this expository note, we give an overview of some topics at the interface of tame geometry (also known as o-minimality), optimization…
This is a brief review of my work on the correspondence between four-dimensional $\mathcal{N} = 1$ supersymmetric field theories realized by brane tilings and two-dimensional integrable lattice models. I explain how to construct integrable…
We study (orientifolded) toric Calabi-Yau singularities in search for D-brane configurations which lead to dynamical supersymmetry breaking at low energy. By exploiting dimer techniques we are able to determine that while most realizations…
Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3D) volumes while considering its real-time implementation. The first algorithm, referred…
Topological concepts open many new horizons for photonic devices, from integrated optics to lasers. The complexity of large scale topological devices asks for an effective solution of the inverse problem: how best to engineer the topology…
We consider the Dirichlet-to-Neumann operator and the direct and inverse Calder\'on's mappings appearing in the Inverse Problem of recovering a smooth bounded and positive isotropic conductivity of a material filling a smooth bounded domain…
Recently, mirror symmetry is derived as T-duality applied to gauge systems that flow to non-linear sigma models. We present some of its applications to study quantum geometry involving D-branes. In particular, we show that one can employ…
In this paper we investigate a variety of deep learning strategies for solving inverse problems. We classify existing deep learning solutions for inverse problems into three categories of Direct Mapping, Data Consistency Optimizer, and Deep…
Learned iterative reconstruction algorithms for inverse problems offer the flexibility to combine analytical knowledge about the problem with modules learned from data. This way, they achieve high reconstruction performance while ensuring…
We extend the dictionary between Type IIB branes and representations of the Ding-Iohara-Miki (DIM) algebra to the case when one of the space directions is a circle. It is well-known that the worldvolume theory on branes wrapping the circle…
The field content and interactions of almost all known gauge theories in AdS_5/CFT_4 can be expressed in terms of dimer models or bipartite graphs drawn on a torus. Associated with the fundamental cell is a complex structure parameter…
The present paper studies so-called deep image prior (DIP) techniques in the context of ill-posed inverse problems. DIP networks have been recently introduced for applications in image processing; also first experimental results for…
In this work, we design a multi-category inverse design neural network to map ordered periodic structure to physical parameters. The neural network model consists of two parts, a classifier and Structure-Parameter-Mapping (SPM) subnets. The…
In this work, following the Discrete de Rham (DDR) paradigm, we develop an arbitrary-order discrete divdiv complex on general polyhedral meshes. The construction rests 1) on discrete spaces that are spanned by vectors of polynomials whose…
In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model checking, hardware verification, cryptanalysis, computer…
In many applications, we need algorithms which can align partially overlapping point sets and are invariant to the corresponding transformations. In this work, a method possessing such properties is realized by minimizing the objective of…
Given a brane tiling, that is, a bipartite graph on a torus, we can associate with it a singular 3-Calabi-Yau variety. Using the brane tiling, we can also construct all crepant resolutions of the above variety. We give an explicit toric…
Spingarn's method of partial inverses has found many applications in nonlinear analysis and in optimization. We show that it can be employed to solve composite monotone inclusions in duality, thus opening a new range of applications for the…
In this paper we present simplifying techniques which allow one to compute the quiver diagrams for various D-branes at (non-Abelian) orbifold singularities with and without discrete torsion. The main idea behind the construction is to take…
The fast multipole method (FMM) performs fast approximate kernel summation to a specified tolerance $\epsilon$ by using a hierarchical division of the domain, which groups source and receiver points into regions that satisfy local…