CS623: Introduction to Computing with Neural Nets (lecture-10) Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay

Similar documents
1. Solve by the method of undetermined coefficients and by the method of variation of parameters. (4)

Ideal Amplifier/Attenuator. Memoryless. where k is some real constant. Integrator. System with memory

Chapter 2: Time-Domain Representations of Linear Time-Invariant Systems. Chih-Wei Liu

Time Dependent Queuing

AdaBoost. AdaBoost: Introduction

EGR 544 Communication Theory

A Complex Neural Network Algorithm for Computing the Largest Real Part Eigenvalue and the corresponding Eigenvector of a Real Matrix

Big O Notation for Time Complexity of Algorithms

Calculus BC 2015 Scoring Guidelines

FIXED FUZZY POINT THEOREMS IN FUZZY METRIC SPACE

Comparison between Fourier and Corrected Fourier Series Methods

6/10/2014. Definition. Time series Data. Time series Graph. Components of time series. Time series Seasonal. Time series Trend

Electrical Engineering Department Network Lab.

Hadamard matrices from the Multiplication Table of the Finite Fields

Lecture 9: Polynomial Approximations

Section 8 Convolution and Deconvolution

MODERN CONTROL SYSTEMS

Notes 03 largely plagiarized by %khc

INTEGER INTERVAL VALUE OF NEWTON DIVIDED DIFFERENCE AND FORWARD AND BACKWARD INTERPOLATION FORMULA

Internet Engineering. Jacek Mazurkiewicz, PhD Softcomputing. Part 1: Introduction, Elementary ANNs

NEWTON METHOD FOR DETERMINING THE OPTIMAL REPLENISHMENT POLICY FOR EPQ MODEL WITH PRESENT VALUE

Outline. simplest HMM (1) simple HMMs? simplest HMM (2) Parameter estimation for discrete hidden Markov models

ECE-314 Fall 2012 Review Questions

10.3 Autocorrelation Function of Ergodic RP 10.4 Power Spectral Density of Ergodic RP 10.5 Normal RP (Gaussian RP)

λiv Av = 0 or ( λi Av ) = 0. In order for a vector v to be an eigenvector, it must be in the kernel of λi

φ ( t ) = φ ( t ). The notation denotes a norm that is usually

1 Notes on Little s Law (l = λw)

Solutions to selected problems from the midterm exam Math 222 Winter 2015

Conditional Probability and Conditional Expectation

14.02 Principles of Macroeconomics Fall 2005

Chemical Engineering 374

An interesting result about subset sums. Nitu Kitchloo. Lior Pachter. November 27, Abstract

The analysis of the method on the one variable function s limit Ke Wu

F D D D D F. smoothed value of the data including Y t the most recent data.

ANALYSIS OF THE CHAOS DYNAMICS IN (X n,x n+1) PLANE

BE.430 Tutorial: Linear Operator Theory and Eigenfunction Expansion

Extremal graph theory II: K t and K t,t

UNIT 1: ANALYTICAL METHODS FOR ENGINEERS

A Generalized Cost Malmquist Index to the Productivities of Units with Negative Data in DEA

Math 2414 Homework Set 7 Solutions 10 Points

Clock Skew and Signal Representation

N! AND THE GAMMA FUNCTION

Review Exercises for Chapter 9

2 f(x) dx = 1, 0. 2f(x 1) dx d) 1 4t t6 t. t 2 dt i)

In this section we will study periodic signals in terms of their frequency f t is said to be periodic if (4.1)

Union-Find Partition Structures

Mean Square Convergent Finite Difference Scheme for Stochastic Parabolic PDEs

Math-303 Chapter 7 Linear systems of ODE November 16, Chapter 7. Systems of 1 st Order Linear Differential Equations.

Union-Find Partition Structures Goodrich, Tamassia Union-Find 1

CSE 241 Algorithms and Data Structures 10/14/2015. Skip Lists

COS 522: Complexity Theory : Boaz Barak Handout 10: Parallel Repetition Lemma

ODEs II, Supplement to Lectures 6 & 7: The Jordan Normal Form: Solving Autonomous, Homogeneous Linear Systems. April 2, 2003

Linear System Theory

The Interval of Convergence for a Power Series Examples

BEST LINEAR FORECASTS VS. BEST POSSIBLE FORECASTS

The Rosenblatt s LMS algorithm for Perceptron (1958) is built around a linear neuron (a neuron with a linear

LIMITS OF FUNCTIONS (I)

C(p, ) 13 N. Nuclear reactions generate energy create new isotopes and elements. Notation for stellar rates: p 12

Math 6710, Fall 2016 Final Exam Solutions

Online Supplement to Reactive Tabu Search in a Team-Learning Problem

xp (X = x) = P (X = 1) = θ. Hence, the method of moments estimator of θ is

State and Parameter Estimation of The Lorenz System In Existence of Colored Noise

Discrete-Time Signals and Systems. Introduction to Digital Signal Processing. Independent Variable. What is a Signal? What is a System?

Department of Mathematical and Statistical Sciences University of Alberta

International journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online

CSE 202: Design and Analysis of Algorithms Lecture 16

David Randall. ( )e ikx. k = u x,t. u( x,t)e ikx dx L. x L /2. Recall that the proof of (1) and (2) involves use of the orthogonality condition.

DETERMINATION OF PARTICULAR SOLUTIONS OF NONHOMOGENEOUS LINEAR DIFFERENTIAL EQUATIONS BY DISCRETE DECONVOLUTION

Let s express the absorption of radiation by dipoles as a dipole correlation function.

12 Getting Started With Fourier Analysis

Solutions Manual 4.1. nonlinear. 4.2 The Fourier Series is: and the fundamental frequency is ω 2π

Eigenvalues and Eigenvectors

A TAUBERIAN THEOREM FOR THE WEIGHTED MEAN METHOD OF SUMMABILITY

11. Adaptive Control in the Presence of Bounded Disturbances Consider MIMO systems in the form,

COMPARISON OF ALGORITHMS FOR ELLIPTIC CURVE CRYPTOGRAPHY OVER FINITE FIELDS OF GF(2 m )

Effect of Heat Exchangers Connection on Effectiveness

Please do NOT write in this box. Multiple Choice. Total

Advection! Discontinuous! solutions shocks! Shock Speed! ! f. !t + U!f. ! t! x. dx dt = U; t = 0

A Note on Random k-sat for Moderately Growing k

Review Answers for E&CE 700T02

CLOSED FORM EVALUATION OF RESTRICTED SUMS CONTAINING SQUARES OF FIBONOMIAL COEFFICIENTS

Pure Math 30: Explained!

Problems and Solutions for Section 3.2 (3.15 through 3.25)

Fourier transform. Continuous-time Fourier transform (CTFT) ω ω

INFINITE SEQUENCES AND SERIES

Economics 8723 Macroeconomic Theory Problem Set 2 Professor Sanjay Chugh Spring 2017

Basic Results in Functional Analysis

Four equations describe the dynamic solution to RBC model. Consumption-leisure efficiency condition. Consumption-investment efficiency condition

10-701/ Machine Learning Mid-term Exam Solution

Solution. 1 Solutions of Homework 6. Sangchul Lee. April 28, Problem 1.1 [Dur10, Exercise ]

Some Properties of Semi-E-Convex Function and Semi-E-Convex Programming*

SUPER LINEAR ALGEBRA

Lecture 15: Three-tank Mixing and Lead Poisoning

FORBIDDING HAMILTON CYCLES IN UNIFORM HYPERGRAPHS

MATH 31B: MIDTERM 2 REVIEW

Calculus Limits. Limit of a function.. 1. One-Sided Limits...1. Infinite limits 2. Vertical Asymptotes...3. Calculating Limits Using the Limit Laws.

L-functions and Class Numbers

Using Linnik's Identity to Approximate the Prime Counting Function with the Logarithmic Integral

UNIT 6 Signals and Systems

The Connection between the Basel Problem and a Special Integral

Transcription:

CS6: Iroducio o Compuig ih Neural Nes lecure- Pushpak Bhaacharyya Compuer Sciece ad Egieerig Deparme IIT Bombay

Tilig Algorihm repea A kid of divide ad coquer sraegy Give he classes i he daa, ru he percepro raiig algorihm If liearly separable, covergece ihou ay hidde layer If o, do as ell as you ca pocke algorihm This ill produce classes ih misclassified pois

Tilig Algorihm cod Take he class ih misclassified pois ad break io subclasses hich coai o ouliers Ru PTA agai afer recruiig he required umber of percepros Do his uil homogeous classes are obaied Apply he same procedure for he firs hidde layer o obai he secod hidde layer ad so o

Illusraio XOR problem Classes are,,,,

As bes a classificaio as possible, ve, -ve, -ve, ve

Classes ih error,,,, oulier

Ho o achieve his classificaio Give he labels as sho: eqv o a OR problem -,,,, oulier

The parially developed / Ge he firs euro i he hidde layer, hich compues OR h.5..

Break he icorrec class,,,,, oulier,, - Do care: Make

Solve classificaio for h,,,, - This is

Ne sage of he / Compues Compues h h -.5.5 -. -...

Geig he oupu layer Solve a ilig algo problem for he hidde layer h h y,,, -, AND problem

Fial / AND / y.5 Compues.. Compues Compues h h.5 -.5. -. -..

Lab eercise Impleme he ilig algorihm ad ru i for. XOR. Majoriy. IRIS daa

Hopfield e Ispired by associaive memory hich meas memory rerieval is o by address, bu by par of he daa. Cosiss of N euros fully coeced ih symmeric eigh sregh ij = ji No self coecio. So he eigh mari is - diagoal ad symmeric. Each compuig eleme or euro is a liear hreshold eleme ih hreshold =.

Compuaio Y Neuro i θ = W W W σ σ... σ Figure: A euro i he Hopfield Ne.

Eample = = 5 = = = = A ime = s = s = - s = Usable sae: Neuro ill flip. A sable paer is called a aracor for he e. 5 Figure: A eample Hopfield Ne

Sabiliy Asychroous mode of operaio: a ay isa a radomly seleced euro compares he e ipu ih he hreshold. I he sychroous mode of operaio all euros updae hemselves simulaeously a ay isa of ime. Sice here are feedback coecios i he Hopfield Ne he quesio of sabiliy arises. A every ime isa he eork evolves ad fially seles io a sable sae. Ho does he Hopfield Ne fucio as associaive memory? Oe eeds o sore or sabilize a vecor hich is he memory eleme.

Eergy cosideraio Sable paers correspod o miimum eergy saes. Eergy a sae <,,,, > E = -/ j j<>i ji i j Chage i eergy alays comes ou o be egaive i he asychroous mode of operaio. Eergy alays decreases. Sabiliy esured.

Hopfield Ne is a fully coeced eork.... 4 i h euro is coeced o - euros

Cocep of Eergy Eergy a sae s is give by he equaio: E s = [ K K M ]

Coecio mari of he eork, -diagoal ad symmeric j... k i... ij k diagoal

Sae Vecor Biary valued vecor: value is eiher or - X = < -.... > e.g. Various aribues of a sude ca be represeed by a sae vecor heigh address 5 roll umber hair color Ram = ~Ram = - 4

Relaio beee eigh vecor W ad sae vecor X W T X Weigh vecor Traspose of sae vecor 5-5 5 W = T X 5 5 = W = T X For eample, i figure, A ime =, sae of he eural eork is: s = <, -, > ad correspodig vecors are as sho. Fig.

W.X T gives he ipus o he euros a he e ime isa 5 5 W = T X = 7 =. sg T X W This shos ha he / ill chage sae

Eergy Cosideraio A ime =, sae of he eural eork is: s = <, -, > 5 - E = -[5**-** *-*] = 4 - The sae of he eural eork uder sabiliy is <-, -, -> 5 - - Esable sae = - -[5*-*-*-* -*-*-] = -

Sae Chage s = <, -, > s = compue by comparig ad summig ==sg[σ j= j j ] = if Σ j= j j > = - oherise

Theorem I he asychroous mode of operaio, he eergy of he Hopfield e alays decreases. Proof: M [ E = K K ]

Proof Le euro chage sae by summig ad comparig We ge folloig equaio for eergy [ E = K K ] M

Proof: oe ha oly euro chages sae [ ]} K [ ] = = j j j j {[ ] = K E E E = [ ][ ] = = j j j Sice oly euro chages sae, j = j, j=,, 4,, ad hece

= Proof coiued [ ][ ] j j j= S D Observaios: Whe he sae chages from - o, S has o be ve ad D is ve; so E becomes egaive. Whe he sae chages from o -, S has o be -ve ad D is ve; so E becomes egaive. Therefore, Eergy for ay sae chage alays decreases.

The Hopfield e has o coverge i he asychroous mode of operaio As he eergy E goes o decreasig, i has o hi he boom, sice he eigh ad he sae vecor have fiie values. Tha is, he Hopfield Ne has o coverge o a eergy miimum. Hece he Hopfield Ne reaches sabiliy.