MOSS: Multi-Objective Optimization for Stable Rule Sets
Brian Liu, Rahul Mazumder
摘要
We present MOSS, a multi-objective optimization framework for constructing stable sets of decision rules. MOSS incorporates three important criteria for interpretability: sparsity, accuracy, and stability, into a single multi-objective optimization framework. Importantly, MOSS allows a practitioner to rapidly evaluate the trade-off between accuracy and stability in sparse rule sets in order to select an appropriate model. We develop a specialized cutting plane algorithm in our framework to rapidly compute the Pareto frontier between these two objectives, and our algorithm scales to problem instances beyond the capabilities of commercial optimization solvers. Our experiments show that MOSS outperforms state-ofthe-art rule ensembles in terms of both predictive performance and stability.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Exploring the Whole Rashomon Set of Sparse Decision TreesRui Xin, Chudi Zhong, Zhi Chen, Takuya Takagi 等NeurIPS 2022 · 被引用 117 次
- Fire: An Optimization Approach for Fast Interpretable Rule ExtractionBrian Liu, Rahul MazumderKDD 2023 · 被引用 7 次
- Efficient Exploration of the Rashomon Set of Rule-Set ModelsMartino Ciaperoni, Han Xiao, Aristides GionisKDD 2024 · 被引用 3 次
相关 Paper
- Learning Accurate and Interpretable Decision Rule Sets from Neural NetworksLitao Qiao, Weijia Wang, Bill LinAAAI 2021 · 被引用 53 次
- Generalized and Scalable Optimal Sparse Decision TreesJimmy Lin, Chudi Zhong, Diane Hu, Cynthia Rudin 等ICML 2020 · 被引用 174 次
- SORTeD Rashomon Sets of Sparse Decision Trees: Anytime EnumerationElif Arslan, Jacobus G. M. van der Linden, Serge P. Hoogendoorn, Marco Rinaldi 等NeurIPS 2025 · 被引用 8 次
- From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon SetsZakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer 等ICML 2026 · 被引用 1 次
- Near-Optimal Decision Trees in a SPLIT SecondVarun Babbar, Hayden McTavish, Cynthia Rudin, Margo I. SeltzerICML 2025
