Viplove Arora

Viplove Arora

Auto-generated profile, based on publicly available information

Viplove Arora

Purdue University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
24 January 2019 in ACM Transactions on Modeling and Computer Simulation
Verified
Journal Article
Open access
SHSusan R. Hunter
Susan R. Hunter
EAEric A. Applegate
Eric A. Applegate
VAViplove Arora
Viplove Arora
BCBryan Chong
Bryan Chong
KCKyle Cooper
Kyle Cooper
CVCarolina Vivas-Valencia
Carolina Vivas-Valencia
The multiobjective simulation optimization (MOSO) problem is a nonlinear multiobjective optimization problem in which multiple simultaneous and conflicting objective functions can only be observed with stochastic error. We provide an introduction to MOSO at the advanced tutorial level, aimed at researchers and practitioners who wish to begin working in this emerging area. Our focus is exclusively on MOSO methods that characterize the entire efficient or Pareto-optimal set as the solution to the MOSO problem; later, this set may be used as input to the broader multicriteria decision-making process. Our introduction to MOSO includes an overview of existing theory, methods, and provably convergent algorithms that explicitly control sampling error for (1) MOSO on finite sets, called multiobjective ranking and selection; (2) MOSO with integer-ordered decision variables; and (3) MOSO with continuous decision variables. In the context of integer-ordered and continuous decision variables, we focus on methods that provably converge to a local efficient set under the natural ordering. We also discuss key open questions that remain in this emerging field.

9 July 2018 in Applied Network Science
Verified
Journal Article
Open access
PDF file
VAViplove Arora
Viplove Arora
MVMario Ventresca
Mario Ventresca
The ubiquity of supply chains along with their increasingly interconnected structure has ignited interest in studying supply chain networks through the lens of complex adaptive systems. A particularly important characteristic of supply chains is the desirable goal of sustaining their operation when exposed to unexpected perturbations. Applied network science methods can be used to analyze topological properties of supply chains and propose models for their growth. Network models focusing on the critical aspect of supply chain resilience may provide insights into the design of supply networks that may quickly recover from disruptions. This is vital for understanding both static and dynamic structures of complex supply networks, and enabling management to make informed decisions and prioritizing particular operations. This paper proposes an action-based perspective for creating a compact probabilistic model for a given real-world supply network. The action-based model consists of a set of rules (actions) that a firm may use to connect with other firms, such that the synthesized networks are topologically resilient. Additionally, it captures the heterogeneous roles of different firms by incorporating domain specific constraints. Results analyzing the resilience of networks subjected to node disruptions show that networks synthesized using the proposed model can generally outperform its real-world counterpart.

27 July 2017 in Scientific Reports
Verified
Journal Article
Open access
PDF file
VAViplove Arora
Viplove Arora
MVMario Ventresca
Mario Ventresca
Complex networks can model a wide range of complex systems in nature and society, and many algorithms (network generators) capable of synthesizing networks with few and very specific structural characteristics (degree distribution, average path length, etc.) have been developed. However, there remains a significant lack of generators capable of synthesizing networks with strong resemblance to those observed in the real-world, which can subsequently be used as a null model, or to perform tasks such as extrapolation, compression and control. In this paper, a robust new approach we term Action-based Modeling is presented that creates a compact probabilistic model of a given target network, which can then be used to synthesize networks of arbitrary size. Statistical comparison to existing network generators is performed and results show that the performance of our approach is comparable to the current state-of-the-art methods on a variety of network measures, while also yielding easily interpretable generators. Additionally, the action-based approach described herein allows the user to consider an arbitrarily large set of structural characteristics during the generator design process.

25 August 2022 in RNA
Verified
Journal Article
Open access
PDF file
VAViplove Arora
Viplove Arora
GSGuido Sanguinetti
Guido Sanguinetti
RNA-binding proteins (RBPs) are key co- and post-transcriptional regulators of gene expression, playing a crucial role in many biological processes. Experimental methods like CLIP-seq have enabled the identification of transcriptome-wide RNA–protein interactions for select proteins; however, the time- and resource-intensive nature of these technologies call for the development of computational methods to complement their predictions. Here, we leverage recent, large-scale CLIP-seq experiments to construct a de novo predictor of RNA–protein interactions based on graph neural networks (GNN). We show that the GNN method allows us not only to predict missing links in an RNA–protein network, but to predict the entire complement of targets of previously unassayed proteins, and even to reconstruct the entire network of RNA–protein interactions in different conditions based on minimal information. Our results demonstrate the potential of modern machine learning methods to extract useful information on post-transcriptional regulation from large data sets.

1 January 2022 in Statistical Applications in Genetics and Molecular Biology
Verified
Journal Article
Closed access
VAViplove Arora
Viplove Arora
GSGuido Sanguinetti
Guido Sanguinetti
RNA-protein interactions have long being recognised as crucial regulators of gene expression. Recently, the development of scalable experimental techniques to measure these interactions has revolutionised the field, leading to the production of large-scale datasets which offer both opportunities and challenges for machine learning techniques. In this brief note, we will discuss some of the major stumbling blocks towards the use of machine learning in computational RNA biology, focusing specifically on the problem of predicting RNA-protein interactions from next-generation sequencing data.

20 July 2016
Verified
Conference Paper
Open access
VAViplove Arora
Viplove Arora
MVMario Ventresca
Mario Ventresca
Complex networks are used to model a wide range of systems in nature and society. One area of importance is the ability to model network formation, which has lead to the development of many different algorithms (network generators) capable of synthesizing networks with very specific structural characteristics (e.g., degree distribution, average path length). In this paper, we propose an approach based on action-based networks, which have the potential to generate more realistic network structures than existing techniques. Tests for robustness of the proposed method to infer other network structural characteristics not included in the set of objectives being optimized show the efficacy of the approach.