1994issue C061-6
Walk-forward evaluation of genetic index rules
A one-day index rule search is specified as four coupled choices of encoding, fitness, reproduction, and replacement. Candidates could compare the prior ten highs, lows, and closes, had to abstain when those conditions failed, and were reselected on windows that stepped forward so confirmation never reused the discovery sample.
- System-optimization here is a population search under one encoding, one fitness score, and one variation scheme.
- Rule-representation allowed only greater-than and less-than comparisons among the prior ten highs, lows, and closes, so candidates could not subtract or divide prices.
- Abstention left a session untraded, and left statistics unchanged, unless every listed condition held.
- Walk-forward-analysis retrained and reselected as the windows stepped forward, and robustness-testing asked whether that same procedure still yielded a usable signal on separate confirmation samples.
Four coupled choices
A one-day index rule search is specified as four coupled choices: how candidates are encoded, how fitness is scored, which candidates reproduce, and how mutation and crossover generate replacements. System-optimization, in that setting, is the search of a population of candidate entry, exit, and abstention rules under one stated encoding, fitness score, and variation scheme.
Locked comparisons and abstention
Candidates were limited to lists of greater-than and less-than comparisons among the prior ten sessions of high, low, and close. The search could not invent rules that subtract or divide prices. That constraint is the rule-representation: the limited language of comparisons a candidate is allowed to read from price history.
Every listed condition had to hold before a candidate issued its next-session rise forecast. On other sessions the candidate used abstention, leaving the session untraded, and its statistics were left unchanged.
Fitness, selection, and variation
Fitness is a single score that ranks candidates by combining how often they fire with the average subsequent move. In this workflow it was the product of trade count raised to 0.7 and the average subsequent index move, placing sparse large moves and frequent small moves on one scale.
Selection copied each candidate in proportion to its fitness divided by the population average, eliminating very weak candidates and duplicating very strong ones before variation. Mutation replaced one condition at random. Crossover swapped condition blocks at a split, and two split points could leave an offspring with a different number of conditions than either parent.
Windows that step forward
Rules were discovered on a 1,000-observation training window. The survivor was chosen on a separate 500-observation tuning-window, a sample unused by search and used only to pick which trained candidate proceeds to confirmation. Confirmation statistics were taken on a 10-session test window.
Those three windows then advanced by 10 sessions and the search was rerun. The 500-session and 100-session summaries were averages across 50 and 10 such shifts. Walk-forward-analysis is that retraining and reselection on windows that step forward, so confirmation never uses the observations that created the rule.
Discovery and confirmation stay apart
Discovery and confirmation used different observations because scoring a rule on the same sample that created it can overstate quality. The middle window existed to limit that overfitting before the final window was scored. Robustness-testing checks whether that same search-and-selection procedure still yields a usable signal after the windows move and after discovery and confirmation stay on separate samples.
All readings on this track · 51 readings
- 1986Degrees of freedom in trading system optimization
- 1988Walk-forward and neighborhood tests after optimization
- 1988Undisclosed rules block system robustness tests
- 1988Testing re-optimization calendars against random parameter controls
- 1989Binary search limits on multi-peak average grids
- 1989Parameter neighborhoods that survive a shift
- 1990Use profit mapping to keep a cycle and stop plateau
- 1990Why popular indicator optimization fails robustness
- 1991Retesting weighted indicator balances across horizons
- 1992Constructing forecast models with regression, walk-forward, and robustness
- 1992Diagnose regimes before you lock parameters
- 1992When stops change system timing
- 1993Walk-forward halt rules for forecast models
- 1994Walk-forward evaluation of genetic index rules
- 1995Input pruning as walk-forward system evaluation
- 1995Critiquing neural nets as incomplete trading systems
- 1996Rebuild the equity-path ratio before it ranks a designed system
- 1996Parameter grids can fit random walks
- 1996Walk-forward analysis belongs in the design of a mechanical trading system
- 1997When a holdout fails, discard the rule set
- 1997Test rewarded rule breaks before replacing the system
- 1997Walk-forward rules keep system research from rewriting live trades
- 1999Keep a channel-breakout to two lookbacks and test neighbor stability
- 1999Constant investment size in stock system evaluation
- 2000Forcing optimization maps mechanical system failure boundaries
- 2000Robust parameter selection with surface charts
- 2001A two-gate classroom test for a two-window momentum trend filter
- 2002How a two-sided continuation factor becomes a testable trend rule
- 2002Evaluating two-window trend intensity as a reversal rule
- 2003Discounting speculative bubbles in system robustness tests
- 2003Walk-forward evaluation of locked stochastic oscillator rules
- 2003Critiquing mechanical system design after extreme price regimes
- 2004Evaluating a two-window trend trigger
- 2005Grade backtested signals with holdouts and optimization plateaus
- 2006Reserved-sample evaluation of trading system design
- 2006Walk-forward critique of hindsight crossover systems
- 2008Condition-matched walk-forward evaluation for mechanical systems
- 2011Session-split evaluation of regular and overnight systems
- 2012Walk-forward evaluation as operator rehearsal
- 2013Two-window evaluation of mechanical trading systems
- 2013Walk-forward filter selection for repeated-median velocity
- 2014Walk-forward evaluation for fading-memory velocity systems
- 2015Test oscillator events before tuning rules
- 2016Walk-forward evaluation of a five-parameter parabolic stop-and-reversal
- 2016Walk-forward optimization without curve fitting
- 2017Optimization without overfitting in trend-system evaluation
- 2017Parameter stability is a better guide than a larger crossover grid
- 2018Point-in-time universes for system evaluation
- 2018Walk-forward robustness evaluation for optimized systems
- 2018Critiquing breakout systems through robustness tests
- 2018A critique of parameter fitting in system design