Constructing Free Energy Approximations and GBP Algorithms

Size: px
Start display at page:

Download "Constructing Free Energy Approximations and GBP Algorithms"

Transcription

1 3710 Advnced Topcs n A ecture 15 Brnslv Kveton kveton@cs.ptt.edu 5802 ennott qure onstructng Free Energy Approxtons nd BP Algorths ontent Why? Belef propgton (BP) Fctor grphs egon-sed free energy pproxtons Bethe ethod Bethe ethod nd BP egon grphs enerlzed elef propgton (BP)

2 BP on luster Trees, τ(),, τ(,),, τ(,) τ(,) Belef propgton on,,, cluster trees s n exct,, ethod for coputng posteror rgnls pce coplexty s exponentl n the treewdth of the grph BP on luster rphs, τ(),, τ(,),, τ() τ() τ() Belef propgton on,,, cluster grphs s n τ() pproxte ethods,, for coputng posteror rgnls τ() onvergence s not gurnteed! pce coplexty s lner n the sze of the lrgest cluster

3 Fctor rphs,,,,,,,, A fctor grph s prtte grph tht represents fctored structure,, luster tree Vrle nodes c d e Fctor grph Fctor nodes Fctor rphs,,,,,,,, A fctor grph s prtte grph tht represents fctored structure,, luster tree Vrle nodes c d e Fctor grph Fctor nodes

4 BP on Fctor rphs Messges: Mrgnls: n ( x ) ( x ) c N () \ c ( x ) ( x ) ( x ) f ( x ) n j ( x j ) N () ( ) x \ x j N \ c d e BP on Fctor rphs Messges: Mrgnls: n ( x ) ( x ) c N () \ c ( x ) ( x ) ( x ) f ( x ) n j ( x j ) N () ( ) x \ x j N \ P(x h )? c d e

5 BP on Fctor rphs Messges: Mrgnls: n ( x ) ( x ) c N () \ c ( x ) ( x ) ( x ) f ( x ) n j ( x j ) N () ( ) x \ x j N \ P(x h )? c d e BP on Fctor rphs Messges: Mrgnls: n ( x ) ( x ) c N () \ c ( x ) ( x ) ( x ) f ( x ) n j ( x j ) N () ( ) x \ x j N \ P(x h )? c d e

6 BP on Fctor rphs Messges: Mrgnls: n ( x ) ( x ) c N () \ c ( x ) ( x ) ( x ) f ( x ) n j ( x j ) N () ( ) x \ x j N \ P(x h )? c d e Fctored jont: p Energy equtons: Free Energy ( x) exp [ E( x) ] Z E( x) ln ( x ) Z x exp [ E( x) ] ( ) F ( p) F + F M 1 F ln Z ( ) U ( ) ( ) U ( ) ( x) E( x) s free energy F ( ) F elholtz free energy x f ( ) ( x) ln ( x) x Vrtonl verge energy Vrtonl entropy

7 egon-bsed Free Energy A regon of fctor grph s gven y vrle set V nd fctor set A such tht f fctor node elongs to A, ll ts vrle nodes re n V The forls cn express oth Kkuch nd Bethe pproxtons A B A B nvld regon Vld regon egon-bsed Free Energy egon verge energy nd entropy: F E ( ) U ( ) ( ) ( x ) ln f ( x ) A egon-sed verge energy nd pproxte entropy: F ({ }) U ({ }) ({ }) where c s countng nuer of the regon U U ( ) ( x ) E ( x ) x ( ) ( x ) ln ( x ) x ({ }) c U ( ) ({ }) c ( )

8 egon-bsed Free Energy A regon-sed pproxton s vld f for every fctor node nd every vrle node : c A ( ) cv ( ) 1 f (x ) p (x ), then the verge energy U of vld regon-sed pproxton s exct f p(x) s unfor nd (x ) p (x ), the entropy of vld regon-sed pproxton s exct Nether fctors nor vrles re doule counted Mnzton of F cn e cheved y nzng ( p) or xzng onstrned egon-bsed Free Energy A regon-sed pproxton s constrned f: Every (x ) hs the for of prolty functon Mrgnls re consstent cross regons A constrned regon-sed pproxton s xent-norl f t s vld nd the entropy cheves ts xu when ll (x ) re unfor Mnzton of F cn e cheved y xzng espte these restrctons we y get strnge lookng results!

9 Bethe Method Bethe pproxton s specl cse of regon-sed free energy pproxton Bethe free energy equls to F Bethe U Bethe Bethe : U Bethe ( ) ( x ) ln f ( x ) f the fctor grph hs no cycles, U Bethe nd Bethe re exct Bethe pproxtons re xent-norl M 1 x M N Bethe 1 x 1 x ( ) ( x ) ln ( x ) + ( d 1) ( x ) ln ( x ) A B Bethe Method nd BP The prole of fndng F Bethe cn e stted s: nze suject to : F Bethe x x x \ x ( x ) ( x ) 1 1 ( x ) ( x ) To solve ths constrned optzton prole, we ntroduce grngn ultplers, nd turn t nto unconstrned one The frst dervtves wth respect to elefs yeld sttonry ponts, whch re fxed ponts of the BP lgorth

10 egon rphs egon grph s grphcl forls for genertng regonsed free energy pproxtons A,,1,2,4,5 2 B,,2,3,5,6,4,5 5 5,6 6,E,4,5,7,8 8 F,5,6,8,9 egon rphs egon grph s grphcl forls for genertng regonsed free energy pproxtons A,,1,2,4,5 2 B,,2,3,5,6,4,5 5 5,6 6,E,4,5,7,8 8 F,5,6,8,9 egons nd e cn e connected y n edge e only f e

11 egon rphs egon grph s grphcl forls for genertng regonsed free energy pproxtons A,,1,2,4,5,4,5,E,4,5,7,8 2 B,,2,3,5, , F,5,6,8, The countng nuer equls to one nus the n-degree egon rphs egon grph s grphcl forls for genertng regonsed free energy pproxtons A,,1,2,4,5,4,5,E,4,5,7,8 2 B,,2,3,5, , F,5,6,8, The grph hs to stsfy the regon grph condton

12 enerlzed Belef Propgton A clss of essge-pssng lgorths Prent-to-chld lgorth enerlzes the BP lgorth on regon grphs ( x ) xp\ FP \ P f ( x ) ( x ) (, ) ( P, ) ( x ) f ( x ) ( x ) ( ) (, ) N ( P, ) ( x ) P orrectness cn e proved slrly to the BP lgorth ( ) A P P P P ( ) \ε ( ) P ( x )

An Ising model on 2-D image

An Ising model on 2-D image School o Coputer Scence Approte Inerence: Loopy Bele Propgton nd vrnts Prolstc Grphcl Models 0-708 Lecture 4, ov 7, 007 Receptor A Knse C Gene G Receptor B Knse D Knse E 3 4 5 TF F 6 Gene H 7 8 Hetunndn

More information

STATISTICAL MECHANICS OF THE INVERSE ISING MODEL

STATISTICAL MECHANICS OF THE INVERSE ISING MODEL STATISTICAL MECHANICS OF THE INVESE ISING MODEL Muro Cro Supervsors: rof. Mchele Cselle rof. ccrdo Zecchn uly 2009 INTODUCTION SUMMAY OF THE ESENTATION Defnton of the drect nd nverse prole Approton ethods

More information

Advanced Machine Learning. An Ising model on 2-D image

Advanced Machine Learning. An Ising model on 2-D image Advnced Mchne Lernng Vrtonl Inference Erc ng Lecture 12, August 12, 2009 Redng: Erc ng Erc ng @ CMU, 2006-2009 1 An Isng model on 2-D mge odes encode hdden nformton ptchdentty. They receve locl nformton

More information

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )

More information

Probabilistic Graphical Models

Probabilistic Graphical Models School of Computer Scence Prolstc Grphcl Models Vrtonl Inference Erc ng Lecture 13, Ferury 24, 2014 Redng: See clss weste Erc ng @ CMU, 2005-2014 1 Inference Prolems Compute the lelhood of oserved dt Compute

More information

Variable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia

Variable time amplitude amplification and quantum algorithms for linear algebra. Andris Ambainis University of Latvia Vrble tme mpltude mplfcton nd quntum lgorthms for lner lgebr Andrs Ambns Unversty of Ltv Tlk outlne. ew verson of mpltude mplfcton;. Quntum lgorthm for testng f A s sngulr; 3. Quntum lgorthm for solvng

More information

EM and Structure Learning

EM and Structure Learning EM and Structure Learnng Le Song Machne Learnng II: Advanced Topcs CSE 8803ML, Sprng 2012 Partally observed graphcal models Mxture Models N(μ 1, Σ 1 ) Z X N N(μ 2, Σ 2 ) 2 Gaussan mxture model Consder

More information

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism CS294-40 Lernng for Rootcs nd Control Lecture 10-9/30/2008 Lecturer: Peter Aeel Prtlly Oservle Systems Scre: Dvd Nchum Lecture outlne POMDP formlsm Pont-sed vlue terton Glol methods: polytree, enumerton,

More information

Lecture 36. Finite Element Methods

Lecture 36. Finite Element Methods CE 60: Numercl Methods Lecture 36 Fnte Element Methods Course Coordntor: Dr. Suresh A. Krth, Assocte Professor, Deprtment of Cvl Engneerng, IIT Guwht. In the lst clss, we dscussed on the ppromte methods

More information

6 Roots of Equations: Open Methods

6 Roots of Equations: Open Methods HK Km Slghtly modfed 3//9, /8/6 Frstly wrtten t Mrch 5 6 Roots of Equtons: Open Methods Smple Fed-Pont Iterton Newton-Rphson Secnt Methods MATLAB Functon: fzero Polynomls Cse Study: Ppe Frcton Brcketng

More information

Jens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers

Jens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers Jens Sebel (Unversty of Appled Scences Kserslutern) An Interctve Introducton to Complex Numbers 1. Introducton We know tht some polynoml equtons do not hve ny solutons on R/. Exmple 1.1: Solve x + 1= for

More information

Katholieke Universiteit Leuven Department of Computer Science

Katholieke Universiteit Leuven Department of Computer Science Updte Rules for Weghted Non-negtve FH*G Fctorzton Peter Peers Phlp Dutré Report CW 440, Aprl 006 Ktholeke Unverstet Leuven Deprtment of Computer Scence Celestjnenln 00A B-3001 Heverlee (Belgum) Updte Rules

More information

Machine Learning. Support Vector Machines. Le Song. CSE6740/CS7641/ISYE6740, Fall Lecture 8, Sept. 13, 2012 Based on slides from Eric Xing, CMU

Machine Learning. Support Vector Machines. Le Song. CSE6740/CS7641/ISYE6740, Fall Lecture 8, Sept. 13, 2012 Based on slides from Eric Xing, CMU Mchne Lernng CSE6740/CS764/ISYE6740 Fll 0 Support Vector Mchnes Le Song Lecture 8 Sept. 3 0 Bsed on sldes fro Erc Xng CMU Redng: Chp. 6&7 C.B ook Outlne Mu rgn clssfcton Constrned optzton Lgrngn dult Kernel

More information

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x) DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng

More information

Excess Error, Approximation Error, and Estimation Error

Excess Error, Approximation Error, and Estimation Error E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple

More information

Haddow s Experiment:

Haddow s Experiment: schemtc drwng of Hddow's expermentl set-up movng pston non-contctng moton sensor bems of sprng steel poston vres to djust frequences blocks of sold steel shker Hddow s Experment: terr frm Theoretcl nd

More information

SVMs for regression Non-parametric/instance based classification method

SVMs for regression Non-parametric/instance based classification method S 75 Mchne ernng ecture Mos Huskrecht mos@cs.ptt.edu 539 Sennott Squre SVMs for regresson Non-prmetrc/nstnce sed cssfcton method S 75 Mchne ernng Soft-mrgn SVM Aos some fet on crossng the seprtng hperpne

More information

Lecture 4: Piecewise Cubic Interpolation

Lecture 4: Piecewise Cubic Interpolation Lecture notes on Vrtonl nd Approxmte Methods n Appled Mthemtcs - A Perce UBC Lecture 4: Pecewse Cubc Interpolton Compled 6 August 7 In ths lecture we consder pecewse cubc nterpolton n whch cubc polynoml

More information

CISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting

CISE 301: Numerical Methods Lecture 5, Topic 4 Least Squares, Curve Fitting CISE 3: umercl Methods Lecture 5 Topc 4 Lest Squres Curve Fttng Dr. Amr Khouh Term Red Chpter 7 of the tetoo c Khouh CISE3_Topc4_Lest Squre Motvton Gven set of epermentl dt 3 5. 5.9 6.3 The reltonshp etween

More information

HAMILTON-JACOBI TREATMENT OF LAGRANGIAN WITH FERMIONIC AND SCALAR FIELD

HAMILTON-JACOBI TREATMENT OF LAGRANGIAN WITH FERMIONIC AND SCALAR FIELD AMION-JACOBI REAMEN OF AGRANGIAN WI FERMIONIC AND SCAAR FIED W. I. ESRAIM 1, N. I. FARAA Dertment of Physcs, Islmc Unversty of Gz, P.O. Box 18, Gz, Plestne 1 wbrhm 7@hotml.com nfrht@ugz.edu.s Receved November,

More information

ψ ij has the eigenvalue

ψ ij has the eigenvalue Moller Plesset Perturbton Theory In Moller-Plesset (MP) perturbton theory one tes the unperturbed Hmltonn for n tom or molecule s the sum of the one prtcle Foc opertors H F() where the egenfunctons of

More information

CIS587 - Artificial Intelligence. Uncertainty CIS587 - AI. KB for medical diagnosis. Example.

CIS587 - Artificial Intelligence. Uncertainty CIS587 - AI. KB for medical diagnosis. Example. CIS587 - rtfcl Intellgence Uncertnty K for medcl dgnoss. Exmple. We wnt to uld K system for the dgnoss of pneumon. rolem descrpton: Dsese: pneumon tent symptoms fndngs, l tests: Fever, Cough, leness, WC

More information

Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC

Rank One Update And the Google Matrix by Al Bernstein Signal Science, LLC Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses

More information

Geometric Correction or Georeferencing

Geometric Correction or Georeferencing Geoetrc Correcton or Georeferencng GEOREFERENCING: fro ge to p Coordntes on erth: (λ, φ) ge: (, ) p: (, ) rel nteger Trnsfortons (nvolvng deforton): erth-to-ge: χ erth-to-p: ψ (crtogrphc proecton) ge-to-p:

More information

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Newton-Raphson Method of Solving a Nonlinear Equation Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson

More information

Why BP Works STAT 232B

Why BP Works STAT 232B Why BP Works STAT 232B Free Energes Helmholz & Gbbs Free Energes 1 Dstance between Probablstc Models - K-L dvergence b{ KL b{ p{ = b{ ln { } p{ Here, p{ s the eact ont prob. b{ s the appromaton, called

More information

1 Definition of Rademacher Complexity

1 Definition of Rademacher Complexity COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the

More information

The Schur-Cohn Algorithm

The Schur-Cohn Algorithm Modelng, Estmton nd Otml Flterng n Sgnl Processng Mohmed Njm Coyrght 8, ISTE Ltd. Aendx F The Schur-Cohn Algorthm In ths endx, our m s to resent the Schur-Cohn lgorthm [] whch s often used s crteron for

More information

LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER

LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN FRACTAL HEAT TRANSFER Yn, S.-P.: Locl Frctonl Lplce Seres Expnson Method for Dffuson THERMAL SCIENCE, Yer 25, Vol. 9, Suppl., pp. S3-S35 S3 LOCAL FRACTIONAL LAPLACE SERIES EXPANSION METHOD FOR DIFFUSION EQUATION ARISING IN

More information

4. Eccentric axial loading, cross-section core

4. Eccentric axial loading, cross-section core . Eccentrc xl lodng, cross-secton core Introducton We re strtng to consder more generl cse when the xl force nd bxl bendng ct smultneousl n the cross-secton of the br. B vrtue of Snt-Vennt s prncple we

More information

than 1. It means in particular that the function is decreasing and approaching the x-

than 1. It means in particular that the function is decreasing and approaching the x- 6 Preclculus Review Grph the functions ) (/) ) log y = b y = Solution () The function y = is n eponentil function with bse smller thn It mens in prticulr tht the function is decresing nd pproching the

More information

Hidden Markov Models

Hidden Markov Models CM229S: Machne Learnng for Bonformatcs Lecture 12-05/05/2016 Hdden Markov Models Lecturer: Srram Sankararaman Scrbe: Akshay Dattatray Shnde Edted by: TBD 1 Introducton For a drected graph G we can wrte

More information

Support vector machines for regression

Support vector machines for regression S 75 Mchne ernng ecture 5 Support vector mchnes for regresson Mos Huskrecht mos@cs.ptt.edu 539 Sennott Squre S 75 Mchne ernng he decson oundr: ˆ he decson: Support vector mchnes ˆ α SV ˆ sgn αˆ SV!!: Decson

More information

Least squares. Václav Hlaváč. Czech Technical University in Prague

Least squares. Václav Hlaváč. Czech Technical University in Prague Lest squres Václv Hlváč Czech echncl Unversty n Prgue hlvc@fel.cvut.cz http://cmp.felk.cvut.cz/~hlvc Courtesy: Fred Pghn nd J.P. Lews, SIGGRAPH 2007 Course; Outlne 2 Lner regresson Geometry of lest-squres

More information

THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR

THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR REVUE D ANALYSE NUMÉRIQUE ET DE THÉORIE DE L APPROXIMATION Tome 32, N o 1, 2003, pp 11 20 THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR TEODORA CĂTINAŞ Abstrct We extend the Sheprd opertor by

More information

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI

Logistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton

More information

consider in the case of 1) internal resonance ω 2ω and 2) external resonance Ω ω and small damping

consider in the case of 1) internal resonance ω 2ω and 2) external resonance Ω ω and small damping consder n the cse o nternl resonnce nd externl resonnce Ω nd smll dmpng recll rom "Two_Degs_Frdm_.ppt" tht θ + μ θ + θ = θφ + cos Ω t + τ where = k α α nd φ + μ φ + φ = θ + cos Ω t where = α τ s constnt

More information

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan. THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY Wllam A. Pearlman 2002 References: S. Armoto - IEEE Trans. Inform. Thy., Jan. 1972 R. Blahut - IEEE Trans. Inform. Thy., July 1972 Recall

More information

Read section 3.3, 3.4 Announcements:

Read section 3.3, 3.4 Announcements: Dte: 3/1/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: 1. f x = 3x 6, find the inverse, f 1 x., Using your grphing clcultor, Grph 1. f x,f

More information

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1

Dennis Bricker, 2001 Dept of Industrial Engineering The University of Iowa. MDP: Taxi page 1 Denns Brcker, 2001 Dept of Industrl Engneerng The Unversty of Iow MDP: Tx pge 1 A tx serves three djcent towns: A, B, nd C. Ech tme the tx dschrges pssenger, the drver must choose from three possble ctons:

More information

4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve

4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions

More information

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek ELM Numercl Anlss Dr Muhrrem Mercmek INTEPOLATION ELM Numercl Anlss Some of the contents re dopted from Lurene V. Fusett, Appled Numercl Anlss usng MATLAB. Prentce Hll Inc., 999 ELM Numercl Anlss Dr Muhrrem

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Mean Field / Variational Approximations

Mean Field / Variational Approximations Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but

More information

6. Chemical Potential and the Grand Partition Function

6. Chemical Potential and the Grand Partition Function 6. Chemcl Potentl nd the Grnd Prtton Functon ome Mth Fcts (see ppendx E for detls) If F() s n nlytc functon of stte vrles nd such tht df d pd then t follows: F F p lso snce F p F we cn conclude: p In other

More information

Fact: All polynomial functions are continuous and differentiable everywhere.

Fact: All polynomial functions are continuous and differentiable everywhere. Dierentibility AP Clculus Denis Shublek ilernmth.net Dierentibility t Point Deinition: ( ) is dierentible t point We write: = i nd only i lim eists. '( ) lim = or '( ) lim h = ( ) ( ) h 0 h Emple: The

More information

Effects of polarization on the reflected wave

Effects of polarization on the reflected wave Lecture Notes. L Ros PPLIED OPTICS Effects of polrzton on the reflected wve Ref: The Feynmn Lectures on Physcs, Vol-I, Secton 33-6 Plne of ncdence Z Plne of nterfce Fg. 1 Y Y r 1 Glss r 1 Glss Fg. Reflecton

More information

Physics 4B. A positive value is obtained, so the current is counterclockwise around the circuit.

Physics 4B. A positive value is obtained, so the current is counterclockwise around the circuit. Physcs 4B Solutons to Chapter 7 HW Chapter 7: Questons:, 8, 0 Problems:,,, 45, 48,,, 7, 9 Queston 7- (a) no (b) yes (c) all te Queston 7-8 0 μc Queston 7-0, c;, a;, d; 4, b Problem 7- (a) Let be the current

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

More information

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

Chapter Newton-Raphson Method of Solving a Nonlinear Equation Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson

More information

First Midterm Examination

First Midterm Examination 24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet

More information

7.2 Volume. A cross section is the shape we get when cutting straight through an object.

7.2 Volume. A cross section is the shape we get when cutting straight through an object. 7. Volume Let s revew the volume of smple sold, cylnder frst. Cylnder s volume=se re heght. As llustrted n Fgure (). Fgure ( nd (c) re specl cylnders. Fgure () s rght crculr cylnder. Fgure (c) s ox. A

More information

xp(x µ) = 0 p(x = 0 µ) + 1 p(x = 1 µ) = µ

xp(x µ) = 0 p(x = 0 µ) + 1 p(x = 1 µ) = µ CSE 455/555 Sprng 2013 Homework 7: Parametrc Technques Jason J. Corso Computer Scence and Engneerng SUY at Buffalo jcorso@buffalo.edu Solutons by Yngbo Zhou Ths assgnment does not need to be submtted and

More information

MTH 146 Class 7 Notes

MTH 146 Class 7 Notes 7.7- Approxmte Itegrto Motvto: MTH 46 Clss 7 Notes I secto 7.5 we lered tht some defte tegrls, lke x e dx, cot e wrtte terms of elemetry fuctos. So, good questo to sk would e: How c oe clculte somethg

More information

An Introduction to Support Vector Machines

An Introduction to Support Vector Machines An Introducton to Support Vector Mchnes Wht s good Decson Boundry? Consder two-clss, lnerly seprble clssfcton problem Clss How to fnd the lne (or hyperplne n n-dmensons, n>)? Any de? Clss Per Lug Mrtell

More information

Introducing Entropy Distributions

Introducing Entropy Distributions Graubner, Schdt & Proske: Proceedngs of the 6 th Internatonal Probablstc Workshop, Darstadt 8 Introducng Entropy Dstrbutons Noel van Erp & Peter van Gelder Structural Hydraulc Engneerng and Probablstc

More information

find (x): given element x, return the canonical element of the set containing x;

find (x): given element x, return the canonical element of the set containing x; COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:

More information

Applied Statistics Qualifier Examination

Applied Statistics Qualifier Examination Appled Sttstcs Qulfer Exmnton Qul_june_8 Fll 8 Instructons: () The exmnton contns 4 Questons. You re to nswer 3 out of 4 of them. () You my use ny books nd clss notes tht you mght fnd helpful n solvng

More information

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup

BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (

More information

Computational and Statistical Learning theory Assignment 4

Computational and Statistical Learning theory Assignment 4 Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}

More information

Abhilasha Classes Class- XII Date: SOLUTION (Chap - 9,10,12) MM 50 Mob no

Abhilasha Classes Class- XII Date: SOLUTION (Chap - 9,10,12) MM 50 Mob no hlsh Clsses Clss- XII Dte: 0- - SOLUTION Chp - 9,0, MM 50 Mo no-996 If nd re poston vets of nd B respetvel, fnd the poston vet of pont C n B produed suh tht C B vet r C B = where = hs length nd dreton

More information

Fast Frequent Free Tree Mining in Graph Databases

Fast Frequent Free Tree Mining in Graph Databases The Chinese University of Hong Kong Fst Frequent Free Tree Mining in Grph Dtses Peixing Zho Jeffrey Xu Yu The Chinese University of Hong Kong Decemer 18 th, 2006 ICDM Workshop MCD06 Synopsis Introduction

More information

The graphs of Rational Functions

The graphs of Rational Functions Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

More information

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. with respect to λ. 1. χ λ χ λ ( ) λ, and thus:

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede. with respect to λ. 1. χ λ χ λ ( ) λ, and thus: More on χ nd errors : uppose tht we re fttng for sngle -prmeter, mnmzng: If we epnd The vlue χ ( ( ( ; ( wth respect to. χ n Tlor seres n the vcnt of ts mnmum vlue χ ( mn χ χ χ χ + + + mn mnmzes χ, nd

More information

International Journal of Pure and Applied Sciences and Technology

International Journal of Pure and Applied Sciences and Technology Int. J. Pure Appl. Sc. Technol., () (), pp. 44-49 Interntonl Journl of Pure nd Appled Scences nd Technolog ISSN 9-67 Avlle onlne t www.jopst.n Reserch Pper Numercl Soluton for Non-Lner Fredholm Integrl

More information

8. Computing Eigenvalues in Parallel

8. Computing Eigenvalues in Parallel 8. Coptng Egenles n Prllel x egenector wth egenle λ, ff: x λx, x spd, then there exsts n orthogonl ss of egenectors λ,,,,n Λ or Λ,..., n ), Λ dg λ,..., λ n ) n generl y e coplex ntry nd Λ n pper trnglr

More information

Polynomial Regression Models

Polynomial Regression Models LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance

More information

If C = 60 and = P, find the value of P. c 2 = a 2 + b 2 2abcos 60 = a 2 + b 2 ab a 2 + b 2 = c 2 + ab. c a

If C = 60 and = P, find the value of P. c 2 = a 2 + b 2 2abcos 60 = a 2 + b 2 ab a 2 + b 2 = c 2 + ab. c a Answers: (000-0 HKMO Finl Events) Creted : Mr. Frncis Hung Lst updted: 0 June 08 Individul Events I P I P I P I P 5 7 0 0 S S S S Group Events G G G G 80 00 0 c 8 c c c d d 6 d 5 d 85 Individul Event I.,

More information

Quiz: Experimental Physics Lab-I

Quiz: Experimental Physics Lab-I Mxmum Mrks: 18 Totl tme llowed: 35 mn Quz: Expermentl Physcs Lb-I Nme: Roll no: Attempt ll questons. 1. In n experment, bll of mss 100 g s dropped from heght of 65 cm nto the snd contner, the mpct s clled

More information

Math& 152 Section Integration by Parts

Math& 152 Section Integration by Parts Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

A Family of Multivariate Abel Series Distributions. of Order k

A Family of Multivariate Abel Series Distributions. of Order k Appled Mthemtcl Scences, Vol. 2, 2008, no. 45, 2239-2246 A Fmly of Multvrte Abel Seres Dstrbutons of Order k Rupk Gupt & Kshore K. Ds 2 Fculty of Scence & Technology, The Icf Unversty, Agrtl, Trpur, Ind

More information

Probability-Theoretic Junction Trees

Probability-Theoretic Junction Trees Probablty-Theoretc Juncton Trees Payam Pakzad, (wth Venkat Anantharam, EECS Dept, U.C. Berkeley EPFL, ALGO/LMA Semnar 2/2/2004 Margnalzaton Problem Gven an arbtrary functon of many varables, fnd (some

More information

Using Predictions in Online Optimization: Looking Forward with an Eye on the Past

Using Predictions in Online Optimization: Looking Forward with an Eye on the Past Usng Predctons n Onlne Optmzton: Lookng Forwrd wth n Eye on the Pst Nngjun Chen Jont work wth Joshu Comden, Zhenhu Lu, Anshul Gndh, nd Adm Wermn 1 Predctons re crucl for decson mkng 2 Predctons re crucl

More information

Data Assimilation for 2-D Advection-Dispersion Equations

Data Assimilation for 2-D Advection-Dispersion Equations Dt Asslton for -D Advecton-Dsperson qutons Sergey Kvv Insttute of Mthetcl Mchnes nd Syste Probles Ntonl Acdey of Scences of Ukrne 4 Glushkov pr. 387 Kev Ukrne slk@env.sp.kev.u Abstrct. Dt sslton bsed on

More information

Bayesian Networks. Course: CS40022 Instructor: Dr. Pallab Dasgupta

Bayesian Networks. Course: CS40022 Instructor: Dr. Pallab Dasgupta Bayesan Networks Course: CS40022 Instructor: Dr. Pallab Dasgupta Department of Computer Scence & Engneerng Indan Insttute of Technology Kharagpur Example Burglar alarm at home Farly relable at detectng

More information

1. Statement of the problem

1. Statement of the problem Volue 14, 010 15 ON THE ITERATIVE SOUTION OF A SYSTEM OF DISCRETE TIMOSHENKO EQUATIONS Peradze J. and Tsklaur Z. I. Javakhshvl Tbls State Uversty,, Uversty St., Tbls 0186, Georga Georgan Techcal Uversty,

More information

Engineering Risk Benefit Analysis

Engineering Risk Benefit Analysis Engneerng Rsk Beneft Analyss.55, 2.943, 3.577, 6.938, 0.86, 3.62, 6.862, 22.82, ESD.72, ESD.72 RPRA 2. Elements of Probablty Theory George E. Apostolaks Massachusetts Insttute of Technology Sprng 2007

More information

M/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ

M/G/1/GD/ / System. ! Pollaczek-Khinchin (PK) Equation. ! Steady-state probabilities. ! Finding L, W q, W. ! π 0 = 1 ρ M/G//GD/ / System! Pollcze-Khnchn (PK) Equton L q 2 2 λ σ s 2( + ρ ρ! Stedy-stte probbltes! π 0 ρ! Fndng L, q, ) 2 2 M/M/R/GD/K/K System! Drw the trnston dgrm! Derve the stedy-stte probbltes:! Fnd L,L

More information

Lecture 5: Ideal monatomic gas

Lecture 5: Ideal monatomic gas Lecture 5: Ideal monatomc gas Statstcal mechancs of the perfect gas Ams: Key new concepts and methods: Countng states Waves n a box. Demonstraton that β / kt Heat, work and Entropy n statstcal mechancs

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Machine learning: Density estimation

Machine learning: Density estimation CS 70 Foundatons of AI Lecture 3 Machne learnng: ensty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square ata: ensty estmaton {.. n} x a vector of attrbute values Objectve: estmate the model of

More information

Section 7.1 Integration by Substitution

Section 7.1 Integration by Substitution Section 7. Integrtion by Substitution Evlute ech of the following integrls. Keep in mind tht using substitution my not work on some problems. For one of the definite integrls, it is not possible to find

More information

Computations in Quantum Tensor Networks

Computations in Quantum Tensor Networks Coputtons n Quntu Tensor etwors Thos ucle Thos Schulte-erbrüggen Konrd Wldherr Bonn 4.8. Overvew () Proble settng: Coputton of Ground Sttes Physcl odel nd th. descrpton () Effcent Representton of Vectors

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

VECTORS VECTORS VECTORS VECTORS. 2. Vector Representation. 1. Definition. 3. Types of Vectors. 5. Vector Operations I. 4. Equal and Opposite Vectors

VECTORS VECTORS VECTORS VECTORS. 2. Vector Representation. 1. Definition. 3. Types of Vectors. 5. Vector Operations I. 4. Equal and Opposite Vectors 1. Defnton A vetor s n entt tht m represent phsl quntt tht hs mgntude nd dreton s opposed to slr tht ls dreton.. Vetor Representton A vetor n e represented grphll n rrow. The length of the rrow s the mgntude

More information

Review of linear algebra. Nuno Vasconcelos UCSD

Review of linear algebra. Nuno Vasconcelos UCSD Revew of lner lgebr Nuno Vsconcelos UCSD Vector spces Defnton: vector spce s set H where ddton nd sclr multplcton re defned nd stsf: ) +( + ) (+ )+ 5) λ H 2) + + H 6) 3) H, + 7) λ(λ ) (λλ ) 4) H, - + 8)

More information

Second degree generalized gauss-seidel iteration method for solving linear system of equations. ABSTRACT

Second degree generalized gauss-seidel iteration method for solving linear system of equations. ABSTRACT Ethiop. J. Sci. & Technol. 7( 5-, 0 5 Second degree generlized guss-seidel itertion ethod for solving liner syste of equtions Tesfye Keede Bhir Dr University, College of Science, Deprtent of Mthetics tk_ke@yhoo.co

More information

Math 113 Exam 2 Practice

Math 113 Exam 2 Practice Mth Em Prctice Februry, 8 Em will cover sections 6.5, 7.-7.5 nd 7.8. This sheet hs three sections. The first section will remind you bout techniques nd formuls tht you should know. The second gives number

More information

Harvard University Computer Science 121 Midterm October 23, 2012

Harvard University Computer Science 121 Midterm October 23, 2012 Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is

More information

Lecture 6 More on Complete Randomized Block Design (RBD)

Lecture 6 More on Complete Randomized Block Design (RBD) Lecture 6 More on Complete Randomzed Block Desgn (RBD) Multple test Multple test The multple comparsons or multple testng problem occurs when one consders a set of statstcal nferences smultaneously. For

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

a = Acceleration Linear Motion Acceleration Changing Velocity All these Velocities? Acceleration and Freefall Physics 114

a = Acceleration Linear Motion Acceleration Changing Velocity All these Velocities? Acceleration and Freefall Physics 114 Lner Accelerton nd Freell Phyc 4 Eyre Denton o ccelerton Both de o equton re equl Mgntude Unt Drecton (t ector!) Accelerton Mgntude Mgntude Unt Unt Drecton Drecton 4/3/07 Module 3-Phy4-Eyre 4/3/07 Module

More information

Precalculus Spring 2017

Precalculus Spring 2017 Preclculus Spring 2017 Exm 3 Summry (Section 4.1 through 5.2, nd 9.4) Section P.5 Find domins of lgebric expressions Simplify rtionl expressions Add, subtrct, multiply, & divide rtionl expressions Simplify

More information

GAUSS ELIMINATION. Consider the following system of algebraic linear equations

GAUSS ELIMINATION. Consider the following system of algebraic linear equations Numercl Anlyss for Engneers Germn Jordnn Unversty GAUSS ELIMINATION Consder the followng system of lgebrc lner equtons To solve the bove system usng clsscl methods, equton () s subtrcted from equton ()

More information

Homework Assignment 3 Due in class, Thursday October 15

Homework Assignment 3 Due in class, Thursday October 15 Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Convergence Theorems for Two Iterative Methods. A stationary iterative method for solving the linear system: (1.1)

Convergence Theorems for Two Iterative Methods. A stationary iterative method for solving the linear system: (1.1) Conrgnc Thors for Two Itrt Mthods A sttonry trt thod for solng th lnr syst: Ax = b (.) ploys n trton trx B nd constnt ctor c so tht for gn strtng stt x of x for = 2... x Bx c + = +. (.2) For such n trton

More information

Learning Theory: Lecture Notes

Learning Theory: Lecture Notes Learnng Theory: Lecture Notes Lecturer: Kamalka Chaudhur Scrbe: Qush Wang October 27, 2012 1 The Agnostc PAC Model Recall that one of the constrants of the PAC model s that the data dstrbuton has to be

More information