Algorithms
Video
M. Pawan Kumar – Self-Paced Learning for Specific-Class Semantic Segmentation
Algorithms for learning the parameters of latent variable models are prone to getting stuck in a bad local optimum. To alleviate this problem, we build on the intuition that the algorithm should be presented with…
Video
Converting any Algorithm into an Incentive-Compatible Mechanism
Does algorithm design become harder in the presence of incentive constraints? The theory of algorithmic mechanism design is largely founded on the presumption that the answer is affirmative, a presumption that has been rigorously confirmed…
