Sciweavers

134 search results - page 1 / 27
» Local Minimax Learning of Approximately Polynomial Functions
Sort
View
CVPR
2000
IEEE
14 years 7 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
ICTAI
2006
IEEE
13 years 11 months ago
Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
Daniel Stronger, Peter Stone
ICCV
2009
IEEE
13 years 3 months ago
Local distance functions: A taxonomy, new algorithms, and an evaluation
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
Deva Ramanan, Simon Baker
TIT
1998
96views more  TIT 1998»
13 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