70 citations
- Aalto UniversityFI2 papers
- Dhirubhai Ambani UniversityIN1 paper
- Finland UniversityFI1 paper
- Indian Health ServiceUS1 paper
- Indian Institute of Management CalcuttaIN1 paper
- Indian Institute of Technology KanpurIN1 paper
- Iowa State UniversityUS1 paper
- Laboratoire des Sciences du Numérique de NantesFR1 paper
- Monash UniversityAU1 paper
- Nantes UniversitéFR1 paper
- University of FloridaUS1 paper
- University of HelsinkiFI1 paper
10 papers
The Twist Decomposition of Serial Robots Under Lower-Mobility Tasks
Luc Baron, Damien Chablat
This paper introduces a twist decomposition framework for serial manipulators performing lower mobility tasks. Rather than relying on Jacobian null-space projections, the method se…
Predictive Hotspot Mapping for Data-driven Crime Prediction
Karthik Sriram, Ankur Sinha, Suvashis Choudhary
Predictive hotspot mapping is an important problem in crime prediction and control. An accurate hotspot mapping helps in appropriately targeting the available resources to manage c…
FinBloom: Knowledge Grounding Large Language Model with Real-time Financial Data
Ankur Sinha, Chaitanya Agarwal, Pekka Malo
Large language models (LLMs) excel at generating human-like responses but often struggle with interactive tasks that require access to real-time information. This limitation poses…
A Linear Programming Enhanced Genetic Algorithm for Hyperparameter Tuning in Machine Learning
Ankur Sinha, Paritosh Pankaj
In this paper, we formulate the hyperparameter tuning problem in machine learning as a bilevel program. The bilevel program is solved using a micro genetic algorithm that is enhanc…
SEntFiN 1.0: Entity-Aware Sentiment Analysis for Financial News
Ankur Sinha, Satishwar Kedas, Rishu Kumar +1
Fine-grained financial sentiment analysis on news headlines is a challenging task requiring human-annotated datasets to achieve high performance. Limited studies have tried to addr…
An Abstract Model for Branch and Cut
Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan
Branch and cut is the dominant paradigm for solving a wide range of mathematical programming problems -- linear or nonlinear -- combining efficient search (via branch and bound) an…