Related papers: Unlabeled Compression Schemes Exceeding the VC-dim…
The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…
In 2008, Vallentin made a conjecture involving the least distortion of an embedding of a distance-regular graph into Euclidean space. Vallentin's conjecture implies that for a least distortion Euclidean embedding of a distance-regular graph…
It is generally well understood that predictive classification and compression are intrinsically related concepts in information theory. Indeed, many deep learning methods are explained as learning a kind of compression, and that better…
In this note, we investigate the performance of the PCM scheme with linear quantization rule for quantizing unit-norm tight frame expansions for ${\mathbb R}^d$ without the White Noise Hypothesis. In \cite{WX}, Wang and Xu showed that for…
Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as…
We call a periodic ball packing in d-dimensional Euclidean space periodically (strictly) jammed with respect to a period lattice if there are no nontrivial motions of the balls that preserve the period (that maintain some period with…
This paper shows that simply prescribing "none of the above" labels to unlabeled data has a beneficial regularization effect to supervised learning. We call it universum prescription by the fact that the prescribed labels cannot be one of…
We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypotheses grow exponentially large. Such asymptotic analysis…
Ultrasound image compression by preserving speckle-based key information is a challenging task. In this paper, we introduce an ultrasound image compression framework with the ability to retain realism of speckle appearance despite achieving…
Theoretical developments on cross validation (CV) have mainly focused on selecting one among a list of finite-dimensional models (e.g., subset or order selection in linear regression) or selecting a smoothing parameter (e.g., bandwidth for…
In the realm of machine learning theory, to prevent unnatural coding schemes between teacher and learner, No-Clash Teaching Dimension was introduced as provably optimal complexity measure for collusion-free teaching. However, whether…
We give a short proof that Strassen's asymptotic rank conjecture implies that for every $\varepsilon > 0$ there exists a $(3/2^{2/3} + \varepsilon)^n$-time algorithm for set cover on a universe of size $n$ with sets of bounded size. This…
This reply shows that the argument presented in the comment by Jorg and Krzakala (cond mat 0709.0894) cannot be used to weaken the results presented in our paper on ultrametricity evidence in the 3d Edwards Anderson model (PRL 99, 057206,…
The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that…
Let $P$ be a partially ordered set. The function $\mbox{La}^{\#}(n,P)$ denotes the size of the largest family $\mathcal{F}\subset 2^{[n]}$ that does not contain an induced copy of $P$. It was proved by Methuku and P\'alv\"olgyi that there…
A family of sets is union-closed (UC) if the union of any two sets in the family is also in the family. Frankl's UC sets conjecture states that for any nonempty UC family $\mathcal{F} \subseteq 2^{[n]}$ such that $\mathcal{F} \neq…
In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…
We tackle the problem of unsupervised visual descriptors compression, which is a key ingredient of large-scale image retrieval systems. While the deep learning machinery has benefited literally all computer vision pipelines, the existing…
A classical result of Erd\H{o}s, Lov\'asz and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs is equal to the number of non-trivial connected…
We propose a realistic scenario for the unsupervised video learning where neither task boundaries nor labels are provided when learning a succession of tasks. We also provide a non-parametric learning solution for the under-explored problem…