English
Related papers

Related papers: Uniform convergence of Vapnik--Chervonenkis classe…

200 papers

We initiate the study of effective pointwise ergodic theorems in resource-bounded settings. Classically, the convergence of the ergodic averages for integrable functions can be arbitrarily slow. In contrast, we show that for a class of…

Computational Complexity · Computer Science 2021-02-16 Satyadev Nandakumar , Subin Pulari

We prove that if a rectangular matrix with uniformly small entries and approximately orthogonal rows is applied to the independent standardized random variables with uniformly bounded third moments, then the empirical CDF of the resulting…

Probability · Mathematics 2007-06-14 Bernard Bercu , Wlodzimierz Bryc

We study partially hyperbolic homoclinic classes of $C^1$-generic diffeomorphisms with a one-dimensional central bundle, so that the central Lyapunov exponent $\chi^c(\mu)$ is well defined for any ergodic measure $\mu$ supported on the…

Dynamical Systems · Mathematics 2026-03-31 Camila Crispin , Lorenzo J. Díaz

Consider a topological dynamical system where the group is abelian and the topologies are locally compact and second-countable. Given an invariant measure for this system, we show that if its dynamical spectrum is contained in some Borel…

Dynamical Systems · Mathematics 2026-01-12 Michael Francis , Christopher Ramsey , Nicolae Strungaru

We introduce a new class of sparse sequences that are ergodic and pointwise universally $L^2$-good for ergodic averages. That is, sequences along which the ergodic averages converge almost surely to the projection to invariant functions.…

Dynamical Systems · Mathematics 2025-08-27 Sebastián Donoso , Alejandro Maass , Vicente Saavedra-Araya

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

Functional Analysis · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…

Logic · Mathematics 2018-02-08 Filippo Calderoni , Luca Motto Ros

In response to a 1997 problem of M. Vidyasagar, we state a necessary and sufficient condition for distribution-free PAC learnability of a concept class $\mathscr C$ under the family of all non-atomic (diffuse) measures on the domain…

Machine Learning · Computer Science 2010-11-08 Vladimir Pestov

Given a compact metric space $X$ and a probability measure in the $\sigma-$algebra of Borel subsets of $X$, we will establish a dominated convergence theorem for ultralimits of sequences of integrable maps and apply it to deduce a…

Dynamical Systems · Mathematics 2018-05-25 Maria Carvalho , Fernando Moreira

It is known that for $X$ a nowhere locally compact metric space, the set of bounded continuous, nowhere locally uniformly continuous real-valued functions on $X$ contains a dense $G_\delta$ set in the space $C_b(X)$ of all bounded…

General Topology · Mathematics 2021-05-21 Alexander J. Izzo

We develop a novel method, based on the statistical concept of the Vapnik-Chervonenkis dimension, to evaluate the selectivity (output cardinality) of SQL queries - a crucial step in optimizing the execution of large scale database and…

Databases · Computer Science 2015-03-18 Matteo Riondato , Mert Akdere , Ugur Cetintemel , Stanley B. Zdonik , Eli Upfal

We provide a unified framework to proving pointwise convergence of sparse sequences, deterministic and random, at the $L^1(X)$ endpoint. Specifically, suppose that \[ a_n \in \{ \lfloor n^c \rfloor, \min\{ k : \sum_{j \leq k} X_j = n\} \}…

Dynamical Systems · Mathematics 2026-03-10 Ben Krause , Yu-Chen Sun

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

Information Theory · Computer Science 2016-11-17 Maxim Raginsky

Consider a class of skew product transformations consisting of an ergodic or a periodic transformation on a probability space (M, B, m) in the base and a semigroup of transformations on another probability space (W,F,P) in the fibre. Under…

Dynamical Systems · Mathematics 2007-10-08 Julia Brettschneider

We resolve the topological version of the Erd\H{o}s Similarity conjecture introduced previously by Gallagher, Lai and Weber. We show that a set is topologically universal on ${\mathbb R}$ if and only if it is of strong measure zero. As a…

Classical Analysis and ODEs · Mathematics 2025-02-19 Yeonwook Jung , Chun-Kit Lai

We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…

Dynamical Systems · Mathematics 2015-03-13 Sergey Bezuglyi , Jan Kwiatkowski , Konstantin Medynets , Boris Solomyak

We characterize conditions under which collections of distributions on $\{0,1\}^\mathbb{N}$ admit uniform estimation of their mean. Prior work from Vapnik and Chervonenkis (1971) has focused on uniform convergence using the empirical mean…

Machine Learning · Computer Science 2026-01-19 Tanmay Devale , Pramith Devulapalli , Steve Hanneke

Let $(X,\mu)$ be an arbitrary measure space equipped with a family of pairwise commuting measure preserving transformations $T_1, \dotsc, T_m$. We prove that the ergodic averages \[ A_{N;X}^{P_1, \dotsc, P_m}f = \frac{1}{N} \sum_{n=1}^N…

Dynamical Systems · Mathematics 2024-11-13 Maximilian O'Keeffe

Let $T \colon M \to M$ be a nonuniformly expanding dynamical system, such as logistic or intermittent map. Let $v \colon M \to \mathbb{R}^d$ be an observable and $v_n = \sum_{k=0}^{n-1} v \circ T^k$ denote the Birkhoff sums. Given a…

Dynamical Systems · Mathematics 2022-10-19 Alexey Korepanov

We give a new proof of VC bounds where we avoid the use of symmetrization and use a shadow sample of arbitrary size. We also improve on the variance term. This results in better constants, as shown on numerical examples. Moreover our bounds…

Statistics Theory · Mathematics 2007-06-13 Olivier Catoni