Optimal Practice Allocation Under Learning Saturation

Shrisha Rao

Home/Archive/arXiv

arXiv · 2609.05501

Optimal Practice Allocation Under Learning Saturation

Shrisha Rao

View original source ↗Read source document ↗Export metadata ↓

Abstract

A saying attributed to Bruce Lee unfavorably contrasts a martial artist who has practiced ten thousand kicks once each with another who has practiced a single kick ten thousand times. We read the saying as implicitly raising a question about how to allocate a fixed practice budget among several skills, and we show that the answer is governed by two ingredients: the shape of the learning curve that converts practice into skill, and the rule by which separate skills are aggregated into overall effectiveness. Neither ingredient alone settles the matter. Our central result reduces the multivariable allocation problem to the maximization of a single scalar \emph{efficiency function} $\eff(x)=f(x)^{p}/x$; under a simple uniqueness and divisibility condition, every optimal practice schedule is \emph{balanced}, dividing the budget equally among a definite number of skills. The optimal number of skills is then determined by a transparent criterion equating the elasticity of the learning curve to the reciprocal of the aggregation parameter. Hard-saturation models, heterogeneous learning rates, a sharp specialization threshold, and a genuinely intermediate optimal repertoire all follow as consequences.

Explore related subjects

math.GM

Keep this discovery

BibTeX RIS

Shrisha Rao. 2026-08-28. Optimal Practice Allocation Under Learning Saturation. https://arxiv.org/abs/2609.05501

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

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗

arXiv2026

The decrease in sectional curvature of the Fisher--Rao manifold of beta distributions

In the paper, the author develops a general convexity lemma and applies it to demonstrate the monotonic decrease of a function involving polygamma functions, arising from the sectional curvature of the Fisher--Rao manifold of beta distributions.

math.GM↗

arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗