Pages that link to "Item:Q1892210"

The following pages link to Robust trainability of single neurons (Q1892210):

Displaying 21 items.

• Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
• Computational limitations on training sigmoid neural networks (Q685499) (← links)
• Maximizing agreements and coagnostic learning (Q817828) (← links)
• Apportioned margin approach for cost sensitive large margin classifiers (Q825011) (← links)
• Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
• Complexity in the case against accuracy estimation (Q1399985) (← links)
• On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
• Hardness results for neural network approximation problems (Q1603592) (← links)
• On the complexity of learning for spiking neurons with temporal coding. (Q1854302) (← links)
• Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications (Q1855638) (← links)
• Some connections between learning and optimization (Q1885804) (← links)
• Fast learning of relational kernels (Q1959554) (← links)
• Neural networks with linear threshold activations: structure and algorithms (Q2164715) (← links)
• A local Vapnik-Chervonenkis complexity (Q2281678) (← links)
• On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
• Regularizing conjunctive features for classification (Q2662672) (← links)
• Discriminative Reranking for Natural Language Parsing (Q3225425) (← links)
• Classification Based on the Support Vector Machine, Regression Depth, and Discriminant Analysis (Q3298682) (← links)
• On the Nonlearnability of a Single Spiking Neuron (Q3370746) (← links)
• Boosting Method for Local Learning in Statistical Pattern Recognition (Q3536235) (← links)