Skip to content
AI News HubLIVE
Original source2 min read

SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering

Summary

SURFACE introduces an adaptive scalarization weight update method that estimates the mapping between weight grid regions and Pareto front areas to allocate a finite number of solutions according to a desired preference distribution. Theoretical analysis shows linear convergence to a finite-resolution error floor, and experiments demonstrate improved target-mass balance and Pareto front coverage over baselines.

SourcearXiv Machine LearningAuthor: Liuyuan Jiang, Prasanna Sattigeri, Lisha Chen
SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 12 Nov 2026]

Title:SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering

View a PDF of the paper titled SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering, by Liuyuan Jiang and 2 other authors

View PDF HTML (experimental)

Abstract:Constructing a finite Pareto representation requires allocating a limited number of solutions across the Pareto front (PF). A desired preference distribution specifies this allocation by assigning more solutions to some PF regions and fewer to others. Scalarization generates Pareto solutions by varying objective weights and solving single-objective problems. However, a distribution of scalarization weights generally does not translate into the same distribution of Pareto solutions along the PF, because the weight-to-solution map is nonlinear and unknown in this http URL account for this distortion, we introduce SURFACE (Scalarization Updates for Redistributing Finite Approximations with Chart Estimation}), which adaptively updates scalarization weights to match a desired PF distribution. SURFACE estimates how each region of the weight grid corresponds to an area of the PF from the current scalarized solutions, then redistributes the weights accordingly. The method supports parallel, warm-started, inexact optimization with standard single-objective solvers. Theoretically, we establish that, under the stated regularity conditions, SURFACE achieves linear convergence of the preference distribution mismatch to a finite-resolution error floor of $\mathcal{O}(N^{-2/(M-1)})$, where $N$ is the number of adaptive weights and $M$ is the number of objectives. Empirically, experiments across multiple benchmarks demonstrate improved target-mass balance and PF coverage compared with established baselines.

Subjects:

Machine Learning (cs.LG); Optimization and Control (math.OC); Machine Learning (stat.ML)

Cite as: arXiv:2611.17484 [cs.LG]

(or arXiv:2611.17484v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.17484

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Liuyuan Jiang [view email] [v1] Thu, 12 Nov 2026 20:14:55 UTC (5,320 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering, by Liuyuan Jiang and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cs math math.OC stat stat.ML

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • SURFACE adaptively updates scalarization weights to match a desired Pareto front distribution by estimating the weight-to-solution map.
  • The method achieves linear convergence of the preference distribution mismatch to an error floor of O(N^{-2/(M-1)}) under regularity conditions.
  • It supports parallel, warm-started, inexact optimization with standard single-objective solvers.
  • Experiments across benchmarks show better target-mass balance and PF coverage compared with established baselines.

Highlights and analysis are generated automatically and may contain errors. Check the original source.