Related papers: Domain closure conditions and definability preserv…

The majority of traditional classification ru les minimizing the expected probability of error (0-1 loss) are inappropriate if the class probability distributions are ill-defined or impossible to estimate. We argue that in such cases class…

This survey is devoted to discussing the problems of the unique determination of surfaces that are the boundaries of (generally speaking) nonconvex domains. First (in Sec. 2) we examine some results on the problem of the unique…

We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…

Recent advances in unsupervised domain adaptation have shown that mitigating the domain divergence by extracting the domain-invariant representation could significantly improve the generalization of a model to an unlabeled data domain.…

We address various notions of shadowing and expansivity for continuous maps restricted to a proper subset of their domain. We prove new equivalences of shadowing and expansive properties, we demonstrate under what conditions certain…

Domain generalization (DG) is the problem of generalizing from several distributions (or domains), for which labeled training data are available, to a new test domain for which no labeled data is available. For the prevailing benchmark…

Goal recognition is the problem of recognizing the intended goal of autonomous agents or humans by observing their behavior in an environment. Over the past years, most existing approaches to goal and plan recognition have been ignoring the…

The partition function with boundary conditions for various two-dimensional Ising models is examined and previously unobserved properties of conformal invariance and universality are established numerically.

Conventionally, AI models are thought to trade off explainability for lower accuracy. We develop a training strategy that not only leads to a more explainable AI system for object classification, but as a consequence, suffers no perceptible…

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Determining a stability domain, i.e. a set of equilibria for which a dynamical system remains stable, is a core problem in control. When dealing with controlled systems, the problem is generally transformed into a robustness analysis…

Necessary and sufficient conditions for the solvability of boundary value problems for a family of functional differential equations with a non-integrable singularity are obtained.

A probabilistic database with attribute-level uncertainty consists of relations where cells of some attributes may hold probability distributions rather than deterministic content. Such databases arise, implicitly or explicitly, in the…

In this paper we deal with defects inside defects in systems of two scalar fields in 3+1 dimensions. The systems we consider are defined by potentials containing two real scalar fields, and so we are going to investigate domain ribbons…

In this article we consider area preserving diffeomorphisms of planar domains, and we are interested in their conformal points, i.e., points at which the derivative is a similarity. We present some conditions that guarantee existence of…

The purpose of this article is to explore the properties of integrable, purely transmitting, defects placed at the junctions of several one-dimensional domains within a network. The defect sewing conditions turn out to be quite restrictive…

Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…

These lectures present results and problems on the characterization of structurally stable dynamics. We will shed light those which do not seem to depend on the regularity class (holomorphic or differentiable). Furthermore, we will present…

We obtain some rigidity results for overdetermined boundary value problems for singular solutions in bounded domains.

We introduce two criteria to regularize the optimization involved in learning a classifier in a domain where no annotated data are available, leveraging annotated data in a different domain, a problem known as unsupervised domain…