Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Manfred K. Warmuth:

TR00-070 | 14th July 2000
Peter Auer, Manfred K. Warmuth

Tracking the best disjunction

Littlestone developed a simple deterministic on-line learning
algorithm for learning $k$-literal disjunctions. This algorithm
(called Winnow) keeps one weight for each variable and does
multiplicative updates to its weights. We develop a randomized
version of Winnow and prove bounds for an adaptation of the
algorithm ... more >>>

TR00-055 | 14th July 2000
Peter Auer, Stephen Kwek, Manfred K. Warmuth

Learning of Depth Two Neural Networks with Constant Fan-in at the Hidden Nodes

We present algorithms for learning depth two neural networks where the
hidden nodes are threshold gates with constant fan-in. The transfer
function of the output node might be more general: we have results for
the cases when the threshold function, the logistic function or the
identity function is ... more >>>

ISSN 1433-8092 | Imprint