Author: Panagiote Ligouras
Publisher:
ISBN: 9788893551038
Category : Mathematics
Languages : en
Pages : 352
Book Description
888 Geometric Inequalities. From and for Mathematical Olympiads
Author: Panagiote Ligouras
Publisher:
ISBN: 9788893551038
Category : Mathematics
Languages : en
Pages : 352
Book Description
Publisher:
ISBN: 9788893551038
Category : Mathematics
Languages : en
Pages : 352
Book Description
Problem-Solving and Selected Topics in Euclidean Geometry
Author: Sotirios E. Louridas
Publisher: Springer Science & Business Media
ISBN: 1461472733
Category : Mathematics
Languages : en
Pages : 238
Book Description
"Problem-Solving and Selected Topics in Euclidean Geometry: in the Spirit of the Mathematical Olympiads" contains theorems which are of particular value for the solution of geometrical problems. Emphasis is given in the discussion of a variety of methods, which play a significant role for the solution of problems in Euclidean Geometry. Before the complete solution of every problem, a key idea is presented so that the reader will be able to provide the solution. Applications of the basic geometrical methods which include analysis, synthesis, construction and proof are given. Selected problems which have been given in mathematical olympiads or proposed in short lists in IMO's are discussed. In addition, a number of problems proposed by leading mathematicians in the subject are included here. The book also contains new problems with their solutions. The scope of the publication of the present book is to teach mathematical thinking through Geometry and to provide inspiration for both students and teachers to formulate "positive" conjectures and provide solutions.
Publisher: Springer Science & Business Media
ISBN: 1461472733
Category : Mathematics
Languages : en
Pages : 238
Book Description
"Problem-Solving and Selected Topics in Euclidean Geometry: in the Spirit of the Mathematical Olympiads" contains theorems which are of particular value for the solution of geometrical problems. Emphasis is given in the discussion of a variety of methods, which play a significant role for the solution of problems in Euclidean Geometry. Before the complete solution of every problem, a key idea is presented so that the reader will be able to provide the solution. Applications of the basic geometrical methods which include analysis, synthesis, construction and proof are given. Selected problems which have been given in mathematical olympiads or proposed in short lists in IMO's are discussed. In addition, a number of problems proposed by leading mathematicians in the subject are included here. The book also contains new problems with their solutions. The scope of the publication of the present book is to teach mathematical thinking through Geometry and to provide inspiration for both students and teachers to formulate "positive" conjectures and provide solutions.
Sequences And Mathematical Induction:in Mathematical Olympiad And Competitions (2nd Edition)
Author: Zhi-gang Feng
Publisher: World Scientific
ISBN: 9811211051
Category : Mathematics
Languages : en
Pages : 224
Book Description
In China, lots of excellent maths students takes an active part in various maths contests and the best six senior high school students will be selected to form the IMO National Team to compete in the International Mathematical Olympiad. In the past ten years, China's IMO Team has achieved outstanding results — they have won the first place almost every year.The author is one of the senior coaches of China's IMO National Team, he is the headmaster of Shanghai senior high school which is one of the best high schools of China. In the past decade, the students of this school have won the IMO gold medals almost every year.The author attempts to use some common characteristics of sequence and mathematical induction to fundamentally connect Math Olympiad problems to particular branches of mathematics. In doing so, the author hopes to reveal the beauty and joy involved with math exploration and at the same time, attempts to arouse readers' interest of learning math and invigorate their courage to challenge themselves with difficult problems.
Publisher: World Scientific
ISBN: 9811211051
Category : Mathematics
Languages : en
Pages : 224
Book Description
In China, lots of excellent maths students takes an active part in various maths contests and the best six senior high school students will be selected to form the IMO National Team to compete in the International Mathematical Olympiad. In the past ten years, China's IMO Team has achieved outstanding results — they have won the first place almost every year.The author is one of the senior coaches of China's IMO National Team, he is the headmaster of Shanghai senior high school which is one of the best high schools of China. In the past decade, the students of this school have won the IMO gold medals almost every year.The author attempts to use some common characteristics of sequence and mathematical induction to fundamentally connect Math Olympiad problems to particular branches of mathematics. In doing so, the author hopes to reveal the beauty and joy involved with math exploration and at the same time, attempts to arouse readers' interest of learning math and invigorate their courage to challenge themselves with difficult problems.
Algebraic Inequalities
Author: Hayk Sedrakyan
Publisher: Springer
ISBN: 3319778366
Category : Mathematics
Languages : en
Pages : 244
Book Description
This unique collection of new and classical problems provides full coverage of algebraic inequalities. Many of the exercises are presented with detailed author-prepared-solutions, developing creativity and an arsenal of new approaches for solving mathematical problems. Algebraic Inequalities can be considered a continuation of the book Geometric Inequalities: Methods of Proving by the authors. This book can serve teachers, high-school students, and mathematical competitors. It may also be used as supplemental reading, providing readers with new and classical methods for proving algebraic inequalities.
Publisher: Springer
ISBN: 3319778366
Category : Mathematics
Languages : en
Pages : 244
Book Description
This unique collection of new and classical problems provides full coverage of algebraic inequalities. Many of the exercises are presented with detailed author-prepared-solutions, developing creativity and an arsenal of new approaches for solving mathematical problems. Algebraic Inequalities can be considered a continuation of the book Geometric Inequalities: Methods of Proving by the authors. This book can serve teachers, high-school students, and mathematical competitors. It may also be used as supplemental reading, providing readers with new and classical methods for proving algebraic inequalities.
Lecture Notes on Mathematical Olympiad Courses
Author: Jiagu Xu
Publisher: World Scientific
ISBN: 9814293563
Category : Mathematics
Languages : en
Pages : 183
Book Description
Olympiad mathematics is not a collection of techniques of solving mathematical problems but a system for advancing mathematical education. This book is based on the lecture notes of the mathematical Olympiad training courses conducted by the author in Singapore. Its scope and depth not only covers and exceeds the usual syllabus, but introduces a variety concepts and methods in modern mathematics. In each lecture, the concepts, theories and methods are taken as the core. The examples are served to explain and enrich their intension and to indicate their applications. Besides, appropriate number of test questions is available for reader''s practice and testing purpose. Their detailed solutions are also conveniently provided. The examples are not very complicated so that readers can easily understand. There are many real competition questions included which students can use to verify their abilities. These test questions are from many countries, e.g. China, Russia, USA, Singapore, etc. In particular, the reader can find many questions from China, if he is interested in understanding mathematical Olympiad in China. This book serves as a useful textbook of mathematical Olympiad courses, or as a reference book for related teachers and researchers. Errata(s). Errata. Sample Chapter(s). Lecture 1: Operations on Rational Numbers (145k). Request Inspection Copy. Contents: .: Operations on Rational Numbers; Linear Equations of Single Variable; Multiplication Formulae; Absolute Value and Its Applications; Congruence of Triangles; Similarity of Triangles; Divisions of Polynomials; Solutions to Testing Questions; and other chapters. Readership: Mathematics students, school teachers, college lecturers, university professors; mathematics enthusiasts
Publisher: World Scientific
ISBN: 9814293563
Category : Mathematics
Languages : en
Pages : 183
Book Description
Olympiad mathematics is not a collection of techniques of solving mathematical problems but a system for advancing mathematical education. This book is based on the lecture notes of the mathematical Olympiad training courses conducted by the author in Singapore. Its scope and depth not only covers and exceeds the usual syllabus, but introduces a variety concepts and methods in modern mathematics. In each lecture, the concepts, theories and methods are taken as the core. The examples are served to explain and enrich their intension and to indicate their applications. Besides, appropriate number of test questions is available for reader''s practice and testing purpose. Their detailed solutions are also conveniently provided. The examples are not very complicated so that readers can easily understand. There are many real competition questions included which students can use to verify their abilities. These test questions are from many countries, e.g. China, Russia, USA, Singapore, etc. In particular, the reader can find many questions from China, if he is interested in understanding mathematical Olympiad in China. This book serves as a useful textbook of mathematical Olympiad courses, or as a reference book for related teachers and researchers. Errata(s). Errata. Sample Chapter(s). Lecture 1: Operations on Rational Numbers (145k). Request Inspection Copy. Contents: .: Operations on Rational Numbers; Linear Equations of Single Variable; Multiplication Formulae; Absolute Value and Its Applications; Congruence of Triangles; Similarity of Triangles; Divisions of Polynomials; Solutions to Testing Questions; and other chapters. Readership: Mathematics students, school teachers, college lecturers, university professors; mathematics enthusiasts
Solving Problems in Geometry
Author: Kim Hoo Hang
Publisher: World Scientific Publishing Company
ISBN: 9789814583749
Category : Mathematics
Languages : en
Pages : 250
Book Description
This new volume of the Mathematical Olympiad Series focuses on the topic of geometry. Basic and advanced theorems commonly seen in Mathematical Olympiad are introduced and illustrated with plenty of examples. Special techniques in solving various types of geometrical problems are also introduced, while the authors elaborate extensively on how to acquire an insight and develop strategies in tackling difficult geometrical problems. This book is suitable for any reader with elementary geometrical knowledge at the lower secondary level. Each chapter includes sufficient scaffolding and is comprehensive enough for the purpose of self-study. Readers who complete the chapters on the basic theorems and techniques would acquire a good foundation in geometry and may attempt to solve many geometrical problems in various mathematical competitions. Meanwhile, experienced contestants in Mathematical Olympiad competitions will find a large collection of problems pitched at competitions at the international level, with opportunities to practise and sharpen their problem-solving skills in geometry.
Publisher: World Scientific Publishing Company
ISBN: 9789814583749
Category : Mathematics
Languages : en
Pages : 250
Book Description
This new volume of the Mathematical Olympiad Series focuses on the topic of geometry. Basic and advanced theorems commonly seen in Mathematical Olympiad are introduced and illustrated with plenty of examples. Special techniques in solving various types of geometrical problems are also introduced, while the authors elaborate extensively on how to acquire an insight and develop strategies in tackling difficult geometrical problems. This book is suitable for any reader with elementary geometrical knowledge at the lower secondary level. Each chapter includes sufficient scaffolding and is comprehensive enough for the purpose of self-study. Readers who complete the chapters on the basic theorems and techniques would acquire a good foundation in geometry and may attempt to solve many geometrical problems in various mathematical competitions. Meanwhile, experienced contestants in Mathematical Olympiad competitions will find a large collection of problems pitched at competitions at the international level, with opportunities to practise and sharpen their problem-solving skills in geometry.
Convex Optimization & Euclidean Distance Geometry
Author: Jon Dattorro
Publisher: Meboo Publishing USA
ISBN: 0976401304
Category : Mathematics
Languages : en
Pages : 776
Book Description
The study of Euclidean distance matrices (EDMs) fundamentally asks what can be known geometrically given onlydistance information between points in Euclidean space. Each point may represent simply locationor, abstractly, any entity expressible as a vector in finite-dimensional Euclidean space.The answer to the question posed is that very much can be known about the points;the mathematics of this combined study of geometry and optimization is rich and deep.Throughout we cite beacons of historical accomplishment.The application of EDMs has already proven invaluable in discerning biological molecular conformation.The emerging practice of localization in wireless sensor networks, the global positioning system (GPS), and distance-based pattern recognitionwill certainly simplify and benefit from this theory.We study the pervasive convex Euclidean bodies and their various representations.In particular, we make convex polyhedra, cones, and dual cones more visceral through illustration, andwe study the geometric relation of polyhedral cones to nonorthogonal bases biorthogonal expansion.We explain conversion between halfspace- and vertex-descriptions of convex cones,we provide formulae for determining dual cones,and we show how classic alternative systems of linear inequalities or linear matrix inequalities and optimality conditions can be explained by generalized inequalities in terms of convex cones and their duals.The conic analogue to linear independence, called conic independence, is introducedas a new tool in the study of classical cone theory; the logical next step in the progression:linear, affine, conic.Any convex optimization problem has geometric interpretation.This is a powerful attraction: the ability to visualize geometry of an optimization problem.We provide tools to make visualization easier.The concept of faces, extreme points, and extreme directions of convex Euclidean bodiesis explained here, crucial to understanding convex optimization.The convex cone of positive semidefinite matrices, in particular, is studied in depth.We mathematically interpret, for example,its inverse image under affine transformation, and we explainhow higher-rank subsets of its boundary united with its interior are convex.The Chapter on "Geometry of convex functions",observes analogies between convex sets and functions:The set of all vector-valued convex functions is a closed convex cone.Included among the examples in this chapter, we show how the real affinefunction relates to convex functions as the hyperplane relates to convex sets.Here, also, pertinent results formultidimensional convex functions are presented that are largely ignored in the literature;tricks and tips for determining their convexityand discerning their geometry, particularly with regard to matrix calculus which remains largely unsystematizedwhen compared with the traditional practice of ordinary calculus.Consequently, we collect some results of matrix differentiation in the appendices.The Euclidean distance matrix (EDM) is studied,its properties and relationship to both positive semidefinite and Gram matrices.We relate the EDM to the four classical axioms of the Euclidean metric;thereby, observing the existence of an infinity of axioms of the Euclidean metric beyondthe triangle inequality. We proceed byderiving the fifth Euclidean axiom and then explain why furthering this endeavoris inefficient because the ensuing criteria (while describing polyhedra)grow linearly in complexity and number.Some geometrical problems solvable via EDMs,EDM problems posed as convex optimization, and methods of solution arepresented;\eg, we generate a recognizable isotonic map of the United States usingonly comparative distance information (no distance information, only distance inequalities).We offer a new proof of the classic Schoenberg criterion, that determines whether a candidate matrix is an EDM. Our proofrelies on fundamental geometry; assuming, any EDM must correspond to a list of points contained in some polyhedron(possibly at its vertices) and vice versa.It is not widely known that the Schoenberg criterion implies nonnegativity of the EDM entries; proved here.We characterize the eigenvalues of an EDM matrix and then devisea polyhedral cone required for determining membership of a candidate matrix(in Cayley-Menger form) to the convex cone of Euclidean distance matrices (EDM cone); \ie,a candidate is an EDM if and only if its eigenspectrum belongs to a spectral cone for EDM^N.We will see spectral cones are not unique.In the chapter "EDM cone", we explain the geometric relationship betweenthe EDM cone, two positive semidefinite cones, and the elliptope.We illustrate geometric requirements, in particular, for projection of a candidate matrixon a positive semidefinite cone that establish its membership to the EDM cone. The faces of the EDM cone are described,but still open is the question whether all its faces are exposed as they are for the positive semidefinite cone.The classic Schoenberg criterion, relating EDM and positive semidefinite cones, isrevealed to be a discretized membership relation (a generalized inequality, a new Farkas''''''''-like lemma)between the EDM cone and its ordinary dual. A matrix criterion for membership to the dual EDM cone is derived thatis simpler than the Schoenberg criterion.We derive a new concise expression for the EDM cone and its dual involvingtwo subspaces and a positive semidefinite cone."Semidefinite programming" is reviewedwith particular attention to optimality conditionsof prototypical primal and dual conic programs,their interplay, and the perturbation method of rank reduction of optimal solutions(extant but not well-known).We show how to solve a ubiquitous platonic combinatorial optimization problem from linear algebra(the optimal Boolean solution x to Ax=b)via semidefinite program relaxation.A three-dimensional polyhedral analogue for the positive semidefinite cone of 3X3 symmetricmatrices is introduced; a tool for visualizing in 6 dimensions.In "EDM proximity"we explore methods of solution to a few fundamental and prevalentEuclidean distance matrix proximity problems; the problem of finding that Euclidean distance matrix closestto a given matrix in the Euclidean sense.We pay particular attention to the problem when compounded with rank minimization.We offer a new geometrical proof of a famous result discovered by Eckart \& Young in 1936 regarding Euclideanprojection of a point on a subset of the positive semidefinite cone comprising all positive semidefinite matriceshaving rank not exceeding a prescribed limit rho.We explain how this problem is transformed to a convex optimization for any rank rho.
Publisher: Meboo Publishing USA
ISBN: 0976401304
Category : Mathematics
Languages : en
Pages : 776
Book Description
The study of Euclidean distance matrices (EDMs) fundamentally asks what can be known geometrically given onlydistance information between points in Euclidean space. Each point may represent simply locationor, abstractly, any entity expressible as a vector in finite-dimensional Euclidean space.The answer to the question posed is that very much can be known about the points;the mathematics of this combined study of geometry and optimization is rich and deep.Throughout we cite beacons of historical accomplishment.The application of EDMs has already proven invaluable in discerning biological molecular conformation.The emerging practice of localization in wireless sensor networks, the global positioning system (GPS), and distance-based pattern recognitionwill certainly simplify and benefit from this theory.We study the pervasive convex Euclidean bodies and their various representations.In particular, we make convex polyhedra, cones, and dual cones more visceral through illustration, andwe study the geometric relation of polyhedral cones to nonorthogonal bases biorthogonal expansion.We explain conversion between halfspace- and vertex-descriptions of convex cones,we provide formulae for determining dual cones,and we show how classic alternative systems of linear inequalities or linear matrix inequalities and optimality conditions can be explained by generalized inequalities in terms of convex cones and their duals.The conic analogue to linear independence, called conic independence, is introducedas a new tool in the study of classical cone theory; the logical next step in the progression:linear, affine, conic.Any convex optimization problem has geometric interpretation.This is a powerful attraction: the ability to visualize geometry of an optimization problem.We provide tools to make visualization easier.The concept of faces, extreme points, and extreme directions of convex Euclidean bodiesis explained here, crucial to understanding convex optimization.The convex cone of positive semidefinite matrices, in particular, is studied in depth.We mathematically interpret, for example,its inverse image under affine transformation, and we explainhow higher-rank subsets of its boundary united with its interior are convex.The Chapter on "Geometry of convex functions",observes analogies between convex sets and functions:The set of all vector-valued convex functions is a closed convex cone.Included among the examples in this chapter, we show how the real affinefunction relates to convex functions as the hyperplane relates to convex sets.Here, also, pertinent results formultidimensional convex functions are presented that are largely ignored in the literature;tricks and tips for determining their convexityand discerning their geometry, particularly with regard to matrix calculus which remains largely unsystematizedwhen compared with the traditional practice of ordinary calculus.Consequently, we collect some results of matrix differentiation in the appendices.The Euclidean distance matrix (EDM) is studied,its properties and relationship to both positive semidefinite and Gram matrices.We relate the EDM to the four classical axioms of the Euclidean metric;thereby, observing the existence of an infinity of axioms of the Euclidean metric beyondthe triangle inequality. We proceed byderiving the fifth Euclidean axiom and then explain why furthering this endeavoris inefficient because the ensuing criteria (while describing polyhedra)grow linearly in complexity and number.Some geometrical problems solvable via EDMs,EDM problems posed as convex optimization, and methods of solution arepresented;\eg, we generate a recognizable isotonic map of the United States usingonly comparative distance information (no distance information, only distance inequalities).We offer a new proof of the classic Schoenberg criterion, that determines whether a candidate matrix is an EDM. Our proofrelies on fundamental geometry; assuming, any EDM must correspond to a list of points contained in some polyhedron(possibly at its vertices) and vice versa.It is not widely known that the Schoenberg criterion implies nonnegativity of the EDM entries; proved here.We characterize the eigenvalues of an EDM matrix and then devisea polyhedral cone required for determining membership of a candidate matrix(in Cayley-Menger form) to the convex cone of Euclidean distance matrices (EDM cone); \ie,a candidate is an EDM if and only if its eigenspectrum belongs to a spectral cone for EDM^N.We will see spectral cones are not unique.In the chapter "EDM cone", we explain the geometric relationship betweenthe EDM cone, two positive semidefinite cones, and the elliptope.We illustrate geometric requirements, in particular, for projection of a candidate matrixon a positive semidefinite cone that establish its membership to the EDM cone. The faces of the EDM cone are described,but still open is the question whether all its faces are exposed as they are for the positive semidefinite cone.The classic Schoenberg criterion, relating EDM and positive semidefinite cones, isrevealed to be a discretized membership relation (a generalized inequality, a new Farkas''''''''-like lemma)between the EDM cone and its ordinary dual. A matrix criterion for membership to the dual EDM cone is derived thatis simpler than the Schoenberg criterion.We derive a new concise expression for the EDM cone and its dual involvingtwo subspaces and a positive semidefinite cone."Semidefinite programming" is reviewedwith particular attention to optimality conditionsof prototypical primal and dual conic programs,their interplay, and the perturbation method of rank reduction of optimal solutions(extant but not well-known).We show how to solve a ubiquitous platonic combinatorial optimization problem from linear algebra(the optimal Boolean solution x to Ax=b)via semidefinite program relaxation.A three-dimensional polyhedral analogue for the positive semidefinite cone of 3X3 symmetricmatrices is introduced; a tool for visualizing in 6 dimensions.In "EDM proximity"we explore methods of solution to a few fundamental and prevalentEuclidean distance matrix proximity problems; the problem of finding that Euclidean distance matrix closestto a given matrix in the Euclidean sense.We pay particular attention to the problem when compounded with rank minimization.We offer a new geometrical proof of a famous result discovered by Eckart \& Young in 1936 regarding Euclideanprojection of a point on a subset of the positive semidefinite cone comprising all positive semidefinite matriceshaving rank not exceeding a prescribed limit rho.We explain how this problem is transformed to a convex optimization for any rank rho.
Geometric Inequalities
Author: Hayk Sedrakyan
Publisher: Springer
ISBN: 3319550802
Category : Mathematics
Languages : en
Pages : 454
Book Description
This unique collection of new and classical problems provides full coverage of geometric inequalities. Many of the 1,000 exercises are presented with detailed author-prepared-solutions, developing creativity and an arsenal of new approaches for solving mathematical problems. This book can serve teachers, high-school students, and mathematical competitors. It may also be used as supplemental reading, providing readers with new and classical methods for proving geometric inequalities.
Publisher: Springer
ISBN: 3319550802
Category : Mathematics
Languages : en
Pages : 454
Book Description
This unique collection of new and classical problems provides full coverage of geometric inequalities. Many of the 1,000 exercises are presented with detailed author-prepared-solutions, developing creativity and an arsenal of new approaches for solving mathematical problems. This book can serve teachers, high-school students, and mathematical competitors. It may also be used as supplemental reading, providing readers with new and classical methods for proving geometric inequalities.
Lecture Notes On Mathematical Olympiad Courses: For Senior Section - Volume 2
Author: Jiagu Xu
Publisher: World Scientific Publishing Company
ISBN: 9813100583
Category : Mathematics
Languages : en
Pages : 297
Book Description
Olympiad mathematics is not a collection of techniques of solving mathematical problems but a system for advancing mathematical education. This book is based on the lecture notes of the mathematical Olympiad training courses conducted by the author in Singapore. Its scope and depth not only covers and beyond the usual syllabus, but introduces a variety of concepts and methods in modern mathematics as well.In each lecture, the concepts, theories and methods are taken as the core. The examples serve to explain and enrich their intentions and to indicate their applications. Besides, appropriate number of test questions is available for the readers' practice and testing purpose. Their detailed solutions are also conveniently provided.The examples are not very complicated so readers can easily understand. There are many real competition questions included which students can use to verify their abilities. These test questions originate from many countries all over the world. This book will serve as a useful textbook of mathematical Olympiad courses, a self-study lecture notes for students, or as a reference book for related teachers and researchers.
Publisher: World Scientific Publishing Company
ISBN: 9813100583
Category : Mathematics
Languages : en
Pages : 297
Book Description
Olympiad mathematics is not a collection of techniques of solving mathematical problems but a system for advancing mathematical education. This book is based on the lecture notes of the mathematical Olympiad training courses conducted by the author in Singapore. Its scope and depth not only covers and beyond the usual syllabus, but introduces a variety of concepts and methods in modern mathematics as well.In each lecture, the concepts, theories and methods are taken as the core. The examples serve to explain and enrich their intentions and to indicate their applications. Besides, appropriate number of test questions is available for the readers' practice and testing purpose. Their detailed solutions are also conveniently provided.The examples are not very complicated so readers can easily understand. There are many real competition questions included which students can use to verify their abilities. These test questions originate from many countries all over the world. This book will serve as a useful textbook of mathematical Olympiad courses, a self-study lecture notes for students, or as a reference book for related teachers and researchers.
Microprediction
Author: Peter Cotton
Publisher: MIT Press
ISBN: 0262047322
Category : Computers
Languages : en
Pages : 233
Book Description
How a web-scale network of autonomous micromanagers can challenge the AI revolution and combat the high cost of quantitative business optimization. The artificial intelligence (AI) revolution is leaving behind small businesses and organizations that cannot afford in-house teams of data scientists. In Microprediction, Peter Cotton examines the repeated quantitative tasks that drive business optimization from the perspectives of economics, statistics, decision making under uncertainty, and privacy concerns. He asks what things currently described as AI are not “microprediction,” whether microprediction is an individual or collective activity, and how we can produce and distribute high-quality microprediction at low cost. The world is missing a public utility, he concludes, while companies are missing an important strategic approach that would enable them to benefit—and also give back. In an engaging, colloquial style, Cotton argues that market-inspired “superminds” are likely to be very effective compared with other orchestration mechanisms in the domain of microprediction. He presents an ambitious yet practical alternative to the expensive “artisan” data science that currently drains money from firms. Challenging the machine learning revolution and exposing a contradiction at its heart, he offers engineers a new liberty: no longer reliant on quantitative experts, they are free to create intelligent applications using general-purpose application programming interfaces (APIs) and libraries. He describes work underway to encourage this approach, one that he says might someday prove to be as valuable to businesses—and society at large—as the internet.
Publisher: MIT Press
ISBN: 0262047322
Category : Computers
Languages : en
Pages : 233
Book Description
How a web-scale network of autonomous micromanagers can challenge the AI revolution and combat the high cost of quantitative business optimization. The artificial intelligence (AI) revolution is leaving behind small businesses and organizations that cannot afford in-house teams of data scientists. In Microprediction, Peter Cotton examines the repeated quantitative tasks that drive business optimization from the perspectives of economics, statistics, decision making under uncertainty, and privacy concerns. He asks what things currently described as AI are not “microprediction,” whether microprediction is an individual or collective activity, and how we can produce and distribute high-quality microprediction at low cost. The world is missing a public utility, he concludes, while companies are missing an important strategic approach that would enable them to benefit—and also give back. In an engaging, colloquial style, Cotton argues that market-inspired “superminds” are likely to be very effective compared with other orchestration mechanisms in the domain of microprediction. He presents an ambitious yet practical alternative to the expensive “artisan” data science that currently drains money from firms. Challenging the machine learning revolution and exposing a contradiction at its heart, he offers engineers a new liberty: no longer reliant on quantitative experts, they are free to create intelligent applications using general-purpose application programming interfaces (APIs) and libraries. He describes work underway to encourage this approach, one that he says might someday prove to be as valuable to businesses—and society at large—as the internet.