Basic Prerequisites: 03 · Transaction-Cost Models.
1. Intuition & Practical Objective
Turnover is the rate at which you convert an alpha model into trading. Everything in this folder lives on this axis: a brilliant signal rebalanced daily at annual turnover can lose money, while a modest signal rebalanced quarterly can compound. This page answers the two questions a practitioner actually faces:
- How much may I trade? Two controls: penalize turnover with a linear price (an economic cost), or budget it with a hard constraint (a risk control). The first requires you to know your cost; the second does not, and is therefore what risk desks prefer.
- How fast should I converge? The target is a moving object - alphas revise every period. The great insight of the dynamic-trading literature (Gârleanu & Pedersen 2013) is that you should trade partially toward an “aim” portfolio, not jump to the current target, because a jump buys a noisy estimate you will want to undo next period.
The one-sentence essence. “Turnover is a dial, and the optimal setting is where the marginal alpha of one more unit of trading equals the marginal cost of executing it - in a static problem that is a penalty ; across periods it is a fraction of the way to a long-horizon aim.”
2. Mathematical Ground Truth & Derivations
2.1 Two ways to control turnover
Penalty form. Add to the objective:
By the envelope logic of 02, is the model’s assumed cost per unit of trading. Choosing therefore means choosing a cost forecast - and §3 shows that the certainty-equivalent-optimal lands exactly on the true cost, which is the cleanest possible statement of “price your trades honestly.”
Budget form. Instead cap the distance:
This is convex, needs no cost estimate, and is the form a risk committee is happy to mandate (“no more than turnover per rebalance”). The price of the budget is its shadow price - exactly the that the penalty form would have used.
The trade-off frontier. Sweep either control and plot the pairs :
2.2 The multi-period problem and partial adjustment
Over periods, ignoring the path is a mistake. The canonical tracking problem is
a tracking-error penalty on plus a cost penalty on the move. In the scalar case this is a tridiagonal linear system whose solution is a monotone ramp to the target, and its asymptotic behaviour is geometric:
- Cheap trading ( small, large) ⇒ : jump to the target at once.
- Expensive trading ( large, small) ⇒ : creep toward it; over a finite horizon you may never arrive.
The Gârleanu–Pedersen aim (preview of 06). With predictable returns and proportional costs, the optimal policy is
i.e. trade a matrix fraction of the gap between the aim portfolio and the current book - not all of it. The matrix is non-diagonal, so a signal in one name moves several weights: cross-asset cost coupling (verified in 06).
3. Computational Implementation - the frontier and the ramp
(A) sweep the linear penalty and report turnover, gross alpha, realized net alpha at a true cost of 10 bp, net Sharpe and certainty-equivalent utility. (B) solve the multi-period tracking problem and compare the optimal ramp to “all at once” and “equal slices.” numpy + scipy.
Three verified readings:
- (A) The utility-optimal is exactly the true cost. Certainty-equivalent utility peaks at over , and is the true 10 bp cost used to compute realized net alpha. Miss it low () and you overtrade: turnover , net Sharpe , utility . Miss it high () and you undertrade: turnover drops to but gross alpha falls to and utility to . The frontier is a hump, and its peak is the honest cost.
- (A) Net Sharpe and utility disagree - know which you are optimizing. Net Sharpe rises monotonically with () because shrinking risk raises the ratio, while utility peaks in the middle because it also counts the alpha you gave up. A desk judged on Sharpe will always over-penalize turnover; a desk judged on dollars will not. State the objective before tuning the dial.
- (B) The optimal path is a geometric ramp, and “all-at-once” is only right when trading is cheap. With the optimum (objective ) beats both all-at-once () and equal slices (). As impact grows to the ramp flattens dramatically ( vs at ) and the advantage over all-at-once explodes ( vs ): at high cost, front-loading is catastrophic. Note the path never reaches the target within at - the horizon is a real constraint, and “finish rebalancing” is a choice, not an identity.
4. Failure Modes & First-Principles Breakdowns
- Tuning by feel instead of by cost. §3 shows the penalty is a cost forecast; setting it “to be safe” makes you skip good trades. The correct discipline is to set equal to your measured marginal cost (or to the shadow price of a turnover budget you have committed to).
- The turnover budget hides regime change. A tight glues the portfolio to a stale book exactly when the world has moved (a regime shift looks identical to noise in a one-period problem). Budgets are about inputs you can see; robustness about regimes is a different tool (Robust · 05).
- Single-period myopia. Re-solving “optimally” every period with a fresh target front-loads trades and re-trades the same signal repeatedly - the turnover spiral of 05. The fix is the partial-adjustment / aim policy, not a bigger penalty.
- Ignoring the trading horizon. The ramp of §3(B) shows the target may be unreachable in periods at high cost. Pretending you will “finish the rebalance” next week when the cost model says otherwise is a forecast error, and it is a systematic one.
5. References
- Gârleanu, Nicolae & Pedersen, Lasse Heje (2013), Dynamic Trading with Predictable Returns and Transaction Costs, Journal of Finance 68(6):2309–2340
- Boyd, Busseti, Diamond, Kahn, Koh, Nystrup & Speth (2017), Multi-Period Trading via Convex Optimization, Foundations and Trends in Optimization 3(1):1–72
- Lobo, Fazel & Boyd (2007), Annals of OR 152:341–365
- Grinold & Kahn (2000), Active Portfolio Management, 2nd ed.
- Clarke, de Silva & Thorley (2002), FAJ 58(5):48–66
6. Connected Graph Bridges
- Back: 03 · Transaction-Cost Models
- Execution bridge: Optimal Execution (Almgren–Chriss) (the within-day version of the ramp) · POV
- Siblings: Robust · Constraints as Robustness (turnover as a -space constraint) · Covariance Shrinkage & RMT (churn from noisy inputs)
- Continue: 05 · Failure Modes & Practice · 06 · Advanced Extensions
- Hub: Index Hub