Related papers: Simplex Subdivisions and Nonnegativity Decision of…
A method for constructing distributions on the non negative integers as discrete analogue of continuous distributions on the non negative real is presented. A justification of the definition of discrete self decomposable laws is provided.…
The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…
This Survey provides an overview of techniques in termination analysis for programs with numerical variables and transitions defined by linear constraints. This subarea of program analysis is challenging due to the existence of undecidable…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
Unsupervised learning aims at the discovery of hidden structure that drives the observations in the real world. It is essential for success in modern machine learning. Latent variable models are versatile in unsupervised learning and have…
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the…
This work is a study of the impact of multiple aspects in a classic unsupervised word sense disambiguation algorithm. We identify relevant factors in a decision rule algorithm, including the initial labeling of examples, the formalization…
Collaborative filtering (CF) is a widely studied research topic in recommender systems. The learning of a CF model generally depends on three major components, namely interaction encoder, loss function, and negative sampling. While many…
This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…
We study the problem of learning fair prediction models for unseen test sets distributed differently from the train set. Stability against changes in data distribution is an important mandate for responsible deployment of models. The domain…
Given a finite set $X$ of points in $R^n$ and a family $F$ of sets generated by the pairs of points of $X$, we determine volumetric and structural conditions for the sets that allow us to guarantee the existence of a positive-fraction…
For each $n \geq 1$, let $\{X_{j,n}\}_{1 \leq j \leq n}$ be a sequence of strictly stationary random variables. In this article, we give some asymptotic weak dependence conditions for the convergence in distribution of the point process…
We define a simple dependent type theory and prove that its well-formed types correspond exactly to finite inverse categories.
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
Annotating datasets is one of the main costs in nowadays supervised learning. The goal of weak supervision is to enable models to learn using only forms of labelling which are cheaper to collect, as partial labelling. This is a type of…
We discuss some notions of compactness and convergence relative to a specified family F of subsets of some topological space X. The two most interesting particular cases of our construction appear to be the following ones. (1) The case in…
This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…
Summability methods for ultraholomorphic classes in sectors, defined in terms of a strongly regular sequence $\mathbb{M}=(M_p)_{p\in\mathbb{N}_0}$, have been put forward by A. Lastra, S. Malek and the second author [1], and their validity…
The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…