CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH
|
|
- Hilary Osborne
- 5 years ago
- Views:
Transcription
1 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH Yaron Azrieli and Ehud Lehrer Tel-Aviv University CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 1/3
2 Outline Categorization and Prototypes - short general background. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
3 Outline Categorization and Prototypes - short general background. Categorization system the model. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
4 Outline Categorization and Prototypes - short general background. Categorization system the model. Categorization systems generated by prototypes Axiomatization. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
5 Outline Categorization and Prototypes - short general background. Categorization system the model. Categorization systems generated by prototypes Axiomatization. Voronoi diagrams. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
6 Outline Categorization and Prototypes - short general background. Categorization system the model. Categorization systems generated by prototypes Axiomatization. Voronoi diagrams. Proof sketch. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
7 Outline Categorization and Prototypes - short general background. Categorization system the model. Categorization systems generated by prototypes Axiomatization. Voronoi diagrams. Proof sketch. Examples. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
8 Outline Categorization and Prototypes - short general background. Categorization system the model. Categorization systems generated by prototypes Axiomatization. Voronoi diagrams. Proof sketch. Examples. Discussion. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
9 Outline Categorization and Prototypes - short general background. Categorization system the model. Categorization systems generated by prototypes Axiomatization. Voronoi diagrams. Proof sketch. Examples. Discussion. Remarks, open questions,... CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 2/3
10 General background Why do we categorize? CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 3/3
11 General background Why do we categorize? If you have never seen this particular creature before, why are you afraid of it? CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 3/3
12 General background It seems that for decision under stress we use a prototype-oriented decision process. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 4/3
13 General background It seems that for decision under stress we use a prototype-oriented decision process. A team trained to recognize a prototype from a set of prototypical scenarios and react accordingly, do not need a coordinator to act in harmony. This is crucial when the team might need to react instantaneously with no time for coordination. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 4/3
14 General background The classical view: A category as a list of features If man has one meaning, let this be two-footed animal. By has one meaning I mean this: if X means man, then if anything is a man, it s humanity will consist in being X. Aristotle, Metaphysics. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 5/3
15 General background The classical view: Categories are defined in terms of a conjunction of necessary and sufficient features. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 6/3
16 General background The classical view: Categories are defined in terms of a conjunction of necessary and sufficient features. Features are binary. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 6/3
17 General background The classical view: Categories are defined in terms of a conjunction of necessary and sufficient features. Features are binary. All members of a category have equal status. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 6/3
18 General background The prototypes approach: Another way to achieve separateness and clarity of actually continuous categories is by conceiving of each category in terms of its clear cases rather than its boundaries. As Wittgenstein (1953) has pointed out, categorical judgments become a problem only if one is concerned with boundaries in the normal course of life, two neighbors know on whose property they are standing without exact demarcation of the boundary line. E. Rosch, Principles of Categorization (1978). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 7/3
19 General background The prototypes approach: Certain members of a category are more typical than others. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 8/3
20 General background The prototypes approach: Certain members of a category are more typical than others. Categories have radial structure. They form around the prototypical cases. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 8/3
21 General background The prototypes approach: Certain members of a category are more typical than others. Categories have radial structure. They form around the prototypical cases. Category membership is a matter of degree. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 8/3
22 General background The prototypes approach: Certain members of a category are more typical than others. Categories have radial structure. They form around the prototypical cases. Category membership is a matter of degree. People categorize more typical members faster than less typical ones. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 8/3
23 Entities and Categories A finite set of categories L = {1, 2,...,l} CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 9/3
24 Entities and Categories A finite set of categories L = {1, 2,...,l} The set of entities to be categorized is R d + (d 2). That is, an entity is defined by the intensity of d attributes, and the intensity is unbounded. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 9/3
25 Entities and Categories A finite set of categories L = {1, 2,...,l} The set of entities to be categorized is R d + (d 2). That is, an entity is defined by the intensity of d attributes, and the intensity is unbounded. Typically, the d attributes represent just a partial list of attributes of the entity under consideration. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 9/3
26 Entities and Categories A finite set of categories L = {1, 2,...,l} The set of entities to be categorized is R d + (d 2). That is, an entity is defined by the intensity of d attributes, and the intensity is unbounded. Typically, the d attributes represent just a partial list of attributes of the entity under consideration. The set R d + can be replaced by the entire Euclidean space, or the simplex. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 9/3
27 Categorization system Definition: An open partition of R d + is a collection of non-empty, pairwise disjoint open sets, say, A 1,A 2,... such that cl A i = R d +. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 10/3
28 Categorization system Definition: An open partition of R d + is a collection of non-empty, pairwise disjoint open sets, say, A 1,A 2,... such that cl A i = R d +. Definition: 1. A categorization system is a collection of open partitions P A = (P A (i)) i A of R d +, A L ( A 2). 2. When x P A (i) we say that x is categorized as i when A is considered. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 10/3
29 Axioms Convexity: For every A L and for each i A, P A (i) is a convex set. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 11/3
30 Axioms Convexity: For every A L and for each i A, P A (i) is a convex set. Hierarchic Consistency: For every A L and for each i A, P A (i) = B A,i B P B(i). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 11/3
31 Axioms Convexity: For every A L and for each i A, P A (i) is a convex set. Hierarchic Consistency: For every A L and for each i A, P A (i) = B A,i B P B(i). Non-Redundancy: For every three categories {i,j,k} L, P {i,j} (i) P {i,k} (i). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 11/3
32 Axioms Convexity: For every A L and for each i A, P A (i) is a convex set. Hierarchic Consistency: For every A L and for each i A, P A (i) = B A,i B P B(i). Non-Redundancy: For every three categories {i,j,k} L, P {i,j} (i) P {i,k} (i). Variety: For every four distinct categories {i,j,k,m} L, cl(p {i,j,k} (i)) cl(p {i,j,k} (j)) cl(p {i,j,k} (k)) cl(p {m,j,k} (m)) cl(p {m,j,k} (j)) cl(p {m,j,k} (k)) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 11/3
33 Extended prototypes Definition: A categorization system, P A = (P A (i)) i A, A L, is generated by extended prototypes, if there exist l points x 1,x 2,...,x l in R d+1 +, such that for any A L and any i A, P A (i) = {y R d + : d i (y) < d j (y) for every j A,j i}, where d i (y) = (y, 0) x i 2 (i = 1,...,l) and (y, 0) is the vector in R d+1 + whose first d coordinates coincide with y and the last coincides with 0. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 12/3
34 Extended prototypes Definition: A categorization system, P A = (P A (i)) i A, A L, is generated by extended prototypes, if there exist l points x 1,x 2,...,x l in R d+1 +, such that for any A L and any i A, P A (i) = {y R d + : d i (y) < d j (y) for every j A,j i}, where d i (y) = (y, 0) x i 2 (i = 1,...,l) and (y, 0) is the vector in R d+1 + whose first d coordinates coincide with y and the last coincides with 0. Interpretation: The extended prototype is in R d+1 +. Recall that the d attribute may represent only a partial information about the entity. The hidden attribute may me interpreted as an imaginary completion of the unknown attributes. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 12/3
35 Partial information Suppose that you encounter this: CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 13/3
36 Partial information Suppose that you encounter this: CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 13/3
37 Partial information Suppose that you encounter this: What do you do? CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 13/3
38 Axiomatization The main result: If {P A } A L is a categorization system generated by extended prototypes, then it satisfies Convexity and Hierarchic Consistency. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 14/3
39 Axiomatization The main result: If {P A } A L is a categorization system generated by extended prototypes, then it satisfies Convexity and Hierarchic Consistency. If a categorization system {P A } A L satisfies Convexity and Hierarchic Consistency, and in addition satisfies Non-Redundancy and Variety, then it is generated by extended prototypes. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 14/3
40 Remarks Hierarchic Consistency is a necessary condition for a categorization system to be generated by prototypes regardless of the metric (e.g., maximum norm, l 1 etc.). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 15/3
41 Remarks Hierarchic Consistency is a necessary condition for a categorization system to be generated by prototypes regardless of the metric (e.g., maximum norm, l 1 etc.). The Euclidean metric is the result of the Convexity axiom. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 15/3
42 Voronoi Diagrams Let x 1,x 2,...,x n be some n distinct points in R d. For every i = 1, 2,...,n, let A i = {y R d : y x i < y x j for every j = 1, 2,...,n j i} where stands for the Euclidian norm. Definition: The Voronoi diagram induced by x 1,x 2,...,x n is the collection of sets A 1,A 2,...,A n. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 16/3
43 Voronoi Diagrams CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 17/3
44 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal distance from x i and x j is the hyperplane which is the perpendicular bisector of the segment between x i and x j. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 18/3
45 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal distance from x i and x j is the hyperplane which is the perpendicular bisector of the segment between x i and x j. For every i = 1,...,n, A i is the intersection of a (finite) number of half spaces. Therefore, it is a convex polyhedral set. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 18/3
46 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal distance from x i and x j is the hyperplane which is the perpendicular bisector of the segment between x i and x j. For every i = 1,...,n, A i is the intersection of a (finite) number of half spaces. Therefore, it is a convex polyhedral set. x i A i. Therefore A i is not empty. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 18/3
47 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal distance from x i and x j is the hyperplane which is the perpendicular bisector of the segment between x i and x j. For every i = 1,...,n, A i is the intersection of a (finite) number of half spaces. Therefore, it is a convex polyhedral set. x i A i. Therefore A i is not empty. The closure of the union of the sets A i (1 i n) is the entire space. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 18/3
48 Voronoi Diagrams Generalization: Power diagrams Every point x i has a non-negative weight w i. For a point y R d, let d i (y) = y x i 2 + w i. Similarly to the former case, define for i = 1, 2,...,n B i = {y R d : d i (y) < d j (y) for every j = 1, 2,...,n j i} Definition: The Power diagram induced by (x 1,w 1 ),..., (x n,w n ) is the collection of sets B 1,B 2,...,B n. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 19/3
49 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal weighted distance from x i and x j is a hyperplane perpendicular to the segment between x i and x j (not necessarily the perpendicular bisector). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 20/3
50 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal weighted distance from x i and x j is a hyperplane perpendicular to the segment between x i and x j (not necessarily the perpendicular bisector). For every i = 1,...,n, B i is the intersection of a (finite) number of half spaces. Therefore, it is a convex polyhedral set. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 20/3
51 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal weighted distance from x i and x j is a hyperplane perpendicular to the segment between x i and x j (not necessarily the perpendicular bisector). For every i = 1,...,n, B i is the intersection of a (finite) number of half spaces. Therefore, it is a convex polyhedral set. B i can be empty. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 20/3
52 Voronoi Diagrams Simple observations: For every two points x i,x j, the set of points in R d which are in equal weighted distance from x i and x j is a hyperplane perpendicular to the segment between x i and x j (not necessarily the perpendicular bisector). For every i = 1,...,n, B i is the intersection of a (finite) number of half spaces. Therefore, it is a convex polyhedral set. B i can be empty. The closure of the union of the sets B i (1 i n) is the entire space. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 20/3
53 Proof sketch Part 1 of the main theorem: If {P A } A L is a categorization system generated by extended prototypes, then it satisfies Convexity and Hierarchic Consistency. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 21/3
54 Proof sketch Part 1 of the main theorem: If {P A } A L is a categorization system generated by extended prototypes, then it satisfies Convexity and Hierarchic Consistency. Lemma: Let {P A } A L be a categorization system. Then {P A } A L satisfies Hierarchic Consistency if and only if for every A L ( A 2) and for each i A, P A (i) = j A\{i} P {i,j}(i). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 21/3
55 Proof sketch Part 2 of the main theorem: If a categorization system {P A } A L satisfies Convexity and Hierarchic Consistency, and in addition satisfies Non-Redundancy and Variety, then it is generated by extended prototypes. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 22/3
56 Proof sketch Lemma: If {P A } A L satisfies Convexity then for every two categories i,j L there exists a hyperplane H i,j, such that P {i,j} (i) is the open half space on one side of it and P {i,j} (j) is the complementary open half. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 23/3
57 Proof sketch Lemma: If {P A } A L satisfies Convexity then for every two categories i,j L there exists a hyperplane H i,j, such that P {i,j} (i) is the open half space on one side of it and P {i,j} (j) is the complementary open half. Lemma: Non-Redundancy implies that for any three distinct categories i,j,k the hyperplanes H i,j and H i,k are not parallel. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 23/3
58 Proof sketch Lemma: If {P A } A L satisfies Convexity then for every two categories i,j L there exists a hyperplane H i,j, such that P {i,j} (i) is the open half space on one side of it and P {i,j} (j) is the complementary open half. Lemma: Non-Redundancy implies that for any three distinct categories i,j,k the hyperplanes H i,j and H i,k are not parallel. Lemma: Let {P A } A L be a categorization system which satisfies Convexity, Hierarchic Consistency and Non-Redundancy. For any three distinct categories i, j and k H i,j H i,k = H i,j H j,k = H j,k H i,k CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 23/3
59 Proof sketch Proposition: If a categorization system {P A } A L satisfies Convexity, Hierarchic Consistency, Non-Redundancy and Variety, then there are l points x 1,...,x l Rd + such that: 1. x i x j is perpendicular to the hyperplane H i,j, for every i,j L; and 2. The direction from x i to x j is the same as the direction from P {i,j} (i) to P {i,j} (j) (we call such points well oriented ). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 24/3
60 Proof sketch P L (2) P L (4) 3 P L (1) P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
61 Proof sketch P L (2) P L (4) x P L (1) P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
62 Proof sketch x 2 P L (2) P L (4) x P L (1) P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
63 Proof sketch x 2 P L (2) P L (4) x 1 3 x 3 4 P L (1) P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
64 Proof sketch x 2 P L (2) x 4 P L (4) x 1 3 x 3 4 P L (1) P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
65 Proof sketch x 2 P L (2) x 4 P L (4) x 1 3 x 3 4 P L (1) P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
66 Proof sketch x 2 P L (2) x 4 P L (4) P L (1) x 1 3 x P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
67 Proof sketch x 2 P L (2) x 4 P L (4) P L (1) x 1 3 x P L (3) CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
68 Proof sketch x 2 P L (2) x 4 P L (4) P L (1) x 1 3 x P L (3) 1 4 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
69 Proof sketch x 2 P L (2) x 4 P L (4) P L (1) x 1 3 x P L (3) 1 4 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 25/3
70 Proof sketch Proposition: Let {x 1,...,x l } Rd + be points that satisfy the previous proposition. There exist a set of numbers w 1,...,w l, such that P {i,j} (i) = {y R d +; d i (y) < d j (y)} for every i,j L, where d i (y) = (y, 0) (x i,w i) 2. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 26/3
71 Proof sketch Conclusion of the main result s proof: It is possible to find points x 1 = (x 1,w 1),...,x l = (x l,w l) in such that for every two categories i,j L, P {i,j} (i) = {y R d +; (y, 0) x i 2 < (y, 0) x j 2 }. Therefore, for any A L and any i A, R d+1 + P A (i) = j A\{i} {y R d +; (y, 0) x i 2 < (y, 0) x j 2 } = {y R d +; (y, 0) x i 2 < (y, 0) x j 2 for every j A,j i} Thus, the categorization system is generated by extended prototypes. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 27/3
72 Examples Categorization which is not generated by extended prototypes L = {i,j,k} (3 categories), d = 2 (2 attributes). P {i,j} (i) = {(x 1,x 2 ) R 2 +; x 1 < 1} P {i,k} (i) = {(x 1,x 2 ) R 2 +; x 2 < 1} P {j,k} (j) = {(x 1,x 2 ) R 2 +; x 2 < 2 x 1 } By Hierarchic Consistency, when L is considered: P L (i) = {(x 1,x 2 ) R 2 +; x 1 < 1, x 2 < 1} P L (j) = {(x 1,x 2 ) R 2 +; x 1 > 1, x 2 < 2 x 1 } P L (k) = {(x 1,x 2 ) R 2 +; x 2 > 1, x 2 > 2 x 1 } CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 28/3
73 Examples Categorization which is not generated by extended prototypes x 2 i j k j P L (k) k i P L (i) P L (j) x 1 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 29/3
74 Examples The hidden attribute L = {i,j,k,m} (4 categories), d = 2 (2 attributes). P {i,j} (i) = {(x 1,x 2 ) R 2 +; 2x 2 > 4 x 1 } P {i,k} (i) = {(x 1,x 2 ) R 2 +; x 2 > 1} P {i,m} (i) = {(x 1,x 2 ) R 2 +; 2x 2 > x 1 1} P {j,k} (j) = {(x 1,x 2 ) R 2 +; 2x 2 > x 1 } P {j,m} (j) = {(x 1,x 2 ) R 2 +; 2x 1 < 5} P {k,m} (k) = {(x 1,x 2 ) R 2 +; 2x 2 < 5 x 1 } When more than 2 categories are considered, the partitions are determined by Hierarchic Consistency. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 30/3
75 Examples The hidden attribute x 2 j m P L (i) P L (j) P L (m) P L (k) x 1 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 31/3
76 Examples Convexity and Hierarchic Consistency are insufficient L = {i,j,k} (3 categories), d = 2 (2 attributes). P {i,j} (i) = {(x 1,x 2 ) R 2 +; x 1 < 1} P {i,k} (i) = {(x 1,x 2 ) R 2 +; x 1 < 1} P {j,k} (j) = {(x 1,x 2 ) R 2 +; x 2 > x 1 } By Hierarchic Consistency, when L is considered: P L (i) = {(x 1,x 2 ) R 2 +; x 1 < 1} P L (j) = {(x 1,x 2 ) R 2 +; x 1 > 1, x 2 > x 1 } P L (k) = {(x 1,x 2 ) R 2 +; x 1 > 1, x 2 < x 1 } CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 32/3
77 Examples Convexity and Hierarchic Consistency are insufficient x 2 i i j k P L (j) j k P L (i) P L (k) x 1 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 33/3
78 Examples Variety is not satisfied L = {i,j,k,m} (4 categories), d = 2 (2 attributes). P {i,j} (i) = {(x 1,x 2 ) R 2 +; x 1 < 1} P {i,k} (i) = {(x 1,x 2 ) R 2 +; x 2 > 1} P {i,m} (i) = {(x 1,x 2 ) R 2 +; x 2 > 2x 1 1} P {j,k} (j) = {(x 1,x 2 ) R 2 +; 2x 2 > 3 x 1 } P {j,m} (j) = {(x 1,x 2 ) R 2 +; x 2 > x 1 } P {k,m} (k) = {(x 1,x 2 ) R 2 +; x 2 < 2 x 1 } When more than 2 categories are considered, the partitions are determined by Hierarchic Consistency. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 34/3
79 Examples Variety is not satisfied x 2 i j x 2 P {i,j,k} (i) j P {m,j,k} (j) j m i k P {i,j,k} (j) k P {m,j,k} (m) P {i,j,k} (k) j P {m,j,k} (k) k k m x 1 x 1 CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 35/3
80 Discussion Limitations of the axioms: More than one prototypical example resulting in non-convex categories. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 36/3
81 Discussion Limitations of the axioms: More than one prototypical example resulting in non-convex categories. The effect of the set of categories under consideration on the prototypes Violation of Hierarchic Consistency. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 36/3
82 Discussion Decision theory and categorization Categorization of decision problems according to their best response satisfies Hierarchic Consistency. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 37/3
83 Discussion Decision theory and categorization Categorization of decision problems according to their best response satisfies Hierarchic Consistency. If a decision problem is defined by a distribution P over some state space (say Ω), and u(p,a) is the expected utility when choosing the action a, then the categorization of decision problems (distributions) according to their best response forms convex categories. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 37/3
84 Remarks & Open questions Categorizations generated by (non-extended) prototypes. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 38/3
85 Remarks & Open questions Categorizations generated by (non-extended) prototypes. Other domains. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 38/3
86 Remarks & Open questions Categorizations generated by (non-extended) prototypes. Other domains. Other metrics. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 38/3
87 Remarks & Open questions Categorizations generated by (non-extended) prototypes. Other domains. Other metrics. Prototypical sets. CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 38/3
88 Remarks & Open questions Categorizations generated by (non-extended) prototypes. Other domains. Other metrics. Prototypical sets. Another version of the Non-redundancy axiom which is also necessary: Non-Redundancy : For every three categories {i,j,k} L, if P {i,j} (i) = P {i,k} (i) then either P {i,j,k} (i) P {j,k} (j) or P {i,j,k} (i) P {j,k} (k). CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 38/3
89 Remarks & Open questions Categorizations generated by (non-extended) prototypes. Other domains. Other metrics. Prototypical sets. Another version of the Non-redundancy axiom which is also necessary: Non-Redundancy : For every three categories {i,j,k} L, if P {i,j} (i) = P {i,k} (i) then either P {i,j,k} (i) P {j,k} (j) or P {i,j,k} (i) P {j,k} (k). Is the theorem still true without assuming Variety? CATEGORIZATION GENERATED BY PROTOTYPES AN AXIOMATIC APPROACH p. 38/3
Mathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationDecidability of consistency of function and derivative information for a triangle and a convex quadrilateral
Decidability of consistency of function and derivative information for a triangle and a convex quadrilateral Abbas Edalat Department of Computing Imperial College London Abstract Given a triangle in the
More informationOrdered categories and additive conjoint measurement on connected sets
Ordered categories and additive conjoint measurement on connected sets D. Bouyssou a, T. Marchant b a CNRS - LAMSADE, Université Paris Dauphine, F-75775 Paris Cedex 16, France b Ghent University, Dunantlaan
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More informationConvex Sets. Prof. Dan A. Simovici UMB
Convex Sets Prof. Dan A. Simovici UMB 1 / 57 Outline 1 Closures, Interiors, Borders of Sets in R n 2 Segments and Convex Sets 3 Properties of the Class of Convex Sets 4 Closure and Interior Points of Convex
More informationChapter 3. Betweenness (ordering) A system satisfying the incidence and betweenness axioms is an ordered incidence plane (p. 118).
Chapter 3 Betweenness (ordering) Point B is between point A and point C is a fundamental, undefined concept. It is abbreviated A B C. A system satisfying the incidence and betweenness axioms is an ordered
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationA Parametric Simplex Algorithm for Linear Vector Optimization Problems
A Parametric Simplex Algorithm for Linear Vector Optimization Problems Birgit Rudloff Firdevs Ulus Robert Vanderbei July 9, 2015 Abstract In this paper, a parametric simplex algorithm for solving linear
More informationNormal Fans of Polyhedral Convex Sets
Set-Valued Analysis manuscript No. (will be inserted by the editor) Normal Fans of Polyhedral Convex Sets Structures and Connections Shu Lu Stephen M. Robinson Received: date / Accepted: date Dedicated
More information4.7 The Levi-Civita connection and parallel transport
Classnotes: Geometry & Control of Dynamical Systems, M. Kawski. April 21, 2009 138 4.7 The Levi-Civita connection and parallel transport In the earlier investigation, characterizing the shortest curves
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationStat 451: Solutions to Assignment #1
Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More information1. To be a grandfather. Objects of our consideration are people; a person a is associated with a person b if a is a grandfather of b.
20 [161016-1020 ] 3.3 Binary relations In mathematics, as in everyday situations, we often speak about a relationship between objects, which means an idea of two objects being related or associated one
More informationMinimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane Alberto Del Pia Department of Industrial and Systems Engineering & Wisconsin Institutes for Discovery, University of Wisconsin-Madison
More informationSummer School: Semidefinite Optimization
Summer School: Semidefinite Optimization Christine Bachoc Université Bordeaux I, IMB Research Training Group Experimental and Constructive Algebra Haus Karrenberg, Sept. 3 - Sept. 7, 2012 Duality Theory
More informationLinear Discrimination Functions
Laurea Magistrale in Informatica Nicola Fanizzi Dipartimento di Informatica Università degli Studi di Bari November 4, 2009 Outline Linear models Gradient descent Perceptron Minimum square error approach
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationk th -order Voronoi Diagrams
k th -order Voronoi Diagrams References: D.-T. Lee, On k-nearest neighbor Voronoi Diagrams in the plane, IEEE Transactions on Computers, Vol. 31, No. 6, pp. 478 487, 1982. B. Chazelle and H. Edelsbrunner,
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationSupport Vector Machine. Industrial AI Lab.
Support Vector Machine Industrial AI Lab. Classification (Linear) Autonomously figure out which category (or class) an unknown item should be categorized into Number of categories / classes Binary: 2 different
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More informationShow that the following problems are NP-complete
Show that the following problems are NP-complete April 7, 2018 Below is a list of 30 exercises in which you are asked to prove that some problem is NP-complete. The goal is to better understand the theory
More information(U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M.
1. Abstract Integration The main reference for this section is Rudin s Real and Complex Analysis. The purpose of developing an abstract theory of integration is to emphasize the difference between the
More informationEquitable Partitioning Policies for Robotic Networks
Equitable Partitioning Policies for Robotic Networks Marco Pavone, Alessandro Arsie, Emilio Frazzoli, Francesco Bullo Abstract The most widely applied resource allocation strategy is to balance, or equalize,
More informationWeek 3: Faces of convex sets
Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationDigital Logic Design: a rigorous approach c
Digital Logic Design: a rigorous approach c Chapter 1: Sets and Functions Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. October 25, 2017 Book Homepage: http://www.eng.tau.ac.il/~guy/even-medina
More informationPerformance of small signal sets
42 Chapter 5 Performance of small signal sets In this chapter, we show how to estimate the performance of small-to-moderate-sized signal constellations on the discrete-time AWGN channel. With equiprobable
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationLOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi
LOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi Department of Mathematics, East China Normal University, Shanghai, 200062, China and Center for Combinatorics,
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationOn the Volume of Unbounded Polyhedra in the Hyperbolic Space
Beiträge zur Algebra und eometrie Contributions to Algebra and eometry Volume 44 (2003), No. 1, 145-154. On the Volume of Unbounded Polyhedra in the Hyperbolic Space S. Kántor Institute of Mathematics
More informationON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION
ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION CHRISTIAN GÜNTHER AND CHRISTIANE TAMMER Abstract. In this paper, we consider multi-objective optimization problems involving not necessarily
More informationRepresenting Independence Models with Elementary Triplets
Representing Independence Models with Elementary Triplets Jose M. Peña ADIT, IDA, Linköping University, Sweden jose.m.pena@liu.se Abstract An elementary triplet in an independence model represents a conditional
More informationFacets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes
Facets for Node-Capacitated Multicut Polytopes from Path-Block Cycles with Two Common Nodes Michael M. Sørensen July 2016 Abstract Path-block-cycle inequalities are valid, and sometimes facet-defining,
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More information3. Prove or disprove: If a space X is second countable, then every open covering of X contains a countable subcollection covering X.
Department of Mathematics and Statistics University of South Florida TOPOLOGY QUALIFYING EXAM January 24, 2015 Examiners: Dr. M. Elhamdadi, Dr. M. Saito Instructions: For Ph.D. level, complete at least
More informationA G δ IDEAL OF COMPACT SETS STRICTLY ABOVE THE NOWHERE DENSE IDEAL IN THE TUKEY ORDER
A G δ IDEAL OF COMPACT SETS STRICTLY ABOVE THE NOWHERE DENSE IDEAL IN THE TUKEY ORDER JUSTIN TATCH MOORE AND S LAWOMIR SOLECKI Abstract. We prove that there is a G δ σ-ideal of compact sets which is strictly
More informationHOMOLOGY THEORIES INGRID STARKEY
HOMOLOGY THEORIES INGRID STARKEY Abstract. This paper will introduce the notion of homology for topological spaces and discuss its intuitive meaning. It will also describe a general method that is used
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationOn the convexity of piecewise-defined functions
On the convexity of piecewise-defined functions arxiv:1408.3771v1 [math.ca] 16 Aug 2014 Heinz H. Bauschke, Yves Lucet, and Hung M. Phan August 16, 2014 Abstract Functions that are piecewise defined are
More informationNotes. Relations. Introduction. Notes. Relations. Notes. Definition. Example. Slides by Christopher M. Bourke Instructor: Berthe Y.
Relations Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 7.1, 7.3 7.5 of Rosen cse235@cse.unl.edu
More informationThe Evolution and Discovery of the Species of Equality in Euclid s Elements
From the SelectedWorks of Lee T Nutini 2010 The Evolution and Discovery of the Species of Equality in Euclid s Elements Lee T Nutini Available at: https://works.bepress.com/nutini/2/ Nutini 1 The Evolution
More informationConvex hull of two quadratic or a conic quadratic and a quadratic inequality
Noname manuscript No. (will be inserted by the editor) Convex hull of two quadratic or a conic quadratic and a quadratic inequality Sina Modaresi Juan Pablo Vielma the date of receipt and acceptance should
More informationAdvanced Linear Programming: The Exercises
Advanced Linear Programming: The Exercises The answers are sometimes not written out completely. 1.5 a) min c T x + d T y Ax + By b y = x (1) First reformulation, using z smallest number satisfying x z
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 informationZero sum games Proving the vn theorem. Zero sum games. Roberto Lucchetti. Politecnico di Milano
Politecnico di Milano General form Definition A two player zero sum game in strategic form is the triplet (X, Y, f : X Y R) f (x, y) is what Pl1 gets from Pl2, when they play x, y respectively. Thus g
More informationSupport Vector Machine. Industrial AI Lab. Prof. Seungchul Lee
Support Vector Machine Industrial AI Lab. Prof. Seungchul Lee Classification (Linear) Autonomously figure out which category (or class) an unknown item should be categorized into Number of categories /
More informationPartial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times
Preprints of the 13th IFAC Symposium on Information Control Problems in Manufacturing, Moscow, Russia, June 3-5, 2009 Fr-A2.3 Partial job order for solving the two-machine flow-shop minimum-length problem
More informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
More informationExact Join Detection for Convex Polyhedra and Other Numerical Abstractions
Exact Join Detection for Convex Polyhedra and Other Numerical Abstractions Roberto Bagnara, Patricia M. Hill, Enea Zaffanella Department of Mathematics, University of Parma, Italy Abstract Deciding whether
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationUnit 1: Introduction to Proof
Unit 1: Introduction to Proof Prove geometric theorems both formally and informally using a variety of methods. G.CO.9 Prove and apply theorems about lines and angles. Theorems include but are not restricted
More informationOn the projection onto a finitely generated cone
Acta Cybernetica 00 (0000) 1 15. On the projection onto a finitely generated cone Miklós Ujvári Abstract In the paper we study the properties of the projection onto a finitely generated cone. We show for
More information36th United States of America Mathematical Olympiad
36th United States of America Mathematical Olympiad 1. Let n be a positive integer. Define a sequence by setting a 1 = n and, for each k > 1, letting a k be the unique integer in the range 0 a k k 1 for
More informationarxiv: v1 [math.fa] 14 Jul 2018
Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of
More informationConvex Hull-Based Metric Refinements for Topological Spatial Relations
ABSTRACT Convex Hull-Based Metric Refinements for Topological Spatial Relations Fuyu (Frank) Xu School of Computing and Information Science University of Maine Orono, ME 04469-5711, USA fuyu.xu@maine.edu
More informationPROPERTIES OF SIMPLE ROOTS
PROPERTIES OF SIMPLE ROOTS ERIC BRODER Let V be a Euclidean space, that is a finite dimensional real linear space with a symmetric positive definite inner product,. Recall that for a root system Δ in V,
More informationThe Axiom of Choice and Zorn s Lemma
The Axiom of Choice and Zorn s Lemma Any indexed family of sets A ={Ai: i I} may be conceived as a variable set, to wit, as a set varying over the index set I. Each Ai is then the value of the variable
More informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
More information4 Choice axioms and Baire category theorem
Tel Aviv University, 2013 Measure and category 30 4 Choice axioms and Baire category theorem 4a Vitali set....................... 30 4b No choice....................... 31 4c Dependent choice..................
More informationRelations Graphical View
Introduction Relations Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Recall that a relation between elements of two sets is a subset of their Cartesian
More informationCombinatorial Generalizations of Jung s Theorem
Discrete Comput Geom (013) 49:478 484 DOI 10.1007/s00454-013-9491-3 Combinatorial Generalizations of Jung s Theorem Arseniy V. Akopyan Received: 15 October 011 / Revised: 11 February 013 / Accepted: 11
More informationA vector identity for the Dirichlet tessellation
Math. Proc. Camb. Phil. Soc. (1980), 87, 151 Printed in Great Britain A vector identity for the Dirichlet tessellation BY ROBIN SIBSON University of Bath (Received 1 March 1979, revised 5 June 1979) Summary.
More informationAxiomatic Decision Theory
Decision Theory Decision theory is about making choices It has a normative aspect what rational people should do... and a descriptive aspect what people do do Not surprisingly, it s been studied by economists,
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationDynamic Programming Lecture #4
Dynamic Programming Lecture #4 Outline: Probability Review Probability space Conditional probability Total probability Bayes rule Independent events Conditional independence Mutual independence Probability
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationarxiv: v2 [math.ag] 24 Jun 2015
TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set
More informationLattice closures of polyhedra
Lattice closures of polyhedra Sanjeeb Dash IBM Research sanjeebd@us.ibm.com Oktay Günlük IBM Research gunluk@us.ibm.com April 10, 2017 Diego A. Morán R. Universidad Adolfo Ibañez diego.moran@uai.cl Abstract
More informationUsing the Johnson-Lindenstrauss lemma in linear and integer programming
Using the Johnson-Lindenstrauss lemma in linear and integer programming Vu Khac Ky 1, Pierre-Louis Poirion, Leo Liberti LIX, École Polytechnique, F-91128 Palaiseau, France Email:{vu,poirion,liberti}@lix.polytechnique.fr
More informationContext-Free Languages (Pre Lecture)
Context-Free Languages (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Context-Free Languages (Pre Lecture) Fall 2017 1 / 34 Outline Pumping Lemma
More informationLinear Programming. Larry Blume Cornell University, IHS Vienna and SFI. Summer 2016
Linear Programming Larry Blume Cornell University, IHS Vienna and SFI Summer 2016 These notes derive basic results in finite-dimensional linear programming using tools of convex analysis. Most sources
More information1 Chapter 1: SETS. 1.1 Describing a set
1 Chapter 1: SETS set is a collection of objects The objects of the set are called elements or members Use capital letters :, B, C, S, X, Y to denote the sets Use lower case letters to denote the elements:
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationEilenberg-Steenrod properties. (Hatcher, 2.1, 2.3, 3.1; Conlon, 2.6, 8.1, )
II.3 : Eilenberg-Steenrod properties (Hatcher, 2.1, 2.3, 3.1; Conlon, 2.6, 8.1, 8.3 8.5 Definition. Let U be an open subset of R n for some n. The de Rham cohomology groups (U are the cohomology groups
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationEvery Neural Code Can Be Realized by Convex Sets
Every Neural Code Can Be Realized by Convex Sets Megan K. Franke and Samuel Muthiah July 21, 2017 Abstract Place cells are neurons found in some mammals that fire based on the animal s location in their
More informationResearch Division. Computer and Automation Institute, Hungarian Academy of Sciences. H-1518 Budapest, P.O.Box 63. Ujvári, M. WP August, 2007
Computer and Automation Institute, Hungarian Academy of Sciences Research Division H-1518 Budapest, P.O.Box 63. ON THE PROJECTION ONTO A FINITELY GENERATED CONE Ujvári, M. WP 2007-5 August, 2007 Laboratory
More informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) September 29, 2015 1 Lecture 09 1.1 Equicontinuity First let s recall the conception of equicontinuity for family of functions that we learned
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationOn bisectors in Minkowski normed space.
On bisectors in Minkowski normed space. Á.G.Horváth Department of Geometry, Technical University of Budapest, H-1521 Budapest, Hungary November 6, 1997 Abstract In this paper we discuss the concept of
More informationLecture 2: Minimax theorem, Impagliazzo Hard Core Lemma
Lecture 2: Minimax theorem, Impagliazzo Hard Core Lemma Topics in Pseudorandomness and Complexity Theory (Spring 207) Rutgers University Swastik Kopparty Scribe: Cole Franks Zero-sum games are two player
More informationReminder Notes for the Course on Measures on Topological Spaces
Reminder Notes for the Course on Measures on Topological Spaces T. C. Dorlas Dublin Institute for Advanced Studies School of Theoretical Physics 10 Burlington Road, Dublin 4, Ireland. Email: dorlas@stp.dias.ie
More informationDeciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point Gérard Cornuéjols 1 and Yanjun Li 2 1 Tepper School of Business, Carnegie Mellon
More informationAppendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS
Appendix PRELIMINARIES 1. THEOREMS OF ALTERNATIVES FOR SYSTEMS OF LINEAR CONSTRAINTS Here we consider systems of linear constraints, consisting of equations or inequalities or both. A feasible solution
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationCharacterizing Ideal Weighted Threshold Secret Sharing
Characterizing Ideal Weighted Threshold Secret Sharing Amos Beimel Tamir Tassa Enav Weinreb August 12, 2004 Abstract Weighted threshold secret sharing was introduced by Shamir in his seminal work on secret
More informationMath 203, Solution Set 4.
Math 203, Solution Set 4. Problem 1. Let V be a finite dimensional vector space and let ω Λ 2 V be such that ω ω = 0. Show that ω = v w for some vectors v, w V. Answer: It is clear that if ω = v w then
More informationSANDWICH GAMES. July 9, 2014
SANDWICH GAMES EHUD LEHRER AND ROEE TEPER July 9, 204 Abstract. The extension of set functions (or capacities) in a concave fashion, namely a concavification, is an important issue in decision theory and
More informationTHE AUTOMORPHISM GROUP ON THE RIEMANN SPHERE
THE AUTOMORPHISM GROUP ON THE RIEMANN SPHERE YONG JAE KIM Abstract. In order to study the geometries of a hyperbolic plane, it is necessary to understand the set of transformations that map from the space
More informationEllipsoidal Mixed-Integer Representability
Ellipsoidal Mixed-Integer Representability Alberto Del Pia Jeff Poskin September 15, 2017 Abstract Representability results for mixed-integer linear systems play a fundamental role in optimization since
More informationLecture 8: Equivalence Relations
Lecture 8: Equivalence Relations 1 Equivalence Relations Next interesting relation we will study is equivalence relation. Definition 1.1 (Equivalence Relation). Let A be a set and let be a relation on
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More information