Related papers: Evolving Local Corrections for Global Construction…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose a new graph convolutional neural network model for learning branch-and-bound variable selection policies, which leverages the natural…
This thesis provides an explanation of L\'aszl\'o Babai's quasi-polynomial algorithm for the Graph Isomorphism Problem published in 2015 with a particular focus on the case of local certificates, i.e. the case that cannot be dealt with by…
Many combinatorial optimization problems can be approximated within $(1 \pm \epsilon)$ factors in $\text{poly}(\log n, 1/\epsilon)$ rounds in the LOCAL model via network decompositions [Ghaffari, Kuhn, and Maus, STOC 2018]. These approaches…
This article is concerned with the derivation of numerical reconstruction schemes for the inverse moving source problem on determining source profiles in (time-fractional) evolution equations. As a continuation of the theoretical result on…
The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite…
Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Tur\'an problems in $2$-colorings of the edges of the complete graph $K_n$ that deal with the appearance of unavoidable patterns once a…
In inverse problems, the use of an $\ell_{12}$ analysis regularizer induces a bias in the estimated solution. We propose a general refitting framework for removing this artifact while keeping information of interest contained in the biased…
The lack of regularity of geometric variables at the origin is often a source of serious problem for spherically symmetric evolution codes in numerical relativity. One usually deals with this by restricting the gauge and solving the…
We design a new iterative algorithm, called REINFORCE-OPT, for solving a general type of optimization problems. This algorithm parameterizes the solution search rule and iteratively updates the parameter using a reinforcement learning (RL)…
Global transformations form a categorical framework adapting graph transformations to describe fully synchronous rule systems on a given data structure.In this work we focus on data structures that can be captured as presheaves and study…
In exploratory factor analysis, rotation techniques are employed to derive interpretable factor loading matrices. Factor rotations deal with equality-constrained optimization problems aimed at determining a loading matrix based on measure…
Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix preconditioning methods are prohibitively expensive. We show how…
We study the growth of degrees in many autonomous and non-autonomous lattice equations defined by quad rules with corner boundary values, some of which are known to be integrable by other characterisations. Subject to an enabling…
Parity compilation is the challenge of laying out the required constraints for the parity mapping in a local way. We present the first constructive compilation algorithm for the parity architecture using plaquettes for arbitrary…
A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…
With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…
We discuss a new method to solve in a semianalytical way the Dokshitzer-Gribov-Lipatov-Altarelli-Parisi evolution equations at NLO order in the x-space. The method allows to construct an evolution operator expressed in form of a rapidly…
An undirected graph consists of a set of vertices and a set of undirected edges between vertices. Such a graph may contain an abundant number of cycles, then a feedback vertex set (FVS) is a set of vertices intersecting with each of these…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…