Sciweavers

3044 search results - page 449 / 609
» Linear logical approximations
Sort
View
CJ
1999
95views more  CJ 1999»
15 years 5 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 5 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
TIT
1998
96views more  TIT 1998»
15 years 5 months ago
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation
Abstract— The paper deals with estimating transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for m...
Alexander Goldenshluger
NCA
2007
IEEE
15 years 5 months ago
A computational strategy exploiting genetic algorithms to recover color surface reflectance functions
—Information about the spectral reflectance of a color surface is useful in many applications. Assuming that reflectance functions can be adequately approximated by a linear comb...
Raimondo Schettini, Silvia Zuffi
SCHOLARPEDIA
2008
109views more  SCHOLARPEDIA 2008»
15 years 5 months ago
Latent semantic analysis
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (&q...
Thomas K. Landauer, Susan T. Dumais