pith. sign in
Pith Number

pith:7JVW7MQ7

pith:2026:7JVW7MQ7KD7ONX7VG6APWPLAXY
not attested not anchored not stored refs resolved

Statistical Unlearning of Distributions: A Hypothesis Testing Approach

Aaradhya Pandey, Sanjeev Kulkarni

A hypothesis test comparing edited data to desired and unwanted distributions supplies a criterion for choosing which samples to remove when unlearning entire domains.

arxiv:2605.16645 v1 · 2026-05-15 · math.ST · cs.IT · cs.LG · math.IT · stat.ML · stat.TH

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{7JVW7MQ7KD7ONX7VG6APWPLAXY}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We formalize this using a hypothesis test of the edited data with the desired and unwanted domains, leading to an interpretable and robust criterion for selecting samples to remove. Within this statistical framework, we characterize the fundamental region of the allowable edited data distributions and the removal-preservation Pareto frontier for a broad class of distribution families.

C2weakest assumption

Domains of information can be accurately modeled as probability distributions, and a hypothesis test between the edited dataset and the desired versus unwanted distributions provides a sufficient criterion for sample removal that preserves performance on the target domain.

C3one line summary

A hypothesis testing approach to distributional unlearning that characterizes allowable edited distributions and removal-preservation Pareto frontiers for parametric and nonparametric families including Gaussians, Poisson, and Gaussian white noise.

References

13 extracted · 13 resolved · 0 Pith anchors

[1] Sangamesh Kodge, Gobinda Saha, and Kaushik Roy 2024
[2] Vladimir Koltchinskii and Martin Wahl 2023 · doi:10.1007/978-3-031-26979-0_15
[3] T(t 1 +X, t 2 +X)(x) =F F −1(1−x)−δ =T(t 2 +X, t 1 +X)(x).(25) So,T(t 1 +X, t 2 +X)(x) =T(X, δ+X)(x) =T(δ+X, X)(x)(26)
[4] Thenε 1 ≤ε 2 if and only if fX,ε1(x)≥f X,ε2(x)for allx∈[0,1].(27) Intuition and importance:The proof of this lemma is along the same lines of the proof given in Dong et al 2022
[5] There exists a Markov kernel 3 R : (W,F W)→(W ′,F W ′)such that R◦P=P ′ andR◦Q=Q ′,where for a probability distribution p on (W,F W), we define the probability distribution R◦p as R◦p(A ′) := Z W R(w, 2022

Formal links

2 machine-checked theorem links

Receipt and verification
First computed 2026-05-20T00:02:34.135065Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

fa6b6fb21f50fee6dff53780fb3d60be07392612b84d96c983fb42366df961c1

Aliases

arxiv: 2605.16645 · arxiv_version: 2605.16645v1 · doi: 10.48550/arxiv.2605.16645 · pith_short_12: 7JVW7MQ7KD7O · pith_short_16: 7JVW7MQ7KD7ONX7V · pith_short_8: 7JVW7MQ7
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/7JVW7MQ7KD7ONX7VG6APWPLAXY \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: fa6b6fb21f50fee6dff53780fb3d60be07392612b84d96c983fb42366df961c1
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "f8f4f8d837ff4722cdd7fe6dae8a1c16ac4b9e5fd4886e3856dad02d542eb934",
    "cross_cats_sorted": [
      "cs.IT",
      "cs.LG",
      "math.IT",
      "stat.ML",
      "stat.TH"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "math.ST",
    "submitted_at": "2026-05-15T21:33:38Z",
    "title_canon_sha256": "0bac3f9c2c2fabee2359b15caeb17b03ee20ee175c4999bb8075d9ce849a1708"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16645",
    "kind": "arxiv",
    "version": 1
  }
}