Pages that link to "Item:Q1342520"
From MaRDI portal
The following pages link to Predicting \(\{ 0,1\}\)-functions on randomly drawn points (Q1342520):
Displaying 50 items.
- Classic learning (Q676240) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Learning commutative deterministic finite state automata in polynomial time (Q749224) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Two-dimensional partial cubes (Q785580) (← links)
- Risk bounds for statistical learning (Q869973) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (Q1014429) (← links)
- Equivalence of models for polynomial learnability (Q1183606) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- Learning with unreliable boundary queries (Q1271553) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Characterizing rational versus exponential learning curves (Q1370864) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- On the complexity of learning from drifting distributions (Q1376422) (← links)
- Learning nested differences in the presence of malicious noise (Q1390947) (← links)
- Relative expected instantaneous loss bounds (Q1604219) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Apple tasting. (Q1854360) (← links)
- Improved lower bounds for learning from noisy examples: An information-theoretic approach (Q1854425) (← links)
- Exploiting random walks for learning (Q1854545) (← links)
- Efficient algorithms for learning functions with bounded variation (Q1887165) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- The true sample complexity of active learning (Q1959593) (← links)
- (Machine) learning parameter regions (Q2024444) (← links)
- Sharpness estimation of combinatorial generalization ability bounds for threshold decision rules (Q2034842) (← links)
- Distribution-free robust linear regression (Q2113267) (← links)
- On partial cubes, well-graded families and their duals with some applications in graphs (Q2192079) (← links)
- The power of random counterexamples (Q2290678) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- On density of subgraphs of halved cubes (Q2311351) (← links)
- Optimality of SVM: novel proofs and tighter bounds (Q2333789) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- A new PAC bound for intersection-closed concept classes (Q2384136) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- Bounding Embeddings of VC Classes into Maximum Classes (Q2805735) (← links)
- Learning with a Drifting Target Concept (Q2835624) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- A sharp concentration inequality with applications (Q4487095) (← links)
- Ten More Years of Error Rate Research (Q4831978) (← links)
- (Q5054630) (← links)
- Combinatorial bounds of overfitting for threshold classifiers (Q5137158) (← links)
- (Q5159394) (← links)
- An extension of play against the random past strategy. Choosing the right experts on IBM forecasts (Q5219522) (← links)
- Improved bounds on the sample complexity of learning (Q5943102) (← links)
