Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Do they apply Occam's razor, where simpler equations are favored over more complicated ones?


"One might define simplicity as the length of the equation, say, and accuracy as how close the curve gets to each point in the data set, but those are just two definitions from a smorgasbord of options."

"..the algorithm evaluated candidate equations in terms of how well they could compress a data set. A random smattering of points, for example, can’t be compressed at all; you need to know the position of every dot. But if 1,000 dots fall along a straight line, they can be compressed into just two numbers (the line’s slope and height). The degree of compression, the couple found, gave a unique and unassailable way to compare candidate equations."


Yes. The article states something about statistics and Bayesian and other terms I only barely understand. It uses "+" over "hyperbolic cosine" for example (to quote the article).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: