Enhancing Tail NFT Recommendation via Dependency-Aware Extreme Multi-Label Learning
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
With the rise of Web3, Non-Fungible Tokens (NFTs) have become a new class of digital assets, driving demand for large-scale NFT recommendation systems. Each NFT can be associated to a rich set of semantic, stylistic, and thematic labels, forming a highly complex label space. Similar to e-commerce platforms where detailed product labels enable personalized recommendations, such semantic dependencies between labels can potentially enhance NFT recommendation performance. Thus, NFT recommendation can be naturally formulated as an extreme multi-label (XML) classification problem. Many existing probabilistic label tree (PLT)-based approaches address XML problem by recursively partitioning the label space, which greatly alleviates the demands on expensive computer resources. Yet, the highly skewed distribution of labels in datasets in XML makes tail labels more challenging to predict than head labels. In this paper, Our preliminary analysis reveals that inherent label dependencies can be leveraged to improve tail label recommendations for NFTs. We propose ChainTail, a dependency-aware framework that enhances PLT-based NFT label partitioning and prediction re-scoring. It includes: (1) a Dependency-aware partition module that partitions highly dependent NFT labels into subsets. (2) a Dependency-aware ReScore module that re-ranks prediction scores of labels to eliminate the label-priors. Our experimental results show that ChainTail boosts tail label recommendation on widely used item recommendation datasets.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it