Research map / Learning theory and algorithms / Prediction and decision losses
Diverse Representative Rashomon Sets for Sparse Generalized Additive Models
Varun Babbar, Christopher Li, Chudi Zhong, Cynthia Rudin
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes a method to compute diverse, representative subsets of the Rashomon set for sparse generalized additive models, extending beyond restricted model classes.
Problem
Approximating the Rashomon set (near-optimal predictive models) for sparse GAMs; existing approaches only apply to restricted settings.
Approach
Computes a diverse, representative approximation of the Rashomon set for sparse generalized additive models, rather than enumerating the full set, so that the set is usable for interaction and constraint-based model selection. Details beyond the abstract are not stated here.
Closest papers by meaning
- Exploring and Interacting with the Set of Good Sparse Generalized Additive Models (NeurIPS 2023 · similarity 0.92)
- Dropout-Based Rashomon Set Exploration for Efficient Predictive Multiplicity Estimation (ICLR 2024 · similarity 0.90)
- Exploring the Whole Rashomon Set of Sparse Decision Trees (NeurIPS 2022 · similarity 0.89)
- SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration (NeurIPS 2025 · similarity 0.87)
- RashomonGB: Analyzing the Rashomon Effect and Mitigating Predictive Multiplicity in Gradient Boosting (NeurIPS 2024 · similarity 0.86)
- Exploring the cloud of feature interaction scores in a Rashomon set (ICLR 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
