Rajiv Ratn Shah

Rajiv Ratn Shah

Auto-generated profile, based on publicly available information

Rajiv Ratn Shah

Indraprastha Institute of Information Technology Delhi

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
18 May 2021 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
RSRamit Sawhney
Ramit Sawhney
SAShivam Agarwal
Shivam Agarwal
AWArnav Wadhwa
Arnav Wadhwa
TDTyler Derr
Tyler Derr
RSRajiv Ratn Shah
Rajiv Ratn Shah
Quantitative trading and investment decision making are intricate financial tasks that rely on accurate stock selection. Despite advances in deep learning that have made significant progress in the complex and highly stochastic stock prediction problem, modern solutions face two significant limitations. They do not directly optimize the target of investment in terms of profit, and treat each stock as independent from the others, ignoring the rich signals between related stocks' temporal price movements. Building on these limitations, we reformulate stock prediction as a learning to rank problem and propose STHAN-SR, a neural hypergraph architecture for stock selection. The key novelty of our work is the proposal of modeling the complex relations between stocks through a hypergraph and a temporal Hawkes attention mechanism to tailor a new spatiotemporal attention hypergraph network architecture to rank stocks based on profit by jointly modeling stock interdependence and the temporal evolution of their prices. Through experiments on three markets spanning over six years of data, we show that STHAN-SR significantly outperforms state-of-the-art neural stock forecasting methods. We validate our design choices through ablative and exploratory analyses over STHAN-SR's spatial and temporal components and demonstrate its practical applicability.

1 September 2016 in Knowledge-Based Systems
Verified
Journal Article
Closed access
RSRajiv Ratn Shah
Rajiv Ratn Shah
YYYi Yu
Yi Yu
AVAkshay Verma
Akshay Verma
STSuhua Tang
Suhua Tang
ASAnwar Dilawar Shaikh
Anwar Dilawar Shaikh
RZRoger Zimmermann
Roger Zimmermann

8 April 2020
Verified
Book Chapter
Closed access
PDF file
DSDhruva Sahrawat
Dhruva Sahrawat
DMDebanjan Mahata
Debanjan Mahata
HZHaimin Zhang
Haimin Zhang
MKMayank Kulkarni
Mayank Kulkarni
ASAgniv Sharma
Agniv Sharma
RZRoger Zimmermann
Roger Zimmermann

11 November 2021 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
AVAstha Verma
Astha Verma
ASA. V. Subramanyam
A. V. Subramanyam
Zheng WangZheng Wang
Zheng Wang
SSShin'Ichi Satoh
Shin'Ichi Satoh
RSRajiv Ratn Shah
Rajiv Ratn Shah
Unsupervised domain adaptation for person re-identification (Re-ID suffers severe domain discrepancies between source and target domains. To reduce the domain shift caused by the changes of context, camera style, or viewpoint, existing methods in this field fine-tune and adapt the Re-ID model with augmented samples, either through translating source samples to the target style or by assigning pseudo labels to the target. The former methods may lose identity details but keep redundant source background during translation, while the latter methods may assign noisy labels when the model meets the unseen background and person pose. To address the challenges, we mitigate the domain shift in the former translation direction by decoupling environment and identity-related features in a cyclic manner. We propose a novel individual-preserving and environmental-switching cyclic generation network (IPES-GAN . Our network has the following distinct features: 1 Decoupled features instead of fused features: the images are encoded into an individual part and an environmental part, which are proved beneficial to generation and adaptation; 2 Cyclic generation instead of one-step adaptive generation. The source and target environment features are swapped to generate cross-domain images with preserved identity-related features conditioned with source (target environment features, and then swapped again to generate back the input image, so that cyclic generation runs in a self-supervised way. Experiments carried out on two major benchmarks: Market-1501 and DukeMTMC-reID reveal state-of-the-art performance.

1 December 2015
Verified
Conference Paper
Closed access
RSRajiv Ratn Shah
Rajiv Ratn Shah
YYYi Yu
Yi Yu
ASAnwar Dilawar Shaikh
Anwar Dilawar Shaikh
RZRoger Zimmermann
Roger Zimmermann
In multimedia-based e - learning systems, the accessibility and searchability of most lecture video content is still insufficient due to the unscripted and spontaneous speech of the speakers. Moreover, this problem becomes even more challenging when the quality of such lecture videos is not sufficiently high. To extract the structural knowledge of a multi-topic lecture video and thus make it easily accessible it is very desirable to divide each video into shorter clips by performing an automatic topic-wise video segmentation. To this end, this paper presents the TRACE system to automatically perform such a segmentation based on a linguistic approach using Wikipedia texts. TRACE has two main contributions: (i) the extraction of a novel linguistic-based Wikipedia feature to segment lecture videos efficiently, and (ii) the investigation of the late fusion of video segmentation results derived from state-of-the-art algorithms. Specifically for the late fusion, we combine confidence scores produced by the models constructed from visual, transcriptional, and Wikipedia features. According to our experiments on lecture videos from VideoLectures.NET and NPTEL, the proposed algorithm segments knowledge structures more accurately compared to existing state-of-the-art algorithms. The evaluation results are very encouraging and thus confirm the effectiveness of TRACE.

6 June 2021
Verified
Conference Paper
Closed access
SCSuransh Chopra
Suransh Chopra
PMPuneet Mathur
Puneet Mathur
RSRamit Sawhney
Ramit Sawhney
RSRajiv Ratn Shah
Rajiv Ratn Shah
While emotion recognition is a well-studied task, it remains unexplored to a large extent in cross-lingual settings. Speech Emotion Recognition (SER) in low-resource languages poses difficulties as existing approaches for knowledge transfer do not generalize seamlessly. Probing the learning process of generalized representations across languages, we propose a meta-learning approach for low-resource speech emotion recognition. The proposed approach achieves fast adaptation on a number of unseen target languages simultaneously. We evaluate the Model Agnostic Meta-Learning (MAML) algorithm on three low-resource target languages -Persian, Italian, and Urdu. We empirically demonstrate that our proposed method - MetaSER 1 , considerably outperforms multitask and transfer learning-based methods for speech emotion recognition task, and discuss the benefits, efficiency, and challenges of MetaSER on limited data settings.