algoGod: Be Crowned the World’s Greatest Algorithms Expert!

16Oct07

Komli today launched the “algoGod contest” for machine learning, math, genetics, and algorithm experts.

http://www.komli.com/algogod/

Contest winner to receive Rs. 2,00,000

Start date: October 15th 2007.
Entries must be submitted on or before November 14th 2007.
Results will be declared on December 31st 2007.

Have you ever wondered if you are the best algorithms expert on the planet? Have you ever thought, “I know I can beat everyone, just let me prove it?” Well Komli’s algoGod contest is for you, it’s your chance to show the world how smart you really are!

The algoGod contest seeks to crown one expert as the ‘Algorithms God’. How are we going to do this? Well, the proof is in the pudding! We want every contestant to solve a common problem, and whoever is best will receive the algoGod prize!

A little more background:

Komli lives in the world of online advertising, and online advertising is rife with opportunity with complex algorithms based on cutting edge topics such as machine learning, data mining, graph theory, etc. Online advertising is growing at a very fast pace, and the number of variables affecting the performance of an online ad has been growing at an even faster pace. Komli is devising methods for maximizing the yield of online advertising using advanced statistical machine learning methods over large-scale systems. This is a very interesting and complex algorithm problem.

Komli is currently using a set of algorithms for maximizing the yield of online ads, collectively called ‘Yin-Yang’. There are a lot of interesting alternative approaches to Yin-Yang that have yet to be tried. Komli is interested in determining if any of these alternative approaches can beat Yin-Yang by making better predictions.

Komli will provide participants with anonymous ad impression data and a prediction accuracy bar that is 50% better than what Yin-Yang can do on the same training data set. Participants’ solutions will be judged by ‘Time complexity’ and ‘Space complexity’ criteria. The participant whose solution works best will receive Rs. 2,00,000, bragging rights and an opportunity to work with Komli. Of course, participants have to share their method and code with Komli. Eager participants can signup for the contest by filling the form on the left. Also, please let us know of any questions at algogod@komli.com.

Advertisements


One Response to “algoGod: Be Crowned the World’s Greatest Algorithms Expert!”

  1. 1 Keith Ackermann

    This is a loaded question. Any one application algorithm, such as quicksort of the FFT, can be more important than any other one for a given application.

    However, there is a common underlying theme to the algorithms mentioned above, and many more too, and that is recursive divide-and-conquor.

    Linear methods have fantastic utility but still have theoretical expotential running time. Divide-and-conquor always converges in log time.


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: