Skip to content

Minimum redundancy maximum relevance

mRMR balances target relevance against redundant inputs. See MID versus MIQ, a checked scoring example, interaction limits and training-only estimation.

Minimum redundancy maximum relevance (mRMR) is a feature-selection approach that rewards association with the target while penalising overlap with inputs already selected. In a return-forecasting model, several lookback signals may tell much the same story. A slightly weaker signal on its own can therefore be preferred when it brings less redundant information.
It is a feature-selection filter: it scores candidate columns before fitting the final predictor. The classical formulation uses mutual information, which can detect dependence beyond linear correlation. It does not identify causal drivers or promise better trading results.

The next feature must earn its place

Let YY be the target and SS the nonempty set of features already chosen. The mutual-information difference (MID) rule selects the remaining candidate XX with the largest score
MID⁡(X∣S)=I(X;Y)−1∣S∣∑Z∈SI(X;Z).\operatorname{MID}(X\mid S)=I(X;Y)-\frac{1}{|S|}\sum_{Z\in S}I(X;Z).
The first term measures relevance to the target; the second is average pairwise redundancy with selected inputs. Start with the feature having greatest target relevance, then recompute scores after each addition. Peng, Long and Ding (2005), §2.2, give this incremental rule. Greedy additions do not guarantee the globally best predictive subset.
The author’s FAQ, Q1.2 and Q2.5, distinguishes the variants. MIQ divides relevance by average redundancy instead of subtracting it. These are different criteria; a ratio needs an explicit policy for a zero or near-zero denominator. A reported “mRMR ranking” should identify the variant and estimator.

Why B beats A

Suppose one feature ZZ has already been selected. The following are synthetic, already estimated mutual-information values in bits, supplied to illustrate scoring; they are not measurements from market data.
CandidateRelevance to targetRedundancy with ZMID score
A0.50 bits0.40 bits0.10 bits
B0.40 bits0.10 bits0.30 bits
Relevance alone chooses A. MID chooses B: subtracting 0.10 from 0.40 leaves 0.30, whereas A keeps only 0.10 after its larger penalty. These scores are ranking criteria, not predicted returns or forecast-accuracy improvements. For the same inputs, MIQ gives A a ratio of 1.25 and B a ratio of 4; it happens to choose B too, despite using a different rule.
Synthetic supplied estimates in bits: A has relevance 0.50 minus redundancy 0.40, leaving MID 0.10. B has relevance 0.40 minus redundancy 0.10, leaving MID 0.30, so B is selected next.
Synthetic supplied estimates in bits: A has relevance 0.50 minus redundancy 0.40, leaving MID 0.10. B has relevance 0.40 minus redundancy 0.10, leaving MID 0.30, so B is selected next.
Original synthetic scoring example. Solid blue is the MID remainder; the patterned tail is the redundancy deducted from the full relevance bar.

A penalty is not conditional information

Do not read the difference as “the exact information added after conditioning on Z.” For one selected feature, the identity is

I(X;Y∣Z)=I(X;Y)−I(X;Z)+I(X;Z∣Y).I(X;Y\mid Z)=I(X;Y)-I(X;Z)+I(X;Z\mid Y).

MID omits the last term. Pairwise scores can miss useful interactions. Consider two independent fair bits, XX and ZZ, and a target YY that is 1 exactly when the bits differ. Each input alone has zero mutual information with the target, but together they determine it completely: one bit of information. Once Z is known, X provides that entire bit; its MID score is still zero. A zero score therefore need not mean zero conditional usefulness.

Estimate inside the research boundary

Estimated MI depends on the sample and estimation choices. Binning a continuous signal changes the variable being analysed; bin boundaries learned from data belong inside training. With nearest-neighbour estimates, neighbourhood size trades estimation variance against bias. Specify whether variables are discrete or continuous and keep information units consistent.

For example, scikit-learn's current mutual_info_classif documentation reports nats, not bits, and describes a univariate relevance estimator—not a complete mRMR selector. Do not subtract a redundancy estimate in bits from relevance in nats.
Fit the selector separately within every chronological training fold, using only features and completed target outcomes available at that fit time. Any choice of subset size, estimator settings or MID versus MIQ belongs inside development validation, including inner folds when tuning. Selecting columns on the full history before cross-validation leaks held-out information; the official preprocessing guidance demonstrates this failure.
Time-Ordered Train, Validation and Test Design explains eligible labels, refitting schedules and how to keep the entire learned pipeline within its window. Its preview is public; the full lesson requires membership. Assess the resulting predictor on later data, because a compact ranking can still be unstable across market regimes or discard interactions the final model could use.

Sources

Last updated
  • feature selection
  • mutual information
  • mrmr
  • machine learning
  • data leakage
← Back to the glossaryBack to top ↑