Algorithms and Optimization (2018--ICTS Bangalore)

source: International Centre for Theoretical Sciences      2018年1月17日
Algorithms and Optimization: https://www.icts.res.in/discussion-me...
DATES: 02 January 2018 to 03 January 2018
VENUE: Ramanujan Lecture Hall, ICTS Bangalore
DESCRIPTION:
The goal of this discussion meeting is to bring together leading young researchers in the areas of algorithms and optimization to discuss and disseminate the recent directions and advances in these areas. The topics include learning algorithms, convex optimization, nonconvex optimization, combinatorial optimization, spectral algorithms, semidefinite programming-based algorithms, parallel algorithms, counting algorithms, and their applications.
ORGANIZERS: Prateek Jain and Nisheeth K. Vishnoi

48:30 Structure recovery in graphical models by Piyush Srivastava
48:38 Average-Case Algorithmic Thresholds via Sum-of-Squares by Pravesh Kothari
33:06 Accelerated Newton Iteration for Roots of Black Box Polynomials by Anand Louisi
51:09 How to escape saddle points efficiently? by Praneeth Netrapalli
46:04 Algorithmic Applications of An Approximate Version of Caratheodory's Theorem by Siddhartha Barman
48:24 Derandomizing the Isolation Lemma and Parallel Algorithms by Rohit Gurjar
49:08 Invariant theory and geodesically convex optimization by Ankit Garg
40:59 Efficiently decoding Reed-Muller codes from random errors by Ramprasad Saptarishi
36:19 Combinatorial Markets with Covering Constraints: Algorithms and Applications by Ruta Mehta
43:30 Fisher Markets and Nash Social Welfar by Jugal Garg
9:35 Learning Sums of Independent Commonly Supported Integer Random Variables by Anindya De
45:20 Learning Combinatorial Structures by Swati Gupta
47:03 Robust Regression by Purushottam Kar