JL Lemma: Proof Sketch

66 words
1 min read
Python Week 1: the first filter for runtime behavior
Visual companion
Python
Type and operator map

Python Week 1: the first filter for runtime behavior

View
Revision summary

What this note is really saying

Short form

# JL Lemma: Proof Sketch ## Key Steps 1. Choose a random $m \times d$ matrix $R$ with entries $R_{ij} \sim N(0, 1/m)$ 2.

JL Lemma: Proof Sketch

Key Steps

  1. Choose a random m×dm \times d matrix RR with entries Rij∼N(0,1/m)R_{ij} \sim N(0, 1/m)
  2. For any fixed vector xx, show E[∣∣Rx∣∣2]=∣∣x∣∣2E[||Rx||^2] = ||x||^2
  3. By concentration: Pr⁡(∣∣∣Rx∣∣2−∣∣x∣∣2∣≥ϵ∣∣x∣∣2)≤2exp⁡(−m(ϵ2/2−ϵ3/3))\Pr(|||Rx||^2 - ||x||^2| \geq \epsilon ||x||^2) \leq 2\exp(-m(\epsilon^2/2 - \epsilon^3/3))
  4. Union bound over (n2)\binom{n}{2} pairs gives the result when m=O(log⁡n/ϵ2)m = O(\log n / \epsilon^2) Join Discord PreviousJohnson-LindenstraussNextLocality-Sensitive Hashing
Document outline

Keep your place and jump directly to a heading.

Table of contents

No note selected

Open a chapter to see its outline, backlinks, and sources here.