Sets with Small Intersection
Suppose that we want to construct subsets $S_1, \ldots, S_m \subseteq
\{1,\ldots,n\}$ with the following properties:
1. $|S_i| \geq k$ for all $i$
2. $|S_i \cap S_
Advice for Authors
I've spent much of the last few days reading various ICML papers and I find
there's a few pieces of feedback that I give consistently across several papers.
I&
Model Mis-specification and Inverse Reinforcement Learning
In my previous post, “Latent Variables and Model Mis-specification
[https://jsteinhardt.wordpress.com/2017/01/10/latent-variables-and-model-mis-specification/]
”, I argued that while machine learning is good at optimizing accuracy on
observed signals, it has
Linear algebra fact
Here is interesting linear algebra fact: let $A$ be an $n \times n$ matrix and
$u$ be a vector such that $u^{\top}A = \lambda u^{\top}$. Then for any matrix
$B$, $u^
Prékopa–Leindler inequality
Consider the following statements:
1. The shape with the largest volume enclosed by a given surface area is the
$n$-dimensional sphere.
2. A marginal or sum of log-concave distributions is log-concave.
3.