#Hey I am Alex
One intuition is that common asymptotic results rely on \(D = \max ||x||_2\) to bound the excess risk. However \(D\) grows with d
Theorem 1 states that we can approximate \(\hat{f}\) with a polynomial function of degree 2. This would suggest that if \(f^*\) is a not a itself such a function then you will always carry a bias with you empirical optimum.
\[k\left(x, x^{\prime}\right)=\sum_{i=0}^{\infty} \frac{1}{i !}\left(x^{T} x^{\prime}\right)^{i}\]
\[ \mathcal{E}_{\mathbf{X}}:=\left\{\mathbf{X}\left|\max _{i, j}\right| x_{i}^{\top} x_{j}-\delta_{i, j} \mid \leq c n^{-1 / 2}(\log (n))^{(1+\epsilon) / 2}\right\} \]
2.) \[ \begin{align} ||M||_F & = \sqrt{\sum_{i \neq j} \sum_{k=0}^\infty \frac{1}{k !}\left(x_i^{T} x_j \right)^{k} } \leq \sqrt{\sum_{i \neq j} \sum_{k=0}^\infty \frac{1}{k !}\left( c n^{-1 / 2}(\log (n))^{(1+\epsilon) / 2}\right)^{k} } \\ & = n \sqrt{ \exp\left( c n^{-1 / 2}(\log (n))^{(1+\epsilon) / 2} \right) } \end{align} \]
\[\begin{align} ||M||_{op} \leq ||M||_F \rightarrow 0. \end{align}\]
3.)
\[\left(\mathbf{X}^{T} \mathbf{X}\right)^{\circ 3} \rightarrow I_{d}\]
\[(K -I_n)^{\circ 3} = K^{\circ 3} -I_n^{\circ 3} = K^{\circ 3} -I_n \]
\[ || K - I_n ||_{op} = || M + D - I_n ||_{op} \leq ||M||_{op} + ||D - I_n||_{op} \rightarrow 0\]
You can brainstorm ideas here and delete this section later (or keep it)
or
or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up
Syntax | Example | Reference | |
---|---|---|---|
# Header | Header | 基本排版 | |
- Unordered List |
|
||
1. Ordered List |
|
||
- [ ] Todo List |
|
||
> Blockquote | Blockquote |
||
**Bold font** | Bold font | ||
*Italics font* | Italics font | ||
~~Strikethrough~~ | |||
19^th^ | 19th | ||
H~2~O | H2O | ||
++Inserted text++ | Inserted text | ||
==Marked text== | Marked text | ||
[link text](https:// "title") | Link | ||
 | Image | ||
`Code` | Code |
在筆記中貼入程式碼 | |
```javascript var i = 0; ``` |
|
||
:smile: | ![]() |
Emoji list | |
{%youtube youtube_id %} | Externals | ||
$L^aT_eX$ | LaTeX | ||
:::info This is a alert area. ::: |
This is a alert area. |
On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?
Please give us some advice and help us improve HackMD.
Syncing