Related papers: On teaching sets of k-threshold functions

We deal with the following closely related problems: (i) For a germ of a reduced plane analytic curve, what is the minimal degree of an algebraic curve with a singular point analytically equivalent (isomorphic) to the given one? (ii) For a…

Let $X \subset \mathbb{P}^{n+1}$ be a smooth Fano hypersurface of dimension $n$ and degree $d$. The derived category of coherent sheaves on $X$ contains an interesting subcategory called the Kuznetsov component $\mathcal{A}_X$. We show that…

We say that a set of points $S\subset \mathbb{R}^d$ is an $\varepsilon$-nearly $k$-distance set if there exist $1\le t_1\le \ldots\le t_k,$ such that the distance between any two distinct points in $S$ falls into…

Few-shot Learning aims to learn classifiers for new classes with only a few training examples per class. Existing meta-learning or metric-learning based few-shot learning approaches are limited in handling diverse domains with various…

Few-shot learning is a challenging area of research that aims to learn new concepts with only a few labeled samples of data. Recent works based on metric-learning approaches leverage the meta-learning approach, which is encompassed by…

It is shown that for deep neural networks, a single wide layer of width $N+1$ ($N$ being the number of training samples) suffices to prove the connectivity of sublevel sets of the training loss function. In the two-layer setting, the same…

We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that every graph G with diameter at most d and connectivity at least…

We obtain precise plateau estimates for the two-point function of the finite-volume weakly-coupled hierarchical $|\varphi|^4$ model in dimensions $d \ge 4$, for both free and periodic boundary conditions, and for any number $n \ge 1$ of…

We study the distance set problem for pairs of compact sets $A, B\subset \mathbb{R}^n$, $n\geq 2$. We show that if $B$ is contained in a hyperplane and \begin{align*} \dim_{H} A+\dim_{H} B>n, \end{align*} then the distance set $…

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

Automatic discovery of category-specific 3D keypoints from a collection of objects of some category is a challenging problem. One reason is that not all objects in a category necessarily have the same semantic parts. The level of difficulty…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

In this paper, we give a geometric interpretation of optimal functionals in the context of intersection of symmetry planes and cyclic polytopes. For 1D CFTs, we demonstrate that at given derivative order, the functional is given by a…

Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…

Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardness results for the problem of finding a low degree polynomial…

In this paper, the concepts of $K$-subset systems and $k$-well-filtered spaces are introduced, which provide another uniform approach to $d$-spaces, $s$-well-filtered spaces (i.e., $\mathcal{U}_{S}$-admissibility) and well-filtered spaces.…

In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several…

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Persistent cycles, especially the minimal ones, are useful geometric features functioning as augmentations for the intervals in a purely topological persistence diagram (also termed as barcode). In our earlier work, we showed that computing…