Related papers: Rank Selection and Depth Conditions for Balanced S…

It is natural to ask: what kinds of matrices satisfy the Restricted Eigenvalue (RE) condition? In this paper, we associate the RE condition (Bickel-Ritov-Tsybakov 09) with the complexity of a subset of the sphere in $\R^p$, where $p$ is the…

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…

Given a map of simplicial topological spaces, mild conditions on degeneracies and the levelwise maps imply that the geometric realization of the simplicial map is a cofibration. These conditions are not formal consequences of model category…

Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\em…

We show that if a simplicial complex is a near-cone of sufficiently high depth, then the only maximum families of small pairwise intersecting faces are those with a common intersection. Thus, near-cones of sufficiently high depth satisfy…

The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…

We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…

We determine simplicity criteria in characteristics 0 and $p$ for a ubiquitous class of iterated skew polynomial rings in two indeterminates over a base ring. One obstruction to simplicity is the possible existence of a canonical normal…

In this note we show that a semisimplicial set with the weak Kan condition admits a simplicial structure, provided any object allows an idempotent self-equivalence. Moreover, any two choices of simplicial structures give rise to equivalent…

We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…

It is shown that certain lower semi-continuous maps from a paracompact space to the family of closed subsets of the bundle space of a Banach bundle admit continuous selections. This generalization of the theorem of Douady, dal…

We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…

To explain the decision of any model, we extend the notion of probabilistic Sufficient Explanations (P-SE). For each instance, this approach selects the minimal subset of features that is sufficient to yield the same prediction with high…

Let (V,A) be a weighted graph with a finite vertex set V, with a symmetric matrix of nonnegative weights A and with Laplacian $\Delta$. Let $S_*:V\times V\mapsto{\mathbb{R}}$ be a symmetric kernel defined on the vertex set V. Consider n…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…

We introduce random-kernel networks, a multilayer extension of random feature models where depth is created by deterministic kernel composition and randomness enters only in the outermost layer. We prove that deeper constructions can…

We prove that arbitrary simplicial manifolds satisfy Kan conditions in a suitable local sense. This allows us to expand a technique for differentiating higher Lie groupoids worked out in current research to the setting of general simplicial…

This is the second of a series of articles devoted to the study of relaxed highest-weight modules over affine vertex algebras and W-algebras. The first studied the simple "rank-$1$" affine vertex superalgebras $L_k(\mathfrak{sl}_2)$ and…

In recent years, saliency ranking has emerged as a challenging task focusing on assessing the degree of saliency at instance-level. Being subjective, even humans struggle to identify the precise order of all salient instances. Previous…

Let $\Delta$ be a simplicial complex on $V = \{x_1,...,x_n\}$, with Stanley-Reisner ideal $I_{\Delta}\subseteq R = k[x_1,...,x_n]$. The goal of this paper is to investigate the class of artinian algebras $A=A(\Delta,a_1,...,a_n)=…