Random rotation applies a randomly selected rotation matrix to input feature vectors before modeling. Because the square orthogonal matrix preserves vector lengths and angles, the transformation is reversible and keeps the data geometrically equivalent. section 5.2.3
Comparing tabular models
Rotate a tabular dataset, then compare gradient-boosted decision trees with a deep neural network. Deep architectures may outperform after rotation because they can learn rotated signals, while tree models rely on axis-oriented splitting rules. Treat this result as evidence of a limitation in the tree model, not automatic proof that deep learning is superior. section 5.2.3
Use random rotation when you need to:
- Test model sensitivity to feature orientation. section 5.2.3
- Improve ensemble diversity or robustness. section 5.2.3
- Address rotation-invariance requirements in computer vision or quantum chemistry. section 5.2.3
