Wasi Uddin Ahmad

Wasi Uddin Ahmad

Auto-generated profile, based on publicly available information

Wasi Uddin Ahmad

AWS AI Labs, New York City, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2023
Verified
Conference Paper
Open access
PDF file
WAWasi Uddin Ahmad
Wasi Uddin Ahmad
GTGolam Rahman Tushar
Golam Rahman Tushar
SCSaikat Chakraborty
Saikat Chakraborty
KCKai-Wei Chang
Kai-Wei Chang
Wasi Uddin Ahmad, Md Golam Rahman Tushar, Saikat Chakraborty, Kai-Wei Chang. Findings of the Association for Computational Linguistics: ACL 2023. 2023.

30 November 2023
Verified
Conference Paper
Open access
XWXiaokai Wei
Xiaokai Wei
SGSujan Kumar Gonugondla
Sujan Kumar Gonugondla
SWShiqi Wang
Shiqi Wang
WAWasi Ahmad
Wasi Ahmad
BRBaishakhi Ray
Baishakhi Ray
BXBing Xiang
Bing Xiang
ML-powered code generation aims to assist developers to write code in a more productive manner by intelligently generating code blocks based on natural language prompts. Recently, large pretrained deep learning models have pushed the boundary of code generation and achieved impressive performance. However, the huge number of model parameters poses a significant challenge to their adoption in a typical software development environment, where a developer might use a standard laptop or mid-size server to develop code. Such large models cost significant resources in terms of memory, latency, dollars, as well as carbon footprint. Model compression is a promising approach to address these challenges. We have identified quantization as one of the most promising compression techniques for code-generation as it avoids expensive retraining costs. As quantization represents model parameters with lower-bit integer (e.g., int8), the model size and runtime latency would both benefit. We empirically evaluate quantized models on code generation tasks across different dimensions: (i) resource usage and carbon footprint, (ii) accuracy, and (iii) robustness. Through systematic experiments we find a code-aware quantization recipe that could run even a 6-billion-parameter model in a regular laptop without significant accuracy or robustness degradation. We find that the recipe is readily applicable to code summarization task as well.

7 July 2016
Verified
Conference Paper
Open access
WAWasi Uddin Ahmad
Wasi Uddin Ahmad
MRMasudur Rahman
Masudur Rahman
HWHongning Wang
Hongning Wang
Modern search engines utilize users' search history for personalization, which provides more effective, useful and relevant search results. However, it also has the potential risk of revealing users' privacy by identifying their underlying intention from their logged search behaviors. To address this privacy issue, we proposed a Topic-based Privacy Protection solution on client side. In our solution, each user query will be submitted with k additional cover queries, which will act as a proxy to disguise users' intent from a search engine. The set of cover queries are generated in a controlled way so that each query carries similar uncertainty to randomize a user's search history while still providing necessary utility for the search engine to perform personalization. We used statistical topic models to infer topics from the original user query and generated cover queries of similar entropy but from unrelated topics. Extensive experiments are performed on AOL search log and the promising results demonstrated the effectiveness of our solution.

3 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
NJNihal Jain
Nihal Jain
DZDejiao Zhang
Dejiao Zhang
WAWasi Uddin Ahmad
Wasi Uddin Ahmad
ZWZijian Wang
Zijian Wang
FNFeng Nan
Feng Nan
BXBing Xiang
Bing Xiang
Despite exciting progress in causal language models, the expressiveness of the representations is largely limited due to poor discrimination ability. To remedy this issue, we present ContraCLM, a novel contrastive learning framework at both token-level and sequence-level. We assess ContraCLM on a variety of downstream tasks. We show that ContraCLM enhances discrimination of the representations and bridges the gap with the encoder-only models, which makes causal language models better suited for tasks beyond language generation. Specifically, we attain $44\%$ relative improvement on the Semantic Textual Similarity tasks and $34\%$ on Code-to-Code Search tasks. Furthermore, by improving the expressiveness of the representations, ContraCLM also boosts the source code generation capability with $9\%$ relative improvement on execution accuracy on the HumanEval benchmark.

4 June 2021 in arXiv
Verified
Preprint
Open access
PDF file
WAWasi Uddin Ahmad
Wasi Uddin Ahmad
JCJianfeng Chi
Jianfeng Chi
TLTu Le
Tu Le
TNThomas Norton
Thomas Norton
YTYuan Tian
Yuan Tian
KCKai-Wei Chang
Kai-Wei Chang
Understanding privacy policies is crucial for users as it empowers them to learn about the information that matters to them. Sentences written in a privacy policy document explain privacy practices, and the constituent text spans convey further specific information about that practice. We refer to predicting the privacy practice explained in a sentence as intent classification and identifying the text spans sharing specific information as slot filling. In this work, we propose PolicyIE, an English corpus consisting of 5,250 intent and 11,788 slot annotations spanning 31 privacy policies of websites and mobile applications. PolicyIE corpus is a challenging real-world benchmark with limited labeled examples reflecting the cost of collecting large-scale annotations from domain experts. We present two alternative neural approaches as baselines, (1) intent classification and slot filling as a joint sequence tagging and (2) modeling them as a sequence-to-sequence (Seq2Seq) learning task. The experiment results show that both approaches perform comparably in intent classification, while the Seq2Seq method outperforms the sequence tagging approach in slot filling by a large margin. We perform a detailed error analysis to reveal the challenges of the proposed corpus.