Pages that link to "Item:Q1329154"
From MaRDI portal
The following pages link to Efficient distribution-free learning of probabilistic concepts (Q1329154):
Displaying 50 items.
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- Robustness and generalization (Q420915) (← links)
- Visual stability analysis for model selection in graded possibilistic clustering (Q506291) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Partial observability and learnability (Q991012) (← links)
- Maximal width learning of binary functions (Q1041230) (← links)
- A graph-theoretic generalization of the Sauer-Shelah lemma (Q1265742) (← links)
- Scale-sensitive dimensions and skeleton estimates for classification (Q1265744) (← links)
- Prediction, learning, uniform convergence, and scale-sensitive dimensions (Q1271550) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Efficient distribution-free population learning of simple concepts (Q1273753) (← links)
- On the boosting ability of top-down decision tree learning algorithms (Q1305926) (← links)
- On-line maximum likelihood prediction with respect to general loss functions (Q1370862) (← links)
- Approximation and learning of convex superpositions (Q1370865) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- Approximate location of relevant variables under the crossover distribution. (Q1422405) (← links)
- Structural results about exact learning with unspecified attribute values (Q1567399) (← links)
- Learnability in Hilbert spaces with reproducing kernels (Q1599198) (← links)
- Robust regression using biased objectives (Q1698865) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- PAC learning of probability distributions over a discrete domain. (Q1874385) (← links)
- Efficient algorithms for learning functions with bounded variation (Q1887165) (← links)
- Uniform approximation of Vapnik-Chervonenkis classes (Q1932231) (← links)
- Optimal approximation rate of ReLU networks in terms of width and depth (Q2065073) (← links)
- Primal and dual combinatorial dimensions (Q2112665) (← links)
- Nonlinear approximation via compositions (Q2185653) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Sequential complexities and uniform martingale laws of large numbers (Q2257118) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- Efficient learning with robust gradient descent (Q2320583) (← links)
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model (Q2328061) (← links)
- \(L_{p}\)-norm Sauer-Shelah lemma for margin multi-category classifiers (Q2402375) (← links)
- Aspects of discrete mathematics and probability in the theory of machine learning (Q2478432) (← links)
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms (Q2485074) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Integer cells in convex sets (Q2570073) (← links)
- Learning cost-sensitive active classifiers (Q2676585) (← links)
- (Q2771837) (← links)
- On Martingale Extensions of Vapnik–Chervonenkis Theory with Applications to Online Learning (Q2805727) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- Sample Complexity of Classifiers Taking Values in ℝ<sup><i>Q</i></sup>, Application to Multi-Class SVMs (Q3562430) (← links)
- (Q4636990) (← links)
- (Q4637010) (← links)
- Efficiently learning structured distributions from untrusted batches (Q5144981) (← links)
- Deep Network Approximation for Smooth Functions (Q5155613) (← links)
- Deep Network Approximation Characterized by Number of Neurons (Q5162359) (← links)
- Margin Error Bounds for Support Vector Machines on Reproducing Kernel Banach Spaces (Q5380867) (← links)
- (Q5743481) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
