Related papers: fc: A Package for Generalized Function Composition…
Score matching is an estimation procedure that has been developed for statistical models whose probability density function is known up to proportionality but whose normalizing constant is intractable, so that maximum likelihood is…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
Having a function $f$ and a set of functionals $\{\mathcal{C}_{n}\}$, $c_n^f \equiv \mathcal{C}_n \left(f\right)$, one can interpret function approximation very generally as a construction of some function $\mathcal{A}_{N}^{f}$ such that…
In the present article, a new method for the evaluation of fractional derivatives of arbitrary real order is proposed. Numerous but inequivalent formulations have been given in the past. Some of them exhibit unsatisfactory properties such…
Merging has become a widespread way to cheaply combine individual models into a single model that inherits their capabilities and attains better performance. This popularity has spurred rapid development of many new merging methods, which…
Finite State Controllers (FSCs) are an effective way to represent sequential plans compactly. By imposing appropriate conditions on transitions, FSCs can also represent generalized plans that solve a range of planning problems from a given…
Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall…
We present a system of efficient methods for traversing and combining associative collection data structures. A distinguishing feature of the system is that, like traditional sequential iterator libraries, it does not require specialized…
Many automatic theorem-provers rely on rewriting. Using theorems as rewrite rules helps to simplify the subgoals that arise during a proof. LCF is an interactive theorem-prover intended for reasoning about computation. Its implementation of…
Functional data analysis has become a tool of interest in applied areas such as economics, medicine, and chemistry. Among the techniques developed in recent literature, functional semiparametric regression stands out for its balance between…
The topic of summarization evaluation has recently attracted a surge of attention due to the rapid development of abstractive summarization systems. However, the formulation of the task is rather ambiguous, neither the linguistic nor the…
Fuzzy Cognitive Maps (FCMs) are considered a soft computing technique combining elements of fuzzy logic and recurrent neural networks. They found multiple application in such domains as modeling of system behavior, prediction of time…
The paper introduces a novel representation for Generalized Planning (GP) problems, and their solutions, as C++ programs. Our C++ representation allows to formally proving the termination of generalized plans, and to specifying their…
Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the…
Fuzzing has become one of the most popular techniques to identify bugs in software. To improve the fuzzing process, a plethora of techniques have recently appeared in academic literature. However, evaluating and comparing these techniques…
Incorporating covariates into functional principal component analysis (PCA) can substantially improve the representation efficiency of the principal components and predictive performance. However, many existing functional PCA methods do not…
The Theory of Functional Connections (TFC) is a functional interpolation framework founded upon the so-called constrained expression: a functional that expresses the family of all possible functions that satisfy some user-specified, linear…
A new classification of real functions and other related real objects defined within a compact interval is proposed. The scope of the classification includes normal real functions and distributions in the sense of Schwartz, referred to…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
Functional decomposition is the process of breaking down a function $f$ into a composition $f=g(f_1,\dots,f_k)$ of simpler functions $f_1,\dots,f_k$ belonging to some class $\mathcal{F}$. This fundamental notion can be used to model…