Abstract

The role of completely positive–indivisibility (CP-indivisibility) and incompatibility as valuable resources for various information-theoretic tasks is widely acknowledged. This study delves into the intricate relationship between CP-divisibility and channel compatibility. Our investigation focuses on the behavior of incompatibility robustness of quantum channels for a pair of generic dynamical maps. We show that the incompatibility robustness of channels is monotonically nonincreasing for a pair of generic CP-divisible dynamical maps. Further, our explicit study of the behavior of incompatibility robustness with time for some specific dynamical maps reveals nonmonotonic behavior in the CP-indivisible regime. Additionally, we propose a measure of CP-indivisibility based on the incompatibility robustness of quantum channels. Our investigation provides valuable insights into the nature of quantum dynamical maps and their relevance in information-theoretic applications.

Abstract

Advancements in Deep Reinforcement Learning (DRL) have shown significant promise for the development of self directed Unmanned Aerial Vehicles (UAVs). Our research focuses on examining the impact of time-varying noise such as that present in Inertial Measurement Unit (IMU) sensors on the efficacy of DRL-based waypoint navigation and obstacle avoidance in UAVs. Sensor noise affects localization and obstacle detection, and is assumed to follow a Gaussian probability distribution with an unknown non-zero time varying mean and variance. In this study, we consider environment with static obstacles where noise exhibits a time-varying bias, a characteristic commonly associated with IMU sensors. We evaluate the effectiveness of a DRL agent, trained using the Proximal Policy Optimization (PPO) technique, in the presence of such noise.

Abstract

The complex, glinty appearance of detailed normal-mapped surfaces at different scales requires expensive per-pixel Normal Distribution Function computations. Moreover, large light sources further compound this integration and increase the noise in the Monte Carlo renderer. Specialized rendering techniques that explicitly express the underlying normal distribution have been developed to improve performance for glinty surfaces controlled by a fixed material roughness. We present a new method that supports spatially varying roughness based on a neural histogram that computes per-pixel NDFs with arbitrary positions and sizes. Our representation is both memory and compute efficient. Additionally, we fully integrate direct illumination for all light directions in constant time. Our approach decouples roughness and normal distribution, allowing the live editing of the spatially varying roughness of complex normal-mapped objects. We demonstrate that our approach improves on previous work by achieving smaller footprints while offering GPU-friendly computation and compact representation.

Abstract

In this paper, we propose a novel two-step technique for text classification using autoregressive Language Models (LM). In the first step, a set of perplexity and log-likelihood based numeric features are elicited from an LM for a text instance to be classified. Then, in the second step, a classifier based on these features is trained to predict the final label. The classifier used is usually a simple machine learning classifier like Support Vector Machine (SVM) or Logistic Regression (LR) and it is trained using a small set of training examples. We believe, our technique presents a whole new way of exploiting the available training instances, in addition to the existing ways like fine-tuning LMs or in-context learning. Our approach stands out by eliminating the need for parameter updates in LMs, as required in fine-tuning, and does not impose limitations on the number of training examples faced while building prompts for in-context learning. We evaluate our technique across 5 different datasets and compare with multiple competent baselines.

Abstract

To employ Pre-trained Language Models (PLMs) as knowledge containers in niche domains it is important to gauge the knowledge of these PLMs about facts in these domains. It is also an important pre-requisite to know how much enrichment effort is required to make them better. As part of this work, we aim to gauge and enrich small PLMs for knowledge of world geography. Firstly, we develop a moderately sized dataset of masked sentences covering 24 different fact types about world geography to estimate knowledge of PLMs on these facts. We hypothesize that for this niche domain, smaller PLMs may not be well equipped. Secondly, we enrich PLMs with this knowledge through fine-tuning and check if the knowledge in the dataset is infused sufficiently. We further hypothesize that linguistic variability in the manual templates used to embed the knowledge in masked sentences does not affect the knowledge infusion. Finally, we demonstrate the application of PLMs to tourism blog search and Wikidata KB augmentation. In both applications, we aim at showing the effectiveness of using PLMs to achieve competitive performance.

Abstract

The intricate link between brain textbf{Functional Connectivity (FC)} and textbf{Structural Connectivity (SC)} is explored through models performing diffusion on SC to derive FC, using varied methodologies from single to multiple textbf{Graph Diffusion Kernels}. However, existing studies have not correlated diffusion scales with specific brain Regions of Interest (RoIs), limiting the applicability of graph diffusion. We propose a novel approach using textbf{Graph Diffusion Wavelets} to learn the appropriate diffusion scale for each RoI to accurately estimate the SC-FC mapping. Using the open Human Connectome Project (HCP) dataset, we achieve an average textbf{Pearson's correlation} value of 0.833, surpassing the state-of-the-art methods for prediction of FC. It is important to note that the proposed architecture is entirely linear, computationally efficient, and notably demonstrates the textbf{power-law} distribution of diffusion scales. Our results show that the bilateral frontal pole, by virtue of it having large diffusion scale, forms a large community structure. The finding is in line with the current literature on the role of the frontal pole in resting-state networks. Overall, the results underscore the potential of graph diffusion wavelet framework for understanding how the brain structure leads to functional connectivity.

Abstract

Given the challenge of fragmentary or scattered archives, how can we construct a historical and socio-cultural profile of urban micro-minorities that are acutely affected by the “global flows” (Arjun Appadurai 1990) of people, commodities, and capital? Secunderabad, once a town in princely Hyderabad state in colonial South Asia, was shaped critically by the arrival of migrant communities from different parts of the subcontinent. One such group was that of educated, professional, Tamil-speaking migrants from Madras Presidency. Testament to this migration today are multiple localities with a dominance of Tamil-speaking people, cultural events, and related institutions and associations. Using this community as a case study, this paper demonstrates that the biggest challenge in studying the history of a micro-minority is their marginal presence in archives. We find that the keepers of such history are individuals and communities. Hence, we examine private archives, oral histories, and community records in conjunction and contestation with literary texts and official sources, such as census data, civil lists, and gazettes. This paper offers an account of how we addressed methodological challenges by building community networks, and adopting and adapting a mixed-methods, interdisciplinary approach to creatively trace migration, settlement, linguistic, and socio-cultural patterns. Our findings suggest that such approaches have positive implications for city and urban studies and research methods in this area.

Abstract

The concept of raga in Indian classical music serves as a complex, multifaceted melodic entity that can be approached through various perspectives. Compositions within a raga act as foundational structures, serving as the bedrock for improvisations. Analyzing their textual notations is easier and more objective in comparison with analyzing audio samples. A significant amount of musical insights can be derived from the discrete swara sequences alone. This paper aims to construct an intuitive visualization of raga space, using swara sequences from raga compositions. Notations from public sources are normalized, and their TF-IDF features are projected into a low-dimensional space. This approach allows for qualitative analysis of both Carnatic and Hindustani ragas, mapping them to known raga theory.

Abstract

Link prediction can help rectify inaccuracies in various graph algorithms, stemming from unaccounted-for or overlooked links within networks. However, many existing works use a baseline approach, which incurs unnecessary computational costs due to its high time complexity. Further, many studies focus on smaller graphs, which can lead to misleading conclusions. Here, we study the prediction of links using neighborhood-based similarity measures on large graphs. In particular, we improve upon the baseline approach (IBase), and propose a heuristic approach that additionally disregards large hubs (DLH), based on the idea that high-degree nodes contribute little similarity among their neighbors. On a server equipped with dual 16-core Intel Xeon Gold 6226R processors, DLH is on average 1019x faster than IBase, especially on web graphs and social networks, while maintaining similar prediction accuracy. Notably, DLH achieves a link prediction rate of 38.1M edges/s and improves performance by 1.6x for every doubling of threads.

Abstract

The demand for high-quality parallel speech data has been increasing as deep learning-based Speech to Speech Machine Translation (SSMT) and automatic dubbing approaches gain popularity in speech applications. Traditional and well-established speech applications such as Automatic Speech Recognition (ASR) and Text-to-Speech (TTS) heavily rely on large corpus of monolingual speech and the corresponding text. While there is a wealth of parallel text data available for both English and Indic languages, parallel speech data is available only for English and other European languages, yet it often lacks natural prosody and semantic alignment between the languages. For achieving cross-lingual prosody transfer, end-to-end SSMT models, and high-quality dubbing from English to Hindi, in this work, an English-Hindi parallel bilingual speech-text corpus named lIlT-Speech Twins 1.0 is created. This data contains twin-like English and Hindi speech-text pairs obtained from publicly available children's stories in both the languages, through manual and automatic processing. Starting with 8 stories in each language, totaling around 4 hours of audio, the final outcome was a 2-hour dataset. This was achieved through systematic segmentation, re-moval of non-speech background audio, and sentence-by-sentence alignment to ensure accurate meaning in both languages. In addition to ensuring proper alignment and transcription, this dataset offers a rich source of natural prosody, expressions, and emotions, due to the narrative diversity within the stories. The dataset also provides sig-nificant speaker variability, with different characters being voiced by various speakers, enhancing the richness of the lIlT-Speech Twins 1.0 corpus.