Learning Pareto manifolds in high dimensions: How can regularization help?

Tobias Wegel, Filip Kovačević, Alexandru Ţifrea, Fanny Yang
3/11/2025
stat.MLcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Simultaneously addressing multiple objectives is becoming increasingly important in modern machine learning. At the same time, data is often high-dimensional and costly to label. For a single objective such as prediction risk, conventional regularization techniques are known to improve generalization when the data exhibits low-dimensional structure like sparsity. However, it is largely unexplored how to leverage this structure in the context of multi-objective learning (MOL) with multiple competing objectives. In this work, we discuss how the application of vanilla regularization approaches can fail, and propose a two-stage MOL framework that can successfully leverage low-dimensional structure. We demonstrate its effectiveness experimentally for multi-distribution learning and fairness-risk trade-offs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wegel2025learning,
  title  = {Learning Pareto manifolds in high dimensions: How can regularization help?},
  author = {Tobias Wegel and Filip Kovačević and Alexandru Ţifrea and Fanny Yang},
  year   = {2025},
  eprint = {2503.08849},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.08849v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.08849.svg)](https://codeofpaper.com/paper/2503.08849)

Discussion