نتایج جستجو برای: gaussian kernel
تعداد نتایج: 123253 فیلتر نتایج به سال:
We prove the asymptotic of logarithmic Bergman kernel. And as an application, we calculate conditional expectation density zeros Gaussian random sections powers a positive line bundle that vanish along fixed smooth subvariety.
Recent work shows that inference for Gaussian processes can be performed efficiently using iterative methods that rely only on matrix-vector multiplications (MVMs). Structured Kernel Interpolation (SKI) exploits these techniques by deriving approximate kernels with very fast MVMs. Unfortunately, such strategies suffer badly from the curse of dimensionality. We develop a new technique for MVM ba...
(a) (b) (c) Figure: (a) In a simple blocked low rank approximation the diagonal blocks are dense (gray), whereas the off-diagonal blocks are low rank. (b) In an HODLR matrix the low rank off-diagonal blocks form a hierarchical structure leading to a much more compact representation. (c) H2 matrices are a refinement of this idea. (a) In simple blocked low rank approximation the diagonal blocks a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید