{
  "annotation_id": "e5524575-3464-49a6-b9ea-d458971c977e",
  "date_created": "2026-02-17T05:53:08.721000Z",
  "date_modified": "2026-02-17T05:53:08.721000Z",
  "file_hash": "9522ea3755509548df993a388e928046554f56b85a79add162966f53349b1362",
  "private": false,
  "record": {
    "abstract": "Learning robust and generalisable abstractions from high-dimensional input data is a central challenge in machine learning and its applications to high-energy physics (HEP). Solutions of lower functional complexity are known to produce abstractions that generalise more effectively and are more robust to input perturbations. In complex hypothesis spaces, inductive biases make such solutions learnable by shaping the loss geometry during optimisation. In a HEP classification task, we show that a soft symmetry respecting inductive bias creates approximate degeneracies in the loss, which we identify as pseudo-Goldstone modes. We quantify functional complexity using metrics derived from first principles Hessian analysis and via compressibility. Our results demonstrate that solutions of lower complexity give rise to abstractions that are more generalisable, robust, and efficiently distillable.",
    "arxiv_id": "2601.06584",
    "authors": [
      "Maciej Glowacki"
    ],
    "categories": [
      "cs.LG",
      "hep-ex"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Softly Induced Functional Simplicity: Implications for Neural Network Generalisation, Robustness, and Distillation",
    "url": "https://arxiv.org/abs/2601.06584",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3e2fae95-28ce-49d5-8684-beeba4139d69",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}