Every day, your brain completes millions of complicated functions without you even being aware of them, and it learns as it goes.
Teaching a machine to do the same thing is extremely complicated, but it has gotten a little easier thanks to the work of University of California, Merced, Professor Miguel Carreira-Perpiñan.
A faculty member in the School of Engineering, Carreira-Perpiñan recently won a prestigious, competitive Google Faculty Research Award and a grant from the National Science Foundation (NSF) to pursue an algorithm he’s designed to help machines conduct highly complicated processes faster, easier and more efficiently — more like the human brain does.
“Professor Carreira-Perpiñán’s work is crucial given the increasing amount of data available to any person any time, for example via the Internet,” interim School of Engineering Dean Erik Rolland said. “If we want to be able to find any useful information in such mountains of data, we need smart, new methodologies to help us. This is the crux of his work.”
Advances in computation abilities through less expensive, more efficient processors, plus the generation of big data, has more people trying to figure out how to conduct sophisticated, large-scale analyses that can have applications in science, engineering and social sciences.
But there are limits on how small and powerful processors can be before the work they do has to be shared out among parallel processors, or in cloud computing. That makes optimizing complicated sequences of nested mathematical functions — layers of functions within functions — even more challenging.
Carreira-Perpiñán has devised an algorithm that intersects applied math, statistics and computer science. It considers each of a mathematical function’s layers on its own, but also coordinates all the functions so they work together to get the desired outcome, whether it’s recognizing objects, recognizing speech and faces, helping self-driving cars, predicting the properties of materials or forecasting the stock market.
For example, the algorithm makes it possible for a computer to look at a picture you’ve taken of Yosemite National Park and, by computing progressively more abstract features such as edges, corners or object parts layer by layer, categorize the objects in the image such as mountains, trees or people — information your brain would come up with before you’ve even had time to snap that picture.
“Each of the steps in itself is relatively simple. It’s getting a machine to optimize many different steps at once that’s the challenge, because the resulting system is nonlinear, nonconvex and often nondifferentiable,” Carreira-Perpiñán said. “An algorithm that coordinates them all, and parallelizes them efficiently, while guaranteeing it can find a local optimum — that’s new.”
This is the second Google award given to a UC Merced faculty member, and Carreira-Perpiñán’s work is directly related to the many complex functions being performed at the company every day.
Carreira-Perpiñán’s work also earned him a Notable Paper award at the 2014 International Conference on Artificial Intelligence and Statistics, one of the leading conferences in machine learning. He wrote the paper “Distributed Optimization of Deeply Nested Systems” with then-Ph.D. student Weiran Wang, who’s now a postdoctoral scholar at the Toyota Technological Institute at Chicago.
The $60,000 from Google — one of 105 awards given out of 550 applicants from all over the world — and the $450,000 from NSF will help Carreira-Perpiñán and his four current and past Ph.D. students (Mehdi Alizadeh, Ramin Raziperchikolaei, Max Vladymyrov and Wang) continue with their work on the algorithm.
The work is directly related to artificial intelligence, which has seen interest surge again as developments like this offer significant advancements.
“It’s something people have been grappling with for some time,” Carreira-Perpiñán said. “We don’t know how the brain works, but this enables us to solve some of the same functions it does.”
Senior Writer and Public Information Representative
Office: (209) 228-4406
Mobile: (209) 201-6255