Related papers: Full normalization for transfinite stacks
In this work, we establish near-linear and strong convergence for a natural first-order iterative algorithm that simulates Von Neumann's Alternating Projections method in zero-sum games. First, we provide a precise analysis of Optimistic…
The $\sigma$-irregularity index of a graph is defined as the sum of squared degree differences over all edges and provides a sensitive measure of structural heterogeneity. In this paper, we study the problem of maximizing $\sigma(T)$ among…
To model discriminative, i.e. competition induced, self-thinning in even-aged forest stands a concept has been explored that discriminative mortality alters spatial arrangement of trees which in turn alters the mortality. Function of…
We propose a renormalisation group inspired normalising flow that combines benefits from traditional Markov chain Monte Carlo methods and standard normalising flows to sample lattice field theories. Specifically, we use samples from a…
We address unsupervised discontinuous constituency parsing, where we observe a high variance in the performance of the only previous model in the literature. We propose to build an ensemble of different runs of the existing discontinuous…
In this paper, we extend the full replica symmetry breaking scheme to the Ising spin glass on a random regular graph. We propose a new martingale approach, that overcomes the limits of the Parisi-M\'ezard cavity method, providing a…
In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching…
Algorithms for model checking and satisfiability of the modal $\mu$-calculus start by converting formulas to alternating parity tree automata. Thus, model checking is reduced to checking acceptance by tree automata and satisfiability to…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
This paper provides a set of sensitivity analysis and activity identification results for a class of convex functions with a strong geometric structure, that we coined "mirror-stratifiable". These functions are such that there is a…
We describe a technique to reorganize topologies of Steiner trees by exchanging neighbors of adjacent Steiner points. We explain how to use the systematic way of building trees, and therefore topologies, to find the correct topology after…
We review the calculation of the the effective potential with particular emphasis on cases when the tree potential or the renormalisation-group-improved, radiatively corrected potential exhibits non-convex behaviour. We illustrate this in a…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Consideration of the primal and dual problems together leads to important new insights into the characteristics of boosting algorithms. In this work, we propose a general framework that can be used to design new boosting algorithms. A wide…
In this paper, we presented an efficient algorithm to implement the regularization reconstruction of SPECT. Image reconstruction with priori assumptions is usually modeled as a constrained optimization problem. However, there is no…
We initiate the study of affine actions of groups on $\Lambda$-trees for a general ordered abelian group $\Lambda$; these are actions by dilations rather than isometries. This gives a common generalisation of isometric action on a…
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations…
In Part I of this series, we introduced a class of notions of forcing which we call Sigma-Prikry, and showed that many of the known Prikry-type notions of forcing that center around singular cardinals of countable cofinality are…
Normalizing flows model probability distributions by learning invertible transformations that transfer a simple distribution into complex distributions. Since the architecture of ResNet-based normalizing flows is more flexible than that of…
Regularization is essential for avoiding over-fitting to training data in network optimization, leading to better generalization of the trained networks. The label noise provides a strong implicit regularization by replacing the target…