Database
SURFACE: Preference Distribution Matching on Pareto Fronts via Scalarization Steering
arXiv stat.ML0 views
arXiv:2611.17484v1 Announce Type: cross 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 advance.To 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.
Source:https://arxiv.org/abs/2611.17484PreviousDistributionally Robust Risk Evaluation with Low-Rank PerturbationsNextHomogeneous pursuit in $\beta$ model
Related posts

SQL Challenge : ROW_NUMBER() vs RANK() vs DENSE_RANK() – What's the Difference?
0dev.to Database
Why we don't offer a free database, and what we built instead
0dev.to Database
Listing Even Cycles Faster than the Submodular-Width Barrier
0arXiv cs.DB
LuthorSQL: A One-Pass Text-to-SQL Model as System 1 for a Slower LLM Agent
0arXiv cs.DB
MEM-SQL: Memory-Empowered Text-to-SQL
0arXiv cs.DB
Query Processing with eBPF-Offload on Computational Storage
0arXiv cs.DB