Skip to content
View DMHamann's full-sized avatar
  • Hamburg

Block or report DMHamann

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
DMHamann/README.md

Hey, I'm David and I'm a mathematician with a focus on stochastics, statistics, and statistical learning, working at the intersection of probability theory and applied machine learning, with an interest in AI safety and interpretability.

I hold two Bachelor's degrees and a Master's:

  • Bachelor's in Mathematics — thesis on MCMC methods (Metropolis-Hastings, Gibbs sampling, slice sampling) for inference in Hidden Markov Models.
  • Bachelor's in Psychology — agent-based modeling of behavioral phenomena; this is where my interest in how humans (and by extension, learned agents) reason about incentives and reward comes from.
  • Master's in Mathematics, focused on stochastics/statistics — thesis on multivariate Kolmogorov-Smirnov goodness-of-fit tests. I write Python for research and simulation. So far I've worked on goodness-of-fit testing, empirical process theory, and high-dimensional statistics, and I'm increasingly drawn toward AI safety, interpretability, and alignment.

Some of my projects are pinned below or in my public repositories.

Feel free to contact me if you have any questions: david.hamann@posteo.de

Pinned Loading

  1. multivariate_ks_test multivariate_ks_test Public

    Implementation and simulation of a bivariate version of a Kolmogorov-Smirnov goodness-of-fit-test.

    Jupyter Notebook

  2. mcmc_algorithms mcmc_algorithms Public

    Implementation and simulation of four basic Monte-Carlo sampling algorithms: Accept-Reject, Metropolis-Hastings, Gibbs sampling and the slice sampler.

    Jupyter Notebook

  3. deepcluster deepcluster Public

    Reimplementation of DeepCluster (Caron et al., 2018) on MNIST in PyTorch.

    Jupyter Notebook