arXiv subjects

Rishu Garg

Publications and source records attributed to Rishu Garg.

9 recordsLinked to original sources

arXiv2025

On irreducible factors of polynomials over integers

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their higher order formal derivatives at sufficiently large integer arguments. If a lower bound for the minimum possible degree of a factor of such a polynomial is known a priori, then the integer argument becomes significantly smaller, which makes the underlying factorization result easier to apply. A result on explicit lower degree factor bound for the classes of polynomials considered in this paper is also proved via Newton polygons.

math.NT↗

arXiv2025

A generalized Dumas irreducibility criterion

As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, among other results, a lower degree factor bound on factors of a given polynomial over a valued field with a Krull valuation is proved. These factorization results not only unify several known irreducibility results for polynomials over the said domains but also provide us sharp bounds on degrees of irreducible factors of the underlying polynomials.

math.NT↗

arXiv2025

WARC-Bench: Web Archive Based Benchmark for GUI Subtask Executions

Training web agents to navigate complex, real-world websites requires them to master $\textit{subtasks}$ - short-horizon interactions on multiple UI components (e.g., choosing the correct date in a date picker, or scrolling in a container to extract information). We introduce WARC-Bench (Web Archive Benchmark), a novel web navigation benchmark featuring 438 tasks designed to evaluate multimodal AI agents on subtasks. WARC-Bench enables sandboxed interactions with dynamic and realistic webpages using Web ARChive files. We show that WARC-Bench is challenging for leading computer-use models, with the highest observed success rate being 64.8%. To improve open source models on subtask, we explore two common training techniques: supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR). Experiments show that SFT models obtain a 48.8% success rate on the benchmark. Training with RLVR over SFT checkpoints, even in data-scarce settings, improves the score to 52.8% on WARC-Bench, outperforming many frontier models. Our analysis concludes that mastering these subtasks is essential for robust web planning and navigation, and is a capability not extensively evaluated by existing benchmarks.

cs.LG↗

arXiv2025

Some factorization results for formal power series

In this paper, we obtain some factorization results on formal power series over principle ideal domains with sharp bounds on number of irreducible factors. These factorization results correspondingly lead to irreducibility criteria for formal power series. The information about prime factorization of the constant term up to a unit and that of some higher order terms is utilized for the purpose. Further, using theory of Newton polygons for power series, we extend the classical Dumas irreducibility criterion to formal power series over discrete valuation domains, which in particular, yields several irreducibility criteria.

math.NT↗

arXiv2024

Some factorization results for bivariate polynomials

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the degrees of the coefficients of $f$, and on information on the factorization of the constant term and of the leading coefficient of $f$, viewed as a polynomial in $y$ with coefficients in $\mathbb{K}[x]$. In particular, we provide a generalization of the bivariate version of Perron's irreducibility criterion, and similar results for polynomials in an arbitrary number of indeterminates. The proofs use non-Archimedean absolute values, that are suitable for finding information on the location of the roots of $f$ in an algebraic closure of $\mathbb{K}(x)$.

math.NT↗

arXiv2023

Some factorization results on polynomials having integer coefficients

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing some sufficiency conditions on their coefficients along with some conditions on the prime factorization of constant term or the leading coefficient of the underlying polynomials in conjunction with the information about their root location.

math.NT↗

arXiv2020

Feature Engineering Combined with 1 D Convolutional Neural Network for Improved Mortality Prediction

The intensive care units (ICUs) are responsible for generating a wealth of useful data in the form of Electronic Health Record (EHR). This data allows for the development of a prediction tool with perfect knowledge backing. We aimed to build a mortality prediction model on 2012 Physionet Challenge mortality prediction database of 4000 patients admitted in ICU. The challenges in the dataset, such as high dimensionality, imbalanced distribution, and missing values were tackled with analytical methods and tools via feature engineering and new variable construction. The objective of the research is to utilize the relations among the clinical variables and construct new variables which would establish the effectiveness of 1-Dimensional Convolutional Neural Network (1- D CNN) with constructed features. Its performance with the traditional machine learning algorithms like XGBoost classifier, Support Vector Machine (SVM), K-Neighbours Classifier (K-NN), and Random Forest Classifier (RF) is compared for Area Under Curve (AUC). The investigation reveals the best AUC of 0.848 using 1-D CNN model.

cs.LG↗

arXiv2019

Enhancing Learnability of classification algorithms using simple data preprocessing in fMRI scans of Alzheimer's disease

Alzheimer's Disease (AD) is the most common type of dementia. In all leading countries, it is one of the primary reasons of death in senior citizens. Currently, it is diagnosed by calculating the MSME score and by the manual study of MRI Scan. Also, different machine learning methods are utilized for automatic diagnosis but existing has some limitations in terms of accuracy. In this paper, we have proposed some novel preprocessing techniques that have significantly increased the accuracy and at the same time decreased the training time of various classification algorithms. First, we have converted the ADNI dataset which was in 4D format into 2D form. We have also mitigated the computation costs by reducing the parameters of the input dataset while preserving important and relevant data. We have achieved this by using different preprocessing steps like grayscale image conversion, Histogram equalization and selective clipping of dataset. We observed a highest accuracy of 97.52% and a sensitivity of 97.6% in our testing dataset.

cs.LG↗

arXiv2019

Decision Support System for Detection and Classification of Skin Cancer using CNN

Skin Cancer is one of the most deathful of all the cancers. It is bound to spread to different parts of the body on the off chance that it is not analyzed and treated at the beginning time. It is mostly because of the abnormal growth of skin cells, often develops when the body is exposed to sunlight. The Detection Furthermore, the characterization of skin malignant growth in the beginning time is a costly and challenging procedure. It is classified where it develops and its cell type. High Precision and recall are required for the classification of lesions. The paper aims to use MNIST HAM-10000 dataset containing dermoscopy images. The objective is to propose a system that detects skin cancer and classifies it in different classes by using the Convolution Neural Network. The diagnosing methodology uses Image processing and deep learning model. The dermoscopy image of skin cancer taken, undergone various techniques to remove the noise and picture resolution. The image count is also increased by using various image augmentation techniques. In the end, the Transfer Learning method is used to increase the classification accuracy of the images further. Our CNN model gave a weighted average Precision of 0.88, a weighted Recall average of 0.74, and a weighted f1-score of 0.77. The transfer learning approach applied using ResNet model yielded an accuracy of 90.51%

cs.LG↗