Systems | Information | Learning | Optimization
 

Randomized Distributional Design for Bayesian Transfer Learning

Video: https://vimeo.com/215556154 We characterize the Bayesian transfer learning problem as one of conditioning on external stochastic knowledge, typically a partially or completely specified distribution. The knowledge is `external’ in that a joint probability model specifying the stochastic dependence on this knowledge is not available. In consequence, there is no unique …

Community Recovery on the Weighted Stochastic Block Model and Its Information-Theoretic Limits

Video: https://vimeo.com/215556012 Identifying communities in a network is an important problem in many fields, including social science, neuroscience, military intelligence, and genetic analysis. In the past decade, the Stochastic Block Model (SBM) has emerged as one of the most well-studied and well-understood statistical models for this problem. Yet, the SBM …

Parametrization of discrete optimization problems, subdeterminants and matrix-decomposition

Video: https://vimeo.com/216507007 The central goal of this talk is to identify parameters that explain the complexity of Integer linear programming defined as follows: Let P be a polyhedron. Determine an integral point in P that maximizes a linear function. It is obvious that the number of integer variables is such …

Digital humans, virtual surgery and fast fluids; do they have more in common than their hunger for performance?

Video: https://vimeo.com/217685407 Physics-based modeling research in graphics has been consistently conscious of advances in modern parallel hardware, leveraging new performance capabilities to improve the scope and scale of simulation techniques. An exciting consequence of such developments is that a number of performance-hungry emerging applications, including computer-aided healthcare and medical training, …

A variational perspective for accelerated methods in optimization

Video: https://vimeo.com/195845240 Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings. While many generalizations and extensions of Nesterov’s original acceleration method have been proposed, it is not yet clear what is the natural scope of the acceleration concept. In this work, we study accelerated …

Finding low-rank solutions via the Burer-Monteiro approach, efficiently and provably

Video: https://vimeo.com/192676538 A low rank matrix can be described as the outer product of two tall matrices, where the total number of variables is much smaller. One could exploit this observation in optimization: e.g., consider the minimization of a convex function f over low-rank matrices, where the low-rank set is …