0


个人之旅:从信号和系统到图形化模型

A Personal Journey: From Signals and Systems to Graphical Models
课程网址: http://videolectures.net/nipsworkshops2010_willsky_pjf/  
主讲教师: Alan Willsky
开课单位: 麻省理工学院
开课时间: 2011-01-13
课程语种: 英语
中文简介:
这篇演讲概述了一条曲折的研究路线,始于1988年,从一些信号处理器和控制理论家开始,他们试图对新兴的小波分析领域进行统计分析,令演讲者惊讶的是,他们进入了一些领域,这些领域肯定利用了他的S&S/CT背景,但发展成了各种各样的主题。F领域涉及大规模数据同化和绘图的有效数值方法,并最终与图形模型和机器学习达成和解。讨论将涉及我们早期在多分辨率树模型(由小波驱动,但仅与小波间接相关)上的工作,控制理论家思考推理和近似建模/随机实现的方式,其中至少有一个应用程序与机器学习研究者建立模型的方式类似,但不是一个应用程序。主题物理学家!我将(最后)提供与小波的真正融洽,然后转向循环图上的近似推理。第一种方法建立在用于解决PDE的思想上,即嵌套解剖,但是有一些机器学习的扭曲,以及一些控制理论的稳定性问题(显示控制可能有一些东西提供给推理算法设计者)。然后,我将再次讨论一个与数值线性代数关于解稀疏方程组的方法有关的话题,但在图形模型的背景下,这引出了游走和分析的想法,一个令人惊讶的有用(至少我认为是直观的)想法。然后,walk-sum分析允许我们对各种迭代算法(通常称为Richardson迭代、Jacobi迭代或Gauss-Seidel迭代)说一些相当有力的东西,包括用于指导迭代以实现快速收敛的自适应算法。游走和分析也是线性代数解释的另一种方法的关键,涉及所谓的反馈顶点集。我还将介绍一种非常精确的计算图形模型中方差的方法,该方法涉及到对标识矩阵使用低秩近似值。然后回到多分辨率模型,但是现在看看由两种截然不同的数值算法驱动的模型:多网格算法和多极算法。这些算法激发了两类完全不同的模型,后者需要引入我们所说的共轭图。如果我还有时间和精力,我会对一些前瞻性的话题发表评论。
课程简介: This talk outlines a meandering line of research, started in 1988, that began with some signal processors and control theorists trying to make statistical sense of the emerging field of wavelet analysis and, to the speaker's surprise, moved into areas that certainly take advantage of his S&S/CT background but evolved into topics in a variety of fields involving efficient numerical methods for large-scale data assimilation and mapping and, eventually, a rapprochement with graphical models and machine learning. The talk will touch on our early work on multiresolution tree models (motivated by wavelets but only indirectly relevant to them), the way control theorists think of inference and approximate modeling / stochastic realization, with at least one application that rings of the way a machine learning researcher might build a model – but not a mathematical physicist! I’ll provide (finally) a real rapprochement with wavelets and then turn to approximate inference on loopy graphs. The first approach builds on an idea used in the solution of PDEs, namely nested dissection, but with some machine learning twists, and some control-theoretic stability issues (showing how control might have a few things to provide to inference algorithm designers). I will then turn to a topic again related to the ways in which numerical linear algebraists think about solving sparse systems of equations, but in the context of graphical models, this leads to the idea of walk-sum analysis, a surprisingly useful (and at least I think intuitive) idea. Walk-sum analysis then allows us to say some fairly strong things about a variety of iterative algorithms (generally known as either Richardson iterations, Jacobi iterations, or Gauss-Seidel iterations), including adaptive algorithms to guide iterations for fast convergence. Walk-sum analysis is also key in another approach with linear algebraic interpretations, involving so-called feedback vertex sets. I will also touch on an alarmingly accurate method for computing variances in graphical models that involves using a low-rank approximation to the identity matrix(!) and then return to multiresolution models but now looking at models motivated by two quite different classes of numerical algorithms: multigrid algorithms and multipole algorithms. These algorithms motivate two quite different classes of models, the latter of which requires the introduction of what we refer to as conjugate graphs. If I have any time and energy left, I will comment on some prospective topics.
关 键 词: 信号处理器; 统计意义; 偏微分方程; 多分辨率模型
课程来源: 视频讲座网
最后编审: 2020-06-04:毛岱琦(课程编辑志愿者)
阅读次数: 39