SearcharxivSearch

arXiv · 2608.18999

A Sharp Joint Bias-Energy Envelope for Radial Clipping

Abstract

Radial clipping does two things at once: it removes the part of a vector outside a ball and retains a bounded vector inside the ball. The removed part produces bias, while the squared norm of the retained part produces energy. We determine the exact joint price of these effects when only a $p$-moment, $1<p\le2$, is available. The problem turns out to be one-dimensional: everything is decided by the position of one point along a ray. At $\alpha=p\beta$, the extremal configuration changes. On one side a worst point can be chosen on the clipping sphere; on the other the unique positive extremal radius moves outside. When $p=2$, all inner radii tie in the first regime. The resulting constant is optimal both in the deterministic inequality and in the corresponding Hilbert-space stochastic problem. In the first regime, a symmetric law attains the bound. In the second, the supremum is not attained, but a two-point family with an increasingly rare outlier approaches it. We also show how the same transition determines the sharp bias-energy frontier. We conclude with statistical consequences and an application to online learning.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Danila Litvinov. 2026-08-19. A Sharp Joint Bias-Energy Envelope for Radial Clipping. https://arxiv.org/abs/2608.18999

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR