Sciweavers

4255 search results - page 586 / 851
» On Learning Boolean Functions
Sort
View
JCP
2007
143views more  JCP 2007»
15 years 2 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
CORR
2002
Springer
82views Education» more  CORR 2002»
15 years 2 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
Mikhail Belkin, John A. Goldsmith
ML
2000
ACM
105views Machine Learning» more  ML 2000»
15 years 2 months ago
Multiple Comparisons in Induction Algorithms
Abstract. A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction ...
David D. Jensen, Paul R. Cohen
NECO
1998
69views more  NECO 1998»
15 years 1 months ago
Synaptic Runaway In Associative Networks And The Pathogenesis Of Schizophrenia
Synaptic runaway denotes the formationof erroneous synapses and premature functional decline accompanying activity-dependent learning in neural networks. This work studies synapti...
Asnat Greenstein-Messica, Eytan Ruppin
EMNLP
2010
15 years 7 days ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....