Random stuff about hard problems
summary
Examines using random choices to tackle hard computational problems by demonstrating the random walk method in pure Python (no special libraries). Covers applying random-walk techniques to a range of cases from trivial examples up to classically difficult or intractable problems, with accompanying slides and Jupyter notebooks on GitHub.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 1:46Random worktimization
- 4:14Choosing random step
- 11:263D camera calibration
- 19:56MNIST digit recognition
- 22:03Car parking problem
- 23:50Q&A
related talks
38mJumping into Jupyter Notebooks
09mOuvroir de Code Potentiel
33mA Code-Driven Introduction to Reinforcement Learning
01h 28mBayesian Decision Analysis [Tutorial]
01h 31mModern scientific computing and big data analytics in Python
01h 31mPast, Present and Future of Randomized Numerical Linear Algebra II
30mYou are not a Computer: Python, Dynamical Systems, and Radical Embodied...
43mThe Power of Probabilistic Programming
