Related papers: Generalized Tukey reducibility between $\sigma$-di…
This is a survey of recent work on the structure of Tukey reductions among analytic $\sigma$-ideals of compact subsets of compact metric spaces and analytic P-ideals of sets of natural numbers. An attempt is made to organize the results…
We investigate the Tukey order in the class of $F_\sigma$ ideals of subsets of $\omega$. We show that no nontrivial $F_\sigma$ ideal is Tukey below a $G_\delta$ ideal of compact sets. We introduce the notions of flat ideals and gradually…
Every directed set is Tukey equivalent to (a) the family of all compact subsets, ordered by inclusion, of a (locally compact) space, to (b) a neighborhood filter, ordered by reverse inclusion, of a point (of a compact space, and of a…
We give the first dimensionality reduction methods for the overconstrained Tukey regression problem. The Tukey loss function $\|y\|_M = \sum_i M(y_i)$ has $M(y_i) \approx |y_i|^p$ for residual errors $y_i$ smaller than a prescribed…
We introduce a new topological generalization of the $\sigma$-projective hierarchy, not limited to Polish spaces. Earlier attempts have replaced $^{\omega}\omega$ by $^{\kappa}\kappa$, for $\kappa$ regular uncountable, or replaced countable…
This article surveys results regarding the Tukey theory of ultrafilters on countable base sets. The driving forces for this investigation are Isbell's Problem and the question of how closely related the Rudin-Keisler and Tukey…
We prove that Solovay's set $\Sigma$ is generic over the ground model via a forcing notion whose order relation $\subseteq$-extends the given order relation.
The objective of this study is a better understanding of the relationships between reduction and continuity. Solovay reduction is a variation of Turing reduction based on the distance of two real numbers. We characterize Solovay reduction…
Depth of the Tukey median is investigated for empirical distributions. A sharper upper bound is provided for this value for data sets in general position. This bound is lower than the existing one in the literature, and more importantly…
We study a statistical data depth with respect to compact convex random sets which is consistent with the multivariate Tukey depth and the Tukey depth for fuzzy sets. In doing so, we provide a series of properties for statistical data depth…
We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…
This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…
In this paper, we investigate the relationship between the Tukey order and PCF theory, as applied to sets of regular cardinals. We show that it is consistent that for all sets $A$ of regular cardinals that the Tukey spectrum of $A$, denoted…
Let $G$ be a connected reductive group over a $p$-adic field $F$ of characteristic 0 and let $M$ be an $F$-Levi subgroup of $G.$ Given a discrete series representation $\sigma$ of $M(F),$ we prove that there exists a locally constant and…
We present here a PAC-Bayesian point of view on adaptive supervised classification. Using convex analysis, we show how to get local measures of the complexity of the classification model involving the relative entropy of posterior…
Is there a natural way to order data in dimension greater than one? The approach based on the notion of data depth, often associated with John Tukey, is among the most popular. Tukey's depth has found applications in robust statistics,…
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…
The original notion of Solovay reducibility was introduced by Robert M. Solovay (unpublished notes) in 1975 as a measure of relative randomness. The S2a-reducibility introduced by Xizhong Zheng and Robert Rettinger…