English

L2P: Learning to Place for Estimating Heavy-Tailed Distributed Outcomes

Machine Learning 2023-10-13 v3 Data Structures and Algorithms Machine Learning

Abstract

Many real-world prediction tasks have outcome variables that have characteristic heavy-tail distributions. Examples include copies of books sold, auction prices of art pieces, demand for commodities in warehouses, etc. By learning heavy-tailed distributions, "big and rare" instances (e.g., the best-sellers) will have accurate predictions. Most existing approaches are not dedicated to learning heavy-tailed distribution; thus, they heavily under-predict such instances. To tackle this problem, we introduce Learning to Place (L2P), which exploits the pairwise relationships between instances for learning. In its training phase, L2P learns a pairwise preference classifier: is instance A > instance B? In its placing phase, L2P obtains a prediction by placing the new instance among the known instances. Based on its placement, the new instance is then assigned a value for its outcome variable. Experiments on real data show that L2P outperforms competing approaches in terms of accuracy and ability to reproduce heavy-tailed outcome distribution. In addition, L2P provides an interpretable model by placing each predicted instance in relation to its comparable neighbors. Interpretable models are highly desirable when lives and treasure are at stake.

Keywords

Cite

@article{arxiv.1908.04628,
  title  = {L2P: Learning to Place for Estimating Heavy-Tailed Distributed Outcomes},
  author = {Xindi Wang and Onur Varol and Tina Eliassi-Rad},
  journal= {arXiv preprint arXiv:1908.04628},
  year   = {2023}
}

Comments

9 pages, 6 figures, 2 tables Nature of changes from previous version: 1. Added complexity analysis in Section 2.2 2. Datasets change 3. Added LambdaMART in the baseline methods, also a brief discussion on why LambdaMart failed in our problem. 4. Figure updates

R2 v1 2026-06-23T10:46:18.298Z