Related papers: Override and update
Incremental computation has recently been studied using the concepts of change structures and derivatives of programs, where the derivative of a function allows updating the output of the function based on a change to its input. We…
When machine learning systems meet real world applications, accuracy is only one of several requirements. In this paper, we assay a complementary perspective originating from the increasing availability of pre-trained and regularly…
In this paper we presents further developments regarding the enrichment of the basic Theory of Order Completion. In particular, spaces of generalized functions are constructed that contain generalized solutions to all systems of continuous,…
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it…
We formulate the novel task of automatically updating an existing natural language comment based on changes in the body of code it accompanies. We propose an approach that learns to correlate changes across two distinct language…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…
Many convex optimization methods are conceived of and analyzed in a largely separate fashion. In contrast to this traditional separation, this manuscript points out and demonstrates the utility of an important but largely unremarked common…
A superposition rule is a particular type of map that enables one to express the general solution of certain systems of first-order ordinary differential equations, the so-called Lie systems, out of generic families of particular solutions…
The breakthrough of quantum error correction brought with it the picture of quantum information as a sort of combination of two complementary types of classical information, "amplitude" and "phase". Here I show how this intuition can be…
Computer programs are often factored into pure components -- simple, total functions from inputs to outputs -- and components that may have side effects -- errors, changes to memory, parallel threads, abortion of the current loop, etc. We…
In this paper, we build on recent work using a mathematical programming approach for incremental state update in analysis of non-linear mechanics models. In particular, we consider quasi-static analysis of continuum problems in the…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence…
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Reconfiguration paths express sequences of successive reconfiguration operations within a component-based approach allowing dynamic reconfigurations. We use constructs from regular expressions-pin particular, alternatives-to introduce…
For processes involving structure functions and/or fragmentation functions, arguments that there is a part that dominates the NLO corrections are briefly reviewed. The arguments are tested against more recent NLO and in particular NNLO…
In this paper, we obtain some new results on closed subschemes. Specially, we define natural addition and multiplication on the closed subschemes of a scheme. It is shown that "the multiplication" precisely coincides with the well known…
Motivated by an ongoing project on computer aided derivation of asymptotic models governed by partial differential equations, we introduce a class of term transformations that consists of traversal strategies and insertion of contexts. We…
Emerging computational paradigms, such as probabilistic and hybrid programming, introduce new primitive operations that often need to be combined with classic programming constructs. However, it still remains a challenge to provide a…