Identification criteria and lower bounds for perceptron-like learning rules
Neural Computation
On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Monotone circuits for monotone weighted threshold functions
Information Processing Letters
Every Linear Threshold Function has a Low-Weight Approximator
Computational Complexity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational Complexity
On the size of weights in randomized search heuristics
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Problems of Information Transmission
Monotone circuits for monotone weighted threshold functions
Information Processing Letters
Constructive threshold logic addition: a synopsis of the last decade
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
A uniform lower bound on weights of perceptrons
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Weights of exact threshold functions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A better upper bound on weights of exact threshold functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
SIAM Journal on Computing
On exact learning halfspaces with random consistent hypothesis oracle
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Using kolmogorov inspired gates for low power nanoelectronics
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Sparse weighted voting classifier selection and its linear programming relaxations
Information Processing Letters
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Lower bound on weights of large degree threshold functions
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Low-weight halfspaces for sparse boolean vectors
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Discrete Applied Mathematics
Improved Approximation of Linear Threshold Functions
Computational Complexity
Efficient active learning of halfspaces: an aggressive approach
The Journal of Machine Learning Research
| Hi-index | 0.00 |
It is proved that if $n$ is a power of 2, then there is a threshold function on $n$ inputs that requires weights of size around $2^{(n\log n)/2-n}$. This almost matches the known upper bounds.