University of Cambridge > > Machine Learning Reading Group @ CUED > Probabilistic Data Structures and Algorithms

Probabilistic Data Structures and Algorithms

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Konstantina Palla.

Classic software engineering encourages us to think of a computer as a perfect machine that has an error probability of zero. Software components are typically designed to assume and provide exactly this type of perfection. Amazingly, it is possible to construct powerful and efficient algorithms by relaxing the zero error constraint: the demand for space and time resources can be drastically reduced in exchange for accepting a small, non-zero probability of error. This RCC shows a variety of such techniques, probabilistic data structures and algorithms, and how they can be used for machine learning on massive datasets.

Required reading: none. Instead, please think about the following question: “What can be gained from randomness? Can randomness ever help us solve deterministic problems? (And if so, how?)”

This talk is part of the Machine Learning Reading Group @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity