Sciweavers

4366 search results - page 148 / 874
» Learning and Smoothed Analysis
Sort
View
130
Voted
ECML
2006
Springer
15 years 7 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
ICML
2009
IEEE
16 years 4 months ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint
135
Voted
EMNLP
2004
15 years 5 months ago
Learning Hebrew Roots: Machine Learning with Linguistic Constraints
The morphology of Semitic languages is unique in the sense that the major word-formation mechanism is an inherently non-concatenative process of interdigitation, whereby two morph...
Ezra Daya, Dan Roth, Shuly Wintner
ACML
2009
Springer
15 years 10 months ago
Estimating Likelihoods for Topic Models
Abstract. Topic models are a discrete analogue to principle component analysis and independent component analysis that model topic at the word level within a document. They have ma...
Wray L. Buntine
116
Voted
GIS
2009
ACM
16 years 4 months ago
From GPS Traces to a Routable Road Map
This paper presents a method for automatically converting raw GPS traces from everyday vehicles into a routable road network. The method begins by smoothing raw GPS traces using a...
Lili Cao, John Krumm