Souptik Kumar Majumdar

Institute for Visualisation and Interactive Systems, University of Stuttgart

Pfaffenwaldring 5a, 70569 Stuttgart, Germany University of Stuttgart, SimTech Building, Room 01.034 Google Scholar

Biography

Souptik Majumdar is a PhD student in the Collaborative Artificial Intelligence group and a PhD scholar in the International Max Planck Research School for Intelligent Systems (IMPRS-IS) since April 2025. He holds a bachelor's and master's degree in Computer Science from the University of Calcutta (India) and Universität Stuttgart (Germany), respectively. His research interests are in computer vision and machine learning for computational social gaze, gaze estimation, and privacy with applications in AR and VR.

Teaching

2026

Fachpraktikum -- Practical Course: Collaborative Artificial Intelligence (Tutor)Master

2025

Seminar: Advanced Topics in Collaborative AI (Teaching Assistant)Master

2024

Introduction to AI (Tutor)Master

 

Reinforcement Learning (Tutor)Master

Publications

1. 

   Attention Is All You Need For Mixture-of-Depths Routing

   Advait Gadhikar, Souptik Kumar Majumdar, Niclas Popp, Piyapat Saranrittichai, Martin Rapp, Lukas Schott

   arXiv:2412.20875, pp. 1–22, 2024.

   Abstract Links BibTeX Project

   Advancements in deep learning are driven by training models with increasingly larger numbers of parameters, which in turn heightens the computational demands. To address this issue, Mixture-of-Depths (MoD) models have been proposed to dynamically assign computations only to the most relevant parts of the inputs, thereby enabling the deployment of large-parameter models with high efficiency during inference and training. These MoD models utilize a routing mechanism to determine which tokens should be processed by a layer, or skipped. However, conventional MoD models employ additional network layers specifically for the routing which are difficult to train, and add complexity and deployment overhead to the model. In this paper, we introduce a novel attention-based routing mechanism A-MoD that leverages the existing attention map of the preceding layer for routing decisions within the current layer. Compared to standard routing, A-MoD allows for more efficient training as it introduces no additional trainable parameters and can be easily adapted from pretrained transformer models. Furthermore, it can increase the performance of the MoD model. For instance, we observe up to 2% higher accuracy on ImageNet compared to standard routing and isoFLOP ViT baselines. Furthermore, A-MoD improves the MoD training convergence, leading to up to 2x faster transfer learning.

   doi: 10.48550/arXiv.2412.20875

   Paper Access: http://arxiv.org/abs/2412.20875

   @techreport{gadhikar24_arxiv, title = {Attention {Is} {All} {You} {Need} {For} {Mixture}-of-{Depths} {Routing}}, author = {Gadhikar, Advait and Majumdar, Souptik Kumar and Popp, Niclas and Saranrittichai, Piyapat and Rapp, Martin and Schott, Lukas}, year = {2024}, pages = {1--22}, doi = {10.48550/arXiv.2412.20875}, url = {http://arxiv.org/abs/2412.20875} }

1. 

   Using Deep Learning to Recognize Emotions Through Speech Analysis

   Arion Mitra, Ankita Biswas, Ananya Ghosh, Ahona Ghosh, Souptik Kumar Majumdar, Jayati Ghosh Dastidar

   pp. 161–180, 2023.

   Abstract Links BibTeX Project

   Emotion recognition is the identification of emotions usually through verbal communication and facial expressions such as happy, angry, sad, etc. Not only on the basis of a wide spectrum of moods, but different emotions can also be recognized in order to track mental health of as many people as possible for societal well being. Inside positive it detects specific emotions like happiness, satisfaction, or excitement -depending on how it’s configured. The main principles involved in the implementation of our sentiment recognition system that identifies various emotions: anger, happiness, depression, neutral, etc. are audio content and identification of the emotion associated with it. The application developed takes audio input, applies Mel-Frequency Cepstral Coefficients (MFCC) algorithm on it, compares them with those of the content of the existing audio file database depicting various human sentiments, and presents output in the text the emotion expressed by the user. The input from testing was gathered and meaningful spectral coefficients were extracted and stored in a database for comparison with future audio samples. The application extracts the coefficients of the external audio sample and matches it with those present in the database. MFCC algorithm is used to extract the spectral coefficients which are good and can be used for feature matching purposes discarding any static and background noise if present. We have done comparative analysis on our models for their performance evaluation, using four classification metrics and also presented the confusion matrix for better understanding.

   doi: 10.1007/978-3-031-12419-8_9

   Paper Access: https://doi.org/10.1007/978-3-031-12419-8_9

   @incollection{mitra23_aisi, title = {Using {Deep} {Learning} to {Recognize} {Emotions} {Through} {Speech} {Analysis}}, author = {Mitra, Arion and Biswas, Ankita and Ghosh, Ananya and Ghosh, Ahona and Majumdar, Souptik Kumar and Dastidar, Jayati Ghosh}, year = {2023}, booktitle = {Artificial {Intelligence} for {Societal} {Issues}}, pages = {161--180}, doi = {10.1007/978-3-031-12419-8_9}, url = {https://doi.org/10.1007/978-3-031-12419-8_9} }

1. 

   Bit Level Encryption Algorithm Using Chaos Version 1.0(BLEAUC-1.0)

   Asoke Nath, Suchandra Datta, Souptik Kumar Majumdar

   International Journal of Computer Sciences and Engineering, , pp. 451–456, 2019.

   Links BibTeX Project

   doi: https://doi.org/10.26438/ijcse/v7i4.451456

   Paper Access: https://www.ijcseonline.org/full_paper_view.php?paper_id=4056

   @article{nath19_ijcse, title = {Bit Level Encryption Algorithm Using Chaos Version 1.0(BLEAUC-1.0)}, author = {Nath, Asoke and Datta, Suchandra and Majumdar, Souptik Kumar}, year = {2019}, journal = {International Journal of Computer Sciences and Engineering}, pages = {451--456}, doi = {https://doi.org/10.26438/ijcse/v7i4.451456}, url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4056} }