BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20220610T120000Z
UID:1f93090caaa0f047e60589da68989f8d-291
DTSTAMP:19700101T120011Z
DESCRIPTION:Determinant Maximization: Approximation and Estimation Algorithms
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/291/determinant-maximization-approximation-and-estimation-algorithms/
SUMMARY:In the determinant maximization problem, given a collection of vectors, we aim to pick a subset to maximize the determinant of a natural matrix associated with these vectors. The abstract problem captures problems in multiple areas including machine learning, statistics, convex geometry, Nash social welfare problem from algorithmic game theory and network design problems. We will survey the known results and techniques for the problem. The results vary from arbitrary good approximations to only estimation algorithms. The techniques used in these works vary from geometry of polynomials, sparse solutions to convex programming solutions to matroid intersection algorithms.
<br>
<br>
For more details about the seminar please visit the website at https://www.csa.iisc.ac.in/iisc-msr-seminar
DTSTART:20220610T120000Z
END:VEVENT
END:VCALENDAR