What You Need to Know Before
You Start
Starts 6 June 2025 03:44
Ends 6 June 2025
00
days
00
hours
00
minutes
00
seconds
Learning Dynamical Transport without Data
Explore dynamical transport algorithms for generative modeling without data, focusing on sampling from target distributions using unnormalized log-likelihood functions, with applications in physics, chemistry, and Bayesian inference.
Harvard CMSA
via YouTube
Harvard CMSA
2463 Courses
49 minutes
Optional upgrade avallable
Not Specified
Progress at your own speed
Free Video
Optional upgrade avallable
Overview
Explore dynamical transport algorithms for generative modeling without data, focusing on sampling from target distributions using unnormalized log-likelihood functions, with applications in physics, chemistry, and Bayesian inference.
Syllabus
- Introduction to Dynamical Transport
- Sampling from Target Distributions
- Theoretical Foundations
- Methods and Techniques
- Applications in Physics
- Applications in Chemistry
- Applications in Bayesian Inference
- Computational Aspects
- Case Studies
- Conclusion
- Project and Assessment
Overview of dynamical transport algorithms
Importance in generative modeling
Unnormalized log-likelihood functions
Challenges of sampling without direct data
Mathematical formulation of dynamical transport
Key principles of stochastic differential equations (SDEs)
Introduction to measure transport and transformation
Langevin dynamics
Hamiltonian Monte Carlo (HMC)
Normalizing flows
Score-based generative models
Phase space sampling
Quantum systems and path integrals
Molecular dynamics for reaction pathways
Importance sampling in chemical systems
Prior distribution sampling
Posterior estimation without data
Numerical integration techniques
Efficient computation strategies
Real-world examples from physics
Chemical systems simulations
Bayesian inference scenarios
Recap of key concepts
Future perspectives in dynamical transport
Design and implement a dynamical transport model for a chosen application
Evaluation based on accuracy, efficiency, and innovation
Subjects
Computer Science