ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \mathcal M\subset\mathbb R^n be an algebraic manifold of dimension D and let k be a degree-d polynomial kernel. For fixed x,y\in\mathcal M and i.i.d. standard-normal landmark points z_1,\ldots,z_m with m\ge\lambda Dd\log n, prove an asymptotic bound of compressed-sensing type for k(x,y)-K(x,Z)K(Z,Z)^{-1}K(Z,y), such as \Pr\bigl(\lvert k(x,y)-K(x,Z)K(Z,Z)^{-1}K(Z,y)\rvert\ge\varepsilon\bigr)\le C\varepsilon^{-c\lambda}.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.