The Magnitude of Dominated Sets: A Pareto Compliant Indicator Grounded in Metric Geometry
- URL: http://arxiv.org/abs/2604.18147v1
- Date: Mon, 20 Apr 2026 12:10:12 GMT
- Title: The Magnitude of Dominated Sets: A Pareto Compliant Indicator Grounded in Metric Geometry
- Abstract summary: Magnitude is a notion of size or point content for compact metric spaces.<n>For dominated regions in the (ell_1) box setting, magnitude is close to hypervolume.<n>Unlike hypervolume, magnitude assigns positive value to boundary points sharing one or more coordinates with the anchor point.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We investigate \emph{magnitude} as a new unary and strictly Pareto-compliant quality indicator for finite approximation sets to the Pareto front in multiobjective optimization. Magnitude originates in enriched category theory and metric geometry, where it is a notion of size or point content for compact metric spaces and a generalization of cardinality. For dominated regions in the \(\ell_1\) box setting, magnitude is close to hypervolume but not identical: it contains the top-dimensional hypervolume term together with positive lower-dimensional projection and boundary contributions. This paper gives a first theoretical study of magnitude as an indicator. We consider multiobjective maximization with a common anchor point. For dominated sets generated by finite approximation sets, we derive an all-dimensional projection formula, prove weak and strict set monotonicity on finite unions of anchored boxes, and thereby obtain weak and strict Pareto compliance. Unlike hypervolume, magnitude assigns positive value to boundary points sharing one or more coordinates with the anchor point, even when their top-dimensional hypervolume contribution vanishes. We then formulate projected set-gradient methods and compare hypervolume and magnitude on biobjective and three-dimensional simplex examples. Numerically, magnitude favors boundary-including populations and, for suitable cardinalities, complete Das--Dennis grids, whereas hypervolume prefers more interior-filling configurations. Computationally, magnitude reduces to hypervolume on coordinate projections; for fixed dimension this yields the same asymptotic complexity up to a factor \(2^d-1\), and in dimensions two and three \(Θ(n\log n)\) time. These results identify magnitude as a mathematically natural and computationally viable alternative to hypervolume for finite Pareto front approximations.
Related papers
- Hyper-Fold: Exploring the Expressive Limit of Sequence-Geometry Learning for Proteins via Hypergraph Modeling [55.36837305276515]
We show that the complete bilinear operator over content-geometry outer products--the sufficient statistic of all second-order interactions--is the expressive ceiling.<n>We then introduce Hyper-Fold, a rank-K separable convolutional backbone approaching this ceiling at message-passing cost.
arXiv Detail & Related papers (2026-08-29T11:43:25Z) - Equi-Entropic Maps for Four-Partite Quantum States [0.0]
We investigate a weaker form of entanglement for four-party systems of local dimension $d>2$.<n>We introduce a linear map $$ that enforces exact equality of entropies under reshuffling and partial transposition.<n>For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs.
arXiv Detail & Related papers (2026-07-28T16:40:40Z) - Dynamics of Gradient Descent with Large Step Size Near a Manifold of Flat Minima [39.50927136881194]
An important quantity in the theory of gradient descent (GD) is the emphsharpness, defined as the largest eigenvalue of the objective Hessian.<n>Recent work bridges this gap in the setting of overparametrised least-squares with a emphsingle scalar output<n>We show that our framework applies to deep matrix factorisation under mild assumptions, yielding several new structural results.
arXiv Detail & Related papers (2026-07-09T11:58:44Z) - Dimension Reduction for Curves: Simplified and Generalized [56.23281156053955]
We revisit random projections for reducing the dimension of high-dimensional polygonal curves.<n>We give a simplified proof of the known $O(varepsilon-2log(nm))$ bound on the target dimension of a random projection.<n>Our proof is based on the concept of sparse oblivious subspace embeddings.
arXiv Detail & Related papers (2026-07-03T08:48:35Z) - Representational Capacity: Geometric Limits on Feature Representation in Transformer Language Models [51.56484100374058]
We develop a framework for estimating how many near-orthogonal directions a model can support.<n>Applying this metric across dozens of open-source models reveals two classes: models with high $varepsilon$ whose embeddings lack near-orthogonal structure, and models with low $varepsilon$ that maintain it.
arXiv Detail & Related papers (2026-06-01T18:28:56Z) - Intrinsic Wasserstein Rates for Score-Based Generative Models on Smooth Manifolds [61.14405512940818]
We show that Score-based generative models are trained in high-dimensional ambient spaces.<n>We use a ReLU implementation of nearest-projection coordinates via finite intrinsic anchors and Gauss Newton.
arXiv Detail & Related papers (2026-05-15T10:20:05Z) - Nonsmooth Set-Gradient Ascent to the Pareto Front via Layered Hypervolume and Magnitude Indicators [0.0]
A nonsmooth set-gradient ascent method is developed for moving finite approximation sets toward the Pareto front.<n>Two base indicators are treated: the hypervolume indicator and the magnitude indicator of the dominated set.<n>For finite-$$ surrogates, the main nonsmoothness mechanisms are isolated and chamberwise Lipschitz continuity on bounded sets is proved.
arXiv Detail & Related papers (2026-05-13T12:55:22Z) - Higher-order Topological Parity Anomaly and Half-integer Hall Effect in High-dimensional Synthetic Lattices [0.4374837991804086]
parity anomaly and associated textithalf-integer quantized Hall conductance can be realized by the boundary states of $n$-th order topological insulators.<n>Our work offers the realization and characterization of parity anomaly in general high-dimensional higher-order topological insulators.
arXiv Detail & Related papers (2025-05-12T18:44:54Z) - Gaussian Entanglement Measure: Applications to Multipartite Entanglement
of Graph States and Bosonic Field Theory [50.24983453990065]
An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers.
We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states.
By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
arXiv Detail & Related papers (2024-01-31T15:50:50Z) - Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and
Optimal Algorithms [64.10576998630981]
We show the first tight characterization of the optimal Hessian-dependent sample complexity.
A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances.
The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
arXiv Detail & Related papers (2023-06-21T17:03:22Z) - Normalizing flows for lattice gauge theory in arbitrary space-time
dimension [135.04925500053622]
Applications of normalizing flows to the sampling of field configurations in lattice gauge theory have so far been explored almost exclusively in two space-time dimensions.
We discuss masked autoregressive with tractable and unbiased Jacobian determinants, a key ingredient for scalable and exact flow-based sampling algorithms.
For concreteness, results from a proof-of-principle application to SU(3) gauge theory in four space-time dimensions are reported.
arXiv Detail & Related papers (2023-05-03T19:54:04Z) - Holographic properties of superposed quantum geometries [0.0]
We study the holographic properties of a class of quantum geometry states characterized by a superposition of discrete geometric data.
This class includes spin networks, the kinematic states of lattice gauge theory and discrete quantum gravity.
arXiv Detail & Related papers (2022-07-15T17:37:47Z) - Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix.
Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z) - Superposed Random Spin Tensor Networks and their Holographic Properties [0.0]
We study boundary-to-boundary holography in a class of spin network states defined by analogy to projected entangled pair states (PEPS)
We consider superpositions of states corresponding to well-defined, discrete geometries on a graph.
arXiv Detail & Related papers (2022-05-19T12:24:57Z) - Multipartitioning topological phases by vertex states and quantum
entanglement [9.519248546806903]
We discuss multipartitions of the gapped ground states of (2+1)-dimensional topological liquids into three spatial regions.
We compute various correlation measures, such as entanglement negativity, reflected entropy, and associated spectra.
As specific examples, we consider topological chiral $p$-wave superconductors and Chern insulators.
arXiv Detail & Related papers (2021-10-22T18:01:24Z) - The role of regularization in classification of high-dimensional noisy
Gaussian mixture [36.279288150100875]
We consider a high-dimensional mixture of two Gaussians in the noisy regime.
We provide a rigorous analysis of the generalization error of regularized convex classifiers.
We discuss surprising effects of the regularization that in some cases allows to reach the Bayes-optimal performances.
arXiv Detail & Related papers (2020-02-26T14:54:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.