An algorithm that improves pattern recognition

An algorithm that improves pattern recognition
Bookmark and Share

Optimization algorithms, which try to find the minimum values of mathematical functions, are everywhere in engineering. Among other things, they’re used to evaluate design tradeoffs, to assess control systems, and to find patterns in data.

One way to solve a difficult optimization problem is to first reduce it to a related but much simpler problem, then gradually add complexity back in, solving each new problem in turn and using its solution as a guide to solving the next one. This approach seems to work well in practice, but it’s never been characterized theoretically.

This month two CSAIL researchers describe a way to generate that sequence of simplified functions that guarantees the best approximation that the method can offer.

“There are some fundamental questions about this method that we answer for the first time,” says Hossein Mobahi, a CSAIL postdoc who co-wrote the paper with senior research scientist John Fisher.

“For example, I told you that you start from a simple problem, but I didn’t tell you how you choose that simple problem. There are infinitely many functions you can start with. Which one is good? Even if I tell you what function to start with, there are infinitely many ways to transform that to your actual problem. And that transformation affects what you get at the end.”

Read more at MIT News: