Introduction
The growth-optimal or Kelly criterion prescribes, for a single risky asset, the constantly-rebalanced leverage that maximises the almost-sure long-run growth rate of wealth [@kelly1956; @breiman1961; @merton1969]. Its central weakness in application is well known: the optimal bet depends on the asset's expected excess return, a quantity that is estimated with large error and is the hardest moment to pin down [@merton1980; @chopra1993]. Practitioners respond by "fractional Kelly" — betting some fixed fraction (often one half) of the Kelly amount — and defend it on risk-aversion or drawdown grounds 4.
This paper asks a narrower, fully answerable question: in the standard continuous-rebalancing model, exactly how much long-run growth does estimation error in the drift cost, and what leverage is optimal once that error is acknowledged? The contribution is three exact results: a closed-form "estimation tax" on geometric growth (Theorem 2), a first-principles derivation of the fractional-Kelly multiplier as the reliability of the edge estimate (Theorem 3), and a sharp threshold beyond which naive Kelly betting destroys wealth in expectation (Corollary 4). The results are elementary consequences of the quadratic shape of the growth function; their value is that they are exact, closed-form, and reframe a heuristic (fractional Kelly) as Bayesian shrinkage with an explicit fraction. I report no data and run no simulations: every statement below is a theorem in the stated model, and I flag exactly where the model's assumptions are load-bearing.
Model
Let a risky asset's price St follow geometric Brownian motion with excess drift μ (over the risk-free rate, which I normalise to zero without loss of generality) and volatility σ>0:
StdSt=μdt+σdWt.
An investor holds a constant fraction f∈R of wealth in the asset, continuously rebalanced (here f>1 is leverage, f<0 a short). Wealth Vt then obeys dVt/Vt=fμdt+fσdWt, and by Ito's lemma
dlogVt=(fμ−21f2σ2)dt+fσdWt.
By the strong law for Brownian motion, t1log(Vt/V0)→g(f) almost surely, where
g(f)=fμ−21f2σ2(1)
is the long-run log-growth rate. Equation (1) is exact in this model — not a small-f approximation — and is the object every result below maximises. Throughout, "growth" means g.
Result 1: the oracle optimum (classical)
Theorem 1 (Kelly leverage). g is strictly concave and uniquely maximised at
f⋆=σ2μ,g(f⋆)=2σ2μ2.
Proof. g′(f)=μ−fσ2, g′′(f)=−σ2<0; setting g′(f)=0 gives f⋆=μ/σ2, and substitution gives g(f⋆)=μ2/2σ2. □
This is the classical continuous-time Kelly/Merton result 2; it is stated only to fix the benchmark. Completing the square rewrites (1) as
g(f)=g(f⋆)−21σ2(f−f⋆)2,(2)
an identity used repeatedly below: every unit of misplaced leverage costs growth quadratically, at rate σ2/2.
Result 2: the estimation tax
Suppose the investor does not know μ and instead holds an estimator μ^, betting the plug-in Kelly leverage f^=μ^/σ2.
Theorem 2 (estimation tax). The growth shortfall relative to the oracle is exactly
Δ=g(f⋆)−g(f^)=2σ2(μ^−μ)2.
If μ^ is unbiased for μ with variance Var(μ^)=s2, then
E[Δ]=2σ2s2.
Proof. By identity (2), Δ=21σ2(f^−f⋆)2. Since f^−f⋆=(μ^−μ)/σ2, we get Δ=21σ2(μ^−μ)2/σ4=(μ^−μ)2/(2σ2). Taking expectations and using E[(μ^−μ)2]=Var(μ^)=s2 for an unbiased estimator gives the second claim. □
Two features are worth stating plainly. First, the expected tax s2/(2σ2) does not depend on the true edge μ: the penalty for not knowing the drift is governed by how noisy the estimate is relative to the asset's variance, full stop. Second, because a drift is estimated over a window of length T with sampling error s2≈σ2/T, the expected tax is ≈1/(2T) — the same order as the very growth one is trying to harvest, which is why drift estimation, not variance estimation, dominates the practical difficulty.
Result 3: the reliability-optimal leverage
Plug-in betting is not optimal once estimation error is acknowledged. Model the edge and signal jointly: let the true drift be drawn μ∼N(0,τ2) and the available signal be μ^=μ+η with independent noise η∼N(0,s2). Define the edge reliability
ρ=τ2+s2τ2∈[0,1],
the squared correlation between signal and truth. Consider leverage rules linear in the signal, f=cμ^/σ2.
Theorem 3 (fractional Kelly = reliability shrinkage). Among all rules f=cμ^/σ2, expected growth E[g(f;μ)] is maximised at c⋆=ρ, i.e. the optimal leverage is the plug-in Kelly bet shrunk by the edge reliability:
fopt=ρσ2μ^,E[g(fopt)]=2σ2ρτ2=2σ2(τ2+s2)τ4.
Moreover fopt coincides with the full Bayes-optimal leverage: maximising E[g(f;μ)∣μ^] for each observed signal gives f=E[μ∣μ^]/σ2, and under the Gaussian model E[μ∣μ^]=ρμ^.
Proof. Write f=cμ^/σ2. From (1), E[g]=E[fμ]−21σ2E[f2]. Using μ^=μ+η with η⊥μ, E[η]=0:
E[fμ]=σ2cE[μ^μ]=σ2cE[μ2]=σ2cτ2,E[f2]=σ4c2E[μ^2]=σ4c2(τ2+s2).
Hence E[g]=σ−2[cτ2−21c2(τ2+s2)]. This is concave in c with derivative σ−2[τ2−c(τ2+s2)], vanishing at c⋆=τ2/(τ2+s2)=ρ. Substituting c=ρ and using ρ(τ2+s2)=τ2 gives E[g]=σ−2[ρτ2−21ρτ2]=ρτ2/(2σ2). The Bayes step is the standard Gaussian posterior mean E[μ∣μ^]=ρμ^; since the posterior mean is linear in μ^, the best linear rule attains the unconstrained Bayes optimum. □
The multiplier that fractional-Kelly practice treats as a free risk-aversion dial is therefore pinned down: it equals the reliability of the edge signal. A signal that explains half the variance of the true edge (ρ=1/2) justifies exactly half-Kelly — recovering the common rule of thumb as the optimum at a specific, measurable signal quality, not as a blanket prescription.
Corollary 4: when naive Kelly loses money
Corollary 4 (negative-growth threshold). Naive plug-in Kelly (c=1) has expected growth
E[g(f^)]=2σ2τ2−s2,
which is negative whenever s2>τ2. The expected-growth advantage of reliability shrinkage over naive Kelly is
E[g(fopt)]−E[g(f^)]=2σ2(τ2+s2)s4≥0,
with equality only in the noiseless case s=0. Proof. Set c=1 in the expression for E[g] from Theorem 3: σ−2[τ2−21(τ2+s2)]=(τ2−s2)/(2σ2), negative iff s2>τ2. Subtracting from ρτ2/(2σ2) and simplifying with ρ=τ2/(τ2+s2) gives [ρτ2−τ2+s2]/(2σ2)=s4/(2σ2(τ2+s2)). □
The threshold is interpretable. τ2 is the cross-sectional variance of genuine edges; s2 is the variance of the noise in one's estimate of an edge. When estimates are noisier than edges are real, the act of sizing positions by raw Kelly converts a fair game into a losing one in expectation — not because the edges are absent, but because leverage is allocated in the wrong direction often enough that the quadratic growth penalty (identity (2)) dominates. Shrinkage by ρ is precisely the correction that restores non-negative expected growth (it yields ρτ2/2σ2≥0 for all s).
Discussion
The three results share one mechanism: the growth function is a downward parabola in leverage (identity (2)), so any error in the chosen leverage is taxed quadratically at rate σ2/2. Theorem 2 turns that into a closed-form cost of mis-estimation; Theorem 3 turns it into an optimal response (shrink toward zero by the signal's reliability); Corollary 4 locates the point where the cost overwhelms the edge. The qualitative message — estimate the mean badly and you are punished, so bet conservatively — is folklore [@chopra1993; @maclean2011]; what is exact here is the rate (s2/2σ2), the multiplier (ρ), and the threshold (s2=τ2).
The framing also clarifies a confusion between two distinct reasons to bet below full Kelly. One is risk aversion / drawdown control, which applies even under perfect information. The other, isolated here, is purely informational: shrinkage is optimal for growth itself once the edge is uncertain, with no appeal to preferences. Reliability shrinkage and risk-aversion fractionalisation compound multiplicatively and should not be conflated.
Limitations
The results are exact only inside their model, and the model is deliberately thin. (i) Geometric Brownian motion with constant μ,σ is assumed; real returns are heavy-tailed, volatility is stochastic, and edges are non-stationary, all of which can only worsen the estimation tax, not relieve it. (ii) The analysis is single-asset and single-period in its decision (one posterior, one constant-rebalanced leverage); it omits intertemporal hedging demands and, crucially, the fact that an investor learns μ over time, which a full dynamic program would exploit — Theorem 3 is the static-signal optimum, a lower bound on what adaptive learning could achieve. (iii) Transaction costs, borrowing constraints, and the discreteness of real rebalancing are ignored; each tightens the case for lower leverage further. (iv) σ2 is treated as known; in practice variance is estimated too, though far more accurately than the mean. (v) The Gaussian prior/noise in Theorem 3 is what makes the posterior mean linear and the best-linear rule globally Bayes-optimal; under non-Gaussian signals ρ remains the best linear shrinkage but not necessarily the unconstrained optimum. None of these change the direction of any result; they bound its literal applicability. No parameter values, datasets, or simulations are claimed — the paper is a set of proofs.
Conclusion
In the standard growth-optimal model, the cost of not knowing a stock's expected return is exactly Var(μ^)/2σ2 in long-run log-growth; the leverage that best answers that uncertainty is the Kelly bet scaled by the reliability ρ=τ2/(τ2+s2) of the edge estimate; and when estimate noise exceeds true edge variance, naive Kelly sizing has negative expected growth. Fractional Kelly, usually justified by taste for safety, falls out of pure growth optimisation as Bayesian edge-reliability shrinkage with a fraction one can in principle measure. The open direction is the dynamic problem, where ρ itself rises as the edge is learned, and the static shrinkage proved here becomes a time-varying schedule.
References
References are listed in the structured reference data accompanying this submission.