Algorithm may be applied to a broad range of complicated problems.
To work with computational models is to work in a world of unknowns: Models that simulate complex physical processes — from Earth’s changing climate to the performance of hypersonic combustion engines — are staggeringly complex, sometimes incorporating hundreds of parameters, each of which describes a piece of the larger process.
Parameters are often question marks within their models, their contributions to the whole largely unknown. To estimate the value of each unknown parameter requires plugging in hundreds, if not thousands, of values, and running the model each time to narrow in on an accurate value — a computation that can take days, and sometimes weeks.
Now MIT researchers have developed a new algorithm that vastly reduces the computation of virtually any computational model. The algorithm may be thought of as a shrinking bull’s-eye that, over several runs of a model, and in combination with some relevant data points, incrementally narrows in on its target: a probability distribution of values for each unknown parameter.
With this method, the researchers were able to arrive at the same answer as a classic computational approaches, but 200 times faster.
Youssef Marzouk, an associate professor of aeronautics and astronautics, says the algorithm is versatile enough to apply to a wide range of computationally intensive problems.
“We’re somewhat flexible about the particular application,” Marzouk says. “These models exist in a vast array of fields, from engineering and geophysics to subsurface modeling, very often with unknown parameters. We want to treat the model as a black box and say, ‘Can we accelerate this process in some way?’ That’s what our algorithm does.”
Marzouk and his colleagues — recent PhD graduate Patrick Conrad, Natesh Pillai from Harvard University, and Aaron Smith from the University of Ottawa — have published their findings this week in the Journal of the American Statistical Association.
In working with complicated models involving multiple unknown parameters, computer scientists typically employ a technique called Markov chain Monte Carlo (MCMC) analysis — a statistical sampling method that is often explained in the context of the board game “Monopoly.”
To plan out a monopoly, you want to know which properties players land on most often — essentially, an unknown parameter. Each space on the board has a probability of being landed on, determined by the rules of the game, the positions of each player, and the roll of two dice. To determine the probability distribution on the board — the range of chances each space has of being landed on — you could roll the die hundreds of times.
If you roll the die enough times, you can get a pretty good idea of where players will most likely land. This, essentially, is how an MCMC analysis works: by running a model over and over, with different inputs, to determine a probability distribution for one unknown parameter. For more complicated models involving multiple unknowns, the same method could take days to weeks to compute an answer.
With their new algorithm, Marzouk and his colleagues aim to significantly speed up the conventional sampling process.
“What our algorithm does is short-circuits this model and puts in an approximate model,” Marzouk explains. “It may be orders of magnitude cheaper to evaluate.”
The algorithm can be applied to any complex model to quickly determine the probability distribution, or the most likely values, for an unknown parameter. Like the MCMC analysis, the algorithm runs a given model with various inputs — though sparingly, as this process can be quite time-consuming. To speed the process up, the algorithm also uses relevant data to help narrow in on approximate values for unknown parameters.
The Latest on: Shrinking bull’s-eye algorithm
via Google News
The Latest on: Shrinking bull’s-eye algorithm
- Fast way of electron orbit simulation in complex magnetic fieldson January 19, 2016 at 4:00 pm
The design of advanced synchrotron radiation sources requires precise algorithms for ... "Fast way of electron orbit simulation in complex magnetic fields." ScienceDaily. ScienceDaily, 20 January ...
- 'Shrinking bull's-eye' algorithm speeds up complex modeling from days to hourson November 16, 2015 at 4:00 pm
The algorithm may be thought of as a shrinking bull's-eye that, over several runs of a model, and in combination with some relevant data points, incrementally narrows in on its target: a ...
- Mobile image processing method cuts bandwidth use 98%on November 15, 2015 at 8:23 pm
Michaël Gharbi, a graduate student in electrical engineering and computer science at MIT and first author on the Siggraph paper, says that the technique could become more useful as image-processing ...
- Biophysicists take small step in quest for 'robot scientist'on August 25, 2015 at 8:03 am
Biophysicists have taken ... a system's dynamics - a so-called robot scientist. Nature Communications published the finding - a practical algorithm for inferring laws of nature from time-series ...
via Bing News