Training Reinforcement Neurocontrollers Using the Polytope Algorithm
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic
136 indexed results
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic
Recurrent neural networks are often used for learning time-series data. Based on a few assumptions we model this learning task
The paper gives a brief review of the expectation-maximization algorithm (Dempster 1977) in the comprehensible framework of discrete mathematics. In
In this paper, we propose an scalable approach to modeling based upon word processing documents, and we describe the tool
Learning to respond to voice-text input involves the subject's ability in understanding the phonetic and text based contents and his/her
We report here on a study of interannotator agreement in the coreference task as defined by the Message Understanding Conference
Maximum entropy models are considered by many to be one of the most promising avenues of language modeling research. Unfortunately,
We apply a general theory describing the dynamics of supervised learning in layered neural networks in the regime where the
We present a new approach to stochastic modeling of constraint-based grammars that is based on log-linear models and uses EM
We solve the dynamics of on-line Hebbian learning in large perceptrons exactly, for the regime where the size of the
We propose a new framework for building and evaluating machine learning algorithms. We argue that many real-world problems require an
We make a connection between classical polytopes called zonotopes and Support Vector Machine (SVM) classifiers. We combine this connection with
Intrinsic and extrinsic defects play an important role in training and degradation of superconducting wires and magnets. Various defects along
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of
Grammatical relationships (GRs) form an important level of natural language processing, but different sets of GRs are useful for different
Recognizing shallow linguistic patterns, such as basic syntactic relationships between words, is a common task in applied natural language and
k is the most important parameter in a text categorization system based on k-Nearest Neighbor algorithm (kNN).In the classification process,
Memory-based learning (MBL) has enjoyed considerable success in corpus-based natural language processing (NLP) tasks and is thus a reliable method
We propose an automated protocol for designing the energy landscape of a protein energy function by optimizing its parameters. The
We outline a method to measure the detailed chemical composition of extragalactic (unresolved) globular clusters (GCs) from echelle spectra of
We argue that some of the computational complexity associated with estimation of stochastic attribute-value grammars can be reduced by training
We apply the general protocol of parameter optimization (Lee, J. et al. Phys. Chem. B 2001, 105, 7291) to the
The paper presents a data-driven approach to information extraction (viewed as template filling) using the structured language model (SLM) as
Keyphrases are useful for a variety of purposes, including summarizing, indexing, labeling, categorizing, clustering, highlighting, browsing, and searching. The task