A rotation matrix is a square matrix that rotates input-feature vectors while preserving their lengths and the angles between them. Because the transformation is perfectly reversible, rotated data remains equivalent to the original data. section 5.2.3
In machine learning, random rotations can:
- Transform dataset features before model training. section 5.2.3
- Increase ensemble diversity and improve robustness. section 5.2.3
- Expose differences between model families: deep architectures can learn the applied rotation, while gradient-boosted decision trees depend on feature-aligned splitting rules. section 5.2.3
Rotating tabular features
Apply a random rotation matrix to tabular input features before training. The transformation preserves geometric relationships, but may obscure predictor–target relationships for tree-based algorithms. Deep architectures are less affected because they can learn rotated signals. section 5.2.3

