A polynomial-time algorithm for learning noisy linear threshold functions
From MaRDI portal
Publication:1271190
Recommendations
- Hardness results for agnostically learning low-degree polynomial threshold functions
- Thresholding in learning theory
- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
- Learning polynomials with queries: The highly noisy case
- scientific article; zbMATH DE number 67608
- Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
- Approximating linear threshold predicates
- Approximating linear threshold predicates
- A note on polynomial-time learnability in the limit from positive data
- An efficient approach to compute the threshold for multi-dimensional linear classifiers
Cited in
(30)- Unconditional lower bounds for learning intersections of halfspaces
- Worst-case analysis of the Perceptron and Exponentiated Update algorithms
- Learning from binary labels with instance-dependent noise
- Learning fixed-dimension linear thresholds from fragmented data
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Optimal outlier removal in high-dimensional spaces
- Minimum generalization via reflection: A fast linear threshold learner
- Statistical active learning algorithms for noise tolerance and differential privacy
- Unconfused ultraconservative multiclass algorithms
- An algorithmic theory of learning: Robust concepts and random projection
- A deterministic and polynomial modified perceptron algorithm
- Noise tolerant variants of the perceptron algorithm
- Learning Kernel Perceptrons on Noisy Data Using Random Projections
- A complete characterization of statistical query learning with applications to evolvability
- On the complexity of random satisfiability problems with planted solutions
- Online transfer learning
- On the Power of Learning from k-Wise Queries
- Pseudorandom functions: three decades later
- Noise in Classification
- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
- Learning sparse low-threshold linear classifiers
- A simple polynomial-time rescaling algorithm for solving linear programs
- Fitting algebraic curves to noisy data
- Robust logics
- Boosting in the presence of noise
- A deterministic rescaled perceptron algorithm
- On the hardness of learning intersections of two halfspaces
- A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
- Understanding simultaneous train and test robustness
- An algorithmic theory of learning: robust concepts and random projection
This page was built for publication: A polynomial-time algorithm for learning noisy linear threshold functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271190)
