SearcharxivSearch

arXiv subjects

Ritwik Chaudhuri

Publications and source records attributed to Ritwik Chaudhuri.

4 recordsLinked to original sources

A Framework for Testing and Adapting REST APIs as LLM Tools

Large Language Models (LLMs) are increasingly used to build autonomous agents that perform complex tasks with external tools, often exposed through APIs in enterprise systems. Direct use of these APIs is difficult due to the complex input schema and verbose responses. Current benchmarks overlook these challenges, leaving a gap in assessing API readiness for agent-driven automation. We present a testing framework that systematically evaluates enterprise APIs when wrapped as Python tools for LLM-based agents. The framework generates data-aware test cases, translates them into natural language instructions, and evaluates whether agents can correctly invoke the tool, handle their inputs, and process its responses. We apply the framework to generate over 2400 test cases across different domains and develop a taxonomy of common errors, including input misinterpretation, output failures, and schema mismatches. We further classify errors to support debugging and tool refinement. Our framework provides a systematic approach to enabling enterprise APIs as reliable tools for agent-based applications.

cs.SE

Automated Question Generation on Tabular Data for Conversational Data Exploration

Exploratory data analysis (EDA) is an essential step for analyzing a dataset to derive insights. Several EDA techniques have been explored in the literature. Many of them leverage visualizations through various plots. But it is not easy to interpret them for a non-technical user, and producing appropriate visualizations is also tough when there are a large number of columns. Few other works provide a view of some interesting slices of data but it is still difficult for the user to draw relevant insights from them. Of late, conversational data exploration is gaining a lot of traction among non-technical users. It helps the user to explore the dataset without having deep technical knowledge about the data. Towards this, we propose a system that recommends interesting questions in natural language based on relevant slices of a dataset in a conversational setting. Specifically, given a dataset, we pick a select set of interesting columns and identify interesting slices of such columns and column combinations based on few interestingness measures. We use our own fine-tuned variation of a pre-trained language model(T5) to generate natural language questions in a specific manner. We then slot-fill values in the generated questions and rank them for recommendations. We show the utility of our proposed system in a coversational setting with a collection of real datasets.

cs.CL

Cogniculture: Towards a Better Human-Machine Co-evolution

Research in Artificial Intelligence is breaking technology barriers every day. New algorithms and high performance computing are making things possible which we could only have imagined earlier. Though the enhancements in AI are making life easier for human beings day by day, there is constant fear that AI based systems will pose a threat to humanity. People in AI community have diverse set of opinions regarding the pros and cons of AI mimicking human behavior. Instead of worrying about AI advancements, we propose a novel idea of cognitive agents, including both human and machines, living together in a complex adaptive ecosystem, collaborating on human computation for producing essential social goods while promoting sustenance, survival and evolution of the agents' life cycle. We highlight several research challenges and technology barriers in achieving this goal. We propose a governance mechanism around this ecosystem to ensure ethical behaviors of all cognitive agents. Along with a novel set of use-cases of Cogniculture, we discuss the road map ahead for this journey.

cs.CY

Non-Gaussian semi-stable laws arising in sampling of finite point processes

A finite point process is characterized by the distribution of the number of points (the size) of the process. In some applications, for example, in the context of packet flows in modern communication networks, it is of interest to infer this size distribution from the observed sizes of sampled point processes, that is, processes obtained by sampling independently the points of i.i.d. realizations of the original point process. A standard nonparametric estimator of the size distribution has already been suggested in the literature, and has been shown to be asymptotically normal under suitable but restrictive assumptions. When these assumptions are not satisfied, it is shown here that the estimator can be attracted to a semi-stable law. The assumptions are discussed in the case of several concrete examples. A major theoretical contribution of this work are new and quite general sufficient conditions for a sequence of i.i.d. random variables to be attracted to a semi-stable law.

math.ST