On the public citation graph

Robust Trainability of Single Neurons

0 signed · 130 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00058680openalex-snapshot
Learning Decision Lists
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1016/0304-3975(78)90006-3openalex-snapshot
The densest hemisphere problem
inferredcites →https://doi.org/10.1016/0890-5401(91)90025-wopenalex-snapshot
Completeness in approximation classes
inferredcites →https://doi.org/10.1109/sct.1991.160280openalex-snapshot
Approximation properties of NP minimization classes
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1145/130385.130424openalex-snapshot
Toward efficient agnostic learning
inferredcites →https://doi.org/10.1145/167088.167174openalex-snapshot
Efficient probabilistically checkable proofs and applications to approximations
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.5555/114836.114863openalex-snapshot
Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence
inferredcites →https://doi.org/10.5555/92571.92587openalex-snapshot
ON THE COMPUTATIONAL COMPLEXITY OFAPPROXIMATING DISTRIBUTIONS BY PROBABILISTIC AUTOMATA
inferredcites →https://doi.org/10.5860/choice.28-3325openalex-snapshot
Neural network design and the complexity of learning

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1999.2806openalex-snapshot
On the Complexity of Learning for Spiking Neurons with Temporal Coding
inferred← citeshttps://doi.org/10.1007/11899402_6openalex-snapshot
Spying Out Accurate User Preferences for Search Engine Adaptation
inferred← citeshttps://doi.org/10.1007/3-540-36434-x_8openalex-snapshot
Online Learning of Linear Classifiers
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_20openalex-snapshot
On Approximate Learning by Multi-layered Feedforward Circuits
inferred← citeshttps://doi.org/10.1007/3-540-45435-7_19openalex-snapshot
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_9openalex-snapshot
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard
inferred← citeshttps://doi.org/10.1007/3-540-46084-5_65openalex-snapshot
A Simulated Annealing and Resampling Method for Training Perceptrons to Classify Gene-Expression Data
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_5openalex-snapshot
Hardness Results for Neural Network Approximation Problems
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_60openalex-snapshot
On learning disjunctions of zero-one threshold functions with queries
inferred← citeshttps://doi.org/10.1007/978-1-4471-0651-7_4openalex-snapshot
Epicurean-style Learning Applied to the Classification of Gene-Expression Data
inferred← citeshttps://doi.org/10.1007/978-1-4615-2696-4_8openalex-snapshot
Perspectives of Current Research about the Complexity of Learning on Neural Nets
inferred← citeshttps://doi.org/10.1007/978-3-030-11479-4_16openalex-snapshot
Reducing Hierarchical Deep Learning Networks as Game Playing Artefact Using Regret Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-01580-9openalex-snapshot
Adversarial Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_26openalex-snapshot
Neural Networks with Linear Threshold Activations: Structure and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-0348-7958-3_5openalex-snapshot
On Properties of Support Vector Machines for Pattern Recognition in Finite Samples
inferred← citeshttps://doi.org/10.1007/978-3-0348-8201-9_28openalex-snapshot
Classification Based on the Support Vector Machine and on Regression Depth
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_18openalex-snapshot
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays
inferred← citeshttps://doi.org/10.1007/978-3-540-74690-4_8openalex-snapshot
Estimating the Size of Neural Networks from the Number of Available Training Data
inferred← citeshttps://doi.org/10.1007/978-3-642-57489-4_30openalex-snapshot
Classification Based on the Support Vector Machine, Regression Depth, and Discriminant Analysis
inferred← citeshttps://doi.org/10.1007/pl00011665openalex-snapshot
C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees
inferred← citeshttps://doi.org/10.1007/s000370100002openalex-snapshot
Pseudorandom functions in $ \textit{TC}^{0} $ and cryptographic limitations to proving lower bounds
inferred← citeshttps://doi.org/10.1007/s001800200106openalex-snapshot
Comparison between various regression depth methods and the support vector machine to approximate the minimum number of misclassifications
inferred← citeshttps://doi.org/10.1007/s10044-014-0377-7openalex-snapshot
A modified kernel clustering method with multiple factors
inferred← citeshttps://doi.org/10.1007/s10107-023-02016-5openalex-snapshot
Neural networks with linear threshold activations: structure and algorithms
inferred← citeshttps://doi.org/10.1007/s10472-021-09776-wopenalex-snapshot
Apportioned margin approach for cost sensitive large margin classifiers
inferred← citeshttps://doi.org/10.1007/s10601-023-09367-yopenalex-snapshot
Optimal multivariate decision trees
inferred← citeshttps://doi.org/10.1007/s10994-005-0464-5openalex-snapshot
Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning
inferred← citeshttps://doi.org/10.1007/s10994-009-5163-1openalex-snapshot
Fast learning of relational kernels
inferred← citeshttps://doi.org/10.1007/s11192-016-1844-2openalex-snapshot
Towards a new perspective on context based citation index of research articles
inferred← citeshttps://doi.org/10.1007/s12652-024-04791-1openalex-snapshot
Sliced Wasserstein adversarial training for improving adversarial robustness
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00254-gopenalex-snapshot
The complexity and approximability of finding maximum feasible subsystems of linear relations
inferred← citeshttps://doi.org/10.1016/b978-0-12-811788-0.00005-6openalex-snapshot
Supervised Classification: Quite a Brief Overview
inferred← citeshttps://doi.org/10.1016/b978-0-12-812013-2.00007-1openalex-snapshot
Predicting financial risk from revenue reports
inferred← citeshttps://doi.org/10.1016/b978-0-444-52936-7.50018-5openalex-snapshot
Mechanizing Induction
inferred← citeshttps://doi.org/10.1016/j.acra.2005.05.009openalex-snapshot
Computer-assisted Diagnosis of Focal Liver Lesions on CT Images
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2017.03.007openalex-snapshot
Machine learning methods in computational cancer biology
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.005openalex-snapshot
Some connections between learning and optimization
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.004openalex-snapshot
Sparse weighted voting classifier selection and its linear programming relaxations
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.01.003openalex-snapshot
Regularizing conjunctive features for classification
inferred← citeshttps://doi.org/10.1016/j.neucom.2009.09.013openalex-snapshot
Boosting with pairwise constraints
inferred← citeshttps://doi.org/10.1016/j.neucom.2018.11.095openalex-snapshot
Differential privacy for learning vector quantization
inferred← citeshttps://doi.org/10.1016/j.neunet.2016.07.002openalex-snapshot
A local Vapnik–Chervonenkis complexity
inferred← citeshttps://doi.org/10.1016/j.patcog.2018.11.024openalex-snapshot
Linear classifier design in the weight space
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.008openalex-snapshot
On approximate learning by multi-layered feedforward circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.014openalex-snapshot
Maximizing agreements and coagnostic learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.023openalex-snapshot
Self-improved gaps almost everywhere for the agnostic approximation of monomials
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00038-2openalex-snapshot
On the difficulty of approximately maximizing agreements
inferred← citeshttps://doi.org/10.1016/s0167-9473(00)00063-3openalex-snapshot
Measuring overlap in binary regression
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00057-3openalex-snapshot
Hardness results for neural network approximation problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00115-1openalex-snapshot
On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
inferred← citeshttps://doi.org/10.1016/s0933-3657(03)00036-8openalex-snapshot
An Epicurean learning approach to gene-expression data classification
inferred← citeshttps://doi.org/10.1017/cbo9780511812651openalex-snapshot
Pattern Recognition and Neural Networks
inferred← citeshttps://doi.org/10.1023/a:1009744630224openalex-snapshot
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
inferred← citeshttps://doi.org/10.1023/a:1013637720281openalex-snapshot
On the Learnability and Design of Output Codes for Multiclass Problems
inferred← citeshttps://doi.org/10.1063/1.3615722openalex-snapshot
Energy design for protein-protein interactions
inferred← citeshttps://doi.org/10.1080/01621459.2022.2089573openalex-snapshot
Set-Valued Support Vector Machine with Bounded Error Rates
inferred← citeshttps://doi.org/10.1098/rspa.2014.0081openalex-snapshot
Machine learning methods in the computational biology of cancer
inferred← citeshttps://doi.org/10.1109/ccc.2006.31openalex-snapshot
Optimal Hardness Results for Maximizing Agreements with Monomials
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426819openalex-snapshot
A new feature selection algorithm for two-class classification problems and application to endometrial cancer
inferred← citeshttps://doi.org/10.1109/cvpr.2016.415openalex-snapshot
Inferring Forces and Learning Human Utilities from Videos
inferred← citeshttps://doi.org/10.1109/focs.2006.51openalex-snapshot
New Results for Learning Noisy Parities and Halfspaces
inferred← citeshttps://doi.org/10.1109/focs.2009.26openalex-snapshot
Agnostic Learning of Monomials by Halfspaces Is Hard
inferred← citeshttps://doi.org/10.1109/icdmw.2011.110openalex-snapshot
Learning to Combine Ad-hoc Ranking Functions for Image Retrieval
inferred← citeshttps://doi.org/10.1109/iconip.2002.1202156openalex-snapshot
Two applications of the LSA machine
inferred← citeshttps://doi.org/10.1109/ijcnn.1998.687152openalex-snapshot
Constructing high order perceptrons with genetic algorithms
inferred← citeshttps://doi.org/10.1109/ijcnn55064.2022.9892743openalex-snapshot
Improved Multiclass AdaBoost Using Sparse Oblique Decision Trees
inferred← citeshttps://doi.org/10.1109/soli.2013.6611452openalex-snapshot
Does a company has bright future? Predicting financial risk from revenue reports
inferred← citeshttps://doi.org/10.1109/tit.2002.802647openalex-snapshot
On the generalization of soft margin algorithms
inferred← citeshttps://doi.org/10.1109/tit.2021.3134898openalex-snapshot
Learning Convex Polyhedra With Margin
inferred← citeshttps://doi.org/10.1137/070684914openalex-snapshot
On Agnostic Learning of Parities, Monomials, and Halfspaces
inferred← citeshttps://doi.org/10.1137/1.9781611972832.33openalex-snapshot
Active Learning to Rank using Pairwise Supervision
inferred← citeshttps://doi.org/10.1137/1.9781611972832.50openalex-snapshot
A new perspective on convex relaxations of sparse SVM
inferred← citeshttps://doi.org/10.1142/s0129065797000562openalex-snapshot
Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units
inferred← citeshttps://doi.org/10.1145/1015330.1015344openalex-snapshot
Leveraging the margin more carefully
inferred← citeshttps://doi.org/10.1145/1143844.1143943openalex-snapshot
A statistical approach to rule learning
inferred← citeshttps://doi.org/10.1145/1273496.1273628openalex-snapshot
On learning linear ranking functions for beam search
inferred← citeshttps://doi.org/10.1145/1278366.1278368openalex-snapshot
Mining User preference using Spy voting for search engine personalization
inferred← citeshttps://doi.org/10.1145/1344411.1344417openalex-snapshot
On ranking techniques for desktop search
inferred← citeshttps://doi.org/10.1145/2109211.2109214openalex-snapshot
A framework for personalizing web search with concept-based user profiles
inferred← citeshttps://doi.org/10.1145/267460.267477openalex-snapshot
On the complexity of learning for a spiking neuron (extended abstract)
inferred← citeshttps://doi.org/10.1145/267460.267479openalex-snapshot
Learning probabilistically consistent linear threshold functions
inferred← citeshttps://doi.org/10.1145/2992138.2992148openalex-snapshot
Evaluating physical quantities and learning human utilities from RGBD videos
inferred← citeshttps://doi.org/10.1145/3294052.3319680openalex-snapshot
Regularizing Conjunctive Features for Classification
inferred← citeshttps://doi.org/10.1145/3412815.3416882openalex-snapshot
Ensembles of Bagged TAO Trees Consistently Improve over Random Forests, AdaBoost and Gradient Boosting
inferred← citeshttps://doi.org/10.1145/775047.775067openalex-snapshot
Optimizing search engines using clickthrough data
inferred← citeshttps://doi.org/10.1162/0891201053630273openalex-snapshot
Discriminative Reranking for Natural Language Parsing
inferred← citeshttps://doi.org/10.1162/089976602760408035openalex-snapshot
Training a Single Sigmoidal Neuron Is Hard
inferred← citeshttps://doi.org/10.1162/0899766053011519openalex-snapshot
Loading Deep Networks Is Hard: The Pyramidal Case
inferred← citeshttps://doi.org/10.1162/089976605774320601openalex-snapshot
On the Nonlearnability of a Single Spiking Neuron
inferred← citeshttps://doi.org/10.1162/neco.1995.7.2.370openalex-snapshot
Learning Linear Threshold Approximations Using Perceptrons
inferred← citeshttps://doi.org/10.1162/neco.2008.06-07-549openalex-snapshot
Boosting Method for Local Learning in Statistical Pattern Recognition
inferred← citeshttps://doi.org/10.14711/thesis-b924401openalex-snapshot
Mining user preference using SPY voting for search engine personalization
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8664openalex-snapshot
HC-Search: Learning Heuristics and Cost Functions for Structured Prediction
inferred← citeshttps://doi.org/10.1609/aaai.v35i9.16993openalex-snapshot
Kernel-convoluted Deep Neural Networks with Data Augmentation
inferred← citeshttps://doi.org/10.1613/jair.4212openalex-snapshot
HC-Search: A Learning Framework for Search-based Structured Prediction
inferred← citeshttps://doi.org/10.1631/fitee.1601344openalex-snapshot
A machine learning approach to query generation in plagiarism source retrieval
inferred← citeshttps://doi.org/10.17713/ajs.v36i1.318openalex-snapshot
On Speed of Stochastic CART Model Search
inferred← citeshttps://doi.org/10.17877/de290r-14494openalex-snapshot
Determination of hyper-parameters for kernel based classification and regression
inferred← citeshttps://doi.org/10.17877/de290r-15035openalex-snapshot
On Robustness Properties of Convex Risk Minimization Methods for Pattern Recognition
inferred← citeshttps://doi.org/10.17877/de290r-6818openalex-snapshot
Regression Depth and Support Vector Machine
inferred← citeshttps://doi.org/10.2200/s00861ed1v01y201806aim039openalex-snapshot
Adversarial Machine Learning
inferred← citeshttps://doi.org/10.3115/1273073.1273174openalex-snapshot
Minimum risk annealing for training log-linear models
inferred← citeshttps://doi.org/10.48550/arxiv.1402.1792openalex-snapshot
Binary Excess Risk for Smooth Convex Surrogates
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5908openalex-snapshot
Exploiting Smoothness in Statistical Learning, Sequential Prediction, and Stochastic Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1609.06385openalex-snapshot
Multiclass Classification Calibration Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1712.07374openalex-snapshot
Adversarial Structured Prediction for Multivariate Measures
inferred← citeshttps://doi.org/10.48550/arxiv.1812.07526openalex-snapshot
Consistent Robust Adversarial Prediction for General Multiclass Classification
inferred← citeshttps://doi.org/10.48550/arxiv.2011.00392openalex-snapshot
Measure Theoretic Approach to Nonuniform Learnability
inferred← citeshttps://doi.org/10.70675/d3466114z601az4824z98e4z573207e337cbopenalex-snapshot
From confusion noise to active learning : playing on label availability in linear classification problems
inferred← citeshttps://doi.org/10.7282/t3dr2vn1openalex-snapshot
Optimization for sparse and accurate classifiers
inferred← citeshttps://doi.org/10.7551/mitpress/10290.001.0001openalex-snapshot
Foundations of Machine Learning
inferred← citeshttps://doi.org/10.7939/r38m5fopenalex-snapshot
Automatic speaker identification in novels
inferred← citeshttps://doi.org/10.7939/r38p5vn6wopenalex-snapshot
Toward Practical Reinforcement Learning Algorithms: Classification Based Policy Iteration and Model-Based Learning
inferred← citeshttps://doi.org/10.7939/r3bc3t87sopenalex-snapshot
Convex Latent Modeling
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.