Video
Non-Convex Matrix Completion Against a Semi-Random Adversary
Matrix completion is a well-studied problem with many machine learning applications. In practice, the problem is often solved by non-convex optimization algorithms. However, the current theoretical analysis for non-convex algorithms relies heavily on the assumption…
Video
Incentivizing Societal Contributions for and via Machine Learning
Machine learning (ML) and automatic algorithmic decision making have started to play central and crucial roles in our daily lives. At the same time, more and more data used to train ML algorithms are now…