Sciweavers

1614 search results - page 123 / 323
» Learning Rules and Their Exceptions
Sort
View
NIPS
2003
14 years 11 months ago
Reasoning about Time and Knowledge in Neural Symbolic Learning Systems
We show that temporal logic and combinations of temporal logics and modal logics of knowledge can be effectively represented in artificial neural networks. We present a Translat...
Artur S. d'Avila Garcez, Luís C. Lamb
ANLP
1992
116views more  ANLP 1992»
14 years 11 months ago
Automatic Learning for Semantic Collocation
The real di culty in development of practical NLP systems comes from the fact that we do not have e ective means for gathering \knowledge". In this paper, we propose an algor...
Satoshi Sekine, Jeremy J. Carroll, Sophia Ananiado...
ICML
2009
IEEE
15 years 10 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2008
IEEE
15 years 10 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
NIPS
2000
14 years 11 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee