Abstract: Robotic Process Automation (RPA) systems face challenges in handling complex processes and diverse screen layouts that require advanced human-like decision-making capabilities. These systems typically rely on pixel-level encoding through drag-and-drop or automation frameworks such as Selenium to create navigation workflows, rather than visual understanding of screen elements. Present disclosure provides systems and methods that implement large language models (LLMs) coupled with deep learning based image understanding which adapt to new scenarios, including changes in user interface and variations in input data, without the need for human intervention. System of the present disclosure uses computer vision and natural language processing to perceive visible elements on graphical user interface (GUI) and convert them into a textual representation.

Abstract: Recommender Systems (RS) tend to recommend more popular items instead of the relevant long-tail items. Mitigating such popularity bias is crucial to ensure that less popular but relevant items are recommended. System described herein analyses popularity bias in session-based RS obtained via deep learning (DL) models. DL models trained on historical user-item interactions in session logs (having long-tailed item-click distributions) tend to amplify popularity bias. To understand source of this bias amplification, potential sources of bias at data-generation stage (user-item interactions captured as session logs) and model training stage are considered by the system for recommendation wherein popularity of item has causal effect on user-item interactions via conformity bias, and item ranking from models via biased training process due to class imbalance.

Abstract: Session-based Recommendation (SR) is the task of recommending the next item based on previously recorded user interactions. However, most existing approaches for SR either rely on costly online interactions with real users (model-free approaches) or rely on potentially biased rule-based or data-driven user-behavior models (model-based approaches) for learning. This disclosure relates to a system and method for selecting session-based recommendation policies using historical recommendations and user feedback. Herein, the learning of recommendation policies given offline or batch data from old recommendation policies based on a Distributional Reinforcement Learning (DRL) based recommender system in the offline or batch-constrained setting without requiring access to a user-behavior model or real-interactions with the users.

Abstract: Several applications capture data from sensors resulting in multi-sensor time series. Existing neural networks-based approaches for such multi-sensor/multivariate time series modeling assume fixed input-dimension/number of sensors. Such approaches can struggle in practical setting where different instances of same device/equipment come with different combinations of installed sensors. In the present disclosure, neural network models are trained from such multi-sensor time series having varying input dimensionality, owing to availability/installation of different sensors subset at each source of time series. Neural network (NN) architecture is provided for zero-shot transfer learning allowing robust inference for multivariate time series with previously unseen combination of available dimensions/sensors at test time.

Abstract: This disclosure relates generally to method and system for handling popularity bias in item recommendations. In an embodiment the method includes initializing an item embedding look-up matrix corresponding to items in a sequence of item-clicks with respect to a training data. L2 norm is applied to the item embedding look-up matrix to learn a normalized item embeddings. Using a neural network, a session embeddings corresponding to the sequences of item-clicks is modeled and L2 norm is applied to the session embeddings to obtain a normalized session embeddings. Relevance scores corresponding to each of the plurality of items are obtained based on similarity between the normalized item embeddings and the normalized session embeddings. A multi-dimensional probability vector corresponding to the relevance scores for the items to be clicked in the sequence is obtained. A list of the items ordered based on the multi-dimensional probability vector is provided as recommendation.

Abstract: Existing techniques assume that all time varying covariates are confounding and thus attempts to balance a full state representation of a plurality of historical observants. The present disclosure processes a plurality of historical observants and treatment at a timestep t specific to each patient using an encoder network to a obtain a state representation st. A first set of disentangled representations comprising an outcome, a confounding and a treatment representation is learnt to predict an outcome t+1. The first set of disentangled representations are concatenated to obtain a unified representation and the decoder network is initialized using the unified representation to obtain a state representation st+1. A second set of disentangled representations is learnt and concatenated to predict outcome t+m+1 m+1 timesteps ahead of the timestep t and proceeding iteratively until m=??1.

Abstract: This disclosure relates to optimizing an operation of an equipment by a neural network based optimizer is provided. The method include receiving, information associated with at least one equipment instance (j) as an input at a predefined sequence of timestamps; training, a plurality of simulation models for each equipment instance to obtain a function (fj); processing, the external input parameters (et) to obtain a fixed-dimensional vector and passed as an input to obtain an vector (it); generating, a modified (it) from the output vector (it) based on a domain constraint value; computing, a reward (rt) based on (i) the function (fj), (ii) the modified (it), (iii) the external input parameters (et), and (iv) a reward function (Rj); and iteratively performing the steps of processing, generating, and computing reward (rt) for a series of subsequent equipment instances after expiry of the predefined sequence of timestamps associated with a first equipment instance.

Abstract: This disclosure relates generally to program synthesis for weakly-supervised multimodal question answering using filtered iterative back-translation (FIBT). Existing approaches for chart question answering mainly address structural, visual, relational, or simple data retrieval queries with fixed-vocabulary answers. The present disclosure implements a two-stage approach where, in first stage, a computer vision pipeline is employed to extract data from chart images and store in a generic schema. In second stage, SQL programs for Natural Language (NL) queries are generated in dataset by using FIBT. To adapt forward and backward models to required NL queries, a Probabilistic Context-Free Grammar is defined, whose probabilities are set to be inversely proportional to SQL programs in training data and sample programs from it.

Abstract: In the world of digital advertising, optimally allocating an advertisement campaign within a fixed pre-defined budget for an advertising duration aimed at maximizing number of conversions is very important for an advertiser. Embodiments of present disclosure provides a robust and easily generalizable method of optimal allocation of advertisement campaign by formulating it as a constrained Markov Decision Process (MDP) defined by agent state comprising user state and advertiser state, action space comprising a plurality of ad campaigns, state transition routine and a cumulative reward model which rewards maximum total conversions in an advertising duration. The cumulative reward model is trained in conjunction with a deep Q-network for solving the MDP to optimally allocate advertisement campaign for an advertising duration within a constrained budget.

Abstract: Embodiments disclosed herein model lifelong intent detection as a class-incremental learning where a new set of intents/classes are added at each incremental step. To address the issue of catastrophic forgetting during lifelong intent detection (LID), an incremental learner is provided with Prompt Augmented Generative Replay, wherein unlike existing approaches that store real samples in replay memory, only concept words obtained from old intents are stored, which reduces memory consumption and speeds up incremental training still enabling not forgetting the old intents. Joint training of an incremental learner is carried out for LID and a pseudo-labeled utterance generation with objective is to classify a user utterance into one of multiple pre-defined intents by minimizing a total Loss function comprising a LID loss function, a Labeled Utterance Generation loss function, a Supervised Contrastive Training loss function, and a Knowledge Distillation loss function.

Abstract: Existing semi-supervised and unsupervised approaches for intent discovery require an estimate of the number of new intents present in the user logs. The present disclosure receives labeled utterances from known intents and update parameters of a pre-trained language model (PLM). Representation learning and clustering is performed iteratively using labeled and unlabeled utterances from known intents and unlabeled utterances from unknown intents to fine-tune PLM and a plurality of clusters is generated. Cluster merger algorithm is executed iteratively on generated plurality of clusters. A query cluster is obtained by randomly selecting one cluster from the plurality of clusters and by obtaining a corresponding plurality of nearest neighbors based on a cosine-similarity. A response for merging the query cluster and corresponding plurality of nearest neighbors is obtained, and a new cluster is created.

Abstract: Organizations are constantly flooded with questions, ranging from mundane to the unanswerable. It is therefore respective department that actively looks for automated assistance, especially to alleviate the burden of routine, but time-consuming tasks. The embodiments of the present disclosure provide BiLSTM-Siamese Network based Classifier for identifying target class of queries and providing responses to queries pertaining to the identified target class, which acts as an automated assistant that alleviates burden of answering queries in well-defined domains. Siamese Model (SM) is trained for a epochs, and then the same Base-Network is used to train Classification Model (CM) for b epochs iteratively until best accuracy is observed on validation test, wherein SM ensures it learns which sentences are similar/dissimilar semantically while CM learns to predict target class of every user query. Here a and b are assumed to be hyper parameters and are tuned for best performance on the validation set.

Abstract: This disclosure relates to a method and system for extracting information from images of one or more templatized documents. A knowledge graph with a fixed schema based on background knowledge is used to capture spatial and semantic relationships of entities present in scanned document and an adaptive lattice-based approach based on formal concepts analysis (FCA) is used to determine a similarity metric that utilizes both spatial and semantic information to determine if the structure of the scanned document image adheres to any of the known document templates. If a known document template whose structure is closely matching the structure of the scanned document is detected, then an inductive rule learning based approach is used to learn symbolic rules to extract information present in scanned document image and if a new document template is detected, then future scanned document images belonging to new document template are automatically processed using the learnt rules.

Abstract: For various applications (for example, a Virtual Assistant), mechanisms that are capable of collecting user queries and generating responses are being used. While such systems handle structured queries well, they struggle to or fail to interpret an unstructured Natural Language (NL) query. The disclosure herein generally relates to data processing, and, more particularly, to a method and a system for generating responses to unstructured Natural Language (NL) queries. The system collects at least one NL query as input at a time, and generates a sketch, where the sketch is a structured representation of the unstructured NL query. Further by processing the sketch, the system generates one or more database queries. The one or more database queries are then used to search in one or more associated databases and to retrieve matching results, which are then used to generate response to the at least one NL query.

Abstract: Recommender Systems (RS) tend to recommend more popular items instead of the relevant long-tail items. Mitigating such popularity bias is crucial to ensure that less popular but relevant items are recommended. System described herein analyses popularity bias in session-based RS obtained via deep learning (DL) models. DL models trained on historical user-item interactions in session logs (having long-tailed item-click distributions) tend to amplify popularity bias. To understand source of this bias amplification, potential sources of bias at data-generation stage (user-item interactions captured as session logs) and model training stage are considered by the system for recommendation wherein popularity of item has causal effect on user-item interactions via conformity bias, and item ranking from models via biased training process due to class imbalance.

Abstract: This disclosure relates generally to method and system for providing assistance to interviewers. Technical interviewing is immensely important for enterprise but requires significant domain expertise and investment of time. The present disclosure aids assists interviewers with a framework via an interview assistant bot. The method initiates an interview session for a job description by selecting a set of qualified candidates resume to be interviewed. Further, the IA bot recommends each interviewer with a set of question and reference answer pairs prior initiating the interview. At each interview step, the IA bot records interview history and recommends interviewer with the revised set of questions. Further, an assessment score is determined for the candidate using the reference answer extracted from a resource corpus. Additionally, statistics about the interview process is generated, such as number and nature of questions asked, and its variation across to identify outliers for corrective actions.

Abstract: In the world of digital advertising, optimally allocating an advertisement campaign within a fixed pre-defined budget for an advertising duration aimed at maximizing number of conversions is very important for an advertiser. Embodiments of present disclosure provides a robust and easily generalizable method of optimal allocation of advertisement campaign by formulating it as a constrained Markov Decision Process (MDP) defined by agent state comprising user state and advertiser state, action space comprising a plurality of ad campaigns, state transition routine and a cumulative reward model which rewards maximum total conversions in an advertising duration. The cumulative reward model is trained in conjunction with a deep Q-network for solving the MDP to optimally allocate advertisement campaign for an advertising duration within a constrained budget.

Abstract: Existing techniques assume that all time varying covariates are confounding and thus attempts to balance a full state representation of a plurality of historical observants. The present disclosure processes a plurality of historical observants and treatment at a timestep t specific to each patient using an encoder network to a obtain a state representation st. A first set of disentangled representations comprising an outcome, a confounding and a treatment representation is learnt to predict an outcome t+1. The first set of disentangled representations are concatenated to obtain a unified representation and the decoder network is initialized using the unified representation to obtain a state representation st+1. A second set of disentangled representations is learnt and concatenated to predict outcome t+m+1 m+1 timesteps ahead of the timestep t and proceeding iteratively until m=??1.

Abstract: Neural networks can be used for time series data classification. However, in a K-shot scenario in which sufficient training data is unavailable to train the neural network, the neural network may not produce desired results. Disclosed herein are a method and system for training a neural network for time series data classification. In this method, by processing a plurality of task specific data, a system generates a set of updated parameters, which is further used to train a neural network (network) till a triplet loss is below a threshold. The network is trained on a diverse set of few-shot tasks sampled from various domains (e.g. healthcare, activity recognition, and so on) such that it can solve a target task from another domain using only a small number of training samples from the target task.

Abstract: Estimating Remaining Useful Life (RUL) from multi-sensor time series data is difficult through manual inspection. Current machine learning and data analytics methods, for RUL estimation require large number of failed instances for training, which are rarely available in practice, and these methods cannot use information from currently operational censored instances since their failure time is unknown. Embodiments of the present disclosure provide systems and methods for estimating RUL using time series data by implementing an LSTM-RNN based ordinal regression technique, wherein during training RUL value of failed instance(s) is encoded into a vector which is given as a target to the model. Unlike a failed instance, the exact RUL for a censored instance is unknown. For using the censored instances, target vectors are generated and the objective function is modified for training wherein the trained LSTM-RNN based ordinal regression is applied on an input test time series for RUL estimation.