Convex regression provides a flexible nonparametric estimation framework while incorporating appropriate shape information. However, its standard least-squares formulation has $O(n^2)$ supporting-hyperplane constraints creating a computational bottleneck as the sample size $n$ increases. We study a $K$-nearest-neighbor...
Under stability and regularity conditions on value function gradients, Bellman residual derivatives, and fitted critics, it is proved an $\mathcal{O}(\log K)$ regret bound with constants uniform in $\delta$.
J. Blanchet, Lu-Tong Hao, Ren-Yuan Xu· 0 citations
We study finite-horizon LQR with independent disturbances whose laws may drift over time. We address uncertainty in this evolution through ex-ante distributionally robust regret optimization (DRRO), which minimizes worst-case excess expected cost relative to the optimal causal controller that knows the law sequence. To...
Lukas-Benedikt Fiechtner, J. Blanchet· 0 citations
We study continuous-time supercritical branching random walks in space-inhomogeneous random environment on the Hamming cube $\{0,1,\dots,b-1\}^d$, where the reproduction laws at each site are i.i.d. sampled. This serves as an idealized model for RNA sequence evolution with mutation--selection balance. The reproduction...
J. Blanchet, Zhen-Yuan Zhang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.