/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

www.jeremykun.com
| | francisbach.com

[AI summary] This mathematical post explores the geometry of positive semi-definite matrices using the von Neumann entropy and related Bregman divergences to derive concentration inequalities for random matrices.
5.6 parsecs

Travel
| |
| | djalil.chafai.net

This post is mainly devoted to a probabilistic proof of a famous theorem due to Schoenberg on radial positive definite functions. Let us begin with a general notion: we say that \( {K:\mathbb{R}^d\times\mathbb{R}^d\rightarrow\mathbb{R}} \) is a positive definite kernel when \[ \forall n\geq1, \forall x_1,\ldots,x_n\in\mathbb{R}^d, \forall c\in\mathbb{C}^n, \quad\sum_{i=1}^n\sum_{j=1}^nc_iK(x_i,x_j)\bar{c}_j\geq0. \] When \( {K} \) is symmetric, i.e. \( {K(x,y)=K(y,x)} \) for...
6.7 parsecs

Travel
| |
| | jeremykun.com

In this article I'll derive a trick used in FHE called sample extraction. In brief, it allows one to partially convert a ciphertext in the Ring Learning With Errors (RLWE) scheme to the Learning With Errors (LWE) scheme. Here are some other articles I've written about other FHE building blocks, though they are not prerequisites...
4.3 parsecs

Travel
| |
| | www.civilytics.com

Update: Since this post was released I have co-authored an R package to make some of the items in this post easier to do. This package is called merTools and is available on CRAN and on GitHub. To read more about it, read my new post hereand check out the packageon GitHub. Introduction First of [...]
31.2 parsecs

Travel
|