P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory....

5
APPENDIX C P P ROBABILITY ROBABILITY T T HEORY HEORY you can never know too much probability theory. If you are well you can never know too much probability theory. If you are well grounded in probability theory, you will find it easy to integrate results grounded in probability theory, you will find it easy to integrate results from theoretical and applied statistics into the analysis of your from theoretical and applied statistics into the analysis of your applications. applications. Daniel McFadden, 2000 Nobel Prize in Daniel McFadden, 2000 Nobel Prize in Economics Economics •Organization of appendix in ISSO –Basic properties •Sample space •Expected value –Convergence theory •Definitions (four modes) •Examples and counterexamples •Dominated convergence theorem •Convergence in distribution and central limit theorem Slides for Introduction to Stochastic Search and Optimization (ISSO) by J. C. Spall

Transcript of P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory....

Page 1: P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory. If you are well grounded in probability theory, you.

APPENDIX C

P PROBABILITY ROBABILITY TTHEORYHEORY

…you can never know too much probability theory. If you are well you can never know too much probability theory. If you are well grounded in probability theory, you will find it easy to integrate results grounded in probability theory, you will find it easy to integrate results

from theoretical and applied statistics into the analysis of your from theoretical and applied statistics into the analysis of your applications.applications.Daniel McFadden, 2000 Nobel Prize in EconomicsDaniel McFadden, 2000 Nobel Prize in Economics

•Organization of appendix in ISSO–Basic properties

•Sample space•Expected value

–Convergence theory•Definitions (four modes)•Examples and counterexamples•Dominated convergence theorem•Convergence in distribution and central limit theorem

Slides for Introduction to Stochastic Search and Optimization (ISSO) by J. C. Spall

Page 2: P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory. If you are well grounded in probability theory, you.

C-2

Probability Theory

• Random variables, distribution functions, and expectations are critical– Central tools in stochastic search, optimization, and

Monte Carlo methods

• Probabilistic convergence important in building theoretical foundation for stochastic algorithms

• Most theoretical results for algorithms rely on asymptotic arguments (i.e., convergence)

Page 3: P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory. If you are well grounded in probability theory, you.

C-3

Expectation

• Let X m , m {1, 2,…}, be distributed according to density function pX(x)

• Then the expected value of a function f(X) is

provided that <

• Obvious analogue to above for discrete random vectors

• Important special cases for expected value:– Mean: f(X) = X

– Covariance matrix: f(X) = [X – E(X)] [X – E(X)]T

( ) ( ) ( )[ ] R Xf X f x x xmE p d

( )( )E f X

Page 4: P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory. If you are well grounded in probability theory, you.

C-4

Probabilistic Convergence• Finite-sample results are usually hopeless

• Asymptotic (convergence) results provide means to analyze stochastic algorithms

• Four famous modes of convergence:– almost surely (a.s.)– in probability (pr.)– in mean-square (m.s.)– in distribution (dist.)

• First three modes above pertain to sense in which Xk X as k

• Last mode (dist.) pertains to convergence of distribution function of Xk to distribution function of X

Page 5: P ROBABILITY T HEORY APPENDIX C P ROBABILITY T HEORY you can never know too much probability theory. If you are well grounded in probability theory, you.

C-5

Implications for Four Modes of Convergence

pr. a.s.

m.s. dist.