Machine Learning Topic I am working with Guy Bresler performing analysis on average case complexity of statistical tasks.What this means is given a statistical task such as performing sparse principle component analysis on a data set we use a mix of mathematics and complexity theory to provide bounds on various quantities governing algorithms. For example one bound may be bounding the minimum asymptotic error of an algorithm with polynomial runtime. This is a very important theory as it can tell us how powerful a given algorithm is and whether or not it is worth searching for a better algorithm.
I decided to participate in the SuperUROP program because throughout my years in college I have not had any research experience. Through the Super UROP program I wish to fill this void and learn more about the research process. My project deals with a number of fields in mathematics and computer science both of which I enjoy so I look forward to working on this project.