Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pavankumar Murali

dblp:160/5894 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 62% Algorithms and data structures · 38%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%
Artificial intelligence
2 papers
Trustworthy machine learning · 69% Information extraction and text analysis · 31%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling › classification
decision tree learning
0.412020
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees · NeurIPS 2020
Data mining › predictive modeling › classification › decision tree learning
multivariate decision trees
0.412020
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees · NeurIPS 2020
Mathematical optimization › discrete optimization
mixed integer linear programming
0.412020
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees · NeurIPS 2020
Algorithms and data structures › decision tree
optimal decision tree
0.412020
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees · NeurIPS 2020
Machine learning › Trustworthy machine learning › interpretability › explainable AI › self-interpretable models
generalized additive model
0.312018
Neural Interaction Transparency (NIT): Disentangling Learned Interactions for Improved Interpretability · NeurIPS 2018
Machine learning › Trustworthy machine learning
interpretability
0.312018
Neural Interaction Transparency (NIT): Disentangling Learned Interactions for Improved Interpretability · NeurIPS 2018
Natural language and speech › Information extraction and text analysis
natural language query
0.312026
Agentic Solutions for IT Financial Operations · AAAI 2026
Mathematical optimization › integer programming
cutting planes
0.112020
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees · NeurIPS 2020
Mathematical optimization
linear programming relaxation
0.112020
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees · NeurIPS 2020

Methods — techniques the papers use, named apart from their topics

large language model · 2.0agentic systems · 1.0agentic system · 1.0support vector machine · 0.9linear programming · 0.9mixed-integer programming · 0.4mixed integer programming · 0.4cutting planes · 0.4cutting plane · 0.4interaction-order regularizer · 0.3
YearPublicationVenuePosition
2026 Agentic Solutions for IT Financial Operations
abstract
The dynamic nature of cloud spending and pricing structures pose challenges for practitioners in IT Financial Operations (FinOps). Recent advances in agentic systems enables them to instead rely on agents for complex FinOps tasks such as drawing insights from their data through natural language queries. In this work, we present an IT FinOps Data Insights Agent, that implements “chat with your data” approach to support practitioners in their daily tasks. Our agent achieves up to 90% accuracy across ITBench FinOps scenarios.
Bekir O. Turkkan, Pavankumar Murali, Chandrasekhar Narayanaswami 0001, Vadim Sheinin
AAAI2
2020 A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees
abstract
Several recent publications report advances in training optimal decision trees (ODTs) using mixed-integer programs (MIPs), due to algorithmic advances in integer programming and a growing interest in addressing the inherent suboptimality of heuristic approaches such as CART. In this paper, we propose a novel MIP formulation, based on 1-norm support vector machine model, to train a binary oblique ODT for classification problems. We further present techniques, such as cutting planes, to tighten its linear relaxation, to improve run times to reach optimality. Using 36 datasets from the University of California Irvine Machine Learning Repository, we demonstrate that our training approach outperforms its counterparts from literature in terms of out-of-sample performance (around 10% improvement in mean out-of-sample testing accuracy). Towards our goal of developing a scalable framework to train multivariate ODT on large datasets, we propose a new linear programming based data selection method to choose a subset of the data, and use it to train a decision tree through our proposed MIP model. We conclude this paper with extensive numerical testing results, that showcase the generalization performance of our new MIP formulation, and the improvement in mean out-of-sample accuracy on large datasets.
Pavankumar Murali, Dzung T. Phan, Lam M. Nguyen, Jayant Kalagnanam
NeurIPS2
2018 Neural Interaction Transparency (NIT): Disentangling Learned Interactions for Improved Interpretability
abstract
Neural networks are known to model statistical interactions, but they entangle the interactions at intermediate hidden layers for shared representation learning. We propose a framework, Neural Interaction Transparency (NIT), that disentangles the shared learning across different interactions to obtain their intrinsic lower-order and interpretable structure. This is done through a novel regularizer that directly penalizes interaction order. We show that disentangling interactions reduces a feedforward neural network to a generalized additive model with interactions, which can lead to transparent models that perform comparably to the state-of-the-art models. NIT is also flexible and efficient; it can learn generalized additive models with maximum $K$-order interactions by training only $O(1)$ models.
Michael Tsang, Hanpeng Liu, Sanjay Purushotham, Pavankumar Murali, Yan Liu 0002
NeurIPS4
2014 New Developments in Culinary Computational Creativity
Pavankumar Murali, Anshul Sheopuri
ICCC2