Rekha P. Kulkarni

h-index11
2papers
335citations

2 Papers

24.1CLSep 26, 2022
Towards Simple and Efficient Task-Adaptive Pre-training for Text Classification

Arnav Ladkat, Aamir Miyajiwala, Samiksha Jagadale et al.

Language models are pre-trained using large corpora of generic data like book corpus, common crawl and Wikipedia, which is essential for the model to understand the linguistic characteristics of the language. New studies suggest using Domain Adaptive Pre-training (DAPT) and Task-Adaptive Pre-training (TAPT) as an intermediate step before the final finetuning task. This step helps cover the target domain vocabulary and improves the model performance on the downstream task. In this work, we study the impact of training only the embedding layer on the model's performance during TAPT and task-specific finetuning. Based on our study, we propose a simple approach to make the intermediate step of TAPT for BERT-based models more efficient by performing selective pre-training of BERT layers. We show that training only the BERT embedding layer during TAPT is sufficient to adapt to the vocabulary of the target domain and achieve comparable performance. Our approach is computationally efficient, with 78\% fewer parameters trained during TAPT. The proposed embedding layer finetuning approach can also be an efficient domain adaptation technique.

1.2NAAug 2, 2017
Discrete Modified Projection Method for Urysohn Integral Equations with Smooth Kernels

Rekha P. Kulkarni, Gobinda Rakshit

Approximate solutions of linear and nonlinear integral equations using methods related to an interpolatory projection involve many integrals which need to be evaluated using a numerical quadrature formula. In this paper, we consider discrete versions of the modified projection method and of the iterated modified projection methodfor solution of a Urysohn integral equation with a smooth kernel. For $r \geq 1,$ a space of piecewise polynomials of degree less than or equal to r - 1 with respect to an uniform partition is chosen to be the approximating space and the projection is chosen to be the interpolatory projection at r Gauss points. The orders of convergence which we obtain for these discrete versions indicate the choice of numerical quadrature which preserves the orders of convergence. Numerical results are given for a specific example.