Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Ritesh Sarkhel

dblp:167/6748 · DBLP profile ↗
← Back
14ranked-venue papers
8as first author
6since 2021 · last 2025
0000-0002-9116-1517ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 10 · 5 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Information extraction and text analysis · 39% Language models and text generation · 27% Efficient and distributed learning · 12%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 12 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model evaluation
0.812024
Shopping MMLU: A Massive Multi-Task Online Shopping Benchmark for Large Language Models · NeurIPS 2024
Natural language and speech › Language models and text generation › large language model evaluation
multi-task benchmark
0.812024
Shopping MMLU: A Massive Multi-Task Online Shopping Benchmark for Large Language Models · NeurIPS 2024
Machine learning › Efficient and distributed learning › data-efficient learning
label-efficient learning
0.712023
Self-Training for Label-Efficient Information Extraction from Semi-Structured Web-Pages · Proc. VLDB Endow. 2023
Machine learning › Transfer learning and domain adaptation › domain adaptation › unsupervised domain adaptation
self-training
0.712023
Self-Training for Label-Efficient Information Extraction from Semi-Structured Web-Pages · Proc. VLDB Endow. 2023
Natural language and speech › Information extraction and text analysis
named entity recognition
0.512021
Improving Information Extraction from Visually Rich Documents using Visual Span Representations · Proc. VLDB Endow. 2021
Natural language and speech › Information extraction and text analysis › document analysis › document information extraction
visually rich document information extraction
0.512021
Improving Information Extraction from Visually Rich Documents using Visual Span Representations · Proc. VLDB Endow. 2021
Natural language and speech › Information extraction and text analysis › text segmentation
document segmentation
0.412019
Visual Segmentation for Information Extraction from Heterogeneous Visually Rich Documents · SIGMOD Conference 2019
Natural language and speech › Information extraction and text analysis
document understanding
0.412019
Visual Segmentation for Information Extraction from Heterogeneous Visually Rich Documents · SIGMOD Conference 2019
Recommender systems
online shopping
0.212024
Shopping MMLU: A Massive Multi-Task Online Shopping Benchmark for Large Language Models · NeurIPS 2024
Natural language and speech › Language models and text generation
large language model fine-tuning
0.212023
Self-Training for Label-Efficient Information Extraction from Semi-Structured Web-Pages · Proc. VLDB Endow. 2023
Machine learning › Efficient and distributed learning
inference acceleration
0.112019
Deterministic Routing between Layout Abstractions for Multi-Scale Classification of Visually Rich Documents · IJCAI 2019
Image and video processing › feature extraction
image feature extraction
0.112019
Visual Segmentation for Information Extraction from Heterogeneous Visually Rich Documents · SIGMOD Conference 2019

Methods — techniques the papers use, named apart from their topics

few-shot learning · 1.5self-training · 1.2distantly supervised search-and-select · 0.8uncertainty-aware training · 0.7generative model · 0.7multimodal encoding · 0.5deep neural network · 0.5visual segmentation · 0.4spatial pyramid model · 0.4deterministic routing · 0.4depth-wise separable multi-column convolutional network · 0.4
YearPublicationVenuePosition
2025 DocTalk: Scalable Graph-based Dialogue Synthesis for Enhancing LLM Conversational Capabilities
abstract
Large Language Models (LLMs) are increasingly employed in multi-turn conversational tasks, yet their pre-training data predominantly consists of continuous prose, creating a potential mismatch between required capabilities and training paradigms. We introduce a novel approach to address this discrepancy by synthesizing conversational data from existing text corpora. We present a pipeline that transforms a cluster of multiple related documents into an extended multi-turn, multi-topic information-seeking dialogue. Applying our pipeline to Wikipedia articles, we curate DocTalk, a multi-turn pre-training dialogue corpus consisting of over 730k long conversations. We hypothesize that exposure to such synthesized conversational structures during pre-training can enhance the fundamental multi-turn capabilities of LLMs, such as context memory and understanding. Empirically, we show that incorporating DocTalk during pre-training results in up to 40% gain in context memory and understanding, without compromising base performance. DocTalk is available at https://huggingface.co/datasets/AmazonScience/DocTalk.
Jing Yang Lee, Hamed Bonab, Nasser Zalmout, Ming Zeng 0001, Sanket Lokegaonkar, Colin Lockard, Binxuan Huang, Ritesh Sarkhel
SIGDIAL8
2024 Shopping MMLU: A Massive Multi-Task Online Shopping Benchmark for Large Language Models
abstract
Online shopping is a complex multi-task, few-shot learning problem with a wide and evolving range of entities, relations, and tasks. However, existing models and benchmarks are commonly tailored to specific tasks, falling short of capturing the full complexity of online shopping. Large Language Models (LLMs), with their multi-task and few-shot learning abilities, have the potential to profoundly transform online shopping by alleviating task-specific engineering efforts and by providing users with interactive conversations. Despite the potential, LLMs face unique challenges in online shopping, such as domain-specific concepts, implicit knowledge, and heterogeneous user behaviors. Motivated by the potential and challenges, we propose Shopping MMLU, a diverse multi-task online shopping benchmark derived from real-world Amazon data. Shopping MMLU consists of 57 tasks covering 4 major shopping skills: concept understanding, knowledge reasoning, user behavior alignment, and multi-linguality, and can thus comprehensively evaluate the abilities of LLMs as general shop assistants. With Shoppping MMLU, we benchmark over 20 existing LLMs and uncover valuable insights about practices and prospects of building versatile LLM-based shop assistants. Shopping MMLU can be publicly accessed at https://github.com/KL4805/ShoppingMMLU. In addition, with Shopping MMLU, we are hosting a competition in KDD Cup 2024 with over 500 participating teams. The winning solutions and the associated workshop can be accessed at our website https://amazon-kddcup24.github.io/.
Yilun Jin, Zheng Li 0018, Tianyu Cao 0001, Yifan Gao 0001, Pratik Jayarao, Xin Liu 0039, Ritesh Sarkhel, Xianfeng Tang, Wenju Xu, Jingfeng Yang 0001, Qingyu Yin, Priyanka Nigam, Yi Xu 0011, Kai Chen 0005, Qiang Yang 0001, Meng Jiang 0001
NeurIPS9
2024 Natural scene text localization and detection using MSER and its variants: a comprehensive survey
Kalpita Dutta, Ritesh Sarkhel, Mahantapas Kundu, Mita Nasipuri, Nibaran Das
Multim. Tools Appl.2
2023 Self-Training for Label-Efficient Information Extraction from Semi-Structured Web-Pages
abstract
Information Extraction (IE) from semi-structured web-pages is a long studied problem. Training a model for this extraction task requires a large number of human-labeled samples. Prior works have proposed transferable models to improve the label-efficiency of this training process. Extraction performance of transferable models however, depends on the size of their fine-tuning corpus. This holds true for large language models (LLM) such as GPT-3 as well. Generalist models like LLMs need to be fine-tuned on in-domain, human-labeled samples for competitive performance on this extraction task. Constructing a large-scale fine-tuning corpus with human-labeled samples, however, requires significant effort. In this paper, we develop aLabel-Efficient Self-Training Algorithm(LEAST) to improve the label-efficiency of this fine-tuning process. Our contributions are two-fold.First, we develop a generative model that facilitates the construction of a large-scale fine-tuning corpus with minimal human-effort.Second, to ensure that the extraction performance does not suffer due to noisy training samples in our fine-tuning corpus, we develop an uncertainty-aware training strategy. Experiments on two publicly available datasets show that LEAST generalizes to multiple verticals and backbone models. Using LEAST, we can train models with less than ten human-labeled pages from each website, outperforming strong baselines while reducing the number of human-labeled training samples needed for comparable performance by up to 11x.
Ritesh Sarkhel, Binxuan Huang, Colin Lockard, Prashant Shiralkar
Proc. VLDB Endow.1
2021 Two-phase Dynamic Routing for Micro and Macro-level Equivariance in Multi-Column Capsule Networks
Bodhisatwa Mandal, Ritesh Sarkhel, Swarnendu Ghosh, Nibaran Das, Mita Nasipuri
Pattern Recognit.2
2021 Improving Information Extraction from Visually Rich Documents using Visual Span Representations
abstract
Along with textual content, visual features play an essential role in the semantics of visually rich documents. Information extraction (IE) tasks perform poorly on these documents if these visual cues are not taken into account. In this paper, we present Artemis - a visually aware, machine-learning-based IE method for heterogeneous visually rich documents. Artemis represents a visual span in a document by jointly encoding its visual and textual context for IE tasks. Our main contribution is two-fold. First, we develop a deep-learning model that identifies the local context boundary of a visual span with minimal human-labeling. Second, we describe a deep neural network that encodes the multimodal context of a visual span into a fixed-length vector by taking its textual and layout-specific features into account. It identifies the visual span(s) containing a named entity by leveraging this learned representation followed by an inference task. We evaluate Artemis on four heterogeneous datasets from different domains over a suite of information extraction tasks. Results show that it outperforms state-of-the-art text-based methods by up to 17 points in F1-score.
Ritesh Sarkhel, Arnab Nandi 0001
Proc. VLDB Endow.1
2020 Interpretable Multi-headed Attention for Abstractive Summarization at Controllable Lengths
abstract
Abstractive summarization at controllable lengths is a challenging task in natural language processing.It is even more challenging for domains where limited training data is available or scenarios in which the length of the summary is not known beforehand.At the same time, when it comes to trusting machine-generated summaries, explaining how a summary was constructed in human-understandable terms may be critical.We propose Multi-level Summarizer (MLS), a supervised method to construct abstractive summaries of a text document at controllable lengths.The key enabler of our method is an interpretable multi-headed attention mechanism that computes attention distribution over an input document using an array of timestep independent semantic kernels.Each kernel optimizes a human-interpretable syntactic or semantic property.Exhaustive experiments on two low-resource datasets in English language show that MLS outperforms strong baselines by up to 14.70% in the METEOR score.Human evaluation of the summaries also suggests that they capture the key concepts of the document at various length-budgets.
Ritesh Sarkhel, Moniba Keymanesh, Arnab Nandi 0001, Srinivasan Parthasarathy 0001
COLING1
2019 Deterministic Routing between Layout Abstractions for Multi-Scale Classification of Visually Rich Documents
abstract
Classifying heterogeneous visually rich documents is a challenging task. Difficulty of this task increases even more if the maximum allowed inference turnaround time is constrained by a threshold. The increased overhead in inference cost, compared to the limited gain in classification capabilities make current multi-scale approaches infeasible in such scenarios. There are two major contributions of this work. First, we propose a spatial pyramid model to extract highly discriminative multi-scale feature descriptors from a visually rich document by leveraging the inherent hierarchy of its layout. Second, we propose a deterministic routing scheme for accelerating end-to-end inference by utilizing the spatial pyramid model. A depth-wise separable multi-column convolutional network is developed to enable our method. We evaluated the proposed approach on four publicly available, benchmark datasets of visually rich documents. Results suggest that our proposed approach demonstrates robust performance compared to the state-of-the-art methods in both classification accuracy and total inference turnaround.
Ritesh Sarkhel, Arnab Nandi 0001
IJCAI1
2019 Visual Segmentation for Information Extraction from Heterogeneous Visually Rich Documents
abstract
Physical and digital documents often contain visually rich information. With such information, there is no strict ordering or positioning in the document where the data values must appear. Along with textual cues, these documents often also rely on salient visual features to define distinct semantic boundaries and augment the information they disseminate. When performing information extraction (IE), traditional techniques fall short, as they use a text-only representation and do not consider the visual cues inherent to the layout of these documents. We propose VS2, a generalized approach for information extraction from heterogeneous visually rich documents. There are two major contributions of this work. First, we propose a robust segmentation algorithm that decomposes a visually rich document into a bag of visually isolated but semantically coherent areas, called logical blocks. Document type agnostic low-level visual and semantic features are used in this process. Our second contribution is a distantly supervised search-and-select method for identifying the named entities within these documents by utilizing the context boundaries defined by these logical blocks. Experimental results on three heterogeneous datasets suggest that the proposed approach significantly outperforms its text-only counterparts on all datasets. Comparing it against the state-of-the-art methods also reveal that VS2 performs comparably or better on all datasets.
Ritesh Sarkhel, Arnab Nandi 0001
SIGMOD Conference1
2019 Multiobjective optimization for recognition of isolated handwritten Indic scripts
Anisha Gupta, Ritesh Sarkhel, Nibaran Das, Mahantapas Kundu
Pattern Recognit. Lett.2
2018 An improved Harmony Search Algorithm embedded with a novel piecewise opposition based learning algorithm
Ritesh Sarkhel, Nibaran Das, Amit K. Saha, Mita Nasipuri
Eng. Appl. Artif. Intell.1
2018 Object Localization on Natural Scenes: A Survey
abstract
Object localization is one of the inherent tasks of computer vision. It plays an intrinsic role in object detection tasks that initiate with a recognition procedure of figuring out the presence of single/multiple instances of objects of interest in a given image. It involves determination of precise locations of object instances. This paper presents an overview of some of the popularly used approaches to the object localization problem, involving efficient branch-and-bound strategy for sub-window search, super-pixel neighborhood information based approach, boosted local structured Histogram of Oriented Gradients-Local Binary Patterns (HOG-LBP) based strategy, multi-instance learning based weakly supervised object localization, object localization by utilizing deep networks and image tag based object localization. The performance of the mentioned approaches have been compared on the basis of their results on PASCAL-VOC 2007 dataset.
Sandipan Choudhuri, Nibaran Das, Ritesh Sarkhel, Mita Nasipuri
Int. J. Pattern Recognit. Artif. Intell.3
2017 A multi-scale deep quad tree based feature extraction method for the recognition of isolated handwritten characters of popular indic scripts
Ritesh Sarkhel, Nibaran Das, Mahantapas Kundu, Mita Nasipuri
Pattern Recognit.1
2016 A multi-objective approach towards cost effective isolated handwritten Bangla character and digit recognition
Ritesh Sarkhel, Nibaran Das, Amit K. Saha, Mita Nasipuri
Pattern Recognit.1