Sciweavers

3643 search results - page 295 / 729
» Learning Submodular Functions
Sort
View
ITA
2007
101views Communications» more  ITA 2007»
15 years 6 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
ASC
2004
15 years 6 months ago
Neural network-based colonoscopic diagnosis using on-line learning and differential evolution
In this paper, on-line training of neural networks is investigated in the context of computer-assisted colonoscopic diagnosis. A memory-based adaptation of the learning rate for t...
George D. Magoulas, Vassilis P. Plagianakos, Micha...
AROBOTS
2002
91views more  AROBOTS 2002»
15 years 6 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro
NIPS
2008
15 years 8 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 6 months ago
When is there a representer theorem? Vector versus matrix regularizers
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
Andreas Argyriou, Charles A. Micchelli, Massimilia...