Learning fixed-dimension linear thresholds from fragmented data
From MaRDI portal
(Redirected from Publication:1854473)
Recommendations
- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
- On restricted-focus-of-attention learnability of Boolean functions
- Sample-efficient strategies for learning in the presence of noise
- A polynomial-time algorithm for learning noisy linear threshold functions
- Learning from satisfying assignments
Cites work
- scientific article; zbMATH DE number 4088699 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 2077163 (Why is no real title available?)
- scientific article; zbMATH DE number 3214063 (Why is no real title available?)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
- A polynomial-time algorithm for learning noisy linear threshold functions
- A theory of the learnable
- Can PAC learning algorithms tolerate random attribute noise?
- Comparison of Discrimination Techniques Applied to a Complex Data Set of Head Injured Patients
- Convergence of stochastic processes
- Covering numbers for real-valued function classes
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Efficient distribution-free learning of probabilistic concepts
- Efficient noise-tolerant learning from statistical queries
- Exact Learning of Discretized Geometric Concepts
- Harmonic Analysis of Polynomial Threshold Functions
- Learnability and the Vapnik-Chervonenkis dimension
- Learning by distances
- Learning with restricted focus of attention
- Learning with unreliable boundary queries
- Linear programming — Randomization and abstract frameworks
- Noise-tolerant distribution-free learning of general geometric concepts
- On learning a union of half spaces
- On restricted-focus-of-attention learnability of Boolean functions
- On the learnability of discrete distributions
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Learning fixed-dimension linear thresholds from fragmented data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854473)
