Searcharxiv⌕ Search

arXiv subjects

Kuldeep Singh

Publications and source records attributed to Kuldeep Singh.

At least 37 records · Page 2Linked to original sources

Knowledge-Driven Cross-Document Relation Extraction

Relation extraction (RE) is a well-known NLP application often treated as a sentence- or document-level task. However, a handful of recent efforts explore it across documents or in the cross-document setting (CrossDocRE). This is distinct from the single document case because different documents often focus on disparate themes, while text within a document tends to have a single goal. Linking findings from disparate documents to identify new relationships is at the core of the popular literature-based knowledge discovery paradigm in biomedicine and other domains. Current CrossDocRE efforts do not consider domain knowledge, which are often assumed to be known to the reader when documents are authored. Here, we propose a novel approach, KXDocRE, that embed domain knowledge of entities with input text for cross-document RE. Our proposed framework has three main benefits over baselines: 1) it incorporates domain knowledge of entities along with documents' text; 2) it offers interpretability by producing explanatory text for predicted relations between entities 3) it improves performance over the prior methods.

cs.CL↗

Nonlinear Ion-Acoustic Waves with Landau Damping in Non-Maxwellian Space Plasmas

The dynamics of nonlinear ion-acoustic solitary waves in the presence of kinetic (Landau type) damping have been investigated in a collisionless, non-magnetized electron-ion plasma. A cold ion fluid model, coupled to a Vlasov-type kinetic equation for the electron dynamics, has been adopted as a starting point. The electron population was assumed to be in a kappa-distributed state, in account of the non-Maxwellian behavior of energetic (suprathermal) electrons often observed in Space. A multiscale perturbation technique has led to an evolution equation for the electrostatic potential, in the form of a modified Korteweg-de Vries (KdV) equation, incorporating a non-local term accounting for Landau damping (associated with the electron statistics). Exact analytical solutions have been obtained, representing solitary waves undergoing amplitude decay over time. The combined effect of Landau damping and non-Maxwellian electron statistics (via the kappa parameter) on the characteristics of IASWs has been examined. Numerical integration of the evolution equation has been undertaken, to elucidate the importance of kinetic Landau damping on a shock-shaped initial condition. The results of this investigation aim to improve our understanding of the dynamics of nonlinear electrostatic waves under the influence of Landau damping in various space plasma environments.

physics.plasm-ph↗

Beyond Spatio-Temporal Representations: Evolving Fourier Transform for Temporal Graphs

We present the Evolving Graph Fourier Transform (EFT), the first invertible spectral transform that captures evolving representations on temporal graphs. We motivate our work by the inadequacy of existing methods for capturing the evolving graph spectra, which are also computationally expensive due to the temporal aspect along with the graph vertex domain. We view the problem as an optimization over the Laplacian of the continuous time dynamic graph. Additionally, we propose pseudo-spectrum relaxations that decompose the transformation process, making it highly computationally efficient. The EFT method adeptly captures the evolving graph's structural and positional properties, making it effective for downstream tasks on evolving graphs. Hence, as a reference implementation, we develop a simple neural model induced with EFT for capturing evolving graph spectra. We empirically validate our theoretical findings on a number of large-scale and standard temporal graph benchmarks and demonstrate that our model achieves state-of-the-art performance.

cs.LG↗

Revisiting Document-Level Relation Extraction with Context-Guided Link Prediction

Document-level relation extraction (DocRE) poses the challenge of identifying relationships between entities within a document as opposed to the traditional RE setting where a single sentence is input. Existing approaches rely on logical reasoning or contextual cues from entities. This paper reframes document-level RE as link prediction over a knowledge graph with distinct benefits: 1) Our approach combines entity context with document-derived logical reasoning, enhancing link prediction quality. 2) Predicted links between entities offer interpretability, elucidating employed reasoning. We evaluate our approach on three benchmark datasets: DocRED, ReDocRED, and DWIE. The results indicate that our proposed method outperforms the state-of-the-art models and suggests that incorporating context-based link prediction techniques can enhance the performance of document-level relation extraction models.

cs.IR↗

A power law solution for FRLW Universe with observational constraints

This paper examines a power law solution under $f(R,T)$ gravity for an isotropic and homogeneous universe by considering its functional form as $f(R,T) = R + ξRT$, where $ξ$ is a positive constant. In $f(R,T)$ gravity, we have built the field equation for homogeneous and isotropic spacetime. The developed model's solution is $a = αt^β$. We have used the redshift in the range $0 \leq z \leq 1.965$ and obtained the model parameters $α$, $β$, $H_0$ by using the Markov Chain Monte Carlo (MCMC) method. The constrained values of the model parameter are as follows: $H_0 = 67.098^{+2.148}_{-1.792}$ km s$^{-1}$ Mpc$^{-1}$, $H_0 = 67.588^{+2.229}_{-2.170}$ km s$^{-1}$ Mpc$^{-1}$, $H_0 = 66.270^{+2.215}_{-2.181}$ km s$^{-1}$ Mpc$^{-1}$, $H_0 = 65.960^{+2.380}_{-1.834}$ km s$^{-1}$ Mpc$^{-1}$, $H_0 = 66.274^{+2.015}_{-1.864}$ km s$^{-1}$ Mpc$^{-1}$ which have been achieved by bounding the model with the Hubble parameter ($H(z)$) dataset, Baryon Acoustic Oscillations (BAO) dataset, Pantheon dataset, joint $H(z)$ + Pantheon dataset and collective $H(z)$ + BAO + Pantheon dataset, respectively. These computed $H_o$ observational values agree well with the outcomes from the Plank collaboration group. Through an analysis of the energy conditions' behaviour on our obtained solution, the model has been examined and analysed. Using the Om diagnostic as the state finder diagnostic tool and the jerk parameter, we have also investigated the model's validity. Our results show that, within a certain range of restrictions, the proposed model agrees with the observed signatures.

astro-ph.CO↗

ReOnto: A Neuro-Symbolic Approach for Biomedical Relation Extraction

Relation Extraction (RE) is the task of extracting semantic relationships between entities in a sentence and aligning them to relations defined in a vocabulary, which is generally in the form of a Knowledge Graph (KG) or an ontology. Various approaches have been proposed so far to address this task. However, applying these techniques to biomedical text often yields unsatisfactory results because it is hard to infer relations directly from sentences due to the nature of the biomedical relations. To address these issues, we present a novel technique called ReOnto, that makes use of neuro symbolic knowledge for the RE task. ReOnto employs a graph neural network to acquire the sentence representation and leverages publicly accessible ontologies as prior knowledge to identify the sentential relation between two entities. The approach involves extracting the relation path between the two entities from the ontology. We evaluate the effect of using symbolic knowledge from ontologies with graph neural networks. Experimental results on two public biomedical datasets, BioRel and ADE, show that our method outperforms all the baselines (approximately by 3\%).

cs.CL↗

Two-temperature accretion flows around strongly magnetized stars and their spectral analysis

We investigate two-temperature accretion flows onto strongly magnetized compact stars. Matter is accreted in the form of an accretion disc upto the disc radius ($r_{\rm d}$), where, the magnetic pressure exceeds both the gas and ram pressure and thereafter the matter is channelled along the field lines onto the poles. We solve the equations of motion self-consistently along the field lines, incorporating radiative processes like bremsstrahlung, synchrotron and inverse-Comptonization. For a given set of constants of motion, the equations of motion do not produce unique transonic solution. Following the second law of thermodynamics the solution with the highest entropy is selected and thereby eliminating the degeneracy in solution. We study the properties of these solutions and obtain corresponding spectra as a function of the magnetic field ($B_*$), spin period ($P$) and accretion rate of the star ($\dot{M}$). A primary shock is always formed just near the surface. The enhanced radiative processes in this post-shock region slows down the matter and it finally settles on the surface of the star. This post-shock region contributes to $\gtrsim 99.99\%$ of the total luminosity obtained from the accretion flow. It is still important to study the full accretion flow because secondary shocks may be present for some combination of $B_*$, $P$ and ${\dot{M}}$ in addition to primary shocks. We find that secondary shocks, if present, produce an extended emission at higher energies in the spectra.

astro-ph.HE↗

Evolution of ion acoustic solitary waves in pulsar wind

We have studied the evolution of ion-acoustic solitary waves (IASWs) in pulsar wind. The pulsar wind is modeled by considering a weakly relativistic unmagnetized collisionless plasma comprised of relativistic ions and superthermal electrons and positrons. Through fluid simulations, we have demonstrated that the localized ion density perturbations generated in the polar wind plasma can evolve the relativistic IASW pulses. It is found that the concentration of positrons, relativistic factor, superthermality of electrons, and positrons have a significant influence on the dynamical evolution of IASW pulses. Our results may provide insight to understand the evolution of IASW pulses and their role in astrophysical plasmas, especially in the relativistic pulsar winds with supernova outflow which is responsible for the production of superthermal particles and relativistic ions.

physics.plasm-ph↗

On the stability of two-dimensional modulated electrostatic wavepackets in non-Maxwellian dusty plasma-application in Saturn's magnetosphere

Motivated by observations of localized electrostatic wavepackets by the Voyager 1 and 2 and Cassini missions in Saturn's magnetosphere, we have investigated the evolution of modulated electrostatic wavepackets in a dusty plasma environment. The well-known dust-ion acoustic (DIA) mode was selected to explore the dynamics of multi-dimensional structures, by means of a Davey-Stewartson (DS) model, by taking into account the presence of a highly energetic (suprathermal, kappa-distributed) electron population in combination with heavy (immobile) dust in the background. The modulational (in)stability profile of DIA wavepackets for both negative as well as positive dust charge is investigated. A set of explicit criteria for modulational instability (MI) to occur is obtained. Wavepacket modulation properties in 3D dusty plasmas are shown to differ from e.g. Maxwellian plasmas in 1D. Stronger negative dust concentration results in a narrower instability window in the $K$ (perturbation wavenumber) domain and a suppressed growth rate. In the opposite manner, the instability growth rate increases for higher positive dust concentrations and the instability window gets larger. In a nutshell, negative dust seems to suppress instability while positive dust appears to favor the amplitude modulation instability mechanism.

physics.plasm-ph↗

Dust ion-acoustic dromions in Saturn's magnetosphere

Motivated by observations of localized electrostatic wavepackets by the Cassini and (earlier) by Voyager 1 and 2 mission(s) in Saturn's magnetosphere, we have investigated the existence conditions and the dynamical evolution of localized multi-dimensional structures in the Saturnian dusty plasma environment. To this effect, we have adopted a plasma-fluid model for dust-ion acoustic (DIA) excitations, taking into account the presence of a highly energetic (suprathermal, kappa-distributed) electron population in combination with massive dust particulates in the background. A multiple scales perturbation method was shown to lead to a Davey-Stewartson (DS) system of evolution equations, if one assumes perpendicular carrier wave propagation across the magnetic field (direction). The system is then shown to possess two regimes mainly, known in the literature as DS-I and DS-II. In the former case, if certain conditions are fulfilled, exponentially localized solutions are obtained, known as dromions. The combined effects of various physical parameters such as the electron spectral index, the ambient magnetic field (strength), and the dust concentration have been examined. A numerical investigation reveals that the dromion amplitude increases with higher dust concentration, while it decreases for lower $κ_e$ (i.e. with an increase in the suprathermal electron population component). A stronger magnetic field results in higher amplitude but narrower dromions. Our results provide a comprehensive framework for modeling modulated electrostatic wavepackets, in direct comparison with experimental data in planetary environments, in Saturn's magnetosphere, and elsewhere.

physics.plasm-ph↗

Can Persistent Homology provide an efficient alternative for Evaluation of Knowledge Graph Completion Methods?

In this paper we present a novel method, $\textit{Knowledge Persistence}$ ($\mathcal{KP}$), for faster evaluation of Knowledge Graph (KG) completion approaches. Current ranking-based evaluation is quadratic in the size of the KG, leading to long evaluation times and consequently a high carbon footprint. $\mathcal{KP}$ addresses this by representing the topology of the KG completion methods through the lens of topological data analysis, concretely using persistent homology. The characteristics of persistent homology allow $\mathcal{KP}$ to evaluate the quality of the KG completion looking only at a fraction of the data. Experimental results on standard datasets show that the proposed metric is highly correlated with ranking metrics (Hits@N, MR, MRR). Performance evaluation shows that $\mathcal{KP}$ is computationally efficient: In some cases, the evaluation time (validation+test) of a KG completion method has been reduced from 18 hours (using Hits@10) to 27 seconds (using $\mathcal{KP}$), and on average (across methods & data) reduces the evaluation time (validation+test) by $\approx$ $\textbf{99.96}\%$.

cs.LG↗

Learnable Spectral Wavelets on Dynamic Graphs to Capture Global Interactions

Learning on evolving(dynamic) graphs has caught the attention of researchers as static methods exhibit limited performance in this setting. The existing methods for dynamic graphs learn spatial features by local neighborhood aggregation, which essentially only captures the low pass signals and local interactions. In this work, we go beyond current approaches to incorporate global features for effectively learning representations of a dynamically evolving graph. We propose to do so by capturing the spectrum of the dynamic graph. Since static methods to learn the graph spectrum would not consider the history of the evolution of the spectrum as the graph evolves with time, we propose a novel approach to learn the graph wavelets to capture this evolving spectra. Further, we propose a framework that integrates the dynamically captured spectra in the form of these learnable wavelets into spatial features for incorporating local and global interactions. Experiments on eight standard datasets show that our method significantly outperforms related methods on various tasks for dynamic graphs.

cs.LG↗

Contrastive Representation Learning for Conversational Question Answering over Knowledge Graphs

This paper addresses the task of conversational question answering (ConvQA) over knowledge graphs (KGs). The majority of existing ConvQA methods rely on full supervision signals with a strict assumption of the availability of gold logical forms of queries to extract answers from the KG. However, creating such a gold logical form is not viable for each potential question in a real-world scenario. Hence, in the case of missing gold logical forms, the existing information retrieval-based approaches use weak supervision via heuristics or reinforcement learning, formulating ConvQA as a KG path ranking problem. Despite missing gold logical forms, an abundance of conversational contexts, such as entire dialog history with fluent responses and domain information, can be incorporated to effectively reach the correct KG path. This work proposes a contrastive representation learning-based approach to rank KG paths effectively. Our approach solves two key challenges. Firstly, it allows weak supervision-based learning that omits the necessity of gold annotations. Second, it incorporates the conversational context (entire dialog history and domain information) to jointly learn its homogeneous representation with KG paths to improve contrastive representations for effective path ranking. We evaluate our approach on standard datasets for ConvQA, on which it significantly outperforms existing baselines on all domains and overall. Specifically, in some cases, the Mean Reciprocal Rank (MRR) and Hit@5 ranking metrics improve by absolute 10 and 18 points, respectively, compared to the state-of-the-art performance.

cs.CL↗

An Answer Verbalization Dataset for Conversational Question Answerings over Knowledge Graphs

We introduce a new dataset for conversational question answering over Knowledge Graphs (KGs) with verbalized answers. Question answering over KGs is currently focused on answer generation for single-turn questions (KGQA) or multiple-tun conversational question answering (ConvQA). However, in a real-world scenario (e.g., voice assistants such as Siri, Alexa, and Google Assistant), users prefer verbalized answers. This paper contributes to the state-of-the-art by extending an existing ConvQA dataset with multiple paraphrased verbalized answers. We perform experiments with five sequence-to-sequence models on generating answer responses while maintaining grammatical correctness. We additionally perform an error analysis that details the rates of models' mispredictions in specified categories. Our proposed dataset extended with answer verbalization is publicly available with detailed documentation on its usage for wider utility.

cs.CL↗

How Expressive are Transformers in Spectral Domain for Graphs?

The recent works proposing transformer-based models for graphs have proven the inadequacy of Vanilla Transformer for graph representation learning. To understand this inadequacy, there is a need to investigate if spectral analysis of the transformer will reveal insights into its expressive power. Similar studies already established that spectral analysis of Graph neural networks (GNNs) provides extra perspectives on their expressiveness. In this work, we systematically study and establish the link between the spatial and spectral domain in the realm of the transformer. We further provide a theoretical analysis and prove that the spatial attention mechanism in the transformer cannot effectively capture the desired frequency response, thus, inherently limiting its expressiveness in spectral space. Therefore, we propose FeTA, a framework that aims to perform attention over the entire graph spectrum (i.e., actual frequency components of the graphs) analogous to the attention in spatial space. Empirical results suggest that FeTA provides homogeneous performance gain against vanilla transformer across all tasks on standard benchmarks and can easily be extended to GNN-based models with low-pass characteristics (e.g., GAT).

cs.LG↗

Plumber: A Modular Framework to Create Information Extraction Pipelines

Information Extraction (IE) tasks are commonly studied topics in various domains of research. Hence, the community continuously produces multiple techniques, solutions, and tools to perform such tasks. However, running those tools and integrating them within existing infrastructure requires time, expertise, and resources. One pertinent task here is triples extraction and linking, where structured triples are extracted from a text and aligned to an existing Knowledge Graph (KG). In this paper, we present PLUMBER, the first framework that allows users to manually and automatically create suitable IE pipelines from a community-created pool of tools to perform triple extraction and alignment on unstructured text. Our approach provides an interactive medium to alter the pipelines and perform IE tasks. A short video to show the working of the framework for different use-cases is available online under: https://www.youtube.com/watch?v=XC9rJNIUv8g

cs.CL↗

Triple Classification for Scholarly Knowledge Graph Completion

Scholarly Knowledge Graphs (KGs) provide a rich source of structured information representing knowledge encoded in scientific publications. With the sheer volume of published scientific literature comprising a plethora of inhomogeneous entities and relations to describe scientific concepts, these KGs are inherently incomplete. We present exBERT, a method for leveraging pre-trained transformer language models to perform scholarly knowledge graph completion. We model triples of a knowledge graph as text and perform triple classification (i.e., belongs to KG or not). The evaluation shows that exBERT outperforms other baselines on three scholarly KG completion datasets in the tasks of triple classification, link prediction, and relation prediction. Furthermore, we present two scholarly datasets as resources for the research community, collected from public KGs and online resources.

cs.CL↗

Decoys in Cybersecurity: An Exploratory Study to Test the Effectiveness of 2-sided Deception

One of the widely used cyber deception techniques is decoying, where defenders create fictitious machines (i.e., honeypots) to lure attackers. Honeypots are deployed to entice attackers, but their effectiveness depends on their configuration as that would influence whether attackers will judge them as "real" machines or not. In this work, we study two-sided deception, where we manipulate the observed configuration of both honeypots and real machines. The idea is to improve cyberdefense by either making honeypots ``look like'' real machines or by making real machines ``look like honeypots.'"We identify the modifiable features of both real machines and honeypots and conceal these features to different degrees. In an experiment, we study three conditions: default features on both honeypot and real machines, concealed honeypots only, and concealed both honeypots and real machines. We use a network with 40 machines where 20 of them are honeypots. We manipulate the features of the machines, and using an experimental testbed (HackIT), we test the effectiveness of the decoying strategies against humans attackers. Results indicate that: Any of the two forms of deception (conceal honeypots and conceal both honeypots and real machines) is better than no deception at all. We observe that attackers attempted more exploits on honeypots and exfiltrated more data from honeypots in the two forms of deception conditions. However, the attacks on honeypots and data exfiltration were not different within the deception conditions. Results inform cybersecurity defenders on how to manipulate the observable features of honeypots and real machines to create uncertainty for attackers and improve cyberdefense.

cs.CR↗