Related papers: A PBPO+ Graph Rewriting Tutorial
The state-of-the-art models for coreference resolution are based on independent mention pair-wise decisions. We propose a modelling approach that learns coreference at the document-level and takes global decisions. For this purpose, we…
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
In this paper we further the study of arrow algebras, simple algebraic structures inducing toposes through the tripos-to-topos construction, by defining appropriate notions of morphisms between them which correspond to morphisms of the…
In this paper, we present an interpolation framework for structure-preserving model order reduction of parametric bilinear dynamical systems. We introduce a general setting, covering a broad variety of different structures for parametric…
We address the problem of optimizing over functions defined on node subsets in a graph. The optimization of such functions is often a non-trivial task given their combinatorial, black-box and expensive-to-evaluate nature. Although various…
Given graphs as input, Graph Neural Networks (GNNs) support the inference of nodes, edges, attributes, or graph properties. Graph Rewriting investigates the rule-based manipulation of graphs to model complex graph transformations. We…
We study Active Model B+, a scalar field theory extending the paradigmatic Model B for equilibrium coexistence through including terms that do not arise from an underlying free energy functional and thus break detailed balance. In the first…
In this paper, we demonstrate that considering experiments in a graph-theoretic manner allows us to exploit automorphisms of the graph to reduce the number of evaluations of candidate designs for those experiments, and thus find optimal…
The graph based approach to multiple testing is an intuitive method that enables a study team to represent clearly, through a directed graph, its priorities for hierarchical testing of multiple hypotheses, and for propagating the available…
Designing responsive visualizations for various screen types can be tedious as authors must manage multiple chart~versions across design iterations. Automated approaches for responsive visualization must take into account the user's need…
In this article we review the basics of the phasor formalism in a rigorous way, highlighting the physical motivation behind it and presenting a hyperbolic counterpart of the phasor addition formula.
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
It is common in pose graph optimization (PGO) algorithms to assume that noise in the translations and rotations of relative pose measurements is uncorrelated. However, existing work shows that in practice these measurements can be highly…
The Graph Automata have been the paradigm in the expression of utilizing Graphs as a language. Matrix Graph grammars \cite{Pedro} are an algebratization of graph rewriting systems. Here we present the dual of this formalizm which some…
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem domain. In these problems, graphical demonstration of defined binary objects and solutions is the most…
DPO (Direct Preference Optimization) has become a widely used offline preference optimization algorithm due to its simplicity and training stability. However, DPO is prone to overfitting and collapse. To address these challenges, we propose…