{
  "annotation_id": "66935b12-c69b-4553-a8cc-e3e75557fe51",
  "date_created": "2026-02-17T05:53:07.770000Z",
  "date_modified": "2026-02-17T05:53:07.770000Z",
  "file_hash": "cba3c184daedb6dd35886026bd7bf019d729229d00da6ce99f994d7f50ef8341",
  "private": false,
  "record": {
    "abstract": "Least absolute deviations (LAD) is a statistical optimality criterion widely utilized in scenarios where a minority of measurements are contaminated by outliers of arbitrary magnitudes. In this paper, we delve into the robustness of the variant of adaptive iterative hard thresholding to outliers, known as graded fast hard thresholding pursuit (GFHTP$_1$) algorithm. Unlike the majority of the state-of-the-art algorithms in this field, GFHTP$_1$ does not require prior information about the signal\u0027s sparsity. Moreover, its design is parameterless, which not only simplifies the implementation process but also removes the intricacies of parameter optimization. Numerical experiments reveal that the GFHTP$_1$ algorithm consistently outperforms competing algorithms in terms of both robustness and computational efficiency.",
    "arxiv_id": "2601.06558",
    "authors": [
      "Jiao Xu",
      "Peng Li",
      "Bing Zheng"
    ],
    "categories": [
      "cs.IT",
      "cs.CV",
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Hard Thresholding Pursuit Algorithms for Least Absolute Deviations Problem",
    "url": "https://arxiv.org/abs/2601.06558",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2822e54d-8688-49e8-8212-a7fbfc9d12f3",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}