Related papers: Decrement Operators in Belief Change
We consider the problem of low-rank decomposition of incomplete multiway tensors. Since many real-world data lie on an intrinsically low dimensional subspace, tensor low-rank decomposition with missing entries has applications in many data…
Weakly centered and spectrally weakly cenetered weighted composition operators in $L^2$-spaces are characterized. Criteria for existence of invariant subspaces are given. Additional results and examples are supplied.
It has been recently pointed out that dynamical systems depending on future values of the unknowns may be useful in different areas of knowledge. We explore in this context the extension of the concept of order reduction that has been…
In many applications of interacting systems, we are only interested in the dynamic behavior of a subset of all possible active species. For example, this is true in combustion models (many transient chemical species are not of interest in a…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
We introduce novel dynamic oracles for training two of the most accurate known shift-reduce algorithms for constituent parsing: the top-down and in-order transition-based parsers. In both cases, the dynamic oracles manage to notably…
The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that…
We study the general approach to accelerating the convergence of the most widely used solution method of Markov decision processes with the total expected discounted reward. Inspired by the monotone behavior of the contraction mappings in…
Machine reading comprehension (MRC) that requires discrete reasoning involving symbolic operations, e.g., addition, sorting, and counting, is a challenging task. According to this nature, semantic parsing-based methods predict interpretable…
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan less constrained and the other is to minimize its parallel…
In this paper, we study a class of convolution operators on the space of distributions that enlarge the well-studied class of passive operators. In this larger class, we are able to associate, to each operator, a holomorphic function in the…
In [5] the authors suggested a new algorithm for the numerical approximation of a BSDE by merging the cubature method with the first order discretization developed by [3] and [16]. Though the algorithm presented in [5] compared…
We introduce the notion of implicit predictors, which characterize the input-(state)-output prediction behavior underlying a predictive control scheme, even if it is not explicitly enforced as an equality constraint (as in traditional model…
We introduce and study in a general setting the concept of homogeneity of an operator and, in particular, the notion of homogeneity of an integral operator. In the latter case, homogeneous kernels of such operators are also studied. The…
We are studying here the classical operator creating secondary polynomials associated with an orthogonal system for a continuous probability density function on a real interval. We know it is possible with the coupling of Stietjes…
We present new proofs of termination of evaluation in reduction semantics (i.e., a small-step operational semantics with explicit representation of evaluation contexts) for System F with control operators. We introduce a modified version of…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
Many different types of fractional calculus have been proposed, which can be organised into some general classes of operators. For a unified mathematical theory, results should be proved in the most general possible setting. Two important…
We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclicity, where $\mathcal F$ is the family of subsets of the natural numbers containing arbitrarily long arithmetic progressions. We prove several…
Deep learning models in recommender systems are usually trained in the batch mode, namely iteratively trained on a fixed-size window of training data. Such batch mode training of deep learning models suffers from low training efficiency,…