Tracking Performance of the MMax Conjugate Gradient Algorithm Bei Xie and Tamal Bose
|
|
- Darren Waters
- 5 years ago
- Views:
Transcription
1 racki Performace of the MMa Cojuate Gradiet Alorithm Bei Xie ad amal Bose Bradley Det. of Electrical ad Comuter Eieeri Viriia ech
2 Outlie Motivatio Backroud Cojuate Gradiet CG Alorithm Partial Udate Methods Partial Udate CG Alorithm racki Performace Aalysis Simulatios Summary
3 Motivatio Ho to reduce the comutatioal comleity of a adative filter? Solutios: Usi artial udate PU methods. What are the tracki erformace by usi artial udate methods to CG?
4 Cojuate Gradiet Alorithm b Solve system ith form Equivalet to fid a to miimize the cost fuctio 1 J b he radiet of the cost fuctio is: b J he residual vector is defied as: b J
5 A lie search method for miimizi the cost fuctio has the form: 1 is the directio vector CG chooses the directio is cojuately orthooal to the revious directios m 0, m
6 No e fid to miimize he residual vector is also equal to he residual vector is orthooal to the revious directio vectors, 1 J b J 1 1 b 1 1 b b m m, 0
7 CG chooses the directio i the form of Use Polak-ibière P method, 1 β β P method is chose because it is a o-reset method ad erforms better for o-costat matri CG ith P method usually coveres faster tha Fletcher- eeves F method
8 CG Alorithm i adative filter system A basic adative filter system model is d * v d is the desired sial =[,-1,,-N+1] is the iut data vector of a uko system * =[ 1*, *,, N* ] is the imulse resose vector of the uko system * is costat for time-ivariat system * chaes for time-varyi sytem v is a hite oise
9 o estimate the ad b i he eoetially decayi data ido is used b d i i d i i i i i i b b λ is the foretti factor
10 , 1 1 β β d b he CG alorithm i a adative filter system is summarized as: Iitial coditios: 0=0, 0=0, 1=0 η is used to uaratee coverece
11 Partial Udate PU Methods Udate art of the eihts to save the comutatioal comleity Each udate ste, udate M<N coefficiets Basic PU methods iclude eriodic, sequetial, stochastic, ad MMa methods he eriodic method: udate the eihts at every S th iteratio ad coy the eihts at the other iteratios, here S M N
12 he sequetial method: choose the subset of the eihts i a roud-robi fashio. he stochastic method: is a radomized versio of the sequetial method. Usually a uiformly distributed radom rocess ill be alied. he MMa method: the elemets of the eiht are udated accordi to the ositio of the M larest elemets of the iut vector.
13 ˆ ˆ , ˆ 1 ˆ ˆ 1 ˆ ˆ β β d Partial Udate CG Alorithm he artial udate CG alorithm i a adative filter system is summarized as:
14 01,, ˆ 1 1 i M i i i i k N k k N M M I I he umber of multilicatios of CG is 3N +10N+3 er samle he umber of multilicatios of PU CG is N +M +9N+M+3 er samle
15 he MMa method: the elemets of the iut are chose accordi to the ositio of the M larest elemets of the iut vector i k 1 0 if k otherise ma 1l N l, M SOLINE method is used for comariso Mma CG eeds + lo N comarisos
16 racki Performace Aalysis of PU CG Desired sial becomes: d ime-varyi system * uses a first-order Markov model * * is very close to uity is rocess oise * v 1
17 Assumtios: he coefficiet error -* is small ad ideedet of the iut sial at steady state White oise v is ideedet of the iut sial ad is ideedet of rocess oise η Iut sial is ideedet of both v ad η
18 At steady state, the MSE of PU CG ith correlated iut is 1 1 ~ ˆ ~ 1 1 v v tr d E e E ˆ ˆ ˆ ˆ 1 ~ ~ ~ 1 ˆ ~ E E E
19 ~ ˆ ~ ˆ 4 ~ ˆ v E tr tr tr tr N e E v v v At steady state, the MSE of PU CG ith hite iut is Variace of oise
20 1 1 1 tr N e E v v For MMa method ad hite iut, κ <1, κ is close to 1 ~ ˆ, For hite rocess oise η v v N e E
21 Simulatios System idetificatio model he iitial imulse resose of uko system is 16-order N=16 FI filter *=[0.01,0.0,-0.04,-0.08,0.15,-0.3,0.45, 0.6, 0.6,0.45,-0.3,0.15,-0.08,-0.04,0.0,0.01]
22 he variace of the iut oise σ v = Parameter λ=0.9 ad η=0.6 White iut, variace is 1 i Markov model is
23 racki Performace of MMa CG MMa CG, M=8, = MMa CG, M=4, = MMa CG, M=8, =0.001 MMa CG, M=4, = MMa CG, M=8, = MMa CG, M=4, = MSEdB MSEdB samles samles Comariso of MSE of MMa CG for varyi rocess oise η, M=8 Comariso of MSE of MMa CG for varyi rocess oise η, M=4
24 he MSE of MMa CG icreases he the rocess oise icreases. he variace of the MSE icreases he the rocess oise icreases. he artial udate leth does ot have much effect o the MSE results. he artial udate leth oly affects the coverece rate. he coverece rate decreases as the artial udate leth decreases.
25 able 1. he simulated MSE ad theoretical MSE of MMa CG for varyi rocess oise η, M = 8. Process oise σ η Simulated MSE db heoretical MSE db able. he simulated MSE ad theoretical MSE of MMa CG for varyi rocess oise η, M = 4. Process oise σ η Simulated MSE db heoretical MSE db he theoretical results match the simulated results.
26 Performace comariso betee MMa CG ad MMa LS CG MMa CG M=8 LS MMa LS M= CG MMa CG M=4 LS MMa LS M=4 MSEdB MSEdB samles Comariso of MSE of MMa CG ith CG, LS, MMa LS for hite iut, N=16, M= samles Comariso of MSE of MMa CG ith CG, LS, MMa LS for hite iut, N=16, M=4. After 000 samles/iteratios ass, the uko system is chaed by multilyi all coefficiets by -1. he artial udate leth oly affects the coverece rate at the beii i this case.
27 able 3. he comutatioal comleities of CG, MMa CG, LS, ad MMa LS. Alorithms Number of multilicatios er symbol Number of comarisos er symbol CG N= MMa CG N= MMa CG N= LS N= MMa LS N= MMa LS N=
28 Summary he tracki erformace of the MMa CG is aalyzed heoretical mea-square erformace is derived for hite ad correlated iuts he tracki erformace of MMa CG is comared ith CG, LS, MMa LS by usi comuter simulatios he MMa CG alorithm ca achieve similar erformace to the full-udate CG hile reduci comutatioal comleity siificatly he MMa CG alorithm ca achieve similar erformace to the MMa LS hile havi loer comutatioal comleity
LECTURE 17: Linear Discriminant Functions
LECURE 7: Liear Discrimiat Fuctios Perceptro leari Miimum squared error (MSE) solutio Least-mea squares (LMS) rule Ho-Kashyap procedure Itroductio to Patter Aalysis Ricardo Gutierrez-Osua exas A&M Uiversity
More information( ) = is larger than. the variance of X V
Stat 400, sectio 6. Methods of Poit Estimatio otes by Tim Pilachoski A oit estimate of a arameter is a sigle umber that ca be regarded as a sesible value for The selected statistic is called the oit estimator
More informationClassification of DT signals
Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {
More informationChapter 6: BINOMIAL PROBABILITIES
Charles Bocelet, Probability, Statistics, ad Radom Sigals," Oxford Uiversity Press, 016. ISBN: 978-0-19-00051-0 Chater 6: BINOMIAL PROBABILITIES Sectios 6.1 Basics of the Biomial Distributio 6. Comutig
More information15.093J Optimization Methods. Lecture 22: Barrier Interior Point Algorithms
1593J Otimizatio Methods Lecture : Barrier Iterior Poit Algorithms 1 Outlie 1 Barrier Methods Slide 1 The Cetral Path 3 Aroximatig the Cetral Path 4 The Primal Barrier Algorithm 5 The Primal-Dual Barrier
More informationEstimation for a Class of Generalized State-Space Space Models:
Estimatio for a Class of Geeralized State-Sace Sace Models: Richard A. Davis ad Gabriel Rodriuez-Yam Colorado State Uiversit htt://www.stat.colostate.edu/~rdavis/lectures Joit work with: William Dusmuir
More informationChapter 2. Finite Fields (Chapter 3 in the text)
Chater 2. Fiite Fields (Chater 3 i the tet 1. Grou Structures 2. Costructios of Fiite Fields GF(2 ad GF( 3. Basic Theory of Fiite Fields 4. The Miimal Polyomials 5. Trace Fuctios 6. Subfields 1. Grou Structures
More informationRecursive Updating Fixed Parameter
Recursive Udatig Fixed Parameter So far we ve cosidered the sceario where we collect a buch of data ad the use that (ad the rior PDF) to comute the coditioal PDF from which we ca the get the MAP, or ay
More informationPUTNAM TRAINING PROBABILITY
PUTNAM TRAINING PROBABILITY (Last udated: December, 207) Remark. This is a list of exercises o robability. Miguel A. Lerma Exercises. Prove that the umber of subsets of {, 2,..., } with odd cardiality
More informationTo make comparisons for two populations, consider whether the samples are independent or dependent.
Sociology 54 Testig for differeces betwee two samle meas Cocetually, comarig meas from two differet samles is the same as what we ve doe i oe-samle tests, ecet that ow the hyotheses focus o the arameters
More informationWEIGHTED LEAST SQUARES - used to give more emphasis to selected points in the analysis. Recall, in OLS we minimize Q =! % =!
WEIGHTED LEAST SQUARES - used to give more emphasis to selected poits i the aalysis What are eighted least squares?! " i=1 i=1 Recall, i OLS e miimize Q =! % =!(Y - " - " X ) or Q = (Y_ - X "_) (Y_ - X
More information732 Appendix E: Previous EEE480 Exams. Rules: One sheet permitted, calculators permitted. GWC 352,
732 Aedix E: Previous EEE0 Exams EEE0 Exam 2, Srig 2008 A.A. Rodriguez Rules: Oe 8. sheet ermitted, calculators ermitted. GWC 32, 9-372 Problem Aalysis of a Feedback System Cosider the feedback system
More informationMachine Learning. Logistic Regression -- generative verses discriminative classifier. Le Song /15-781, Spring 2008
Machie Learig 070/578 Srig 008 Logistic Regressio geerative verses discrimiative classifier Le Sog Lecture 5 Setember 4 0 Based o slides from Eric Xig CMU Readig: Cha. 3..34 CB Geerative vs. Discrimiative
More informationNonequilibrium Excess Carriers in Semiconductors
Lecture 8 Semicoductor Physics VI Noequilibrium Excess Carriers i Semicoductors Noequilibrium coditios. Excess electros i the coductio bad ad excess holes i the valece bad Ambiolar trasort : Excess electros
More informationECE534, Spring 2018: Final Exam
ECE534, Srig 2018: Fial Exam Problem 1 Let X N (0, 1) ad Y N (0, 1) be ideedet radom variables. variables V = X + Y ad W = X 2Y. Defie the radom (a) Are V, W joitly Gaussia? Justify your aswer. (b) Comute
More informationBirth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes.
EEC 686/785 Modelig & Perforace Evaluatio of Couter Systes Lecture Webig Zhao Deartet of Electrical ad Couter Egieerig Clevelad State Uiversity webig@ieee.org based o Dr. Raj jai s lecture otes Relatioshi
More informationRound-off Errors and Computer Arithmetic - (1.2)
Roud-off Errors ad Comuter Arithmetic - (1.) 1. Roud-off Errors: Roud-off errors is roduced whe a calculator or comuter is used to erform real umber calculatios. That is because the arithmetic erformed
More informationBIOSTATISTICAL METHODS FOR TRANSLATIONAL & CLINICAL RESEARCH
BIOSAISICAL MEHODS FOR RANSLAIONAL & CLINICAL RESEARCH Direct Bioassays: REGRESSION APPLICAIONS COMPONENS OF A BIOASSAY he subject is usually a aimal, a huma tissue, or a bacteria culture, he aget is usually
More informationNew Definition of Density on Knapsack Cryptosystems
Africacryt008@Casablaca 008.06.1 New Defiitio of Desity o Kasac Crytosystems Noboru Kuihiro The Uiversity of Toyo, Jaa 1/31 Kasac Scheme rough idea Public Key: asac: a={a 1, a,, a } Ecrytio: message m=m
More information1 Duality revisited. AM 221: Advanced Optimization Spring 2016
AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationA PENALTY-CONJUGATE GRADIENT ALGORITHM FOR SOLVING CONSTRAINED OPTIMIZATION PROBLEMS
IJRRAS 35 () April 8 wwwarpapresscom/volumes/vol35issue/ijrras_35 pdf A PENALY-CONJUGAE GRADIEN ALGORIHM FOR SOLVING CONSRAINED OPIMIZAION PROBLEMS Hoia Zha Zhuohua Lia & Weli Zhao School of Mathematics
More informationIntroduction to Optimization Techniques. How to Solve Equations
Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually
More informationSimple Regression. Acknowledgement. These slides are based on presentations created and copyrighted by Prof. Daniel Menasce (GMU) CS 700
Simple Regressio CS 7 Ackowledgemet These slides are based o presetatios created ad copyrighted by Prof. Daiel Measce (GMU) Basics Purpose of regressio aalysis: predict the value of a depedet or respose
More informationCOMPUTING FOURIER SERIES
COMPUTING FOURIER SERIES Overview We have see i revious otes how we ca use the fact that si ad cos rereset comlete orthogoal fuctios over the iterval [-,] to allow us to determie the coefficiets of a Fourier
More informationHypothesis Testing. H 0 : θ 1 1. H a : θ 1 1 (but > 0... required in distribution) Simple Hypothesis - only checks 1 value
Hyothesis estig ME's are oit estimates of arameters/coefficiets really have a distributio Basic Cocet - develo regio i which we accet the hyothesis ad oe where we reject it H - reresets all ossible values
More informationNotation List. For Cambridge International Mathematics Qualifications. For use from 2020
Notatio List For Cambridge Iteratioal Mathematics Qualificatios For use from 2020 Notatio List for Cambridge Iteratioal Mathematics Qualificatios (For use from 2020) Mathematical otatio Eamiatios for CIE
More informationSolutions to Problem Sheet 1
Solutios to Problem Sheet ) Use Theorem. to rove that loglog for all real 3. This is a versio of Theorem. with the iteger N relaced by the real. Hit Give 3 let N = [], the largest iteger. The, imortatly,
More informationChapter 5. Estimation Theory and Applications. References:
Chapter 5 stimatio heory ad pplicatios Refereces: S.M.Kay, Fudametals of Statistical Sigal Processig: stimatio heory, Pretice all, 993 stimatio heory ad pplicatios pplicatio reas. Radar Radar system trasmits
More informationOFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI
MIMO-OFDM OFDM Precoder for Miimizig BER Upper Boud of MLD uder Imperfect CSI MCRG Joit Semiar Jue the th 008 Previously preseted at ICC 008 Beijig o May the st 008 Boosar Pitakdumrogkija Kazuhiko Fukawa
More informationFirst, note that the LS residuals are orthogonal to the regressors. X Xb X y = 0 ( normal equations ; (k 1) ) So,
0 2. OLS Part II The OLS residuals are orthogoal to the regressors. If the model icludes a itercept, the orthogoality of the residuals ad regressors gives rise to three results, which have limited practical
More information3/3/2014. CDS M Phil Econometrics. Types of Relationships. Types of Relationships. Types of Relationships. Vijayamohanan Pillai N.
3/3/04 CDS M Phil Old Least Squares (OLS) Vijayamohaa Pillai N CDS M Phil Vijayamoha CDS M Phil Vijayamoha Types of Relatioships Oly oe idepedet variable, Relatioship betwee ad is Liear relatioships Curviliear
More informationECE 6980 An Algorithmic and Information-Theoretic Toolbox for Massive Data
ECE 6980 A Algorithmic ad Iformatio-Theoretic Toolbo for Massive Data Istructor: Jayadev Acharya Lecture # Scribe: Huayu Zhag 8th August, 017 1 Recap X =, ε is a accuracy parameter, ad δ is a error parameter.
More informationExercise 4.3 Use the Continuity Theorem to prove the Cramér-Wold Theorem, Theorem. (1) φ a X(1).
Assigmet 7 Exercise 4.3 Use the Cotiuity Theorem to prove the Cramér-Wold Theorem, Theorem 4.12. Hit: a X d a X implies that φ a X (1) φ a X(1). Sketch of solutio: As we poited out i class, the oly tricky
More informationPC5215 Numerical Recipes with Applications - Review Problems
PC55 Numerical Recipes with Applicatios - Review Problems Give the IEEE 754 sigle precisio bit patter (biary or he format) of the followig umbers: 0 0 05 00 0 00 Note that it has 8 bits for the epoet,
More informationMachine Learning for Data Science (CS 4786)
Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get
More informationECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors
ECONOMETRIC THEORY MODULE XIII Lecture - 34 Asymptotic Theory ad Stochastic Regressors Dr. Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Asymptotic theory The asymptotic
More informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 1
PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured
More informationEmpirical likelihood for parametric model under imputation for missing
Emirical likelihood for arametric model uder imutatio for missig data Lichu Wag Ceter for Statistics Limburgs Uiversitair Cetrum Uiversitaire Camus B-3590 Dieebeek Belgium Qihua Wag Istitute of Alied Mathematics
More informationOutput Analysis and Run-Length Control
IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%
More informationMassachusetts Institute of Technology
Massachusetts Istitute of Techology 6.867 Machie Learig, Fall 6 Problem Set : Solutios. (a) (5 poits) From the lecture otes (Eq 4, Lecture 5), the optimal parameter values for liear regressio give the
More informationSums, products and sequences
Sums, products ad sequeces How to write log sums, e.g., 1+2+ (-1)+ cocisely? i=1 Sum otatio ( sum from 1 to ): i 3 = 1 + 2 + + If =3, i=1 i = 1+2+3=6. The ame ii does ot matter. Could use aother letter
More informationApply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.
Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α
More informationRank Modulation with Multiplicity
Rak Modulatio with Multiplicity Axiao (Adrew) Jiag Computer Sciece ad Eg. Dept. Texas A&M Uiversity College Statio, TX 778 ajiag@cse.tamu.edu Abstract Rak modulatio is a scheme that uses the relative order
More informationSTATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. Comments:
Recall: STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Commets:. So far we have estimates of the parameters! 0 ad!, but have o idea how good these estimates are. Assumptio: E(Y x)! 0 +! x (liear coditioal
More informationChapter 1 Simple Linear Regression (part 6: matrix version)
Chapter Simple Liear Regressio (part 6: matrix versio) Overview Simple liear regressio model: respose variable Y, a sigle idepedet variable X Y β 0 + β X + ε Multiple liear regressio model: respose Y,
More informationLinear Regression Models
Liear Regressio Models Dr. Joh Mellor-Crummey Departmet of Computer Sciece Rice Uiversity johmc@cs.rice.edu COMP 528 Lecture 9 15 February 2005 Goals for Today Uderstad how to Use scatter diagrams to ispect
More informationGrowth of Functions. Chapter 3. CPTR 430 Algorithms Growth of Functions 1
Growth o Fuctios Chapter 3 CPTR 430 Alorithms Growth o Fuctios 1 Asymptotic Eiciecy o Alorithms Idea: Look at iput sizes lare eouh to make rui time order o rowth relevat How does the rui time o a alorithm
More informationCurrent Mode Winner-Take-All Circuits Shih-Chii Liu. Translinear Principle. Current-Mode Low-Pass Filter. Translinear Principle
NE Lecture 6 Wier-Take-All 0/9/03 Curret Mode Wier-Take-All Circuits Shih-Chii Liu Outlie: Trasliear Priciple Curret-Mode Circuit Fuctios: Low-Pass Temporal Filter PseudoCoductaces Spatial Filteri Resistive
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationNBHM QUESTION 2007 Section 1 : Algebra Q1. Let G be a group of order n. Which of the following conditions imply that G is abelian?
NBHM QUESTION 7 NBHM QUESTION 7 NBHM QUESTION 7 Sectio : Algebra Q Let G be a group of order Which of the followig coditios imply that G is abelia? 5 36 Q Which of the followig subgroups are ecesarily
More informationECE534, Spring 2018: Solutions for Problem Set #2
ECE534, Srig 08: s for roblem Set #. Rademacher Radom Variables ad Symmetrizatio a) Let X be a Rademacher radom variable, i.e., X = ±) = /. Show that E e λx e λ /. E e λx = e λ + e λ = + k= k=0 λ k k k!
More informationHomework Set #3 - Solutions
EE 15 - Applicatios of Covex Optimizatio i Sigal Processig ad Commuicatios Dr. Adre Tkaceko JPL Third Term 11-1 Homework Set #3 - Solutios 1. a) Note that x is closer to x tha to x l i the Euclidea orm
More informationEmpirical Process Theory and Oracle Inequalities
Stat 928: Statistical Learig Theory Lecture: 10 Empirical Process Theory ad Oracle Iequalities Istructor: Sham Kakade 1 Risk vs Risk See Lecture 0 for a discussio o termiology. 2 The Uio Boud / Boferoi
More informationA Probabilistic Analysis of Quicksort
A Probabilistic Aalysis of Quicsort You are assumed to be familiar with Quicsort. I each iteratio this sortig algorithm chooses a pivot ad the, by performig comparisios with the pivot, splits the remaider
More informationAdaptive Echo Noise Elimination for Speech Enhancement of Tamil letter Zha
Adative Echo Noise Elimiatio for Seech Ehacemet of Tamil letter Zha A. Sriivasa Deartmet of ECE, Sriivasa Ramauja Cetre, SASTRA Uiversity, Kumbakoam-612001, Idia. E-mail: asriivasa78@yahoo.com Abstract
More informationENGI 4421 Discrete Probability Distributions Page Discrete Probability Distributions [Navidi sections ; Devore sections
ENGI 441 Discrete Probability Distributios Page 9-01 Discrete Probability Distributios [Navidi sectios 4.1-4.4; Devore sectios 3.4-3.6] Chater 5 itroduced the cocet of robability mass fuctios for discrete
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5
CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio
More informationThe Maximum-Likelihood Decoding Performance of Error-Correcting Codes
The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,
More informationLecture 22: Review for Exam 2. 1 Basic Model Assumptions (without Gaussian Noise)
Lecture 22: Review for Exam 2 Basic Model Assumptios (without Gaussia Noise) We model oe cotiuous respose variable Y, as a liear fuctio of p umerical predictors, plus oise: Y = β 0 + β X +... β p X p +
More informationMachine Learning Regression I Hamid R. Rabiee [Slides are based on Bishop Book] Spring
Machie Learig Regressio I Hamid R. Rabiee [Slides are based o Bishop Book] Sprig 015 http://ce.sharif.edu/courses/93-94//ce717-1 Liear Regressio Liear regressio: ivolves a respose variable ad a sigle predictor
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationEstimation Theory Chapter 3
stimatio Theory Chater 3 Likelihood Fuctio Higher deedece of data PDF o ukow arameter results i higher estimatio accuracy amle : If ˆ If large, W, Choose  P  small,  W POOR GOOD i Oly data samle Data
More informationSingle and Multiple Estimation in MIMO Rician Fading Channels
0 Iteratioal Coferece o Comuter Commuicatio ad Maagemet Proc.of CSIT vol.5 (0) (0) IACSIT Press, Sigaore Sigle ad Multile Estimatio i MIMO Ricia adig Caels amid ooralizade + ad Sariar Sirvai Mogaddam aculty
More informationFast Power Flow Methods 1.0 Introduction
Fast ower Flow Methods. Itroductio What we have leared so far is the so-called full- ewto-raphso R power flow alorithm. The R alorithm is perhaps the most robust alorithm i the sese that it is most liely
More informationSolutions to Odd Numbered End of Chapter Exercises: Chapter 4
Itroductio to Ecoometrics (3 rd Updated Editio) by James H. Stock ad Mark W. Watso Solutios to Odd Numbered Ed of Chapter Exercises: Chapter 4 (This versio July 2, 24) Stock/Watso - Itroductio to Ecoometrics
More informationENGI 9420 Engineering Analysis Assignment 3 Solutions
ENGI 9 Egieerig Aalysis Assigmet Solutios Fall [Series solutio of ODEs, matri algebra; umerical methods; Chapters, ad ]. Fid a power series solutio about =, as far as the term i 7, to the ordiary differetial
More informationPipelined and Parallel Recursive and Adaptive Filters
VLSI Digital Sigal Processig Systems Pipelied ad Parallel Recursive ad Adaptive Filters La-Da Va 范倫達, Ph. D. Departmet of Computer Sciece Natioal Chiao ug Uiversity aiwa, R.O.C. Fall, 05 ldva@cs.ctu.edu.tw
More informationTomoki Toda. Augmented Human Communication Laboratory Graduate School of Information Science
Seuetial Data Modelig d class Basics of seuetial data odelig ooki oda Augeted Hua Couicatio Laboratory Graduate School of Iforatio Sciece Basic Aroaches How to efficietly odel joit robability of high diesioal
More informationIntroduction to Econometrics (3 rd Updated Edition) Solutions to Odd- Numbered End- of- Chapter Exercises: Chapter 4
Itroductio to Ecoometrics (3 rd Updated Editio) by James H. Stock ad Mark W. Watso Solutios to Odd- Numbered Ed- of- Chapter Exercises: Chapter 4 (This versio August 7, 204) 205 Pearso Educatio, Ic. Stock/Watso
More informationSIMPLE LINEAR REGRESSION AND CORRELATION ANALYSIS
SIMPLE LINEAR REGRESSION AND CORRELATION ANALSIS INTRODUCTION There are lot of statistical ivestigatio to kow whether there is a relatioship amog variables Two aalyses: (1) regressio aalysis; () correlatio
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationHe-Laplace Method for the Solution of Two-point Boundary Value Problems
America Joural of Mathematical Aalysis, 14, Vol., No., 4-49 Available olie at htt://ubs.scieub.com/ajma/// Sciece ad Educatio Publishig DOI:1.1691/ajma--- He-Lalace Method for the Solutio of Two-oit Boudary
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationDept. of Biomed. Eng. BME801: Inverse Problems in Bioengineering Kyung Hee Univ.
Dept of Biomed Eg BME801: Iverse Problems i Bioegieerig Kyug ee Uiv Adaptive Filters - Statistical digital sigal processig: i may problems of iterest, the sigals exhibit some iheret variability plus additive
More information10-701/ Machine Learning Mid-term Exam Solution
0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it
More informationConfidence Intervals
Cofidece Itervals Berli Che Deartmet of Comuter Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chater 5 & Teachig Material Itroductio
More informationSimple Linear Regression
Chapter 2 Simple Liear Regressio 2.1 Simple liear model The simple liear regressio model shows how oe kow depedet variable is determied by a sigle explaatory variable (regressor). Is is writte as: Y i
More informationFractal geometry extends classical geometry and is more fun too!
Fractal Geometr Reasos for studig this geometr : Fractal geometr eteds classical geometr ad is more fu too! (i) (ii) etesio of classical geometr such as Euclidea geometr, projective geometr I classical
More informationConfidence intervals for proportions
Cofidece itervals for roortios Studet Activity 7 8 9 0 2 TI-Nsire Ivestigatio Studet 60 mi Itroductio From revious activity This activity assumes kowledge of the material covered i the activity Distributio
More informationLeast Squares Methods
Det. of Biomed. Eg. BME80: Iverse Problems i Bioegieerig Kug ee Uiv. Least Squares Methods Overdetermied liear equatios m where R ad m > More equatios tha ukows Caot solve for i most cases. Least squares
More informationMM4 System s Poles and Feedback Characteristics
MM4 System s Poles ad Feedback Characteristics Readigs: Sectio 3.3 (resose & ole locatios.118-16); Sectio 4.1 (basic roerties of feedback.167-179); Extra readigs (feedback characterisitcs) 9/6/011 Classical
More informationSection A assesses the Units Numerical Analysis 1 and 2 Section B assesses the Unit Mathematics for Applied Mathematics
X0/70 NATIONAL QUALIFICATIONS 005 MONDAY, MAY.00 PM 4.00 PM APPLIED MATHEMATICS ADVANCED HIGHER Numerical Aalysis Read carefully. Calculators may be used i this paper.. Cadidates should aswer all questios.
More informationSOME ASPECTS OF MEASUREMENT ERRORS ANALYSIS IN ELECTROMAGNETIC FLOW METERS FOR OPEN CHANNELS
OME APECT OF MEAUREMENT ERROR ANALYI IN ELECTROMAGNETIC FLOW METER FOR OPEN CHANNEL Adrzej Michalski () Wiesław Piotrowski () () Warsaw Uiversity of Techoloy, Istitute of the Theory of Electrical Eieeri
More informationChapter 10 Advanced Topics in Random Processes
ery Stark ad Joh W. Woods, Probability, Statistics, ad Radom Variables for Egieers, 4th ed., Pearso Educatio Ic.,. ISBN 978--3-33-6 Chapter Advaced opics i Radom Processes Sectios. Mea-Square (m.s.) Calculus
More informationReal Variables II Homework Set #5
Real Variables II Homework Set #5 Name: Due Friday /0 by 4pm (at GOS-4) Istructios: () Attach this page to the frot of your homework assigmet you tur i (or write each problem before your solutio). () Please
More informationComplementi di Fisica Lecture 24
Comlemeti di Fisica - Lecture 24 18-11-2015 Comlemeti di Fisica Lecture 24 Livio Laceri Uiversità di Trieste Trieste, 18-11-2015 I this lecture Cotets Drift of electros ad holes i ractice (umbers ): coductivity
More informationContent. Data Structures 1 NTIN066. Outline. Dictionary problem. Binary search tree. Plan of the lecture. General information. Examination.
Data Structures NTIN066 Jiří Fik htts://kam.mff.cui.cz/ fik/ Deartmet of Theoretical Comuter Sciece ad Mathematical Loic Faculty of Mathematics ad Physics Charles Uiversity i Praue Witer semester 05/6
More informationInternational Journal of Mathematical Archive-3(12), 2012, Available online through ISSN
Iteratioal Joural o Mathematical Archive-, 0, 489-4897 Available olie throuh www.ijma.io ISSN 9 5046 NEW ITERATIVE NUMERICAL ALGORITHMS FOR MINIMIZATION OF NONLINEAR FUNCTIONS K. Karthikea* School o Advaced
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationMarkov Decision Processes
Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes
More informationOutline. Linear regression. Regularization functions. Polynomial curve fitting. Stochastic gradient descent for regression. MLE for regression
REGRESSION 1 Outlie Liear regressio Regularizatio fuctios Polyomial curve fittig Stochastic gradiet descet for regressio MLE for regressio Step-wise forward regressio Regressio methods Statistical techiques
More informationTopics Machine learning: lecture 2. Review: the learning problem. Hypotheses and estimation. Estimation criterion cont d. Estimation criterion
.87 Machie learig: lecture Tommi S. Jaakkola MIT CSAIL tommi@csail.mit.edu Topics The learig problem hypothesis class, estimatio algorithm loss ad estimatio criterio samplig, empirical ad epected losses
More informationCLRM estimation Pietro Coretto Econometrics
Slide Set 4 CLRM estimatio Pietro Coretto pcoretto@uisa.it Ecoometrics Master i Ecoomics ad Fiace (MEF) Uiversità degli Studi di Napoli Federico II Versio: Thursday 24 th Jauary, 2019 (h08:41) P. Coretto
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationME 539, Fall 2008: Learning-Based Control
ME 539, Fall 2008: Learig-Based Cotrol Neural Network Basics 10/1/2008 & 10/6/2008 Uiversity Orego State Neural Network Basics Questios??? Aoucemet: Homework 1 has bee posted Due Friday 10/10/08 at oo
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet
More informationCh3. Asymptotic Notation
Ch. Asymptotic Notatio copyright 006 Preview of Chapters Chapter How to aalyze the space ad time complexities of program Chapter Review asymptotic otatios such as O, Ω, Θ, o for simplifyig the aalysis
More information