相关论文: Effective Localization number: building $k$-surviv…

In this paper the work done by Newelski and Roslanowski is revisited to solve a question done by Blass about one of the possible evasion and prediction numbers. This led to define a variation of the $k$-localization property (the…

The well known ideal presentations of countably based domains were recently extended to (effective) quasi-Polish spaces. Continuing these investigations, we explore some classes of effective quasi-Polish spaces. In particular, we prove an…

We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are…

We revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric spaces. We use this to show that effective local compactness…

We study the recently suggested effective Wadge hierarchy in effective spaces, concentrating on the non-collapse property. Along with hierarchies of sets, we study hierarchies of $k$-partitions which are interesting on their own. In…

The notion of effective topological complexity, introduced by B{\l}aszczyk and Kaluba, deals with using group actions in the configuration space in order to reduce the complexity of the motion planning algorithm. In this article we focus on…

We present a detailed study of cardinality-aware top-$k$ classification, a novel approach that aims to learn an accurate top-$k$ set predictor while maintaining a low cardinality. We introduce a new target loss function tailored to this…

We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of…

We intend to localize the selection principles in uniform spaces (Ko\v{c}inac, 2003) by introducing their local variations, namely locally $\Upsilon$-bounded spaces (where $\Upsilon$ is Menger, Hurewicz or Rothberger). It has been observed…

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Notwithstanding the popularity of conventional clustering algorithms such as K-means and probabilistic clustering, their clustering results are sensitive to the presence of outliers in the data. Even a few outliers can compromise the…

In this article, we develop and investigate a new classifier based on features extracted using spatial depth. Our construction is based on fitting a generalized additive model to the posterior probabilities of the different competing…

This paper is intended to survey the basics of localization and anti-localization cardinals on the reals, and its interplay with notions and cardinal characteristics related to measure and category.

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…

High\-cardinality categorical variables pose significant challenges in machine learning, particularly in terms of computational efficiency and model interpretability. Traditional one\-hot encoding often results in high\-dimensional sparse…

We highlight new results on the localization number of a graph, a parameter derived from the localization graph searching game. After introducing the game and providing an overview of existing results, we describe recent results on the…

We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…

Random hypothesis sampling lies at the core of many popular robust fitting techniques such as RANSAC. In this paper, we propose a novel hypothesis sampling scheme based on incremental computation of distances between partial rankings…

The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…