EDBT 2026 Demo / reviewers in the wild / expert
Kiran Kate
dblp:12/8321
· DBLP profile ↗
10ranked-venue papers
1as first author
8since 2021 · last 2025
0009-0003-9688-9245ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 1 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
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.
| Software engineering, system software, and programming languages
3 papers |
Compilers and program optimization · 51% Programming languages and type systems · 39% Services computing and microservices · 10% | |
| Artificial intelligence
4 papers |
Language models and text generation · 46% Knowledge representation and reasoning · 22% Efficient and distributed learning · 22% | |
| Databases, data mining, and information retrieval
3 papers |
Machine learning and data management · 90% Information retrieval · 10% |
Topics — the 11 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning and data management
automated machine learning |
1.1 | 2 | 2022 | Gradual AutoML using Lale · KDD 2022 Pipeline Combinators for Gradual AutoML · NeurIPS 2021 |
Natural language and speech › Language models and text generation
large language model evaluation |
0.9 | 1 | 2025 | NESTFUL: A Benchmark for Evaluating LLMs on Nested Sequences of API Calls · EMNLP 2025 |
Compilers and program optimization › program transformation
code style transfer |
0.7 | 1 | 2023 | CodeStylist: A System for Performing Code Style Transfer Using Neural Networks · AAAI 2023 |
Compilers and program optimization
program transformation |
0.7 | 1 | 2023 | CodeStylist: A System for Performing Code Style Transfer Using Neural Networks · AAAI 2023 |
Machine learning and data management › automated machine learning
hyperparameter optimization |
0.6 | 1 | 2022 | Gradual AutoML using Lale · KDD 2022 |
Machine learning › Efficient and distributed learning
automated machine learning |
0.5 | 1 | 2021 | AutoText: An End-to-End AutoAI Framework for Text · AAAI 2021 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning |
0.5 | 1 | 2021 | Thinking Fast and Slow in AI · AAAI 2021 |
Programming languages and type systems › lambda calculus
combinators |
0.5 | 1 | 2021 | Pipeline Combinators for Gradual AutoML · NeurIPS 2021 |
Programming languages and type systems
functional programming |
0.5 | 1 | 2021 | Pipeline Combinators for Gradual AutoML · NeurIPS 2021 |
Machine learning › Trustworthy machine learning
interpretability |
0.1 | 1 | 2021 | Thinking Fast and Slow in AI · AAAI 2021 |
Natural language and speech › Information extraction and text analysis
text classification |
0.1 | 1 | 2014 | FoodSIS: a text mining system to improve the state of food safety in singapore · KDD 2014 |
Methods — techniques the papers use, named apart from their topics
benchmark construction · 1.7hyperparameter optimization · 1.5combinators · 1.0sequence-to-sequence learning · 0.7neural network · 0.7pipeline composition · 0.6neural architecture search · 0.5ranking · 0.4machine learning · 0.4classification · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Improving Examples in Web API Specifications using Iterated-Calls In-Context LearningabstractExamples in web API specifications can be essential for API testing, API understanding, and even building chat-bots for APIs. Unfortunately, most API specifications lack human-written examples. This paper introduces a novel technique for generating examples for web API specifications. We start from in-context learning (Icl): given an API parameter, use a prompt context containing a few examples from other similar API parameters to call a model to generate new examples. However, while ICL tends to generate correct examples, those lack diversity, which is also important for most downstream tasks. Therefore, we extend the technique to iterated-calls ICL (IcIcl): use a few different prompt contexts, each containing a few examples, to iteratively call the model with each context. Our intrinsic evaluation demonstrates that IcIcl improves both correctness and diversity of generated examples. More importantly, our extrinsic evaluation demonstrates that those generated examples significantly improve the performance of downstream tasks of testing, understanding, and chat-bots for APIs. Kush Jain, Kiran Kate, Jason Tsay, Claire Le Goues, Martin Hirzel |
AST | 2 |
| 2025 | NESTFUL: A Benchmark for Evaluating LLMs on Nested Sequences of API CallsabstractKinjal Basu, Ibrahim Abdelaziz, Kiran Kate, Mayank Agarwal, Maxwell Crouse, Yara Rizk, Kelsey Bradford, Asim Munawar, Sadhana Kumaravel, Saurabh Goyal, Xin Wang, Luis A. Lastras, Pavan Kapanipathi. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025. Kinjal Basu 0002, Ibrahim Abdelaziz, Kiran Kate, Mayank Agarwal, Maxwell Crouse, Yara Rizk, Kelsey Bradford, Asim Munawar, Sadhana Kumaravel, Saurabh Goyal, Luis A. Lastras, Pavan Kapanipathi |
EMNLP | 3 |
| 2024 | AI for Low-Code for AIabstractLow-code programming allows citizen developers to create programs with minimal coding effort, typically via visual (e.g. drag-and-drop) interfaces. In parallel, recent AI-powered tools such as Copilot and ChatGPT generate programs from natural language instructions. We argue that these modalities are complementary: tools like ChatGPT greatly reduce the need to memorize large APIs but still require their users to read (and modify) textual programs, whereas visual tools abstract away most or all program text but struggle to provide easy access to large APIs. At their intersection, we propose LowCoder, the first low-code tool for developing AI pipelines that supports both a visual programming interface (LowCoderVP) and an AI-powered natural language interface (LowCoderNL). We leverage this tool to provide some of the first insights into whether and how these two modalities help programmers by conducting a user study. We task 20 developers with varying levels of AI expertise with implementing four ML pipelines using LowCoder, replacing the LowCoderNL component with a simple keyword search in half the tasks. Overall, we find that LowCoder is especially useful for (i) Discoverability: using LowCoderNL, participants discovered new operators in 75% of the tasks, compared to just 32.5% and 27.5% using web search or scrolling through options respectively in the keyword-search condition, and (ii) Iterative Composition: 82.5% of tasks were successfully completed and many initial pipelines were further successfully improved. Qualitative analysis shows that AI helps users discover how to implement constructs when they know what to do, but still fails to support novices when they lack clarity on what they want to accomplish. Overall, our work highlights the benefits of combining the power of AI with low-code programming. Nikitha Rao, Jason Tsay, Kiran Kate, Vincent J. Hellendoorn, Martin Hirzel |
IUI | 3 |
| 2023 | CodeStylist: A System for Performing Code Style Transfer Using Neural NetworksabstractCode style refers to attributes of computer programs that affect their readability, maintainability, and performance. Enterprises consider code style as important and enforce style requirements during code commits. Tools that assist in coding style compliance and transformations are highly valuable. However, many key aspects of programming style transfer are difficult to automate, as it can be challenging to specify the patterns required to perform the transfer algorithmically. In this paper, we describe a system called CodeStylist which uses neural methods to perform style transfer on code. Chih-Kai Ting, Karl Munson, Serenity Wade, Anish Savla, Kiran Kate, Kavitha Srinivas |
AAAI | 5 |
| 2022 | Gradual AutoML using LaleabstractLale is a sklearn-compatible library for automated machine learning (AutoML). It is open-source (https://github.com/ibm/lale) and addresses the need for gradual automation of machine learning as opposed to offering a black-box AutoML tool. Black-box AutoML tools are difficult to customize and thus restrict data scientists in leveraging their knowledge and intuition in the automation process. Lale is built on three principles: progressive disclosure, orthogonality, and least surprise. These enable a gradual approach offering a spectrum of usage patterns starting from total automation to controlling almost every aspect of AutoML. Lale provides compositional constructs that let data scientists control some aspects of their pipelines while leaving other aspects free to be searched automatically. This tutorial demonstrates the use of Lale for various machine-learning tasks, showing how to progressively exercise more customization. It also covers AutoML for advanced scenarios such as class imbalance correction, bias detection and mitigation, multi-objective optimization, and working with multi-table datasets. While Lale comes with hyperparameter specifications for 216 operators out-of-the-box, users can also add more operators of their own, and this tutorial covers how to do that. Overall, this tutorial teaches you how you can exercise fine-grained control over AutoML without having to be an AutoML expert. Martin Hirzel, Kiran Kate, Parikshit Ram, Avraham Shinnar, Jason Tsay |
KDD | 2 |
| 2021 | Thinking Fast and Slow in AIabstractThis paper proposes a research direction to advance AI which draws inspiration from cognitive theories of human decision making. The premise is that if we gain insights about the causes of some human capabilities that are still lacking in AI (for instance, adaptability, generalizability, common sense, and causal reasoning), we may obtain similar capabilities in an AI system by embedding these causal components. We hope that the high-level description of our vision included in this paper, as well as the several research questions that we propose to consider, can stimulate the AI research community to define, try and evaluate new methodologies, frameworks, and evaluation metrics, in the spirit of achieving a better understanding of both human and machine intelligence. Grady Booch, Francesco Fabiano, Lior Horesh, Kiran Kate, Jonathan Lenchner, Nick Linck, Andrea Loreggia, Keerthiram Murugesan, Nicholas Mattei, Francesca Rossi 0001, Biplav Srivastava |
AAAI | 4 |
| 2021 | AutoText: An End-to-End AutoAI Framework for TextabstractBuilding models for natural language processing (NLP) tasks remains a daunting task for many, requiring significant technical expertise, efforts, and resources. In this demonstration, we present AutoText, an end-to-end AutoAI framework for text, to lower the barrier of entry in building NLP models. AutoText combines state-of-the-art AutoAI optimization techniques and learning algorithms for NLP tasks into a single extensible framework. Through its simple, yet powerful UI, non-AI experts (e.g., domain experts) can quickly generate performant NLP models with support to both control (e.g., via specifying constraints) and understand learned models. Arunima Chaudhary, Alayt Issak, Kiran Kate, Yannis Katsis, Abel N. Valente, Dakuo Wang, Alexandre V. Evfimievski, Sairam Gurajada, Ban Kawas, Cristiano Malossi, Lucian Popa 0001, Tejaswini Pedapati, Horst Samulowitz, Martin Wistuba, Yunyao Li 0001 |
AAAI | 3 |
| 2021 | Pipeline Combinators for Gradual AutoMLabstractAutomated machine learning (AutoML) can make data scientists more productive. But if machine learning is totally automated, that leaves no room for data scientists to apply their intuition. Hence, data scientists often prefer not total but gradual automation, where they control certain choices and AutoML explores the rest. Unfortunately, gradual AutoML is cumbersome with state-of-the-art tools, requiring large non-compositional code changes. More concise compositional code can be achieved with combinators, a powerful concept from functional programming. This paper introduces a small set of orthogonal combinators for composing machine-learning operators into pipelines. It describes a translation scheme from pipelines and associated hyperparameter schemas to search spaces for AutoML optimizers. On that foundation, this paper presents Lale, an open-source sklearn-compatible AutoML library, and evaluates it with a user study. Guillaume Baudart, Martin Hirzel, Kiran Kate, Parikshit Ram, Avraham Shinnar, Jason Tsay |
NeurIPS | 3 |
| 2014 | FoodSIS: a text mining system to improve the state of food safety in singaporeabstractFood safety is an important health issue in Singapore as the number of food poisoning cases have increased significantly over the past few decades. The National Environment Agency of Singapore (NEA) is the primary government agency responsible for monitoring and mitigating the food safety risks. In an effort to pro-actively monitor emerging food safety issues and to stay abreast with developments related to food safety in the world, NEA tracks the World Wide Web as a source of news feeds to identify food safety related articles. However, such information gathering is a difficult and time consuming process due to information overload. In this paper, we present FoodSIS, a system for end-to-end web information gathering for food safety. FoodSIS improves efficiency of such focused information gathering process with the use of machine learning techniques to identify and rank relevant content. We discuss the challenges in building such a system and describe how thoughtful system design and recent advances in machine learning provide a framework that synthesizes interactive learning with classification to provide a system that is used in daily operations. We conduct experiments and demonstrate that our classification approach results in improving the efficiency by average 35% compared to a conventional approach and the ranking approach leads to average 16% improvement in elevating the ranks of relevant articles. Kiran Kate, Sneha Chaudhari, Andy Prapanca, Jayant Kalagnanam |
KDD | 1 |
| 2010 | A Gradient Descent Approach for Multi-modal Biometric IdentificationabstractWhile biometrics-based identification is a key technology in many critical applications such as searching for an identity in a watch list or checking for duplicates in a citizen ID card system, there are many technical challenges in building a solution because the size of the database can be very large (often in 100s of millions) and the intrinsic errors with the underlying biometrics engines. Often multi-modal biometrics is proposed as a way to improve the underlying biometrics accuracy performance. In this paper, we propose a score based fusion scheme tailored for identification applications. The proposed algorithm uses a gradient descent method to learn weights for each modality such that weighted sum of genuine scores is larger than the weighted sum of all the impostor scores. During the identification phase, top K candidates from each modality are retrieved and a super-set of identities is constructed. Using the learnt weights, we compute the weighted score for all the candidates in the superset. The highest scoring candidate is declared as the top candidate for identification. The proposed algorithm has been tested using NIST BSSR-1 dataset and results in terms of accuracy as well as the speed (execution time) are shown to be far superior than the published results on this dataset. Jayanta Basak, Kiran Kate, Vivek Tyagi, Nalini K. Ratha |
ICPR | 2 |