Related papers: Simple Models of Randomization and Preservation Th…

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

Regularization can mitigate the generalization gap between training and inference by introducing inductive bias. Existing works have already proposed various inductive biases from diverse perspectives. However, none of them explores…

For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…

Tractable generalizations of the Gaussian distribution play an important role for the analysis of high-dimensional data. One very general super-class of Normal distributions is the class of $\nu$-spherical distributions whose random…

Fisher [Fis75] and Baur [Bau75] showed independently in the seventies that if $T$ is a complete first-order theory extending the theory of modules, then the class of models of $T$ with pure embeddings is stable. In [Maz4, 2.12], it is asked…

The essential task of tensor data analysis focuses on the tensor decomposition and the corresponding notion of rank. In this paper, by introducing the notion of tensor Singular Value Decomposition (t-SVD), we establish a Regularized Tensor…

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding -- to the…

We (claim to) prove the extremely surprising fact that NP=RP. It is achieved by creating a Fully Polynomial-Time Randomized Approximation Scheme (FPRAS) for approximately counting the number of independent sets in bounded degree graphs,…

We consider ultraweak variational formulations for (parametrized) linear first order transport equations in time and/or space. Computationally feasible pairs of optimally stable trial and test spaces are presented, starting with a suitable…

Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number of random samples using Basis Pursuit (BP) or Orthogonal…

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

We prove that in a countable theory T fully stable over a predicate P, any complete set A has the existence property. This means that A can be extended to a model of T without changing the P-part. In particular, T has the Gaifman property:…

We consider nonlinear scalar conservation laws posed on a network. We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition. We apply standard finite volume methods and show stability and…

We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in…

We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…

We formulate a generalization of the Restricted Isometry Property (RIP) referred to as the Restricted Quasiconvexity Isometry Property (RQIP) for alpha stable random projections with $0<\alpha<1$. A lower bound on the number of rows for…

A trichotomy theorem for countable, stable, unsuperstable theories is offered. We develop the notion of a `regular ideal' of formulas and study types that are minimal with respect to such an ideal.

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

The stability of classical semi-implicit scheme, and some more advanced iterative schemes recently proposed for Numerical Weather Prediction (NWP) purpose is examined. In all these schemes, the solution of the centred-implicit non-linear…