Unpacking Interpretability: Human-Centered Criteria for Optimal Combinatorial Solutions

• URL: http://arxiv.org/abs/2603.08856v1
• Date: Mon, 09 Mar 2026 19:18:52 GMT
• Title: Unpacking Interpretability: Human-Centered Criteria for Optimal Combinatorial Solutions
• Abstract summary: We present an experimental paradigm in which participants chose which of two equally optimal solutions for packing items into bins was easier to understand.<n>We show that preferences reliably track three properties of solution structure.<n>These results provide a concrete, feature-based account of interpretability in optimal packing solutions.
• Score: 0.4077787659104315
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Algorithmic support systems often return optimal solutions that are hard to understand. Effective human-algorithm collaboration, however, requires interpretability. When machine solutions are equally optimal, humans must select one, but a precise account of what makes one solution more interpretable than another remains missing. To identify structural properties of interpretable machine solutions, we present an experimental paradigm in which participants chose which of two equally optimal solutions for packing items into bins was easier to understand. We show that preferences reliably track three quantifiable properties of solution structure: alignment with a greedy heuristic, simple within-bin composition, and ordered visual representation. The strongest associations were observed for ordered representations and heuristic alignment, with compositional simplicity also showing a consistent association. Reaction-time evidence was mixed, with faster responses observed primarily when heuristic differences were larger, and aggregate webcam-based gaze did not show reliable effects of complexity. These results provide a concrete, feature-based account of interpretability in optimal packing solutions, linking solution structure to human preference. By identifying actionable properties (simple compositions, ordered representation, and heuristic alignment), our findings enable interpretability-aware optimization and presentation of machine solutions, and outline a path to quantify trade-offs between optimality and interpretability in real-world allocation and design tasks.

Related papers

• Interpretable clustering via optimal multiway-split decision trees [1.8224668251608893]
  We propose an interpretable clustering method based on optimal multiway-split decision trees.<n>A key feature of our method is the integration of a one-dimensional K-means algorithm for the discretization of continuous variables.<n>Our method yields multiway-split decision trees with concise decision rules while maintaining competitive performance across various evaluation metrics.
  arXiv  Detail & Related papers  (2026-02-14T04:08:52Z)
• Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models [0.8906214436849201]
  We develop a framework based on local optimality guarantees to enable scalable synthesis of interpretations.<n>We show that our approach yields interpretations that closely match those synthesized by methods offering global guarantees.
  arXiv  Detail & Related papers  (2025-08-21T04:11:20Z)
• Feature-Based vs. GAN-Based Learning from Demonstrations: When and Why [50.191655141020505]
  This survey provides a comparative analysis of feature-based and GAN-based approaches to learning from demonstrations.<n>We argue that the dichotomy between feature-based and GAN-based methods is increasingly nuanced.
  arXiv  Detail & Related papers  (2025-07-08T11:45:51Z)
• In-context Demonstration Matters: On Prompt Optimization for Pseudo-Supervision Refinement [71.60563181678323]
  Large language models (LLMs) have achieved great success across diverse tasks, and fine-tuning is sometimes needed to further enhance generation quality.<n>To handle these challenges, a direct solution is to generate high-confidence'' data from unsupervised downstream tasks.<n>We propose a novel approach, pseudo-supervised demonstrations aligned prompt optimization (PAPO) algorithm, which jointly refines both the prompt and the overall pseudo-supervision.
  arXiv  Detail & Related papers  (2024-10-04T03:39:28Z)
• Efficient Fairness-Performance Pareto Front Computation [45.088727439928704]
  We show that optimal fair representations possess several useful structural properties.<n>We then show that these approxing problems can be solved efficiently via concave programming methods.
  arXiv  Detail & Related papers  (2024-09-26T08:46:48Z)
• Feature-Based Interpretable Surrogates for Optimization [0.8437187555622164]
  In this work, we investigate how we can use more general optimization rules to increase interpretability. The proposed rules do not map to a concrete solution but to a set of solutions characterized by common features. In particular, we demonstrate the improvement in solution quality that our approach offers compared to existing interpretable surrogates for optimization.
  arXiv  Detail & Related papers  (2024-09-03T13:12:49Z)
• Mining Potentially Explanatory Patterns via Partial Solutions [39.58317527488534]
  We present an algorithm that assembles a collection of Partial Solutions chosen to strike a balance between high fitness, simplicity and atomicity. Experiments with standard benchmarks show that the proposed algorithm is able to find Partial Solutions which improve explainability at reasonable computational cost without affecting search performance.
  arXiv  Detail & Related papers  (2024-04-05T20:12:02Z)
• Unifying Feature and Cost Aggregation with Transformers for Semantic and Visual Correspondence [51.54175067684008]
  This paper introduces a Transformer-based integrative feature and cost aggregation network designed for dense matching tasks. We first show that feature aggregation and cost aggregation exhibit distinct characteristics and reveal the potential for substantial benefits stemming from the judicious use of both aggregation processes. Our framework is evaluated on standard benchmarks for semantic matching, and also applied to geometric matching, where we show that our approach achieves significant improvements compared to existing methods.
  arXiv  Detail & Related papers  (2024-03-17T07:02:55Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• Contextual Model Aggregation for Fast and Robust Federated Learning in Edge Computing [88.76112371510999]
  Federated learning is a prime candidate for distributed machine learning at the network edge. Existing algorithms face issues with slow convergence and/or robustness of performance. We propose a contextual aggregation scheme that achieves the optimal context-dependent bound on loss reduction.
  arXiv  Detail & Related papers  (2022-03-23T21:42:31Z)
• USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems [9.015720257837575]
  We consider the regression between spaces, aiming to infer high-quality optimization solutions from samples of input-solution pairs. For learning foundations, we present learning-error analysis under the PAC-Bayesian framework. We obtain highly encouraging experimental results for several classic problems on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-07-15T17:59:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.