Related papers: Some new maximum VC classes
One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this…
Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…
It is a long-standing open problem whether there always exists a compression scheme whose size is of the order of the Vapnik-Chervonienkis (VC) dimension $d$. Recently compression schemes of size exponential in $d$ have been found for any…
Motivated by quantum thermodynamics we first investigate the notion of strict positivity, that is, linear maps which map positive definite states to something positive definite again. We show that strict positivity is decided by the action…
We consider the problem of determining which classes of functions can be tested more efficiently than they can be learned, in the distribution-free sample-based model that corresponds to the standard PAC learning setting. Our main result…
The well-known Sauer lemma states that a family $\mathcal{F}\subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i=0}^d\binom{n}{i}$. We obtain both random and explicit constructions to prove that the corresponding…
For a nonempty compact set D of R we determine the maximal possible dimension of a subspace X of polynomial functions of degree at most m which possesses a positive bases (where positivity is understood on D). The exact value of this…
For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik-Chervonenkis (VC) dimension or (ii) for every epsilon > 0 there is a finite partition pi such the pi-boundary of each set has…
We establish a positivity property for a class of semilinear elliptic problems involving indefinite sublinear nonlinearities. Namely, we show that any nontrivial nonnegative solution is positive for a class of problems the strong maximum…
We exhibit a class of "relatively curved" $\vec{\gamma}(t) := (\gamma_1(t),\dots,\gamma_n(t))$, so that the pertaining multi-linear maximal function satisfies the sharp range of H\"{o}lder exponents, \[ \left\| \sup_{r > 0} \ \frac{1}{r}…
The probabilistic classification vector machine (PCVM) synthesizes the advantages of both the support vector machine and the relevant vector machine, delivering a sparse Bayesian solution to classification problems. However, the PCVM is…
The objective of the paper is to study accuracy of multi-class classification in high-dimensional setting, where the number of classes is also large ("large $L$, large $p$, small $n$" model). While this problem arises in many practical…
Uniform laws of large numbers form a cornerstone of Vapnik--Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under…
We present a maximal class of analytic functions, elements of which are in one-to-one correspondence with their asymptotic expansions. In recent decades it has been realized (B. Malgrange, J. Ecalle, J.-P. Ramis, Y. Sibuya et al.), that the…
The logical analysis of data, LAD, is a technique that yields two-class classifiers based on Boolean functions having disjunctive normal form (DNF) representation. Although LAD algorithms employ optimization techniques, the resulting binary…
Maximum VC classes which are stable in the sense of model theory are characterized.
The Sauer-Shelah-Perles Lemma is a cornerstone of combinatorics and learning theory, bounding the size of a binary hypothesis class in terms of its Vapnik-Chervonenkis (VC) dimension. For classes of functions over a $k$-ary alphabet, namely…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
We introduce a notion of subunit vector field for fully nonlinear degenerate elliptic equations. We prove that an interior maximum of a viscosity subsolution of such an equation propagates along the trajectories of subunit vector fields.…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…