Data-Driven Discovery of Linear Dynamical Systems Over Graphs via Dynamical Sampling
Offered By: Fields Institute via YouTube
Course Description
Overview
Syllabus
Intro
Graph signal processing Given information at a subset nodes of a graph, can we recover the missing information on other modes in a robust and efficient way?
Preliminaries
Sampling of graph signals
Motivation
Relation to Frame/Basis theory in Harmonic analysis
Previous work on deterministic dynamical sampling
Relation to linear inverse problem How to choose space-time samples that can do as good as spatial samples? Formulation We can write the space-time sampling as
Randomized dynamical sampling We propose three different random space-time sampling regimes
Random space-time sampling model
Connection with the static case T=1
Optimal sampling distributions
Summary • Optimal sampling distribution depends on the graph structure and the
Reconstruction strategy
Guarantees for standard decoder
Guarantees for efficient decoder
System Identification in dynamical sampling
Generalization to affine systems
Numerical Results
Taught by
Fields Institute
Related Courses
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer