Sciweavers

5785 search results - page 252 / 1157
» Approximability of Probability Distributions
Sort
View
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 11 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar
AAAI
2011
14 years 4 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III
ICML
2005
IEEE
16 years 5 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
15 years 11 months ago
Convergence rate for stochastic consensus algorithms with time-varying noise statistics: Asymptotic normality
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
Minyi Huang
EMNLP
2006
15 years 5 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson