1 code implementation • EMNLP 2021 • Saurav Manchanda, George Karypis
Quantitatively measuring the impact-related aspects of scientific, engineering, and technological (SET) innovations is a fundamental problem with broad applications.
no code implementations • 15 Jul 2024 • Quang H. Nguyen, Duy C. Hoang, Juliette Decugis, Saurav Manchanda, Nitesh V. Chawla, Khoa D. Doan
The rapid progress in machine learning (ML) has brought forth many large language models (LLMs) that excel in various tasks and areas.
2 code implementations • 2 Oct 2023 • Duy C. Hoang, Quang H. Nguyen, Saurav Manchanda, Minlong Peng, Kok-Seng Wong, Khoa D. Doan
Despite outstanding performance in a variety of NLP tasks, recent studies have revealed that NLP models are vulnerable to adversarial attacks that slightly perturb the input to cause the models to misbehave.
1 code implementation • 19 Sep 2022 • Saurav Manchanda
As these models only use the observed triplets to estimate the embeddings, they are prone to suffer through data sparsity that usually occurs in the real-world knowledge graphs, i. e., the lack of enough triplets per entity.
no code implementations • 12 Sep 2022 • Yuqing Xie, Taesik Na, Xiao Xiao, Saurav Manchanda, Young Rao, Zhihong Xu, Guanghua Shu, Esther Vasiete, Tejaswi Tenneti, Haixun Wang
To train the model efficiently on noisy data, we propose a self-adversarial learning method and a cascade training method.
no code implementations • 3 May 2021 • Saurav Manchanda, Da Zheng, George Karypis
To address this question, we propose our GCN framework 'Deep Heterogeneous Graph Convolutional Network (DHGCN)', which takes advantage of the schema of a heterogeneous graph and uses a hierarchical approach to effectively utilize information many hops away.
no code implementations • 15 Dec 2020 • Saurav Manchanda, Mohit Sharma, George Karypis
Slot-filling refers to the task of annotating individual terms in a query with the corresponding intended product characteristics (product type, brand, gender, size, color, etc.).
1 code implementation • 26 Mar 2020 • Khoa D. Doan, Saurav Manchanda, Fengjiao Wang, Sathiya Keerthi, Avradeep Bhowmik, Chandan K. Reddy
We use the intuition that it is much better to train the GAN generator by minimizing the distributional distance between real and generated images in a small dimensional feature space representing such a manifold than on the original pixel-space.
1 code implementation • 3 Mar 2020 • Saurav Manchanda, Khoa Doan, Pranjul Yadav, S. Sathiya Keerthi
This paper addresses the classic problem of regression, which involves the inductive learning of a map, $y=f(x, z)$, $z$ denoting noise, $f:\mathbb{R}^n\times \mathbb{R}^k \rightarrow \mathbb{R}^m$.
1 code implementation • 29 Feb 2020 • Khoa D. Doan, Saurav Manchanda, Sarkhan Badirli, Chandan K. Reddy
In this paper, we show that the high sample-complexity requirement often results in sub-optimal retrieval performance of the adversarial hashing methods.
no code implementations • 7 Feb 2020 • Saurav Manchanda, Pranjul Yadav, Khoa Doan, S. Sathiya Keerthi
We present an experimental analysis on the historical logs of a major display advertising platform (https://www. criteo. com/).
1 code implementation • 26 Nov 2019 • Saurav Manchanda, George Karypis
Experiments on the credit attribution task on a variety of datasets show that the sentence class labels generated by CAWA outperform the competing approaches.
1 code implementation • 22 Aug 2019 • Saurav Manchanda, Mohit Sharma, George Karypis
Moreover, for the tasks of identifying the important terms in a query and for predicting the additional terms that represent product intent, experiments illustrate that our approaches outperform the non-contextual baselines.
no code implementations • 14 Apr 2019 • Saurav Manchanda, George Karypis
Segmenting text into semantically coherent segments is an important task with applications in information retrieval and text summarization.
no code implementations • 14 Apr 2019 • Saurav Manchanda, George Karypis
Word2Vec's Skip Gram model is the current state-of-the-art approach for estimating the distributed representation of words.