arXiv subjects
Publications and source records attributed to Shreya Sharma.
We classify possible Amitsur groups of smooth primitive Fano threefolds defined over complex numbers that admit a faithful action of a finite group. We also classify the Amitsur groups for toric Fano threefolds.
Tantalum is a promising platform for superconducting quantum circuits, yet coherence times remain limited by dielectric losses from interfacial two-level systems (TLS), exacerbated by native oxide regrowth. Here, we implement molecular surface passivation using self-assembled organic monolayers on freshly etched tantalum and silicon in coplanar waveguide resonators. Surface characterization by contact angle, XPS, FTIR and TEM confirm the formation of ordered, nanometer-thick films that suppress oxide formation. Microwave measurements in the ~5-9 GHz range reveal internal quality factors up to 1.8x10^6 in the single-photon regime at 100 mK, representing a ~140% improvement over untreated devices with native oxide. Power and temperature dependent measurements attribute this enhancement to reduced TLS-induced losses. These results demonstrate that molecular passivation effectively engineers low-loss interfaces and provides a scalable route toward high-coherence superconducting quantum devices.
We classify the possible images of the action of the group of automorphisms of a smooth Fano threefold on its Picard group. We also study the first group cohomology of the Picard group for families of smooth Fano threefolds.
The Amitsur subgroup of a variety with a group action measures the failure of the action to lift to the total spaces of its line bundles. We introduce the "numerical Amitsur group," which is an approximation of the ordinary Amitsur subgroup that can be computed using only the Euler-Poincar\'e characteristic on the Picard group. As an application, we find a uniform upper bound on the exponent of the Amitsur subgroup that depends only on the dimension and arithmetic genus of the variety and is independent of the group. Finally, we compute Amitsur subgroups of toric varieties using these ideas.
Recent language models enable new opportunities for structured reasoning with text, such as the construction of intuitive, proof-like textual entailment trees without relying on brittle formal logic. However, progress in this direction has been hampered by a long-standing lack of a clear protocol for determining what valid compositional entailment is. This absence causes noisy datasets and limited performance gains by modern neuro-symbolic engines. To address these problems, we formulate a consistent and theoretically grounded approach to annotating decompositional entailment and evaluate its impact on LLM-based textual inference. We find that our new dataset, RDTE (Recognizing Decompositional Textual Entailment), has a substantially higher internal consistency (+9%) than prior decompositional entailment datasets. We also find that training an RDTE-oriented entailment classifier via knowledge distillation and employing it in an entailment tree reasoning engine significantly improves both accuracy and proof quality, illustrating the practical benefit of this advance for textual inference.
This paper presents a novel mid-wave infrared (MWIR) small target detection dataset (MWIRSTD) comprising 14 video sequences containing approximately 1053 images with annotated targets of three distinct classes of small objects. Captured using cooled MWIR imagers, the dataset offers a unique opportunity for researchers to develop and evaluate state-of-the-art methods for small object detection in realistic MWIR scenes. Unlike existing datasets, which primarily consist of uncooled thermal images or synthetic data with targets superimposed onto the background or vice versa, MWIRSTD provides authentic MWIR data with diverse targets and environments. Extensive experiments on various traditional methods and deep learning-based techniques for small target detection are performed on the proposed dataset, providing valuable insights into their efficacy. The dataset and code are available at https://github.com/avinres/MWIRSTD.
Off-road navigation is a challenging problem both at the planning level to get a smooth trajectory and at the control level to avoid flipping over, hitting obstacles, or getting stuck at a rough patch. There have been several recent works using classical approaches involving depth map prediction followed by smooth trajectory planning and using a controller to track it. We design an end-to-end reinforcement learning (RL) system for an autonomous vehicle in off-road environments using a custom-designed simulator in the Unity game engine. We warm-start the agent by imitating a rule-based controller and utilize Proximal Policy Optimization (PPO) to improve the policy based on a reward that incorporates Control Barrier Functions (CBF), facilitating the agent's ability to generalize effectively to real-world scenarios. The training involves agents concurrently undergoing domain-randomized trials in various environments. We also propose a novel simulation environment to replicate off-road driving scenarios and deploy our proposed approach on a real buggy RC car. Videos and additional results: https://sites.google.com/view/wroom-utd/home
This paper describes CBGT-Net, a neural network model inspired by the cortico-basal ganglia-thalamic (CBGT) circuits found in mammalian brains. Unlike traditional neural network models, which either generate an output for each provided input, or an output after a fixed sequence of inputs, the CBGT-Net learns to produce an output after a sufficient criteria for evidence is achieved from a stream of observed data. For each observation, the CBGT-Net generates a vector that explicitly represents the amount of evidence the observation provides for each potential decision, accumulates the evidence over time, and generates a decision when the accumulated evidence exceeds a pre-defined threshold. We evaluate the proposed model on two image classification tasks, where models need to predict image categories based on a stream of small patches extracted from the image. We show that the CBGT-Net provides improved accuracy and robustness compared to models trained to classify from a single patch, and models leveraging an LSTM layer to classify from a fixed sequence length of patches.
Humans regularly engage in analogical thinking, relating personal experiences to current situations (X is analogous to Y because of Z). Analogical thinking allows humans to solve problems in creative ways, grasp difficult concepts, and articulate ideas more effectively. Can language models (LMs) do the same? To answer this question, we propose AnaloBench, a benchmark to determine analogical reasoning ability in LMs. Our benchmarking approach focuses on aspects of this ability that are common among humans: (i) recalling related experiences from a large amount of information, and (ii) applying analogical reasoning to complex and lengthy scenarios. We test a broad collection of proprietary models (e.g., GPT family, Claude V2) and open source models such as LLaMA2. As in prior results, scaling up LMs results in some performance boosts. Surprisingly, scale offers minimal gains when, (i) analogies involve lengthy scenarios, or (ii) recalling relevant scenarios from a large pool of information, a process analogous to finding a needle in a haystack. We hope these observations encourage further research in this field.
Due to notoriously small value of the neutrino magnetic moment, the phenomena of neutrino spin flavour precession (SFP) requires very high magnetic field. This makes only a handful of systems suitable to study this phenomena. By the observation of SFP, the Dirac and Majorana nature of neutrinos is expected to be distinguished. In this work, we point out the potential of white dwarf (WD) system in studying the spin-flavour oscillation of neutrinos. From recent analysis, it has been found that young isolated WDs may harbor very strong internal magnetic field, even without exhibiting any surface magnetic field. The presence of magnetic field enhances the cooling process and along with that, renders the spin-flavour oscillation of neutrinos emitted in the neutrino cooling process. Employing the standard WD specifications, we analyse whether a magnetized WD is a suitable environment to distinguish between the Dirac and Majorana nature of neutrino. Lower value of spin flavour transition probability implies reduced active neutrino flux which is possible to be estimated in terrestrial neutrino detectors. We find that the spin flavour transition probability of Dirac neutrinos is much higher in comparison to the Majorana neutrino which converts the active neutrino flavours to sterile in a significant amount. We also examine the sensitivity of the spin flavour transition probability to the neutrino magnetic moment.
Our goal is to enable a robot to learn how to sequence its actions to perform tasks specified as natural language instructions, given successful demonstrations from a human partner. The ability to plan high-level tasks can be factored as (i) inferring specific goal predicates that characterize the task implied by a language instruction for a given world state and (ii) synthesizing a feasible goal-reaching action-sequence with such predicates. For the former, we leverage a neural network prediction model, while utilizing a symbolic planner for the latter. We introduce a novel neuro-symbolic model, GoalNet, for contextual and task dependent inference of goal predicates from human demonstrations and linguistic task descriptions. GoalNet combines (i) learning, where dense representations are acquired for language instruction and the world state that enables generalization to novel settings and (ii) planning, where the cause-effect modeling by the symbolic planner eschews irrelevant predicates facilitating multi-stage decision making in large domains. GoalNet demonstrates a significant improvement (51%) in the task completion rate in comparison to a state-of-the-art rule-based approach on a benchmark data set displaying linguistic variations, particularly for multi-stage instructions.
Social media plays a crucial role in today's society. It results in paradigm changes in how people relate and communicate, convey and exchange ideas. Moreover, social media has evolved into critical knowledge networks for consumers and also affects decision-making. In elections, social media became an integral part of political campaigning to reach a greater audience and gather more support. The 2019 Lok Sabha election saw a massive spike in the usage of online social media platforms such as Twitter, Facebook, and WhatsApp; with every major political party launching its own organized social media campaigns. In 2014, Bhartiya Janta Party (BJP) took one step ahead in organizing the campaign by launching its app - NaMo App. We focus our research on Twitter and NaMo App during the 2019 Lok Sabha elections and CAA protests. Twitter is a platform where every individual can express their views and is not biased. In contrast, NaMo App is one of the first apps centered around a specific political party. It acted as a digital medium for BJP for organizing the political campaign to make people's opinion in their favour. This research aims to characterize the role of the NaMo App in a more traditional network as Twitter in shaping political discourse and studies the existence of an online echo chamber. We began by analyzing the amount and type of content shared using the NaMo App on Twitter. We performed content and network analysis for the existence of the echo chamber. We also applied Hawkes process to see the influence that NaMo App has on Twitter. Through this research, we can conclude that the users who share content using NaMo App, may be part of an online echo chamber and are likely to be BJP workers. We show the reach and influence that the NaMo App has on Twitter is significantly less, indicating its inability to break through the diverse audience and change the narrative on Twitter.
Prostitution is one of the root causes of sex trafficking and the transmission of sexual diseases. The rules and regulations followed by the Indian government to regulate the same, fall under the umbrella of the abolitionism model. Neo-abolitionism (also known as the Nordic model) is a new legislative model that has been introduced by the Nordic countries to regulate prostitution. The purpose of this research paper is to examine the possible effects of the application of the Nordic model on the crime rates and the spread of sexually transmitted diseases in India. Further, we also aim to study the effects of the implementation of Neo-abolitionism in Sweden.
Machine Learning models require a vast amount of data for accurate training. In reality, most data is scattered across different organizations and cannot be easily integrated under many legal and practical constraints. Federated Transfer Learning (FTL) was introduced in [1] to improve statistical models under a data federation that allow knowledge to be shared without compromising user privacy, and enable complementary knowledge to be transferred in the network. As a result, a target-domain party can build more flexible and powerful models by leveraging rich labels from a source-domain party. However, the excessive computational overhead of the security protocol involved in this model rendered it impractical. In this work, we aim towards enhancing the efficiency and security of existing models for practical collaborative training under a data federation by incorporating Secret Sharing (SS). In literature, only the semi-honest model for Federated Transfer Learning has been considered. In this paper, we improve upon the previous solution, and also allow malicious players who can arbitrarily deviate from the protocol in our FTL model. This is much stronger than the semi-honest model where we assume that parties follow the protocol precisely. We do so using the one of the practical MPC protocol called SPDZ, thus our model can be efficiently extended to any number of parties even in the case of a dishonest majority. In addition, the models evaluated in our setting significantly outperform the previous work, in terms of both runtime and communication cost. A single iteration in our model executes in 0.8 seconds for the semi-honest case and 1.4 seconds for the malicious case for 500 samples, as compared to 35 seconds taken by the previous implementation.