Sciweavers

2040 search results - page 214 / 408
» Approximate Expectation Maximization
Sort
View
125
Voted
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 3 months ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker
113
Voted
DM
2006
91views more  DM 2006»
15 years 3 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
162
Voted
ML
2008
ACM
152views Machine Learning» more  ML 2008»
15 years 3 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
122
Voted
JCT
2007
117views more  JCT 2007»
15 years 3 months ago
Large independent sets in regular graphs of large girth
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
Joseph Lauer, Nicholas C. Wormald
107
Voted
APPML
2002
76views more  APPML 2002»
15 years 3 months ago
Proper gromov transforms of metrics are metrics
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...
Andreas W. M. Dress