Related papers: Labeled compression schemes for extremal classes
Deep neural networks excel in supervised learning tasks but are constrained by the need for extensive labeled data. Self-supervised learning emerges as a promising alternative, allowing models to learn without explicit labels. Information…
The study of strategic or adversarial manipulation of testing data to fool a classifier has attracted much recent attention. Most previous works have focused on two extreme situations where any testing data point either is completely…
We present a connection between two seemingly disparate fields: VC-theory and graph theory. This connection yields natural correspondences between fundamental concepts in VC-theory, such as shattering and VC-dimension, and well-studied…
We propose a novel Riemannian method for solving the Extreme multi-label classification problem that exploits the geometric structure of the sparse low-dimensional local embedding models. A constrained optimization problem is formulated as…
A semilinear relation S is max-closed if it is preserved by taking the componentwise maximum. The constraint satisfaction problem for max-closed semilinear constraints is at least as hard as determining the winner in Mean Payoff Games, a…
A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…
We generalize the Bernstein-Walsh-Siciak theorem on polynomial approximation in $\mathbb{C}^n$ to the case where the polynomial ring $\mathcal{P}(\mathbb{C}^n)$ is replaced by a subring $\mathcal{P}^S(\mathbb{C}^n)$ consisting of all…
We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points…
The category of weight modules $L_k(\mathfrak{sl}_2)\text{-wtmod}$ of the simple affine vertex algebra of $\mathfrak{sl}_2$ at an admissible level $k$ is neither finite nor semisimple and modules are usually not lower-bounded and have…
Semidefinite programming (SDP) provides a powerful relaxation for the maximum cut problem. For a graph with rational weights, the decision problem of whether the SDP relaxation for the maximum cut problem is exact is known to be $NP$-hard;…
We develop and analyze a class of maximum bound preserving schemes for approximately solving Allen--Cahn equations. We apply a $k$th-order single-step scheme in time (where the nonlinear term is linearized by multi-step extrapolation), and…
The holomorphic endomorphism f of projective space is called post-critically finite (PCF) if the forward image of the critical locus, under iteration of f, has algebraic support (i.e., is a finite union of hypersurfaces). In the case of…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…
In this paper we give a detailed proof of the classification of extremal (=massless) unitary highest weight representations in the Neveu Schwarz and Ramond sectors of the big $N=4$ superconformal algebra which can be found in [5]. Our…
The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary…
This paper introduces the \emph{$d$-distance $b$-matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges, an integer $d\in\mathbb{Z}_+$ and a degree bound function…
In this review articel we study the gaugings of extended supergravity theories in various space-time dimensions. These theories describe the low-energy limit of non-trivial string compactifications. For each theory under consideration we…
Currently available models for spatial extremes suffer either from inflexibility in the dependence structures that they can capture, lack of scalability to high dimensions, or in most cases, both of these. We present an approach to spatial…
One of the drawbacks of conventional grand unification scenarios has been that the unification scale is too high to permit direct exploration. In this paper, we show that the unification scale can be significantly lowered (perhaps even to…
This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…