CORTEXA
← Browse
arxivcs.CGcs.NEmath.NAmath.OC2026-06-29

Computing the Integral R2 Indicator by Perspective Mapping and Box Decomposition

Michael T. M. Emmerich

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 $(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 $N$ objectives, this gives an output-sensitive overhead $O(2^N M)$ for an $M$-box decomposition, or $O(M)$ for fixed $N$. Using existing box-decomposition approaches, the integral R2 can be computed in $O(n \log n)$ for $N=2,3$, in $O(n^2)$ for $N=4$, and in $O\left(n^{\lfloor (N-1)/2\rfloor+1}\right)$ for $N\geq4$, with $n$ denoting the size of the approximation set. On the lower-bound side, exact value computation has an $Ω(n\log n)$ lower bound in the algebraic decision-tree model already in two objectives, this bound lifts to every fixed $N\geq2$, and exact computation is $\#P$-hard when $N$ 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.

View free PDFSource page

Related papers

arxivmath.OCcs.LGcs.NEmath.NA2026-07-16

Fast and Scalable Caputo Fractional Gradient Descent via Perturbation-Preserving Memory Compression

Hwanseo Lee, Junseo Lee, Hyunju Kim

Fractional gradient descent (FGD) incorporates long-range memory through Caputo-type operators and has been shown to improve stability in ill-conditioned and nonconvex optimization problems. Despite these advantages, its practical use remains limited, mainly due to the high compu…

View free PDFSource page
arxivmath.OCcs.AIcs.DCmath.NA2026-07-08

POO-LPSP: Parallel Osprey Optimized Least Penalty-Squared Prioritization Methods for Priority Derivation in the Analytic Hierarchy Process

Kevin Kam Fung Yuen

Pairwise comparison (PC) via pairwise reciprocal matrices (PRMs) is central to the Analytic Hierarchy Process (AHP). Although the traditional eigenvector method is widely applied to derive priorities, its theoretical robustness in reflecting true priority vectors remains debated.…

View free PDFSource page
arxivcs.DMcs.NEmath.OC2026-07-13

Representing the Non-dominated Set of Multi-objective Network Problems by Supported Non-dominated Points

David Könen, Lara Löhken, Michael Stiglmayr

In multi-objective combinatorial optimization, unsupported non-dominated points typically outnumber supported points and are often significantly more challenging to compute. Recent studies show that extreme supported non-dominated points provide high-quality representations of th…

View free PDFSource page
arxivcs.CEcs.CGeess.SYmath.NA2026-07-07

A Decomposition-Based Framework for Joint Optimization and Spatial Packaging of Interconnected Systems with Physical Interactions

Julian Bückmann, Jorn van Kampen, Theo Hofman

This paper presents an approach and application of optimization of spatial packaging of interconnected systems with physical interactions (SPI2) in three-dimensional component placement problems. To enable its application for an automotive use case, SPI2 must support both initial…

View free PDFSource page
arxivcs.LGmath.NAmath.OC2026-07-08

An optimal control approach for neural network architecture adaptation with a posteriori error estimation

C G Krishnanunni, Thomas Scott, Tan Bui-Thanh

This work presents a novel approach for adapting neural network architecture along the depth based on a posteriori error estimation. By formulating neural network training as a continuous-time optimal control problem, we derive rigorous error estimates that quantify how approxima…

View free PDFSource page