Related papers: On a subclass of tame problems

We consider concept generalization at a large scale in the diverse and natural visual spectrum. Established computational modes (i.e., rule-based or similarity-based) are primarily studied isolated and focus on confined and abstract problem…

Nested dichotomies are used as a method of transforming a multiclass classification problem into a series of binary problems. A tree structure is induced that recursively splits the set of classes into subsets, and a binary classification…

The study of complexity and optimization in decision theory involves both partial and complete characterizations of preferences over decision spaces in terms of real-valued monotones. With this motivation, and following the recent…

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

This paper formalizes a latent variable inference problem we call {\em supervised pattern discovery}, the goal of which is to find sets of observations that belong to a single ``pattern.'' We discuss two versions of the problem and prove…

Supervised learning is ubiquitous in medical image analysis. In this paper we consider the problem of meta-learning -- predicting which methods will perform well in an unseen classification problem, given previous experience with other…

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,…

A stationary random sequence admits under some assumptions a representation as the sum of two others: one of them is a martingale difference sequence, and another is a so-called coboundary. Such a representation can be used for proving some…

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

We prove that the number of parameters defining a complex of projective modules over a finite dimensional algebra is upper semi-continuous in families of algebras. Supposing that every algebra is either derived tame or derived wild, we get…

An attempt of a new kind of complexity anthropology is considered.

In this paper, we study three matching problems all of which came up quite recently in the field of machine teaching. The cost of a matching is defined in such a way that, for some formal model of teaching, it equals (or bounds) the number…

Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…

Classification is a ubiquitous and fundamental problem in artificial intelligence and machine learning, with extensive efforts dedicated to developing more powerful classifiers and larger datasets. However, the classification task is…

Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Let $\Lambda$ be a finite-dimensional basic algebra over an algebraically closed field $k$. The well-known Drozd's theorem asserts, that $\Lambda$ is either tame or wild. The Crawley-Boevey's Theorem states that for a given tame algebra…