Title: Polynomial-time algorithms are not always welcome – sparse PCA as a case study When: October 27, Sunday, 12:00 Where: Gonda building, room 101 Abstract: The taxing computational effort that is involved in solving some high-dimensional statistical problems, in particular problems involving non-convex optimization, has popularized the development and analysis of  algorithms that run efficiently (polynomial-time) but ... Read more

במסגרת שיתוף הפעולה בין מחב"א לחברת AWS, אני שמח להזמין אתכם ליום עיון בנושא שירותי מחקר בענן. האירוע מיועד לחוקרים, מרצים ועוזרי מחקר המבצעים כיום פעילות מחקר בענן או שוקלים לבצע מחקר בעתיד באמצעות שירותי ענן. מטרת האירוע לתת לחוקרים את הכלים להתמקד במחקר בצורה יעילה. האירוע יתקיים ב-17.11.2019 באוניברסיטה בר-אילן, הפקולטה למדעי החיים, בנין 212, קומה 2, ... Read more

Title: Heuristic learning on the border between success and failure Abstract: Many popular hypothesis classes, such as neural-networks or decision trees, are computationally hard to learn. In practice, however, heuristic algorithms are used to learn these classes with remarkable success. To better understand this gap, we explore probabilistic models where a small change in the ... Read more

Nadav Cohen from TAU Location: Gonda building (901), room 102. Time: Sunday Nov 24th, 12:00 AM -- 13:00 AM. Title: Analyzing Optimization and Generalization in Deep Learning via Trajectories of Gradient Descent Abstract: Understanding deep learning calls for addressing the questions of: (i) optimization --- the effectiveness of simple gradient-based algorithms in solving neural network ... Read more

Special seminar on urban networks by Prof. Gourab Ghoshal from University of Rochester, NY: Gourab will be around from Nov. 25 - 28. If you are interested in meeting with him, please let me know. Please feel free to forward to all relevant groups, peers. PosterGhoshal