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.
? Tutorial for this page

Nishant Kambhatla

dblp:228/5515 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-author · 3 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
2 papers
Machine translation · 47% Language models and text generation · 29% Deep learning architectures and training · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
data augmentation
0.612022
CipherDAug: Ciphertext based Data Augmentation for Neural Machine Translation · ACL (1) 2022
Natural language and speech › Machine translation
neural machine translation
0.612022
CipherDAug: Ciphertext based Data Augmentation for Neural Machine Translation · ACL (1) 2022
Natural language and speech › Language models and text generation › decoding › decoding strategy
beam search
0.312018
Decipherment of Substitution Ciphers with Neural Language Models · EMNLP 2018
Natural language and speech › Machine translation
decipherment
0.312018
Decipherment of Substitution Ciphers with Neural Language Models · EMNLP 2018
Natural language and speech › Language models and text generation
neural language model
0.312018
Decipherment of Substitution Ciphers with Neural Language Models · EMNLP 2018
Natural language and speech › Machine translation
low-resource machine translation
0.212022
CipherDAug: Ciphertext based Data Augmentation for Neural Machine Translation · ACL (1) 2022

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

multi-source training · 0.6co-regularization · 0.6ROT-k ciphertext · 0.6rest cost estimation · 0.3neural language model · 0.3beam search · 0.3
YearPublicationVenuePosition
2022 CipherDAug: Ciphertext based Data Augmentation for Neural Machine Translation
abstract
We propose a novel data-augmentation technique for neural machine translation based on ROT-k ciphertexts.ROT-k is a simple letter substitution cipher that replaces a letter in the plaintext with the kth letter after it in the alphabet.We first generate multiple ROT-k ciphertexts using different values of k for the plaintext which is the source side of the parallel data.We then leverage this enciphered training data along with the original parallel data via multi-source training to improve neural machine translation.Our method, CipherDAug, uses a co-regularization-inspired training procedure, requires no external data sources other than the original training data, and uses a standard Transformer to outperform strong data augmentation techniques on several datasets by a significant margin.This technique combines easily with existing approaches to data augmentation, and yields particularly strong results in low-resource settings.1
Nishant Kambhatla, Logan Born, Anoop Sarkar
ACL (1)1
2022 Auxiliary Subword Segmentations as Related Languages for Low Resource Multilingual Translation
abstract
We propose a novel technique that combines alternative subword tokenizations of a single source-target language pair that allows us to leverage multilingual neural translation training methods. These alternate segmentations function like related languages in multilingual translation. Overall this improves translation accuracy for low-resource languages and produces translations that are lexically diverse and morphologically rich. We also introduce a cross-teaching technique which yields further improvements in translation accuracy and cross-lingual transfer between high- and low-resource language pairs. Compared to other strong multilingual baselines, our approach yields average gains of +1.7 BLEU across the four low-resource datasets from the multilingual TED-talks dataset. Our technique does not require additional training data and is a drop-in improvement for any existing neural translation system.
Nishant Kambhatla, Logan Born, Anoop Sarkar
EAMT1
2021 Measuring and Improving Faithfulness of Attention in Neural Machine Translation
abstract
While the attention heatmaps produced by neural machine translation (NMT) models seem insightful, there is little evidence that they reflect a model's true internal reasoning.We provide a measure of faithfulness for NMT based on a variety of stress tests where attention weights which are crucial for prediction are perturbed and the model should alter its predictions if the learned weights are a faithful explanation of the predictions.We show that our proposed faithfulness measure for NMT models can be improved using a novel differentiable objective that rewards faithful behaviour by the model through probability divergence.Our experimental results on multiple language pairs show that our objective function is effective in increasing faithfulness and can lead to a useful analysis of NMT model behaviour and more trustworthy attention heatmaps.Our proposed objective improves faithfulness without reducing the translation quality and has a useful regularization effect on the NMT model and can even improve translation quality in some cases.
Pooya Moradi, Nishant Kambhatla, Anoop Sarkar
EACL2
2018 Decipherment of Substitution Ciphers with Neural Language Models
abstract
Decipherment of homophonic substitution ciphers using language models (LMs) is a wellstudied task in NLP.Previous work in this topic scores short local spans of possible plaintext decipherments using n-gram LMs.The most widely used technique is the use of beam search with n-gram LMs proposed by Nuhn et al. (2013).We propose a beam search algorithm that scores the entire candidate plaintext at each step of the decipherment using a neural LM.We augment beam search with a novel rest cost estimation that exploits the prediction power of a neural LM.We compare against the state of the art n-gram based methods on many different decipherment tasks.On challenging ciphers such as the Beale cipher we provide significantly better error rates with much smaller beam sizes.
Nishant Kambhatla, Anahita Mansouri Bigvand, Anoop Sarkar
EMNLP1