{
  "annotation_id": "fd4e8e1e-1f3d-4dc2-a476-c06aa85a8eff",
  "date_created": "2026-02-17T05:53:11.347000Z",
  "date_modified": "2026-02-17T05:53:11.347000Z",
  "file_hash": "16942f23e9c17ed1c891e6596e2a2f10780b3a6674c63956b3f2c65a232ce692",
  "private": false,
  "record": {
    "abstract": "Decision trees are powerful machine learning algorithms, widely used in fields such as economics and medicine for their simplicity and interpretability. However, decision trees such as CART are prone to overfitting, especially when grown deep or the sample size is small. Conventional methods to reduce overfitting include pre-pruning and post-pruning, which constrain the growth of uninformative branches. In this paper, we propose a complementary approach by introducing a covariance-driven splitting criterion for regression trees (CovRT). This method is more robust to overfitting than the empirical risk minimization criterion used in CART, as it produces more balanced and stable splits and more effectively identifies covariates with true signals. We establish an oracle inequality of CovRT and prove that its predictive accuracy is comparable to that of CART in high-dimensional settings. We find that CovRT achieves superior prediction accuracy compared to CART in both simulations and real-world tasks.",
    "arxiv_id": "2601.07281",
    "authors": [
      "Likun Zhang",
      "Wei Ma"
    ],
    "categories": [
      "stat.ML",
      "cs.LG",
      "stat.ME"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Covariance-Driven Regression Trees: Reducing Overfitting in CART",
    "url": "https://arxiv.org/abs/2601.07281",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "703426d1-14ae-4075-b31b-1af86d5728a2",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}