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.
- On the complexity of constrained VC-classes (Q2478433) (← links)
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy (Q2483204) (← links)
- Approximation by neural networks and learning theory (Q2489152) (← links)
- Empirical minimization (Q2494402) (← links)
- Pseudo-dimension and entropy of manifolds formed by affine-invariant dictionary (Q2509171) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- Approximation of Sobolev-type classes with quasi-seminorms (Q2566502) (← links)
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers (Q2576276) (← links)
- On the orders of nonlinear approximations for classes of functions of given form (Q2577348) (← links)
- Complexities of convex combinations and bounding the generalization error in classification (Q2583410) (← links)
- Local Rademacher complexities (Q2583411) (← links)
- A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
- On mean estimation for heteroscedastic random variables (Q2686600) (← links)
- Vapnik-Chervonenkis density in some theories without the independence property. I (Q2790718) (← links)
- Making Vapnik–Chervonenkis Bounds Accurate (Q2805721) (← links)
- Measuring the Capacity of Sets of Functions in the Analysis of ERM (Q2805728) (← links)
- Bounding Embeddings of VC Classes into Maximum Classes (Q2805735) (← links)
- Probabilistic Star Discrepancy Bounds for Double Infinite Random Matrices (Q2926218) (← links)
- On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer (Q3085585) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Convolutions of sets with bounded VC-dimension are uniformly continuous (Q3382236) (← links)
- General Error Estimates for the Longstaff–Schwartz Least-Squares Monte Carlo Algorithm (Q3387908) (← links)
- Convergence of a Least‐Squares Monte Carlo Algorithm for Bounded Approximating Sets (Q3395724) (← links)
- On the VC-dimension and boolean functions with long runs (Q3637825) (← links)
- On the VC-Dimension of Binary Codes (Q4583427) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- CONVERGENCE OF A LEAST‐SQUARES MONTE CARLO ALGORITHM FOR AMERICAN OPTION PRICING WITH DEPENDENT SAMPLE DATA (Q4635047) (← links)
- Metric Entropy for Functions of Bounded Total Generalized Variation (Q4964802) (← links)
- Spaces of algebraic measure trees and triangulations of the circle (Q4991821) (← links)
- On finite sets of small tripling or small alternation in arbitrary groups (Q4993110) (← links)
- Quantitative structure of stable sets in arbitrary finite groups (Q5002564) (← links)
- Ramsey properties of algebraic graphs and hypergraphs (Q5044389) (← links)
- On the geometry of polytopes generated by heavy-tailed random vectors (Q5066318) (← links)
- (Q5088983) (← links)
- (Q5091023) (← links)
- Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
- (Q5381119) (← links)
- A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)
- Learning When-to-Treat Policies (Q5857115) (← links)
- Finite sample properties of system identification of ARX models under mixing conditions (Q5926264) (← links)
- Improved bounds on the sample complexity of learning (Q5943102) (← links)
- Nonlinear approximations using sets of finite cardinality or finite pseudo-dimension (Q5946398) (← links)
- Nonexact oracle inequalities, \(r\)-learnability, and fast rates (Q6149162) (← links)
- Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy (Q6540045) (← links)
- Boosting simple learners (Q6566593) (← links)
- Optimal adjacency labels for subgraphs of Cartesian products (Q6581611) (← links)
- Robust estimation of a regression function in exponential families (Q6592783) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- An improved bound for regular decompositions of 3-uniform hypergraphs of bounded \(\mathrm{VC}_2\)-dimension (Q6628971) (← links)
