Approximating Pareto Frontiers in Stochastic Multi-Objective Optimization via Hashing and Randomization
Jinzhao Li, Nan Jiang, Yexiang Xue

TL;DR
This paper introduces XOR-SMOO, an efficient algorithm for approximating Pareto frontiers in stochastic multi-objective optimization, providing tight guarantees with polynomially many SAT oracle queries.
Contribution
XOR-SMOO is a novel algorithm that achieves multiplicative approximation of Pareto frontiers in intractable SMOO problems using poly-logarithmic SAT oracle queries.
Findings
XOR-SMOO outperforms baselines in real-world problems.
It provides tight approximation guarantees with polynomial queries.
Solutions are more evenly distributed and cover the optimal frontier better.
Abstract
Stochastic Multi-Objective Optimization (SMOO) is critical for decision-making trading off multiple potentially conflicting objectives in uncertain environments. SMOO aims at identifying the Pareto frontier, which contains all mutually non-dominating decisions. The problem is highly intractable due to the embedded probabilistic inference, such as computing the marginal, posterior probabilities, or expectations. Existing methods, such as scalarization, sample average approximation, and evolutionary algorithms, either offer arbitrarily loose approximations or may incur prohibitive computational costs. We propose XOR-SMOO, a novel algorithm that with probability , obtains -approximate Pareto frontiers () for SMOO by querying an SAT oracle poly-log times in and . A -approximate Pareto frontier is only below the true frontier by a fixed,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
