Explore >> Select a destination
|
You are here 
|
danieltakeshi.github.io | ||
| | | | |
jaberkow.wordpress.com
|
|
| | | | | Lately I have been making use of a continuous relaxation of discrete random variables proposed in two recent papers: The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables and Categorical Reparameterization with Gumbel-Softmax. I decided to write a blog post with some motivation of the method, as well as providing some minor clarification on... | |
| | | | |
ryantolsma.com
|
|
| | | | | IVF embryo selection is having a moment. Companies like Orchid Health are pitching parents on the promise of optimizing their future kids for IQ, height, disease resistance, and other desirable phenotypes with celebs and politicians (quietly) leaning in. The tech is real and improving, but the actual upside and long-term vision is limited by some pretty basic math. | |
| | | | |
gregorygundersen.com
|
|
| | | | | [AI summary] The blog post derives the expected value of a left-truncated lognormal distribution, explaining the mathematical derivation and validating it with Monte Carlo simulations. | |
| | | | |
nickhar.wordpress.com
|
|
| | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | ||
