3 papers
cs.LG2026
Literati: Towards Anytime Optimal Shape Generalized Trees via AO*
Nakul Upadhya, Eldan Cohen
Decision trees are prized for their interpretability and strong performance on tabular data, but popular greedy top-down induction algorithms can yield suboptimal and unnecessarily…
cs.LG2025
Empowering Decision Trees via Shape Function Branching
Nakul Upadhya, Eldan Cohen
Decision trees are prized for their interpretability and strong performance on tabular data. Yet, their reliance on simple axis-aligned linear splits often forces deep, complex str…
cs.LG2024
NeurCAM: Interpretable Neural Clustering via Additive Models
Nakul Upadhya, Eldan Cohen
Interpretable clustering algorithms aim to group similar data points while explaining the obtained groups to support knowledge discovery and pattern recognition tasks. While most a…