Closed-Form Beta Distribution Estimation from Sparse Statistics with Random Forest Implicit Regularization
Not on the map. Why?
Abstract (arXiv)
This work advances distribution recovery from sparse data and ensemble classification through three main contributions. First, we introduce a closed-form estimator that reconstructs scaled beta distributions from limited statistics (minimum, maximum, mean, and median) via composite quantile and moment matching. The recovered parameters (α,β), when used as features in Random Forest classifiers, improve pairwise classification on time-series snapshots, validating the fidelity of the recovered distributions. Second, we establish a link between classification accuracy and distributional closeness by deriving error bounds that constrain total variation distance and Jensen-Shannon divergence, the latter exhibiting quadratic convergence. Third, we show that zero-variance features act as an implicit regularizer, increasing selection probability for mid-ranked predictors and producing deeper, more varied trees. A SeatGeek pricing dataset serves as the primary application, illustrating distributional recovery and event-level classification while situating these methods within the structure and dynamics of the secondary ticket marketplace. The UCI handwritten digits dataset confirms the broader regularization effect. Overall, the study outlines a practical route from sparse distributional snapshots to closed-form estimation and improved ensemble accuracy, with reliability enhanced through implicit regularization.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 37 references that are in the map. First posted on arXiv 31 Jul 2025.
Builds on
14 of 37 references.
References · 14
- 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 597
- 2023Bake off redux: a review and experimental evaluation of recent time series classification algorithmscited by 99
- 2024Multistep Distillation of Diffusion Models via Moment Matchingcited by 76
- 2015Explaining the Success of AdaBoost and Random Forests as Interpolating Classifierscited by 45
- 2019Randomization as Regularization: A Degrees of Freedom Explanation for Random Forest Successcited by 30
- 2023Distributional GFlowNets with Quantile Flowscited by 28
- 2023Beta Diffusioncited by 17
- 2023QUANT: A Minimalist Interval Method for Time Series Classificationcited by 15
- 2023Moment Matching Denoising Gibbs Samplingcited by 7
- 2024Hyperparameter Optimization for Randomized Algorithms: A Case Study on Random Featurescited by 7
- 2023Towards black-box parameter estimationcited by 6
- 2024Dataset Condensation with Latent Quantile Matchingcited by 6
Built on by
Not cited yet.