Explorerβ€ΊMathematicsβ€ΊMathematics
Research PaperResearchia:202606.30029

Computing the Integral R2 Indicator by Perspective Mapping and Box Decomposition

Michael T. M. Emmerich

Abstract

The continuous integral R2 indicator is a Pareto-compliant refinement of the classical finite-weight-vector R2 indicator, used in performance assessment, bounded archiving for a-posteriori multi-objective optimization, and skyline selection in databases. This work introduces a bidirectional perspective mapping between continuous integral R2 computation and integration over unions of anchored axis-aligned boxes. After translating the ideal point of a minimization problem to the origin, approximat...

Submitted: June 30, 2026Subjects: Mathematics; Mathematics

Description / Details

The continuous integral R2 indicator is a Pareto-compliant refinement of the classical finite-weight-vector R2 indicator, used in performance assessment, bounded archiving for a-posteriori multi-objective optimization, and skyline selection in databases. This work introduces a bidirectional perspective mapping between continuous integral R2 computation and integration over unions of anchored axis-aligned boxes. After translating the ideal point of a minimization problem to the origin, approximation points become strictly positive loss vectors, and the subgraph of the lower weighted Tchebycheff envelope over the weight simplex maps to the complement of an anchored-box union in reciprocal objective space. The Jacobian gives an absolute R2 formula as a weighted complement volume with density (x1+β‹―+xN)βˆ’(N+1)(x_1+\cdots+x_N)^{-(N+1)}, while differences of R2 values become finite weighted hypervolume differences. Hence, hypervolume algorithms that emit box decompositions can be reused by replacing ordinary box volumes with closed-form weighted box integrals. For NN objectives, this gives an output-sensitive overhead O(2NM)O(2^N M) for an MM-box decomposition, or O(M)O(M) for fixed NN. Using existing box-decomposition approaches, the integral R2 can be computed in O(nlog⁑n)O(n \log n) for N=2,3N=2,3, in O(n2)O(n^2) for N=4N=4, and in O(n⌊(Nβˆ’1)/2βŒ‹+1)O\left(n^{\lfloor (N-1)/2\rfloor+1}\right) for Nβ‰₯4N\geq4, with nn denoting the size of the approximation set. On the lower-bound side, exact value computation has an Ξ©(nlog⁑n)Ξ©(n\log n) lower bound in the algebraic decision-tree model already in two objectives, this bound lifts to every fixed Nβ‰₯2N\geq2, and exact computation is #P\#P-hard when NN is part of the input. Together, the proposed perspective mapping provides a powerful tool for transferring algorithmic and structural results between anchored-box union and hypervolume theory and integral R2 computation.


Source: arXiv:2606.30530v1 - http://arxiv.org/abs/2606.30530v1 PDF: https://arxiv.org/pdf/2606.30530v1 Original Link: http://arxiv.org/abs/2606.30530v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Jun 30, 2026
Topic:
Mathematics
Area:
Mathematics
Comments:
0
Bookmark