Pages that link to "Item:Q1271190"
From MaRDI portal
The following pages link to A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190):
Displaying 25 items.
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Online transfer learning (Q460610) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Worst-case analysis of the Perceptron and Exponentiated Update algorithms (Q1277700) (← links)
- Learning from binary labels with instance-dependent noise (Q1631810) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- Optimal outlier removal in high-dimensional spaces (Q1887715) (← links)
- Minimum generalization via reflection: A fast linear threshold learner (Q1961322) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- Unconfused ultraconservative multiclass algorithms (Q2353009) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- Learning Kernel Perceptrons on Noisy Data Using Random Projections (Q3520070) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention (Q5307576) (← links)
- A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
- Fitting algebraic curves to noisy data (Q5917581) (← links)
- Robust logics (Q5918074) (← links)
- Boosting in the presence of noise (Q5921649) (← links)
- A deterministic rescaled perceptron algorithm (Q5962726) (← links)
