A Generalization of Sauer s Lemma to Classes of LargeMargin Functions


 Todd Bruce
 2 years ago
 Views:
Transcription
1 A Generalization of Sauer s Lemma to Classes of LargeMargin Functions Joel Ratsaby University College Lonon Gower Street, Lonon WC1E 6BT, Unite Kingom WWW home page: Abstract. We generalize Sauer s Lemma to classes H of binaryvalue functions on [n] = {1,..., n} which have a margin of at least N on every element in a sample S [n] of carinality l, where the margin µ h (x) of f F on a point x [n] is efine as the largest nonnegative integer a such that h is constant on the interval I a(x) = [x a, x + a] [n]. 1 Introuction Estimation of the complexity of classes of binaryvalue functions has been behin much of recent evelopments in the of theory learning. In a seminal paper Vapnik an Chervonenkis [1971] applie the law of large numbers uniformly over an infinite class F of binary functions, i.e., inicator functions of sets A in a general omain X, an showe that the complexity of the problem of learning pattern recognition from samples of n ranomly rawn examples can be characterize in terms of a combinatorial complexity of F. This complexity, known as the growth function of F an enote by φ F (n), counts the maximal number of ichotomies, i.e., binary vectors corresponing to the restriction of functions f F on a finite subset S X of carinality n, where the maximum runs over all such S. The VapnikChervonenkis imension of F, enote as V C(F), plays a crucial role in controlling the rate of the growth of φ F (n) with respect to n. Such binary vectors may be viewe as binaryvalue functions on a finite omain [n] {1,..., n} an hence form a finite class H of the same VCimension as F. In this paper we consier classes of binaryvalue functions on [n] which satisfy a constraint of having a large margin on any one set S X of carinality l. We obtain an estimate on the carinality of such a class. Recently there has been interest in learning classes via maximizing the margin [see for instance Vapnik, 1998, Cristianini an ShaweTaylor, 000]. The usual approach analyzes the growth rate (or more precisely the covering number) of Paper appeare in the Proc. of Thir Colloq. on Math. an Comp. Sci. Alg., Trees, Combin. an Probb. (MAthInfo 004), Vienna Austria, Sept University College Lonon, Computer Science Department,Technical Report RN/03/13
2 classes of realvalue functions with a largemargin on some set (sample) S. So to the best of the author s knowlege, the approach taken in the current paper of estimating the complexity of classes of largemargin binaryvalue functions by a generalization of Sauer s lemma is novel. Before iscussing this further we first introuce some neee notation. Some notations, efinitions an existing results Let I(E) enote the inicator function which equals 1 if the expression E is true an 0 otherwise. Let F be a class of functions f : [n] {0, 1}. For a set A = {a 1,..., a k } [n] enote by f A = [f(a 1 ),..., f(a k )]. F is sai to shatter A if {f A : f F } = k. The VapnikChervonenkis imension of F, enote as V C(F ), is efine as the carinality of the largest set shattere by F. Sauer [197] obtaine the following result: Lemma 1. [Sauer, 197] If the VCimension of F is then F i=0 ( ) n. i We note that the boun is tight as for all, n 1 there exist classes F [n] of VCimension which achieve the equality. Consier the following efinition of functional margin 1 which naturally suits binaryvalue functions. Definition 1. The margin µ f (x) of f F on an element x [n] is the largest nonnegative integer a such that f has a constant value of either 0 or 1 on the interval set I a (x) = {x a,..., x + a} provie that I a (x) [n]. The samplemargin µ S (f) of f on a subset S [n] is efine as µ S (f) min x S µ f (x). More generally, this efinition applies also to classes on other omains X if there is a linear orering on X. 3 Motivation an aim of the paper In recent years, in search for better learning algorithms, it has been iscovere [see for instance Vapnik, 1998, Cristianini an ShaweTaylor, 000] that learning 1 For other efinitions of margin see for instance Cristianini an ShaweTaylor [000].
3 3 classes F of realvalue functions that are restricte to have a large margin on a training sample leas to a faster learningerror convergence. The crucial reason for such improve error bouns is the fast ecrease of the covering number of F, which is analogous to the growthnumber in the case of classes of binaryvalue functions, with respect to an increase in samplemargin value. In this paper, we consier the latter case, restricting to a finite class H(S) of binary value functions h on [n] with the constraint that for a fixe subset S [n] of size l, for all h H(S), µ S (h) N. By generalizing Sauer s result (Lemma 1), we obtain an estimate on the carinality of H(S). Being epenent on the margin parameter N, our estimate may be viewe as being analogous to existing results that boun the covering number of classes of finitepseuoimension (or fat γ imension) which consists of realvalue functions uner a similar margin constraint [see for instance Anthony an Bartlett, 1999, Ch. 1]. 4 Technical results We start with an auxiliary lemma: Lemma. For N 0, n 0, 0 m n, let w m,n (n) be the number of stanar (oneimensional) orere partitions of a nonnegative integer n into m parts each no larger than N. Then I(n = 0) if m = 0 ( )( ) w m,n (n) = ( 1) i/(n+1) m n i + m 1 if m 1. i/(n + 1) n i i=0,n+1,(n+1),... Remark 1. While our interest is in [n] = {1,..., n}, we allow w m,n (n) to be efine on n = 0 for use by Lemma 3. Proof: The generating function (g.f.) for w m,n (n) is W (x) = ( ) 1 x w m,n (n)x n N+1 m =. 1 x n 0 When m = 0 the only nonzero coefficient is of ( x 0 an it equals 1 so w 0,N (n) = m. I(n = 0). Let T (x) = (1 x N+1 ) m 1 an S(x) = 1 x) Then T (x) = m ( m ( 1) i i i=0 ) x i(n+1) Hence samples on which the target function (the one to be learnt) has a large margin are of consierable worth. Ratsaby [003] estimate the complexity of such samples as a function of the margin parameter an sample size.
4 4 which generates the sequence t N (n) = ( m n/(n+1)) ( 1) n/(n+1) I(n mo (N + 1) = 0). Similarly, for m 1, it is easy to show S(x) generates s(n) = ( ) n+m 1 n. The prouct W (x) = T (x)s(x) generates their convolution t N (n) s(n), namely, w m,n (n) = i=0,n+1,(n+1),..., ( )( ) ( 1) i/(n+1) m n i + m 1. i/(n + 1) n i Remark. By an alternate proof one obtains a slightly simpler form of over m 1. w m,n (n) = m ( )( ) m n + m 1 k(n + 1) ( 1) k, k m 1 k=0 Before proceeing to the main theorem we have two aitional lemmas. Lemma 3. Let the integer 1 N n an consier the class F consisting of all binaryvalue functions f on [n] which take the value 1 on no more than r n elements of [n] an whose margin on any element x [n] satisfies µ f (x) N. Then where F = r k=0 c(k, n k; m, N) β r (N) (n) c(k, n k; m, N) 1 = w m i,n (k m + 1 i(n + 1))w m j,n (n k m + 1 j(n + 1)). i,j=0 Proof: Consier the integer pair [k, n k], where n 1 an 0 k n. A twoimensional orere mpartition of [k, n k] is an orere partition into m twoimensional parts, [a j, b j ] where 0 a j, b j n but not both are zero an where m j=1 [a j, b j ] = [k, n k]. For instance, [, 1] = [0, 1]+[, 0] = [1, 1]+[1, 0] = [, 0] + [0, 1] are three partitions of [, 1] into two parts (for more examples see Anrews Anrews [1998] ). Suppose we a the constraint that only a 1 or b m may be zero while all remaining a j, b k 1, j m, 1 k m 1. Denote any partition that satisfies this as vali. For instance, let k =, m = 3 then the mpartitions of [k, n k] are: {[0, 1][1, 1][1, n 4]},{[0, 1][1, ][1, n 5]},...,{[0, 1][1, n 3][1, 0]}, {[0, ][1, 1][1, n 5]}, {[0, ][1, ][1, n 6]},..., {[0, ][1, n 4][1, 0]},..., {[0, n 3][1, 1][1, 0]}. For [k, n k], let P n,k be the collection of all vali partitions of [k, n k]. Let F k enote all binary functions on [n] which take the value 1 over exactly k elements of [n]. Define the mapping Π : F k P n,k where for any f F k (1)
5 5 the partition Π(f) is efine by the following proceure: Start from the first element of [n], i.e., 1. If f takes the value 1 on it then let a 1 be the length of the constant 1segment, i.e., the set of all elements starting from 1 on which f takes the constant value 1. Otherwise if f takes the value 0 let a 1 = 0. Then let b 1 be the length of the subsequent 0segment on which f takes the value 0. Let [a 1, b 1 ] be the first part of Π(f). Next, repeat the following: if there is at least one more element of [n] which has not been inclue in the preceing segment, then let a j be the length of the next 1segment an b j the length of the subsequent 0segment. Let [a j, b j ], j = 1,..., m, be the resulting sequence of parts where m is the total number of parts. Only the last part may have a zero value b m since the function may take the value 1 on the last element n of [n] while all other parts, [a j, b j ], j m 1, must have a j, b j 1. The result is a vali partition of [k, n k] into m parts. Clearly, every f F k has a unique partition. Therefore Π is a bijection. Moreover, we may ivie P n,k into mutually exclusive subsets V m consisting of all vali partitions of [k, n k] having exactly m parts, where 1 m n. Thus F k = V m. Consier the following constraint on components of parts: a i, b i N + 1, 1 i m. () Denote by V m,n P n,k the collection of vali partitions of [k, n k] into m parts each of which satisfies this constraint. Let F k,n = F F k consist of all functions satisfying the margin constraint in the statement of the lemma an having exactly k ones. Note that f having a margin no larger than N on any element of [n] implies there oes not exist a segment a i or b i of length larger than N + 1 on which f takes a constant value. Hence the parts of Π(f) satisfy (). Hence, for any f F k,n, its unique vali partition Π(f) must be in V m,n. We therefore have By efinition of F it follows that Let us enote by F k,n = F = V m,n. (3) r F k,n. (4) k=0 c(k, n k; m, N) V m,n (5) the number of vali partitions of [k, n k] into exactly m parts whose components satisfy (). In orer to etermine F it therefore suffices to etermine c(k, n k; m, N).
6 6 We next construct the generating function G(t 1, t ) = c(α 1, α ; m, N)t α1 1 tα. (6) α 1 0 α 0 For m 1, G(t 1, t ) = (t t t N+1 1 )(t 1 + t + + t N+1 ) I(m ) ((t t N+1 1 )(t t N+1 ) ) (m ) + (t t N+1 1 ) I(m ) (t 0 + t t N+1 ) where the values of the exponents of all terms in the first an secon factors represent the possible values for a 1 an b 1, respectively. The values of the exponents in the mile m factors are for the values of a j, b j, j m 1 an those in the factor before last an last are for a m an b m, respectively. Equating this to (6) implies the coefficient of t α1 1 tα equals c(α 1, α ; m, N) which we seek. The right sie of (7) equals ( ( Let W (x) = t m 1 1 t m 1 So (8) becomes ( 1 t N t 1 1 t N+1 1 t ) m + t N+1 1 ) m + t N+1 (7) ( ) m 1 1 t N t 1 ( ) m 1 1 t N+1 1 t. (8) ) m 1 1 x N+1 1 x generate wm 1,N (n) which is efine in Lemma. α 1,α 0 ( w m,n (α 1 )w m,n (α )t α1+m 1 1 t α+m 1 + w m 1,N (α 1 )w m,n (α )t α1+m+n 1 t α+m 1 + w m,n (α 1 )w m 1,N (α )t α1+m 1 1 t α+m+n + w m 1,N (α 1 )w m 1,N (α )t α1+m+n 1 t α+m+n Equating the coefficients of t α 1 1 tα in (6) an (9) yiels ). (9) c(α 1, α ; m, N) 1 = w m i,n (α 1 m + 1 i(n + 1))w m j,n (α m + 1 j(n + 1)). i,j=0 Substituting k for α 1, n k for α, combining (3), (4) an (5) yiels the result. The next lemma extens the result of Lemma 3 to classes H of finite VCimension.
7 7 Lemma 4. Let n 1 an 0 n. Let H be a class of binaryvalue functions h on [n] satisfying µ h (x) N on any x [n] an let V C(H). Then where β (N) is efine in Lemma 3. H β (N) (n) Proof: The proof buils on that of Lemma 7 in Haussler & Long Haussler an Long [1995] which consiere generalizations of the V Cimension an is one by ouble inuction on n an. Start with the case = 0, the boun reuces to H 1 since β (N) 0 (n) 1 when n 1. The boun is correct since if H > 1 then it implies there are two istinct functions h, g. Let k [n] be the element on which they iffer. Then the singleton {k} is shattere by H hence the VCimension of H is at least 1 which contraicts the assumption that = 0 hence H 1 an the lemma hols. Next, suppose = n. Consier the class F in Lemma 3 with r = n. Such F consists of all binaryvalue functions f on [n] which satisfy the margin constraint µ f (x) N on every x [n]. By Lemma 3, F β n (N) (n). Clearly by efinition, H F. Hence H β n (N) (n) as claime. Next, suppose 0 < < n. Define π : H {0, 1} by π(h) = [h(1),..., h(n 1)]. Define α : π(h) {0, 1} by α(u 1,..., u ) = min{v : h H, h(i) = u i, h(n) = v, 1 i n 1}. Define A = {h H : h(n) = α(h(1),..., h(n 1))} an enote by A c = H \ A. Consier any h H. If α(h(1),..., h(n 1)) = 1 then A c oes not contain h. Otherwise, A c contains the function g which agrees with h on 1,..., n 1 an g(n) = 1. Hence for all h A c, h(n) = 1. Make the inuctive assumption that the claime boun hols for all classes H on any subset of [n] having carinality an satisfying the margin constraint. Then we claim the following: Claim 1 A β (N) (n 1). This is prove next: the mapping π is onetoone on A an the set π(a) has VCimension no larger than since any subset of [n] shattere by π(a) is also shattere by A which is in H an V C(H). Hence by the inuction hypothesis π(a) β (N) (n 1) an since π is onetoone then A = π(a). Next, uner the same inuction hypothesis, we have: Claim A c β (N) 1 (n 1). We prove this next: First we show that V C(A c ) 1. Let E [n] be shattere by A c an let E = l. Note that n E since as note earlier h(n) = 1 for all
8 8 h A c. For any b {0, 1} l+1 let h A c be such that h E = [b 1,..., b l ]. If b l+1 = 1 then h(n) = b l+1 since all functions in A c take the value 1 on n. If b l+1 = 0 then there exists a g A which satisfies g(i) = h(i), 1 i n 1 an g(n) = α(h(1),..., h(n 1)), the latter being g(n) = 0. It follows that E {n} is shattere by H. But by assumption V C(H) an n E hence E 1. Since E was chosen arbitrarily then V C(A c ) 1. The same argument as in the proof of Claim 1 applie to A c using 1 to boun its VCimension, obtains the statement of Claim. From Claims 1 an an recalling the efinition of c(k, n k; m, N) from Lemma 3, it follows that H β (N) = k=0 (n 1) + β (N) 1 (n 1) = I(n/ N) + = I(n/ N) + 1 c(k, n k 1; m, N) + k=1 k=0 c(k, n k 1; m, N) + c(k, n k 1; m, N) k=1 c(k 1, n k; m, N) ( ) c(k, n k 1; m, N) + c(k 1, n k; m, N) k=1 where the inicator I(n/ N) enters here since in case k = 0 the only vali function h is the constant0 on [n] satisfying µ h (x) n/, for all x [n]. We now have: Claim 3 ( ) c(k, n k; m, N) = c(k, n k 1; m, N) + c(k 1, n k; m, N). (11) Note that this is a recurrence formula for the number (left han sie of (11)) of vali partitions of [k, n k] (excluing the case k = 0) into parts that satisfy (). We prove the claim next: given any such partition π n there is exactly one of four possible ways that it can be constructe by aing a part to a vali two imensional partition π of [n 1] while still satisfying (). The first two amount to starting from a partition π of [k 1, n k] an: (i) aing the part [1, 0] algebraically to any existing part in π, e.g., [x, y] + [1, 0] = [x + 1, y], to obtain a π n with [x + 1, y] as one of the parts (provie that () is still satisfie) which yiels a total number of parts no larger than n 1 or (ii) aing [1, 0] to π as a new last part to obtain a π n (provie it is still vali) with no more than n parts. The remaining two ways amount to starting from a partition π of [k, n k 1] an acting as before except now aing the part [0, 1] instea of (10)
9 9 [1, 0] either algebraically or as a new first part. There are c(k, n k 1; m, N) vali partitions of [k, n k 1] an there are c(k 1, n k; m, N) vali partitions of [k 1, n k], all satisfying (). Doing the aforementione construction to each one of these partitions yiels all vali partitions of [k, n k] that satisfy (). Continuing, the right han sie of (10) becomes I(n/ N) + k=1 c(k, n k; m, N) = k=0 c(k, n k; m, N) which is precisely β (N) (n). This completes the inuction. Theorem 1. Let n 1, 1 l n an 0 < n l. Let H be a class of binaryvalue functions h on [n] having V C(H). Let S [n] be a sample of carinality l an consier the subclass H(S) H which consists of all functions h H with a margin µ h (x) > N iff x S. Then H(S) β (N) (n l (N + 1)). Proof: The conition µ h (x) > N implies only two types of functions h are allowe, those which take either a constant0 value or a constant1 value over all elements in the interval I N+1 (x). The conition µ h (x) N implies that any function is possible except one that takes a constant0 or a constant1 value over I N+1 (x) (see Definition 1). Hence clearly the first conition is significantly more restrictive. Since we seek an upper boun on H(S) then we consier among all sets of [n] of carinality l a set S with the least restrictive constraint, namely, causing as few elements x [n] as possible (except those in S) to have µ h (x) > N. This is achieve by a maximallypacke set S [n] of l elements, for instance S = {N +,..., N + l + 1}. It yiels a minimalsize region R = {1,..., (N + 1) + l} on which every caniate h must take either a constant0 or constant1 value, i.e., have a margin larger than N for every x S. This leaves a maximalsize region [n]\r on which the less stringent constraint of having a margin no larger than N must hol. By Lemma 4, there are no more than β (N) (n l (N + 1)) functions in H that satisfy the latter. Hence for any S [n] of carinality S = l, H(S) β (N) (n l (N + 1)).
10 10 5 Conclusions The main result of the paper is a boun on the carinality of a class of finite VCimension consisting of binary functions on [n] which have a margin greater than N on a set S of carinality l. This result generalizes the well known Sauer s Lemma an is analogous to existing bouns on the covering number of classes of realvalue functions that have a largemargin on a sample S. The result may be use for obtaining the sample complexity of PAClearning a a class of boolean hypotheses while maximizing the margin on a given training sample.
11 Bibliography G. E. Anrews. The Theory of Partitions. Cambrige University Press, M. Anthony an P. L. Bartlett. Neural Network Learning:Theoretical Founations. Cambrige University Press, N. Cristianini an J. ShaweTaylor. An Introuction to Support Vector Machines an other Kernelbase learning methos. Cambrige University Press, 000. D. Haussler an P.M. Long. A generalization of sauer s lemma. Journal of Combinatorial Theory (A), 71():19 40, J. Ratsaby. On the complexity of goo samples for learning. Technical Report RN/03/1, Department of Computer Science, University College Lonon, September 003. N. Sauer. On the ensity of families of sets. J. Combinatorial Theory (A), 13: , 197. V. Vapnik. Statistical Learning Theory. Wiley, V. N. Vapnik an A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Apl., 16:64 80, 1971.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationFactoring Dickson polynomials over finite fields
Factoring Dickson polynomials over finite fiels Manjul Bhargava Department of Mathematics, Princeton University. Princeton NJ 08544 manjul@math.princeton.eu Michael Zieve Department of Mathematics, University
More information2r 1. Definition (Degree Measure). Let G be a rgraph of order n and average degree d. Let S V (G). The degree measure µ(s) of S is defined by,
Theorem Simple Containers Theorem) Let G be a simple, rgraph of average egree an of orer n Let 0 < δ < If is large enough, then there exists a collection of sets C PV G)) satisfying: i) for every inepenent
More informationPythagorean Triples Over Gaussian Integers
International Journal of Algebra, Vol. 6, 01, no., 5564 Pythagorean Triples Over Gaussian Integers Cheranoot Somboonkulavui 1 Department of Mathematics, Faculty of Science Chulalongkorn University Bangkok
More informationCHAPTER 5 : CALCULUS
Dr Roger Ni (Queen Mary, University of Lonon)  5. CHAPTER 5 : CALCULUS Differentiation Introuction to Differentiation Calculus is a branch of mathematics which concerns itself with change. Irrespective
More informationFirewall Design: Consistency, Completeness, and Compactness
C IS COS YS TE MS Firewall Design: Consistency, Completeness, an Compactness Mohame G. Goua an XiangYang Alex Liu Department of Computer Sciences The University of Texas at Austin Austin, Texas 787121188,
More information10.2 Systems of Linear Equations: Matrices
SECTION 0.2 Systems of Linear Equations: Matrices 7 0.2 Systems of Linear Equations: Matrices OBJECTIVES Write the Augmente Matrix of a System of Linear Equations 2 Write the System from the Augmente Matrix
More informationFor arbitrary a and n, let C(a, n) denote the number of cycles in G(a, n), and let c(a, n, d) be the number of cycles in G(a, n) with GCD d.
Directe Graphs Define by Arithmetic (mo n) EZRA BROWN Department of Mathematics Virginia Tech Blacksburg, Virginia 24061 0123, USA 1. Introuction. Let a an n>0beintegers, an efine G(a, n) to be the irecte
More informationMeanValue Theorem (Several Variables)
MeanValue Theorem (Several Variables) 1 MeanValue Theorem (Several Variables) THEOREM THE MEANVALUE THEOREM (SEVERAL VARIABLES) If f is ifferentiable at each point of the line segment ab, then there
More informationMSc. Econ: MATHEMATICAL STATISTICS, 1995 MAXIMUMLIKELIHOOD ESTIMATION
MAXIMUMLIKELIHOOD ESTIMATION The General Theory of ML Estimation In orer to erive an ML estimator, we are boun to make an assumption about the functional form of the istribution which generates the
More informationLecture 8: Expanders and Applications
Lecture 8: Expaners an Applications Topics in Complexity Theory an Pseuoranomness (Spring 013) Rutgers University Swastik Kopparty Scribes: Amey Bhangale, Mrinal Kumar 1 Overview In this lecture, we will
More informationWitt#5e: Generalizing integrality theorems for ghostwitt vectors [not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5e: Generalizing integrality theorems for ghostwitt vectors [not complete, not proofrea In this note, we will generalize most of
More informationOn Adaboost and Optimal Betting Strategies
On Aaboost an Optimal Betting Strategies Pasquale Malacaria 1 an Fabrizio Smerali 1 1 School of Electronic Engineering an Computer Science, Queen Mary University of Lonon, Lonon, UK Abstract We explore
More informationGiven three vectors A, B, andc. We list three products with formula (A B) C = B(A C) A(B C); A (B C) =B(A C) C(A B);
1.1.4. Prouct of three vectors. Given three vectors A, B, anc. We list three proucts with formula (A B) C = B(A C) A(B C); A (B C) =B(A C) C(A B); a 1 a 2 a 3 (A B) C = b 1 b 2 b 3 c 1 c 2 c 3 where the
More informationMath 230.01, Fall 2012: HW 1 Solutions
Math 3., Fall : HW Solutions Problem (p.9 #). Suppose a wor is picke at ranom from this sentence. Fin: a) the chance the wor has at least letters; SOLUTION: All wors are equally likely to be chosen. The
More informationUsing Stein s Method to Show Poisson and Normal Limit Laws for Fringe Subtrees
AofA 2014, Paris, France DMTCS proc. (subm., by the authors, 1 12 Using Stein s Metho to Show Poisson an Normal Limit Laws for Fringe Subtrees Cecilia Holmgren 1 an Svante Janson 2 1 Department of Mathematics,
More informationInverse Trig Functions
Inverse Trig Functions c A Math Support Center Capsule February, 009 Introuction Just as trig functions arise in many applications, so o the inverse trig functions. What may be most surprising is that
More informationCh 10. Arithmetic Average Options and Asian Opitons
Ch 10. Arithmetic Average Options an Asian Opitons I. Asian Option an the Analytic Pricing Formula II. Binomial Tree Moel to Price Average Options III. Combination of Arithmetic Average an Reset Options
More informationBV has the bounded approximation property
The Journal of Geometric Analysis volume 15 (2005), number 1, pp. 17 [version, April 14, 2005] BV has the boune approximation property G. Alberti, M. Csörnyei, A. Pe lczyński, D. Preiss Abstract: We prove
More informationChapter 2 Review of Classical Action Principles
Chapter Review of Classical Action Principles This section grew out of lectures given by Schwinger at UCLA aroun 1974, which were substantially transforme into Chap. 8 of Classical Electroynamics (Schwinger
More informationDifferentiability of Exponential Functions
Differentiability of Exponential Functions Philip M. Anselone an John W. Lee Philip Anselone (panselone@actionnet.net) receive his Ph.D. from Oregon State in 1957. After a few years at Johns Hopkins an
More informationMannheim curves in the threedimensional sphere
Mannheim curves in the threeimensional sphere anju Kahraman, Mehmet Öner Manisa Celal Bayar University, Faculty of Arts an Sciences, Mathematics Department, Muraiye Campus, 5, Muraiye, Manisa, urkey.
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationnparameter families of curves
1 nparameter families of curves For purposes of this iscussion, a curve will mean any equation involving x, y, an no other variables. Some examples of curves are x 2 + (y 3) 2 = 9 circle with raius 3,
More informationOn some absolute positiveness bounds
Bull. Math. Soc. Sci. Math. Roumanie Tome 53(101) No. 3, 2010, 269 276 On some absolute positiveness bouns by Doru Ştefănescu Deicate to the memory of Laurenţiu Panaitopol (19402008) on the occasion of
More informationA New Vulnerable Class of Exponents in RSA
A ew Vulnerable Class of Exponents in RSA Aberrahmane itaj Laboratoire e Mathmatiues icolas Oresme Universit e Caen, France nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj Abstract Let = p be an
More informationSensor Network Localization from Local Connectivity : Performance Analysis for the MDSMAP Algorithm
Sensor Network Localization from Local Connectivity : Performance Analysis for the MDSMAP Algorithm Sewoong Oh an Anrea Montanari Electrical Engineering an Statistics Department Stanfor University, Stanfor,
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationModelling and Resolving Software Dependencies
June 15, 2005 Abstract Many Linux istributions an other moern operating systems feature the explicit eclaration of (often complex) epenency relationships between the pieces of software
More informationIntegral Regular Truncated Pyramids with Rectangular Bases
Integral Regular Truncate Pyramis with Rectangular Bases Konstantine Zelator Department of Mathematics 301 Thackeray Hall University of Pittsburgh Pittsburgh, PA 1560, U.S.A. Also: Konstantine Zelator
More informationOur goal first will be to define a product measure on A 1 A 2.
1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ algebra A 1 A 2 with the unit element is the σ algebra generated by the
More information(We assume that x 2 IR n with n > m f g are twice continuously ierentiable functions with Lipschitz secon erivatives. The Lagrangian function `(x y) i
An Analysis of Newton's Metho for Equivalent Karush{Kuhn{Tucker Systems Lus N. Vicente January 25, 999 Abstract In this paper we analyze the application of Newton's metho to the solution of systems of
More informationarcsine (inverse sine) function
Inverse Trigonometric Functions c 00 Donal Kreier an Dwight Lahr We will introuce inverse functions for the sine, cosine, an tangent. In efining them, we will point out the issues that must be consiere
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More information3. Recurrence Recursive Definitions. To construct a recursively defined function:
3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a
More informationParameterized Algorithms for dhitting Set: the Weighted Case Henning Fernau. Univ. Trier, FB 4 Abteilung Informatik 54286 Trier, Germany
Parameterize Algorithms for Hitting Set: the Weighte Case Henning Fernau Trierer Forschungsberichte; Trier: Technical Reports Informatik / Mathematik No. 086, July 2008 Univ. Trier, FB 4 Abteilung Informatik
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsionfree abelian groups, one of isomorphism
More informationReview: Vector space
Math 2F Linear Algebra Lecture 13 1 Basis and dimensions Slide 1 Review: Subspace of a vector space. (Sec. 4.1) Linear combinations, l.d., l.i. vectors. (Sec. 4.3) Dimension and Base of a vector space.
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationOptimal Energy Commitments with Storage and Intermittent Supply
Submitte to Operations Research manuscript OPRE200909406 Optimal Energy Commitments with Storage an Intermittent Supply Jae Ho Kim Department of Electrical Engineering, Princeton University, Princeton,
More informationTHE FIRST MAYRMEYER IDEAL
THE FIRST MAYRMEYER IDEAL IRENA SWANSON New Mexico State University  Department of Mathematical Sciences, Las Cruces, New Mexico 880038001, USA Email: iswanson@nmsueu Summary This paper gives a complete
More informationImage compression predicated on recurrent iterated function systems **
1 Image compression preicate on recurrent iterate function systems ** W. Metzler a, *, C.H. Yun b, M. Barski a a Faculty of Mathematics University of Kassel, Kassel, F. R. Germany b Faculty of Mathematics
More informationSensitivity Analysis of Nonlinear Performance with Probability Distortion
Preprints of the 19th Worl Congress The International Feeration of Automatic Control Cape Town, South Africa. August 2429, 214 Sensitivity Analysis of Nonlinear Performance with Probability Distortion
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationAn intertemporal model of the real exchange rate, stock market, and international debt dynamics: policy simulations
This page may be remove to conceal the ientities of the authors An intertemporal moel of the real exchange rate, stock market, an international ebt ynamics: policy simulations Saziye Gazioglu an W. Davi
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationAnswers to the Practice Problems for Test 2
Answers to the Practice Problems for Test 2 Davi Murphy. Fin f (x) if it is known that x [f(2x)] = x2. By the chain rule, x [f(2x)] = f (2x) 2, so 2f (2x) = x 2. Hence f (2x) = x 2 /2, but the lefthan
More information_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page 189 PART III. Growth Theory: The Economy in the Very Long Run
189220_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page 189 PART III Growth Theory: The Economy in the Very Long Run 189220_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page 190 189220_Mankiw7e_CH07.qxp 3/2/09 9:40 PM Page
More informationOpen World Face Recognition with Credibility and Confidence Measures
Open Worl Face Recognition with Creibility an Confience Measures Fayin Li an Harry Wechsler Department of Computer Science George Mason University Fairfax, VA 22030 {fli, wechsler}@cs.gmu.eu Abstract.
More informationMathematics Review for Economists
Mathematics Review for Economists by John E. Floy University of Toronto May 9, 2013 This ocument presents a review of very basic mathematics for use by stuents who plan to stuy economics in grauate school
More informationIf you have ever spoken with your grandparents about what their lives were like
CHAPTER 7 Economic Growth I: Capital Accumulation an Population Growth The question of growth is nothing new but a new isguise for an ageol issue, one which has always intrigue an preoccupie economics:
More informationUNIFIED BIJECTIONS FOR MAPS WITH PRESCRIBED DEGREES AND GIRTH
UNIFIED BIJECTIONS FOR MAPS WITH PRESCRIBED DEGREES AND GIRTH OLIVIER BERNARDI AND ÉRIC FUSY Abstract. This article presents unifie bijective constructions for planar maps, with control on the face egrees
More informationWeb Appendices to Selling to Overcon dent Consumers
Web Appenices to Selling to Overcon ent Consumers Michael D. Grubb MIT Sloan School of Management Cambrige, MA 02142 mgrubbmit.eu www.mit.eu/~mgrubb May 2, 2008 B Option Pricing Intuition This appenix
More informationWeb Appendices of Selling to Overcon dent Consumers
Web Appenices of Selling to Overcon ent Consumers Michael D. Grubb A Option Pricing Intuition This appenix provies aitional intuition base on option pricing for the result in Proposition 2. Consier the
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationM147 Practice Problems for Exam 2
M47 Practice Problems for Exam Exam will cover sections 4., 4.4, 4.5, 4.6, 4.7, 4.8, 5., an 5.. Calculators will not be allowe on the exam. The first ten problems on the exam will be multiple choice. Work
More informationExponential Functions: Differentiation and Integration. The Natural Exponential Function
46_54.q //4 :59 PM Page 5 5 CHAPTER 5 Logarithmic, Eponential, an Other Transcenental Functions Section 5.4 f () = e f() = ln The inverse function of the natural logarithmic function is the natural eponential
More informationPrimitive Prime Divisors of FirstOrder Polynomial Recurrence Sequences
Primitive Prime Divisors of FirstOrder Polynomial Recurrence Sequences Brian Rice brice@hmc.edu July 19, 2006 Abstract The question of which terms of a recurrence sequence fail to have primitive prime
More information5 The Beginning of Transcendental Numbers
5 The Beginning of Transcendental Numbers We have defined a transcendental number (see Definition 3 of the Introduction), but so far we have only established that certain numbers are irrational. We now
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationRecurrence Relations
Recurrence Relations Introduction Determining the running time of a recursive algorithm often requires one to determine the bigo growth of a function T (n) that is defined in terms of a recurrence relation.
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
More informationWhich Networks Are Least Susceptible to Cascading Failures?
Which Networks Are Least Susceptible to Cascaing Failures? Larry Blume Davi Easley Jon Kleinberg Robert Kleinberg Éva Taros July 011 Abstract. The resilience of networks to various types of failures is
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationThe oneyear nonlife insurance risk
The oneyear nonlife insurance risk Ohlsson, Esbjörn & Lauzeningks, Jan Abstract With few exceptions, the literature on nonlife insurance reserve risk has been evote to the ultimo risk, the risk in the
More informationImproved division by invariant integers
1 Improve ivision by invariant integers Niels Möller an Torbjörn Granlun Abstract This paper consiers the problem of iviing a twowor integer by a singlewor integer, together with a few extensions an
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More information2. Properties of Functions
2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is onetoone (short han is 1 1) or injetive if preimages are unique.
More informationProblem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS
Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection
More informationDepartment of Mathematical Sciences, University of Copenhagen. Kandidat projekt i matematik. Jens Jakob Kjær. Golod Complexes
F A C U L T Y O F S C I E N C E U N I V E R S I T Y O F C O P E N H A G E N Department of Mathematical Sciences, University of Copenhagen Kaniat projekt i matematik Jens Jakob Kjær Golo Complexes Avisor:
More informationOptimal Control Policy of a Production and Inventory System for multiproduct in Segmented Market
RATIO MATHEMATICA 25 (2013), 29 46 ISSN:15927415 Optimal Control Policy of a Prouction an Inventory System for multiprouct in Segmente Market Kuleep Chauhary, Yogener Singh, P. C. Jha Department of Operational
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationmax cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x
Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study
More informationHull, Chapter 11 + Sections 17.1 and 17.2 Additional reference: John Cox and Mark Rubinstein, Options Markets, Chapter 5
Binomial Moel Hull, Chapter 11 + ections 17.1 an 17.2 Aitional reference: John Cox an Mark Rubinstein, Options Markets, Chapter 5 1. OnePerio Binomial Moel Creating synthetic options (replicating options)
More informationData Center Power System Reliability Beyond the 9 s: A Practical Approach
Data Center Power System Reliability Beyon the 9 s: A Practical Approach Bill Brown, P.E., Square D Critical Power Competency Center. Abstract Reliability has always been the focus of missioncritical
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationMeasures of distance between samples: Euclidean
4 Chapter 4 Measures of istance between samples: Eucliean We will be talking a lot about istances in this book. The concept of istance between two samples or between two variables is funamental in multivariate
More informationCURRENCY OPTION PRICING II
Jones Grauate School Rice University Masa Watanabe INTERNATIONAL FINANCE MGMT 657 Calibrating the Binomial Tree to Volatility BlackScholes Moel for Currency Options Properties of the BS Moel Option Sensitivity
More informationTheorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that. a = bq + r and 0 r < b.
Theorem (The division theorem) Suppose that a and b are integers with b > 0. There exist unique integers q and r so that a = bq + r and 0 r < b. We re dividing a by b: q is the quotient and r is the remainder,
More informationRisk Adjustment for Poker Players
Risk Ajustment for Poker Players William Chin DePaul University, Chicago, Illinois Marc Ingenoso Conger Asset Management LLC, Chicago, Illinois September, 2006 Introuction In this article we consier risk
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationPROPERTIES OF MATRICES
PROPERIES OF MARICES ajoint... 4, 5 algebraic multiplicity... augmente matri... basis..., cofactor... 4 coorinate vector... 9 Cramer's rule... eterminant..., 5 iagonal matri... 6 iagonalizable... 8 imension...
More informationSpectral Measure of Large Random Toeplitz Matrices
Spectral Measure of Large Random Toeplitz Matrices Yongwhan Lim June 5, 2012 Definition (Toepliz Matrix) The symmetric Toeplitz matrix is defined to be [X i j ] where 1 i, j n; that is, X 0 X 1 X 2 X n
More informationGenerating Elementary Combinatorial Objects
Fall 2009 Combinatorial Generation Combinatorial Generation: an old subject Excerpt from: D. Knuth, History of Combinatorial Generation, in prefascicle 4B, The Art of Computer Programming Vol 4. Combinatorial
More informationStationary random graphs on Z with prescribed iid degrees and finite mean connections
Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the nonnegative
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationLecture 17: Implicit differentiation
Lecture 7: Implicit ifferentiation Nathan Pflueger 8 October 203 Introuction Toay we iscuss a technique calle implicit ifferentiation, which provies a quicker an easier way to compute many erivatives we
More informationBESSEL FUNCTIONS. 1. Introduction The standard form for any second order homogeneous differential
BESSEL FUNCTIONS FAYEZ KAROJI, CASEY TSAI, AND RACHEL WEYRENS Abstract. We briefly aress how to solve Bessel s ifferential equation an escribe its solutions, Bessel functions. Aitionally, we iscuss two
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationPurpose of the Experiments. Principles and Error Analysis. ε 0 is the dielectric constant,ε 0. ε r. = 8.854 10 12 F/m is the permittivity of
Experiments with Parallel Plate Capacitors to Evaluate the Capacitance Calculation an Gauss Law in Electricity, an to Measure the Dielectric Constants of a Few Soli an Liqui Samples Table of Contents Purpose
More informationLecture L253D Rigid Body Kinematics
J. Peraire, S. Winall 16.07 Dynamics Fall 2008 Version 2.0 Lecture L253D Rigi Boy Kinematics In this lecture, we consier the motion of a 3D rigi boy. We shall see that in the general threeimensional
More informationCURVES: VELOCITY, ACCELERATION, AND LENGTH
CURVES: VELOCITY, ACCELERATION, AND LENGTH As examples of curves, consier the situation where the amounts of ncommoities varies with time t, qt = q 1 t,..., q n t. Thus, the amount of the commoities are
More information1 Formulating The Low Degree Testing Problem
6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,
More information