Conditional Expectation
Jean Jacod, Philip Protter · Universitext · 2004
Cited by 1
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 4,805 papers for “Conditional expectation”
Jean Jacod, Philip Protter · Universitext · 2004
Cited by 1
Jean‐Pierre Florens, Vêlayoudom Marimoutou, Anne Péguin-Feissolle · Cambridge University Press eBooks · 2007
Cited by 0
Arup Bose, Arijit Chakrabarty, Rajat Subhra Hazra · Texts and readings in mathematics · 2024
Cited by 0
Denis Bosq, Nikolaos Limnios · 2012
Cited by 2
Paul E. Pfeiffer · Birkhäuser Boston eBooks · 1979
In order to introduce and develop the second concept of conditional independence, we need to examine the concept of conditional expectation. The usual introductory treatment of conditional expectation is intuitive, straightforward, but severely limited in scope. More general treatments tend to assume familiarity with advanced notions of measurability and abstract integration theory. We seek to bridge the gap and make the appropriate aspects of a general treatment more readily accessible.
Cited by 0
Wiley series in probability and statistics · 2017
In this chapter, the authors introduce the general concept of a conditional expectation given a σ-algebra 𝒸. The concepts of a conditional expectation value and a conditional probability are defined more generally, using the factorization of a conditional expectation. The authors also define the general concept of a regression as a factorization g of a conditional expectation E(Y | X) = g(X), provided that X is real-valued. Furthermore, they define an (X=x)-conditional expectation value E(Y | X=x) as a value g(x) of the factorization g. This means that E(Y | X=x) is defined even if P(X=x) = 0. However, E(Y | X=x) is not uniquely defined. Nevertheless, they can formulate propositions about the conditional expectation values E(Y | X=x) for PX-almost all values x of X. Finally, they introduce the concept of mean independence and study its relationship to stochastic independence and uncorrelatedness.
Cited by 0
2014
Cited by 4
Seán Dineen · Graduate studies in mathematics · 2013
Cited by 0
Jean Jacod, Philip Protter · Universitext · 2000
Cited by 0
Paul E. Pfeiffer, David A. Schum · Elsevier eBooks · 1973
Cited by 0
Arup Bose · Texts and readings in mathematics · 2025
Cited by 0
Springer texts in statistics · 2006
Cited by 2
WORLD SCIENTIFIC eBooks · 2024
Cited by 0
Sheldon M. Ross · Elsevier eBooks · 2023
Cited by 0
Sheldon M. Ross · Elsevier eBooks · 1993
Cited by 0
Sheldon M. Ross · Elsevier eBooks · 2014
Cited by 2
Gabriel J. Lord, Cónall Kelly · Elsevier eBooks · 2026
Cited by 0
Zheng Wang, Shandian Zhe · arXiv (Cornell University) · 2019
Expectation propagation (EP) is a powerful approximate inference algorithm. However, a critical barrier in applying EP is that the moment matching in message updates can be intractable. Handcrafting approximations is usually tricky, and lacks generalizability. Importance sampling is very expensive. While Laplace propagation provides a good solution, it has to run numerical optimizations to find Laplace approximations in every update, which is still quite inefficient. To overcome these practical barriers, we propose conditional expectation propagation (CEP) that performs conditional moment matching given the variables outside each message, and then takes expectation w.r.t the approximate posterior of these variables. The conditional moments are often analytical and much easier to derive. In the most general case, we can use (fully) factorized messages to represent the conditional moments by quadrature formulas. We then compute the expectation of the conditional moments via Taylor approximations when necessary. In this way, our algorithm can always conduct efficient, analytical fixed point iterations. Experiments on several popular models for which standard EP is available or unavailable demonstrate the advantages of CEP in both inference quality and computational efficiency.
Cited by 1Open access
Radu Horaud, Florence Forbes, Manuel Yguel et al. · 2012
Cited by 0
János Galambos · 2023
Cited by 0