alephone

13 ms·

1. 1.▲
   Simple random search provides a competitive approach to reinforcement learning(arxiv.org)

   8 points by alephone 9y ago|0 comments
2. 2.▲
   by alephone 11y ago

   Here is the basic idea of differential privacy in its simplest form. Suppose that A is a eps-DP algorithm and X1, X2 are two datasets differing by a single point. Recall that for small eps, exp(eps) is roughly (1+eps) and exp(-eps) is rough
3. 3.▲
   by alephone 11y ago

   "square matrices have as many eigenvectors as they have linearly independent dimensions; i.e. a 2 x 2 matrix would have two eigenvectors, a 3 x 3 matrix three, and an n x n matrix would have n eigenvectors, each one representing its li
4. 4.▲
   Ask HN: Why do we need so many message brokers?

   11 points by alephone 11y ago|7 comments