English
Related papers

Related papers: On the Complexity of Binary Samples

200 papers

We show that the covering dimension, $\dim E$, of the closure $E$ of the interval $]-1,1[$ in the spectrum of $H^\infty$ equals one. Using Su\'arez's result that $\dim M(H^\infty)=2$, we then compute the Bass and topological stable ranks of…

Functional Analysis · Mathematics 2016-02-23 Raymond Mortini

Hyperspaces $\mathcal H(X)$ of all countable compact subsets of a metric space $X$ and $\mathcal A_n(X)$ of infinite compact subsets which have at most $n$ ($n\in\mathbb N$), or finitely many ($n=\omega$) or countably many ($n=\omega+1$)…

General Topology · Mathematics 2021-05-21 Taras Banakh , Paweł Krupski , Krzysztof Omiljanowski

We introduce a maximal inequality for a local empirical process under strongly mixing data. Local empirical processes are defined as the (local) averages $\frac{1}{nh}\sum_{i=1}^n \mathbf{1}\{x - h \leq X_i \leq x+h\}f(Z_i)$, where $f$…

Econometrics · Economics 2023-07-06 Luis Alvarez , Cristine Pinto

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

Functional Analysis · Mathematics 2016-10-26 Tomasz Kania , Tomasz Kochanek

We study the minimax settings of binary classification with F-score under the $\beta$-smoothness assumptions on the regression function $\eta(x) = \mathbb{P}(Y = 1|X = x)$ for $x \in \mathbb{R}^d$. We propose a classification procedure…

Statistics Theory · Mathematics 2019-05-13 Evgenii Chzhen

We measure the clustering of dark matter halos in a large set of collisionless cosmological simulations of the flat LCDM cosmology. Halos are identified using the spherical overdensity algorithm, which finds the mass around isolated peaks…

Cosmology and Nongalactic Astrophysics · Physics 2015-05-18 Jeremy L. Tinker , Brant E. Robertson , Andrey V. Kravtsov , Anatoly Klypin , Michael S. Warren , Gustavo Yepes , Stefan Gottlober

We analyse the convergence of sampling algorithms for functions in reproducing kernel Hilbert spaces (RKHS). To this end, we discuss approximation properties of kernel regression under minimalistic assumptions on both the kernel and the…

Machine Learning · Statistics 2025-04-21 Armin Iske

In this paper we consider the problem of finding the {\em densest} subset subject to {\em co-matroid constraints}. We are given a {\em monotone supermodular} set function $f$ defined over a universe $U$, and the density of a subset $S$ is…

Data Structures and Algorithms · Computer Science 2012-07-31 Venkatesan T. Chakaravarthy , Natwar Modani , Sivaramakrishnan R. Natarajan , Sambuddha Roy , Yogish Sabharwal

Binary hashing is a well-known approach for fast approximate nearest-neighbor search in information retrieval. Much work has focused on affinity-based objective functions involving the hash functions or binary codes. These objective…

Machine Learning · Computer Science 2016-02-05 Miguel Á. Carreira-Perpiñán , Ramin Raziperchikolaei

Let $A$ and $H$ be nonempty finite sets of integers and positive integers, respectively. The generalized $H$-fold sumset, denoted by $H^{(r)}A$, is the union of the sumsets $h^{(r)}A$ for $h\in H$ where, the sumset $h^{(r)}A$ is the set of…

Number Theory · Mathematics 2024-01-17 Mohan , Ram Krishna Pandey

Statistical inference in high-dimensional settings is challenging when standard unregularized methods are employed. In this work, we focus on the case of multiple correlated proportions for which we develop a Bayesian inference framework.…

Methodology · Statistics 2025-06-23 Max Westphal

Binary classification is a task that involves the classification of data into one of two distinct classes. It is widely utilized in various fields. However, conventional classifiers tend to make overconfident predictions for data that…

Machine Learning · Computer Science 2025-03-13 Shoma Yokura , Akihisa Ichiki

The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by…

Data Structures and Algorithms · Computer Science 2015-08-26 Per Austrin , Mikko Koivisto , Petteri Kaski , Jesper Nederlof

This work presents a numerical study of the Dirichlet problem for the fractional Laplacian $(-\Delta)^s$ with $s\in(0,1)$ using Finite Element methods with non-standard bases. Classical approaches based on piece-wise linear basis yield…

Numerical Analysis · Mathematics 2025-11-19 Félix del Teso , Stefano Fronzoni , David Gómez-Castro

We derive necessary density conditions for sampling and for interpolation in general reproducing kernel Hilbert spaces satisfying some natural conditions on the geometry of the space and the reproducing kernel. If the volume of shells is…

Functional Analysis · Mathematics 2018-04-03 Hartmut Führ , Karlheinz Gröchenig , Antti Haimi , Andreas Klotz , José Luis Romero

Let $X=\{x_i:i\in\mathbb{Z}\}$, $\dots<x_{i-1}<x_i<x_{i+1}<\dots$, be a sampling set which is separated by a constant $\gamma>0$. Under certain conditions on $\phi$, it is proved that if there exists a positive integer $\nu$ such that…

Classical Analysis and ODEs · Mathematics 2017-02-02 A. Antony Selvan

Let $\{x\_n\}\_{n\geq 0}$ be a sequence of $[0,1]^d$, $\{\lambda\_n\} \_{n\geq 0}$ a sequence of positive real numbers converging to 0, and $\delta>1$. Let $\mu$ be a positive Borel measure on $[0,1]^d$, $\rho\in (0,1]$ and $\alpha>0$.…

General Mathematics · Mathematics 2007-05-23 Julien Barral , Stephane Seuret

Very recently, motivated by the result of Bhatia and \v{S}emrl which characterizes the Birkhoff-James orthogonality of operators on a finite dimensional Hilbert space in terms of norm attaining points, the Bhatia-\v{S}emrl property was…

Functional Analysis · Mathematics 2021-05-04 Geunsu Choi , Sun Kwang Kim

This paper proposes a generic formulation that significantly expedites the training and deployment of image classification models, particularly under the scenarios of many image categories and high feature dimensions. As a defining…

Computer Vision and Pattern Recognition · Computer Science 2016-03-15 Fumin Shen , Yadong Mu , Wei Liu , Yang Yang , Heng Tao Shen

In 1976, Rauzy studied two complexity functions, $\underline{\beta}$ and $\overline{\beta}$, for infinite sequences over a finite alphabet. The function $\underline{\beta}$ achieves its maximum precisely for Borel normal sequences, while…

Information Theory · Computer Science 2025-06-09 Verónica Becher , Olivier Carton , Santiago Figueira