{"total":13,"rows":[{"id":"2409.12788","title":"Optimal or Greedy Decision Trees? Revisiting their Objectives, Tuning, and Performance","created":"2024-09-19","cited_by_count":9,"area":null},{"id":"2511.03344","title":"SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration","created":"2025-11-05","cited_by_count":6,"area":null},{"id":"2410.11449","title":"Conditional Density Estimation with Histogram Trees","created":"2024-10-15","cited_by_count":4,"area":null},{"id":"2311.13544","title":"Piecewise Polynomial Regression of Tame Functions via Integer Programming","created":"2023-11-22","cited_by_count":1,"area":null},{"id":"2501.05942","title":"Soft regression trees: a model variant and a decomposition training algorithm","created":"2025-01-10","cited_by_count":1,"area":null},{"id":"2502.09502","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","created":"2025-02-13","cited_by_count":1,"area":null},{"id":"2306.06777","title":"Improving the Validity of Decision Trees as Explanations","created":"2023-06-11","cited_by_count":0,"area":null},{"id":"2508.15220","title":"Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models","created":"2025-08-21","cited_by_count":0,"area":null},{"id":"2509.12057","title":"Optimal hypersurface decision trees","created":"2025-09-15","cited_by_count":0,"area":null},{"id":"2510.07832","title":"Surrogate Graph Partitioning for Spatial Prediction","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2510.23901","title":"RS-ORT: A Reduced-Space Branch-and-Bound Algorithm for Optimal Regression Trees","created":"2025-10-27","cited_by_count":0,"area":null},{"id":"2608.20258","title":"DICS: Data-Informed Centroid Splitting for Decision Tree Classifiers","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2609.05826","title":"Scaling Optimal Classification Trees via Adaptive Feature and Sample Reduction","created":"2026-09-05","cited_by_count":0,"area":null}],"next_cursor":null}