Related papers: Full normalization for transfinite stacks
We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…
Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
Machine learning techniques, in particular the so-called normalizing flows, are becoming increasingly popular in the context of Monte Carlo simulations as they can effectively approximate target probability distributions. In the case of…
Theoretical analyses of evolution strategies are indispensable for gaining a deep understanding of their inner workings. For constrained problems, rather simple problems are of interest in the current research. This work presents a…
In this work in progress, we demonstrate a new use-case for the ENIGMA system. The ENIGMA system using the XGBoost implementation of gradient boosted decision trees has demonstrated high capability to learn to guide the E theorem prover's…
We consider products of $\psi$ classes and products of $\omega$ classes on $\overline{M}_{0,n+3}$. For each product, we construct a flat family of subschemes of $\overline{M}_{0,n+3}$ whose general fiber is a complete intersection…
Decision Trees have remained a popular machine learning method for tabular datasets, mainly due to their interpretability. However, they lack the expressiveness needed to handle highly nonlinear or unstructured datasets. Motivated by recent…
This work establishes a rigorous theoretical foundation for analyzing deep learning systems by leveraging Infinite Time Turing Machines (ITTMs), which extend classical computation into transfinite ordinal steps. Using ITTMs, we reinterpret…
We propose a generic termination proof method for rewriting under strategies, based on an explicit induction on the termination property. Rewriting trees on ground terms are modeled by proof trees, generated by alternatively applying…
Decision trees are popular classification models, providing high accuracy and intuitive explanations. However, as the tree size grows the model interpretability deteriorates. Traditional tree-induction algorithms, such as C4.5 and CART,…
We give an intuitive method--using local, cyclic replica symmetry--to isolate exponential tree decay in truncated (connected) correlations. We give an expansion and use the symmetry to show that all terms vanish, except those displaying…
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run…
In a small-step semantics with a deterministic reduction strategy, refocusing is a transformation that connects a reduction-based normalization function (i.e., a normalization function that enumerates the successive terms in a reduction…
A tentative proposal is demonstrated that there is a natural strategy to get rid of unphysical (UV) infinities in QFTs if one adopts the modern standard point of view that a fundamental theory that is complete and well-defined in all…
Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. We consider factorizations $\Gamma\xrightarrow{f} M\xrightarrow{g} G$ of $\varphi$ such that either $g$ or $f$ are universal normal maps (namely, crossed modules). These two…
We will introduce a notion of normal subshifts. A subshift $(\Lambda,\sigma)$ is said to be normal if it satisfies a certain synchronizing property called $\lambda$-synchronizing and is infinite as a set. We have lots of purely infinite…
We study a systematic improvement of perturbation theory for gauge fields on the lattice [hep-lat/0606001]; the improvement entails resumming, to all orders in the coupling constant, a dominant subclass of tadpole diagrams. This method,…
We introduce a new prescription for quantising scalar field theories perturbatively around a true minimum of the full quantum effective action, which is to `complete normal order' the bare action of interest. When the true vacuum of the…
We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that…