Accelerating the pool-adjacent-violators algorithm for isotonic distributional regression
Alexander Henzi, Alexandre Moesching, Lutz Duembgen

TL;DR
This paper presents an improved version of the pool-adjacent-violators algorithm (PAVA) that significantly reduces computation time for estimating stochastically ordered distribution functions by analyzing the dependence of weighted least squares fits.
Contribution
The paper introduces a novel modification to PAVA that accelerates its performance in isotonic distributional regression tasks.
Findings
Reduced computation times for PAVA in distributional regression
Enhanced understanding of weighted least squares dependence
Potential for broader application in stochastic ordering problems
Abstract
In the context of estimating stochastically ordered distribution functions, the pool-adjacent-violators algorithm (PAVA) can be modified such that the computation times are reduced substantially. This is achieved by studying the dependence of antitonic weighted least squares fits on the response vector to be approximated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Control Systems and Identification · Advanced Statistical Methods and Models
