Pith Number

pith:VYSY4OO7

pith:2025:VYSY4OO7JRXIH3HT3SWUEIEYPM

not attested not anchored not stored refs pending

ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learning

Chen Chu, Fan Zhang, Liping Wang Fei Chen, Ruiduan Li, Yihong Huang, Yu Lin, Zhihao Li

ShuffleGate estimates importance of feature components by training gates on sensitivity to their random shuffling across batches, unifying feature selection, dimension selection, and embedding compression.

arxiv:2503.09315 v6 · 2025-03-12 · cs.LG

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{VYSY4OO7JRXIH3HT3SWUEIEYPM}

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

Our gating module can be seamlessly applied at the feature field, dimension, or embedding-entry level, enabling a unified solution to feature selection, dimension selection, and embedding compression. Experiments on four public recommendation benchmarks show that ShuffleGate achieves state-of-the-art results on all three tasks.

C2weakest assumption

That randomly shuffling a component across the batch produces an information-loss signal whose magnitude is a faithful and unbiased measure of that component's true importance to the downstream task, without the shuffling process itself introducing artifacts that the gate then learns to exploit.

C3one line summary

ShuffleGate learns polarized importance gates by measuring model sensitivity to random component shuffling, unifying feature selection, dimension selection, and embedding compression with SOTA results on four recommendation benchmarks.

Receipt and verification

First computed	2026-06-01T02:03:19.982440Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

ae258e39df4c6e83ecf3dcad4220987b14412ac216701443da361e69da2728e3

Aliases

arxiv: 2503.09315 · arxiv_version: 2503.09315v6 · doi: 10.48550/arxiv.2503.09315 · pith_short_12: VYSY4OO7JRXI · pith_short_16: VYSY4OO7JRXIH3HT · pith_short_8: VYSY4OO7

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/VYSY4OO7JRXIH3HT3SWUEIEYPM \
  | 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: ae258e39df4c6e83ecf3dcad4220987b14412ac216701443da361e69da2728e3

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "b0ca564f840950b6213cd75b0a56423b222544820ed8b214aa22096278684a4f",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2025-03-12T12:05:03Z",
    "title_canon_sha256": "035ca5554c06f5a37db11d02e865d812b9e6963443bc39f5cbc72f27fd15681e"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2503.09315",
    "kind": "arxiv",
    "version": 6
  }
}