Pages that link to "Item:Q1345876"
From MaRDI portal
The following pages link to Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876):
Displaying 50 items.
- A simple proof of the shallow packing lemma (Q282762) (← links)
- Linear and nonlinear approximation of spherical radial basis function networks (Q290797) (← links)
- Bounding the expectation of the supremum of an empirical process over a (weak) VC-major class (Q309534) (← links)
- VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
- Generalization ability of fractional polynomial models (Q461189) (← links)
- Discrepancy, chaining and subgaussian processes (Q533745) (← links)
- Monte Carlo algorithms for optimal stopping and statistical learning (Q558680) (← links)
- On combinatorial testing problems (Q605939) (← links)
- Optimal adaptive sampling recovery (Q618773) (← links)
- Covering numbers, dyadic chaining and discrepancy (Q647924) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Two-dimensional partial cubes (Q785580) (← links)
- Risk bounds for statistical learning (Q869973) (← links)
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy (Q876814) (← links)
- Sharp estimate on the supremum of a class of sums of small i.i.d. random variables (Q898400) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- Constrained versions of Sauer's Lemma (Q948694) (← links)
- Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression'' (Q972387) (← links)
- One-inclusion hypergraph density revisited (Q991799) (← links)
- Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path (Q1009248) (← links)
- A graph-theoretic generalization of the Sauer-Shelah lemma (Q1265742) (← links)
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension (Q1265746) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- On the learnability of rich function classes (Q1305934) (← links)
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
- Symmetrization approach to concentration inequalities for empirical processes. (Q1433892) (← links)
- On prediction of individual sequences (Q1583891) (← links)
- Bayesian predictiveness, exchangeability and sufficientness in bacterial taxonomy (Q1602623) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Covering numbers for bounded variation functions (Q1791562) (← links)
- Improved upper bounds for probabilities of uniform deviations (Q1907891) (← links)
- Point sets on the sphere \(\mathbb{S}^{2}\) with small spherical cap discrepancy (Q1930544) (← links)
- The Lasso as an \(\ell _{1}\)-ball model selection procedure (Q1952205) (← links)
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
- Optimal approximations made easy (Q2122796) (← links)
- Normal approximations for discrete-time occupancy processes (Q2196554) (← links)
- On weak \(\epsilon\)-nets and the Radon number (Q2223615) (← links)
- Tractability results for the weighted star-discrepancy (Q2251911) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model (Q2328061) (← links)
- Proof techniques in quasi-Monte Carlo theory (Q2347957) (← links)
- Model selection by bootstrap penalization for classification (Q2384135) (← links)
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
- Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
- Ranking and empirical minimization of \(U\)-statistics (Q2426626) (← links)
- Bracketing entropy and VC-dimension (Q2435838) (← links)
- Aspects of discrete mathematics and probability in the theory of machine learning (Q2478432) (← links)
- On the complexity of constrained VC-classes (Q2478433) (← links)
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy (Q2483204) (← links)
