Siddartha Pullakhandam

Mr. Siddartha Pullakhandam

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2024 in BioMedInformatics
Verified
Journal Article
Open access
PDF file
SPSiddartha Pullakhandam
Siddartha Pullakhandam
Susan McRoySusan McRoy
Susan McRoy
Background: Currently, discriminating Iron Deficiency Anemia (IDA) from other anemia requires an expensive test (serum ferritin). Complete Blood Count (CBC) tests are less costly and more widely available. Machine learning models have not yet been applied to discriminating IDA but do well for similar tasks. Methods: We constructed multiple machine learning methods to classify IDA from CBC data using a US NHANES dataset of over 19,000 instances, calculating accuracy, precision, recall, and precision AUC (PR AUC). We validated the results using an unseen dataset from Kenya, using the same model. We calculated ranked feature importance to explain the global behavior of the model. Results: Our model classifies IDA with a PR AUC of 0.87 and recall/sensitivity of 0.98 and 0.89 for the original dataset and an unseen Kenya dataset, respectively. The explanations indicate that low blood level of hemoglobin, higher age, and higher Red Blood Cell distribution width were most critical. We also found that optimization made only minor changes to the explanations and that the features used remained consistent with professional practice. Conclusions: The overall high performance and consistency of the results suggest that the approach would be acceptable to health professionals and would support enhancements to current automated CBC analyzers.

30 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
JPJebish Purbey
Jebish Purbey
SGSiddhant Gupta
Siddhant Gupta
NMNikhil Manali
Nikhil Manali
SPSiddartha Pullakhandam
Siddartha Pullakhandam
DSDrishti Sharma
Drishti Sharma
RKRam Mohan Rao Kadiyala
Ram Mohan Rao Kadiyala
This paper presents the system description of our entry for the COLING 2025 FMD challenge, focusing on misinformation detection in financial domains. We experimented with a combination of large language models, including Qwen, Mistral, and Gemma-2, and leveraged pre-processing and sequential learning for not only identifying fraudulent financial content but also generating coherent, and concise explanations that clarify the rationale behind the classifications. Our approach achieved competitive results with an F1-score of 0.8283 for classification, and ROUGE-1 of 0.7253 for explanations. This work highlights the transformative potential of LLMs in financial applications, offering insights into their capabilities for combating misinformation and enhancing transparency while identifying areas for future improvement in robustness and domain adaptation.

11 November 2024 in arXiv
Verified
Preprint
Open access
PDF file
JPJebish Purbey
Jebish Purbey
SPSiddartha Pullakhandam
Siddartha Pullakhandam
KMKanwal Mehreen
Kanwal Mehreen
MAMuhammad Arham
Muhammad Arham
DSDrishti Sharma
Drishti Sharma
RKRam Mohan Rao Kadiyala
Ram Mohan Rao Kadiyala
This paper presents a detailed system description of our entry for the CHiPSAL 2025 shared task, focusing on language detection, hate speech identification, and target detection in Devanagari script languages. We experimented with a combination of large language models and their ensembles, including MuRIL, IndicBERT, and Gemma-2, and leveraged unique techniques like focal loss to address challenges in the natural understanding of Devanagari languages, such as multilingual processing and class imbalance. Our approach achieved competitive results across all tasks: F1 of 0.9980, 0.7652, and 0.6804 for Sub-tasks A, B, and C respectively. This work provides insights into the effectiveness of transformer models in tasks with domain-specific and linguistic challenges, as well as areas for potential improvement in future iterations.

8 December 2024 in arXiv
Verified
Preprint
Open access
PDF file
JPJebish Purbey
Jebish Purbey
DSDrishti Sharma
Drishti Sharma
SGSiddhant Gupta
Siddhant Gupta
KMKhawaja Murad
Khawaja Murad
SPSiddartha Pullakhandam
Siddartha Pullakhandam
RKRam Mohan Rao Kadiyala
Ram Mohan Rao Kadiyala
This paper presents the system description of our entry for the COLING 2025 RegNLP RIRAG (Regulatory Information Retrieval and Answer Generation) challenge, focusing on leveraging advanced information retrieval and answer generation techniques in regulatory domains. We experimented with a combination of embedding models, including Stella, BGE, CDE, and Mpnet, and leveraged fine-tuning and reranking for retrieving relevant documents in top ranks. We utilized a novel approach, LeSeR, which achieved competitive results with a recall@10 of 0.8201 and map@10 of 0.6655 for retrievals. This work highlights the transformative potential of natural language processing techniques in regulatory applications, offering insights into their capabilities for implementing a retrieval augmented generation system while identifying areas for future improvement in robustness and domain adaptation.

1 January 2024
Verified
Conference Paper
Open access
PDF file
RKRam Mohan Rao Kadiyala
Ram Mohan Rao Kadiyala
SPSiddartha Pullakhandam
Siddartha Pullakhandam
KMKanwal Mehreen
Kanwal Mehreen
STSubhasya Tippareddy
Subhasya Tippareddy
ASAshay Srivastava
Ashay Srivastava
Ram Mohan Rao Kadiyala, Siddartha Pullakhandam, Kanwal Mehreen, Subhasya Tippareddy, Ashay Srivastava. Proceedings of the Natural Legal Language Processing Workshop 2024. 2024.

21 October 2024 in arXiv
Verified
Preprint
Open access
PDF file
RKRam Mohan Rao Kadiyala
Ram Mohan Rao Kadiyala
SPSiddartha Pullakhandam
Siddartha Pullakhandam
KMKanwal Mehreen
Kanwal Mehreen
STSubhasya Tippareddy
Subhasya Tippareddy
ASAshay Srivastava
Ashay Srivastava
This paper presents our system description and error analysis of our entry for NLLP 2024 shared task on Legal Natural Language Inference (L-NLI) \citep{hagag2024legallenssharedtask2024}. The task required classifying these relationships as entailed, contradicted, or neutral, indicating any association between the review and the complaint. Our system emerged as the winning submission, significantly outperforming other entries with a substantial margin and demonstrating the effectiveness of our approach in legal text analysis. We provide a detailed analysis of the strengths and limitations of each model and approach tested, along with a thorough error analysis and suggestions for future improvements. This paper aims to contribute to the growing field of legal NLP by offering insights into advanced techniques for natural language inference in legal contexts, making it accessible to both experts and newcomers in the field.