3 problems

Let $f:[0,1]\to\mathbb{R}$ be a fixed non-decreasing function, and let $\operatorname{GreedyBox}$ be the adaptive approximation algorithm whose queried points form an empirical dis…

Let $C>0$ and $\rho^*\in ]0,1[$ be constants. For $f\in C^2$, let the modified anisotropic greedy refinement algorithm use a parameter $\rho\in ]\rho^*,1[$, and denote its approxim…

Extension conjecture. Theorem 1 should hold for a larger class of stochastic processes, such as solutions of stochastic differential equations.