Pages that link to "Item:Q1198550"
From MaRDI portal
The following pages link to Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550):
Displaying 50 items.
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Reliable agnostic learning (Q439993) (← links)
- Learning with stochastic inputs and adversarial outputs (Q439998) (← links)
- Generalization ability of fractional polynomial models (Q461189) (← links)
- Simulation-based optimization of Markov decision processes: an empirical process theory approach (Q608432) (← links)
- Optimal adaptive sampling recovery (Q618773) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- Least squares estimators of the regression function with twice censored data (Q643224) (← links)
- On-line learning of smooth functions of a single variable (Q672387) (← links)
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions (Q674405) (← links)
- Rigorous learning curve bounds from statistical mechanics (Q676243) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- Analysis of a multi-category classifier (Q714014) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- Multi-category classifiers and sample width (Q736602) (← links)
- Maximizing agreements and coagnostic learning (Q817828) (← links)
- Complexity of hyperconcepts (Q860806) (← links)
- Distribution-free consistency of empirical risk minimization and support vector regression (Q1047919) (← links)
- On convergence proofs in system identification -- a general principle using ideas from learning theory (Q1128973) (← links)
- A graph-theoretic generalization of the Sauer-Shelah lemma (Q1265742) (← links)
- Scale-sensitive dimensions and skeleton estimates for classification (Q1265744) (← 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)
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance (Q1271551) (← links)
- An introduction to some statistical aspects of PAC learning theory (Q1274408) (← links)
- Learning dynamical systems in a stationary environment (Q1274409) (← links)
- The complexity of model classes, and smoothing noisy data (Q1274410) (← links)
- A learning result for continuous-time recurrent neural networks (Q1274412) (← links)
- Universally consistent regression function estimation using hierarchical \(B\)-splines (Q1283852) (← links)
- Nonparametric estimation of piecewise smooth regression functions (Q1284586) (← links)
- Learning with queries corrupted by classification noise (Q1304475) (← links)
- On the learnability of rich function classes (Q1305934) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- A result of Vapnik with applications (Q1314333) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension (Q1345876) (← links)
- Approximation and learning of convex superpositions (Q1370865) (← links)
- On the complexity of learning from drifting distributions (Q1376422) (← links)
- On the value of partial information for learning from examples (Q1383444) (← links)
- Nonlinear orthogonal series estimates for random design regression (Q1399276) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Bayesian-validated computer-simulation surrogates for optimization and design: Error estimates and applications (Q1404656) (← links)
- On learning multicategory classification with sample queries. (Q1427857) (← links)
- Sample complexity of model-based search (Q1567400) (← links)
- A better approximation for balls (Q1577916) (← links)
- Inequalities for uniform deviations of averages from expectations with applications to nonparametric regression (Q1582357) (← links)
- Prediction from randomly right censored data (Q1599072) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- A new approach for learning belief networks using independence criteria (Q1605675) (← links)
