Sciweavers

3837 search results - page 276 / 768
» Learning Approximate Consistencies
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
AAAI
2000
15 years 8 months ago
Localizing Search in Reinforcement Learning
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
Gregory Z. Grudic, Lyle H. Ungar
UAI
2003
15 years 8 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 7 months ago
Empirical learning aided by weak domain knowledge in the form of feature importance
Standard hybrid learners that use domain knowledge require stronger knowledge that is hard and expensive to acquire. However, weaker domain knowledge can benefit from prior knowle...
Ridwan Al Iqbal
IJON
2006
90views more  IJON 2006»
15 years 7 months ago
Reinforcement learning of a simple control task using the spike response model
In this work, we propose a variation of a direct reinforcement learning algorithm, suitable for usage with spiking neurons based on the spike response model (SRM). The SRM is a bi...
Murilo Saraiva de Queiroz, Roberto Coelho de Berr&...