You could take that word-for-word from the debate that raged after Treasury bailed out the prime funds in 2008.
64 karma · joined April 24, 2021
You could take that word-for-word from the debate that raged after Treasury bailed out the prime funds in 2008.
https://www.nytimes.com/2008/09/20/business/20moneys.html
https://www.nytimes.com/2020/03/19/business/coronavirus-mone...
I don't know enough about browsers or js to know if its difficult or not.
The scary thing is a lot of commercial "people analytics" systems marketed to HR departments, lenders, and government agencies are little more than dressed up relationship tests from 1980s magazines.
https://www.cs.princeton.edu/~arvindn/talks/MIT-STS-AI-snake...
When you phrase it in a way that underlines the mechanical nature of the host's decision, people get it right. When you phrase it in a way that suggests the host's choice is itself random, people get it wrong.
I think the first formulation primes people to think of it from the perspective of the host, which is the right perspective for this problem.
There's some real doozies out there. The Reinhart-Rogoff error, which was used to justify imposing austerity on Greece [0]. The UK's COVID tracing fiasco [1]. The list goes on. People using Excel have no business making decisions that affect other people's lives.
[0] https://stanfordreview.org/clarifying-the-implications-of-th...
If you're curious:
https://www.ams.org/journals/mcom/1978-32-141/S0025-5718-197...
The curse of dimensionality means you often need a huge number of samples to guarantee a useful level of precision. Additionally, many quantities you'd like to know come up in Monte Carlo simulations themselves. That creates an intractable O(N^2) problem.
Here's an example that I encountered at work yesterday:
You want to know P(x>=a and y>=b) where (x,y) is a standard bivariate normal with correlation R.
You can:
1. Simulate a bunch of (x,y) and take the mean of the indicator function 1[x>=a, y>=b]. This will take whole seconds to compute.
2. Use an adaptive quadrature method like scipy.integrate.nquad. This will take dozens to hundreds of milliseconds.
3. Write a fixed grid Gauss-Legendre quadrature routine in c. This will take less than a microsecond.
I needed this value inside a Monte Carlo simulation. If I had to simulate the solution, the problem would be intractable.