- Used Books
- Staff Picks
- Gifts & Gift Cards
- Sell Books
- Stores & Events
- Let's Talk Books
Special Offers see all
More at Powell's
Recently Viewed clear list
Ships in 1 to 3 days
Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex Worldby Leslie Valiant
Synopses & Reviews
In Probably Approximately Correct, computer scientist Leslie Valiant proposes a revolutionary algorithm-based theory to describe how life evolves and learns. He begins by describing two, seemingly different, kinds of algorithms for handling and storing information about the world. One is the algorithm we call evolution by natural selection, which extracts and stores information that enables an organisms descendants to survive. The other is what we call learning, which enables us to extract and store information so that we can survive. While they may appear distinct, Valiant argues that they are not—rather, they are both manifestations of the same algorithm, which he calls probably approximately correct.” The goal of life and of learning, he says, is not perfection, but just enough to get by. And when we apply that insight to our own algorithms—those we develop to run on computers—we get a new and more powerful way to think about one of computer sciences hottest trends: machine learning, evolutionary computing, or genetic algorithms, to use three terms that more or less describe the same thing. Valiant argues that the three decades effort to recapitulate lifes evolution on a computer has failed because those designing the algorithms have neglected to take proper account of the probably approximately correct” model of how evolution works. Valiant offers here both a powerful take-down of the present state of evolutionary computing and a new, better path to powerful learning machines.
A startlingly original synthesis by one of computer sciences greatest minds, Probably Approximately Correct has profound implications for how we think about behavior, cognition, and ultimately the two most important questions of all: the possibilities and limits of human intelligence and of biological evolution.
"Turing Award — winning computer scientist and Harvard professor Valiant introduces readers to 'ecorithms,' his term for formalized trial-and-error approaches to problem solving that provide valuable insight into everything from evolution to artificial intelligence. His concept — a portmanteau of 'eco-' and 'algorithm' — is modeled on the coping mechanisms and adaptations life forms use to survive and thrive. By codifying these processes to be applicable to any environment, Valiant says, researchers can create a 'probably approximately correct' (PAC) model for learning that links Darwin's theory of evolution with problems at the heart of computer science. He grounds his hypotheses in solid computational theory, drawing on Alan Turing's pioneering work on 'robust' problem-solving and algorithm design, and in successive chapters he demonstrates how ecorithms can depict evolution as a search for optimized performance, as well as help computer scientists create machine intelligence. While Valiant's basic idea may seem obvious to many readers, his book offers a broad look at how ecorithms may be applied successfully to a variety of challenging problems. 17 b&w figures & glossary. (June)" Publishers Weekly Copyright PWxyz, LLC. All rights reserved.
From a leading computer scientist, a unifying theory that will revolutionize our understanding of how life evolves and learns.
How does life prosper in a complex and erratic world? While we know that nature follows patterns—such as the law of gravity—our everyday lives are beyond what known science can predict. We nevertheless muddle through even in the absence of theories of how to act. But how do we do it?
In Probably Approximately Correct, computer scientist Leslie Valiant presents a masterful synthesis of learning and evolution to show how both individually and collectively we not only survive, but prosper in a world as complex as our own. The key is probably approximately correct” algorithms, a concept Valiant developed to explain how effective behavior can be learned. The model shows that pragmatically coping with a problem can provide a satisfactory solution in the absence of any theory of the problem. After all, finding a mate does not require a theory of mating. Valiants theory reveals the shared computational nature of evolution and learning, and sheds light on perennial questions such as nature versus nurture and the limits of artificial intelligence.
Offering a powerful and elegant model that encompasses lifes complexity, Probably Approximately Correct has profound implications for how we think about behavior, cognition, biological evolution, and the possibilities and limits of human and machine intelligence.
We have effective theories for very few things. Gravity is one, electromagnetism another. But for most things—whether as basic as finding a mate or as complex as managing an economy—our theories are weak or nonexistent. Fortunately, we dont need them, any more than a fish needs a theory of water to swim; we muddle through. But how do we do it? In Probably Approximately Correct, computer scientist Leslie Valiant presents a theory of the theoryless. The key is probably approximately correct” learning, Valiants model of how effective behavior can be learned even in a world as complex as our own. This model reveals the shared computational nature of evolution and learning, shows how computers might possess authentic intelligence, and sheds some light on human nature, shaped as it has been by evolution and adaptation. Valiant also shows why pragmatically coping with a problem can provide a satisfactory solution in the absence of any theory—after all, finding a mate is a lot more satisfying than finding a theory of mating.
Offering an elegant, powerful model that encompasses all of lifes complexity, Probably Approximately Correct will revolutionize the way we look at the universes greatest mysteries.
About the Author
Leslie Valiant is the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. He is a Fellow of the Royal Society and a member of the National Academy of Sciences. He is a winner of the Nevanlinna Prize from the International Mathematical Union, and the Turing Award, known as the Nobel of computing.
What Our Readers Are Saying
Other books you might like
Computers and Internet » Artificial Intelligence » General