Related papers: The em-convex rewrite system
The motion of a continuum of matter subject to gravitational interaction is classically described by the Euler-Poisson system. Prescribing the density of matter at initial and final times, we are able to obtain weak solutions for this…
This paper introduces a new term rewriting system that is similar to the embedded read-back mechanism for interaction nets presented in our previous work, but is easier to follow than in the original setting and thus to analyze its…
We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM…
In the context of convex optimization problems in Hilbert spaces, we induce inertial effects into the classical ADMM numerical scheme and obtain in this way so-called inertial ADMM algorithms, the convergence properties of which we…
Numerous tasks at the core of statistics, learning and vision areas are specific cases of ill-posed inverse problems. Recently, learning-based (e.g., deep) iterative methods have been empirically shown to be useful for these problems.…
On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…
We study the properties of the multiplicative structure on valuations on convex sets. We prove a new version of the hard Lefschetz theorem for even translation invariant continuous valuations, and discuss related problems of integral…
This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin…
The inverted pendulum is a mechanical system with a rapidly oscillating pivot point. Using techniques similar in spirit to the methodology of effective field theories, we derive an effective Lagrangian that allows for the systematic…
In this paper, a new class of convex functions as a generalization of convexity which is called (h-m)-convex functions and some properties of this class is given. We also prove some Hadamard's type inequalities.
We present several results on the inverse problem and equivalent contactLagrangian systems. These problems naturally lead to consider smooth transformations on the z variable (i.e., reparametrizations of the action). We present the extended…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo were inspired by Knuth-Bendix completion, and introduced a confluent rewriting system that (1) extends the naive rewriting system, and (2) is stable…
We study the error of the number of points of a unimodular lattice that fall in a strictly convex and analytic set having the origin and that is dilated by a factor $t$. The aim is to generalize the result of a previous article. We first…
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
The inverse-free extreme learning machine (ELM) algorithm proposed in [4] was based on an inverse-free algorithm to compute the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of…
The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent to the well known…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
The Einstein-Maxwell (E-M) equations in a curved spacetime that admits at least one Killing vector are derived, from a Lagrangian density adapted to symmetries. In this context, an auxiliary space of potentials is introduced, in which, the…
We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability…