Related papers: Constructing a weak subset of a random set
It is notoriously difficult to build a bad Random Forest (RF). Concurrently, RF blatantly overfits in-sample without any apparent consequence out-of-sample. Standard arguments, like the classic bias-variance trade-off or double descent,…
This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…
Motivated in part by an observation that the zero forcing number for the complement of a tree on $n$ vertices is either $n-3$ or $n-1$ in one exceptional case, we consider the zero forcing number for the complement of more general graphs…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
Dealing with datasets of very high dimension is a major challenge in machine learning. In this paper, we consider the problem of feature selection in applications where the memory is not large enough to contain all features. In this…
The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…
We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…
A forcing set $S$ in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in $S$. An anti-forcing set is the symmetric concept: a set $S$ of elements is called an anti-forcing set…
Connected acyclic graphs (trees) are data objects that hierarchically organize categories. Collections of trees arise in a diverse variety of fields, including evolutionary biology, public health, machine learning, social sciences and…
The feeling that those two forcing notions-Cohen and Random-(equivalently the corresponding Boolean algebras Borel(R)/(meager sets), Borel(R)/(null sets)) are special, was probably old and widespread. A reasonable interpretation is to show…
Decision trees are an extremely popular machine learning technique. Unfortunately, overfitting in decision trees still remains an open issue that sometimes prevents achieving good performance. In this work, we present a novel approach for…
For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…
Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We are interested in the asymptotic behavior of $X_n(k)$ for intermediate levels $k=k_n$ satisfying $k_n\to\infty$ and $k_n=o(\log n)$ as…
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…
Random forests is a common non-parametric regression technique which performs well for mixed-type unordered data and irrelevant features, while being robust to monotonic variable transformations. Standard random forests, however, do not…
In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…
We propose methods for density estimation and data synthesis using a novel form of unsupervised random forests. Inspired by generative adversarial networks, we implement a recursive procedure in which trees gradually learn structural…
Linek's 1989 problem asks whether the numbers of independent sets of trees avoid infinitely many positive integers. We show that the set of natural numbers realized as the number of independent sets of a tree has a lower growth exponent of…