Harsh Bhatia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Harsh Bhatia has a total of 86 co-authors. Here are the top co-authors by number of shared publications:
- Peer-Timo Bremer
Computing Directorate, Lawrence Livermore National Laboratory, Livermore, CA
8 shared publications - Helgi I. Ingolfsson
Lawrence Livermore National Laboratory
5 shared publications - Timothy S. Carpenter
Physical and Life Sciences (PLS) Directorate, Lawrence Livermore National Laboratory, Livermore, CA 94550
5 shared publications Felice C. Lightstone
Physical and Life Sciences (PLS) Directorate, Lawrence Livermore National Laboratory, Livermore, California 94550, United States
4 shared publicationsPeer-Timo Bremer
Computing Directorate, Lawrence Livermore National Laboratory, Livermore, California 94550, United States
4 shared publications- Valerio Pascucci
University of Utah
4 shared publications
Latest Publications
- Open Access
- 19 April 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 19 (9) , 2658-2675
Machine Learning-Driven Multiscale Modeling: Bridging the Scales with a Next-Generation Simulation Infrastructure
Interdependence across time and length scales is common in biology, where atomic interactions can impact larger-scale phenomenon. Such dependence is especially true for a well-known cancer signaling pathway, where the membrane-bound RAS protein binds an effector protein called RAF. To capture the driving forces that bring RAS and RAF (represented as two domains, RBD and CRD) together on the plasma membrane, simulations with the ability to calculate atomic detail while having long time and large length- scales are needed. The Multiscale Machine-Learned Modeling Infrastructure (MuMMI) is able to resolve RAS/RAF protein-membrane interactions that identify specific lipid-protein fingerprints that enhance protein orientations viable for effector binding. MuMMI is a fully automated, ensemble-based multiscale approach connecting three resolution scales: (1) the coarsest scale is a continuum model able to simulate milliseconds of time for a 1 μm2 membrane, (2) the middle scale is a coarse-grained (CG) Martini bead model to explore protein-lipid interactions, and (3) the finest scale is an all-atom (AA) model capturing specific interactions between lipids and proteins. MuMMI dynamically couples adjacent scales in a pairwise manner using machine learning (ML). The dynamic coupling allows for better sampling of the refined scale from the adjacent coarse scale (forward) and on-the-fly feedback to improve the fidelity of the coarser scale from the adjacent refined scale (backward). MuMMI operates efficiently at any scale, from a few compute nodes to the largest supercomputers in the world, and is generalizable to simulate different systems. As computing resources continue to increase and multiscale methods continue to advance, fully automated multiscale simulations (like MuMMI) will be commonly used to address complex science questions.
- 19 April 2023
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 19 (9) , 2658-2675
Open AccessMachine Learning-Driven Multiscale Modeling: Bridging the Scales with a Next-Generation Simulation Infrastructure
Interdependence across time and length scales is common in biology, where atomic interactions can impact larger-scale phenomenon. Such dependence is especially true for a well-known cancer signaling pathway, where the membrane-bound RAS protein binds an effector protein called RAF. To capture the driving forces that bring RAS and RAF (represented as two domains, RBD and CRD) together on the plasma membrane, simulations with the ability to calculate atomic detail while having long time and large length- scales are needed. The Multiscale Machine-Learned Modeling Infrastructure (MuMMI) is able to resolve RAS/RAF protein-membrane interactions that identify specific lipid-protein fingerprints that enhance protein orientations viable for effector binding. MuMMI is a fully automated, ensemble-based multiscale approach connecting three resolution scales: (1) the coarsest scale is a continuum model able to simulate milliseconds of time for a 1 μm2 membrane, (2) the middle scale is a coarse-grained (CG) Martini bead model to explore protein-lipid interactions, and (3) the finest scale is an all-atom (AA) model capturing specific interactions between lipids and proteins. MuMMI dynamically couples adjacent scales in a pairwise manner using machine learning (ML). The dynamic coupling allows for better sampling of the refined scale from the adjacent coarse scale (forward) and on-the-fly feedback to improve the fidelity of the coarser scale from the adjacent refined scale (backward). MuMMI operates efficiently at any scale, from a few compute nodes to the largest supercomputers in the world, and is generalizable to simulate different systems. As computing resources continue to increase and multiscale methods continue to advance, fully automated multiscale simulations (like MuMMI) will be commonly used to address complex science questions.
- 28 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (7) , 4321-4338
Progressive Tree-Based Compression of Large-Scale Particle Data
Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions.
- 28 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 30 (7) , 4321-4338
Progressive Tree-Based Compression of Large-Scale Particle Data
Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions.
- Open Access
Data-driven model for divertor plasma detachment prediction
We present a fast and accurate data-driven surrogate model for divertor plasma detachment prediction leveraging the latent feature space concept in machine learning research. Our approach involves constructing and training two neural networks. An autoencoder that finds a proper latent space representation (LSR) of plasma state by compressing the multi-modal diagnostic measurements, and a forward model using multi-layer perception (MLP) that projects a set of plasma control parameters to its corresponding LSR. By combining the forward model and the decoder network from autoencoder, this new data-driven surrogate model is able to predict a consistent set of diagnostic measurements based on a few plasma control parameters. In order to ensure that the crucial detachment physics is correctly captured, highly efficient 1D UEDGE model is used to generate training and validation data in this study. Benchmark between the data-driven surrogate model and UEDGE simulations shows that our surrogate model is capable to provide accurate detachment prediction (usually within a few percent relative error margin) but with at least four orders of magnitude speed-up, indicating that performance-wise, it has the potential to facilitate integrated tokamak design and plasma control. Comparing to the widely used two-point model and/or two-point model formatting, the new data-driven model features additional detachment front prediction and can be easily extended to incorporate richer physics. This study demonstrates that the complicated divertor and scrape-off-layer plasma state has a low-dimensional representation in latent space. Understanding plasma dynamics in latent space and utilizing this knowledge could open a new path for plasma control in magnetic fusion energy research.
Open AccessData-driven model for divertor plasma detachment prediction
We present a fast and accurate data-driven surrogate model for divertor plasma detachment prediction leveraging the latent feature space concept in machine learning research. Our approach involves constructing and training two neural networks. An autoencoder that finds a proper latent space representation (LSR) of plasma state by compressing the multi-modal diagnostic measurements, and a forward model using multi-layer perception (MLP) that projects a set of plasma control parameters to its corresponding LSR. By combining the forward model and the decoder network from autoencoder, this new data-driven surrogate model is able to predict a consistent set of diagnostic measurements based on a few plasma control parameters. In order to ensure that the crucial detachment physics is correctly captured, highly efficient 1D UEDGE model is used to generate training and validation data in this study. Benchmark between the data-driven surrogate model and UEDGE simulations shows that our surrogate model is capable to provide accurate detachment prediction (usually within a few percent relative error margin) but with at least four orders of magnitude speed-up, indicating that performance-wise, it has the potential to facilitate integrated tokamak design and plasma control. Comparing to the widely used two-point model and/or two-point model formatting, the new data-driven model features additional detachment front prediction and can be easily extended to incorporate richer physics. This study demonstrates that the complicated divertor and scrape-off-layer plasma state has a low-dimensional representation in latent space. Understanding plasma dynamics in latent space and utilizing this knowledge could open a new path for plasma control in magnetic fusion energy research.
- Open Access
- 19 August 2022
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 3 (3) , 035010
A biology-informed similarity metric for simulated patches of human cell membrane
Complex scientific inquiries rely increasingly upon large and autonomous multiscale simulation campaigns, which fundamentally require similarity metrics to quantify ‘sufficient’ changes among data and/or configurations. However, subject matter experts are often unable to articulate similarity precisely or in terms of well-formulated definitions, especially when new hypotheses are to be explored, making it challenging to design a meaningful metric. Furthermore, the key to practical usefulness of such metrics to enable autonomous simulations lies in in situ inference, which requires generalization to possibly substantial distributional shifts in unseen, future data. Here, we address these challenges in a cancer biology application and develop a meaningful similarity metric for ‘patches’—regions of simulated human cell membrane that express interactions between certain proteins of interest and relevant lipids. In the absence of well-defined conditions for similarity, we leverage several biology-informed notions about data and the underlying simulations to impose inductive biases on our metric learning framework, resulting in a suitable similarity metric that also generalizes well to significant distributional shifts encountered during the deployment. We combine these intuitions to organize the learned embedding space in a multiscale manner, which makes the metric robust to incomplete and even contradictory intuitions. Our approach delivers a metric that not only performs well on the conditions used for its development and other relevant criteria, but also learns key spatiotemporal relationships without ever being exposed to any such information during training.
- 19 August 2022
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 3 (3) , 035010
Open AccessA biology-informed similarity metric for simulated patches of human cell membrane
Complex scientific inquiries rely increasingly upon large and autonomous multiscale simulation campaigns, which fundamentally require similarity metrics to quantify ‘sufficient’ changes among data and/or configurations. However, subject matter experts are often unable to articulate similarity precisely or in terms of well-formulated definitions, especially when new hypotheses are to be explored, making it challenging to design a meaningful metric. Furthermore, the key to practical usefulness of such metrics to enable autonomous simulations lies in in situ inference, which requires generalization to possibly substantial distributional shifts in unseen, future data. Here, we address these challenges in a cancer biology application and develop a meaningful similarity metric for ‘patches’—regions of simulated human cell membrane that express interactions between certain proteins of interest and relevant lipids. In the absence of well-defined conditions for similarity, we leverage several biology-informed notions about data and the underlying simulations to impose inductive biases on our metric learning framework, resulting in a suitable similarity metric that also generalizes well to significant distributional shifts encountered during the deployment. We combine these intuitions to organize the learned embedding space in a multiscale manner, which makes the metric robust to incomplete and even contradictory intuitions. Our approach delivers a metric that not only performs well on the conditions used for its development and other relevant criteria, but also learns key spatiotemporal relationships without ever being exposed to any such information during training.
- 22 July 2022
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 18 (8) , 5025-5045
Asynchronous Reciprocal Coupling of Martini 2.2 Coarse-Grained and CHARMM36 All-Atom Simulations in an Automated Multiscale Framework
The appeal of multiscale modeling approaches is predicated on the promise of combinatorial synergy. However, this promise can only be realized when distinct scales are combined with reciprocal consistency. Here, we consider multiscale molecular dynamics (MD) simulations that combine the accuracy and macromolecular flexibility accessible to fixed-charge all-atom (AA) representations with the sampling speed accessible to reductive, coarse-grained (CG) representations. AA-to-CG conversions are relatively straightforward because deterministic routines with unique outcomes are achievable. Conversely, CG-to-AA conversions have many solutions due to a surge in the number of degrees of freedom. While automated tools for biomolecular CG-to-AA transformation exist, we find that one popular option, called Backward, is prone to stochastic failure and the AA models that it does generate frequently have compromised protein structure and incorrect stereochemistry. Although these shortcomings can likely be circumvented by human intervention in isolated instances, automated multiscale coupling requires reliable and robust scale conversion. Here, we detail an extension to Multiscale Machine-learned Modeling Infrastructure (MuMMI), including an improved CG-to-AA conversion tool called sinceCG. This tool is reliable (∼98% weakly correlated repeat success rate), automatable (no unrecoverable hangs), and yields AA models that generally preserve protein secondary structure and maintain correct stereochemistry. We describe how the MuMMI framework identifies CG system configurations of interest, converts them to AA representations, and simulates them at the AA scale while on-the-fly analyses provide feedback to update CG parameters. Application to systems containing the peripheral membrane protein RAS and proximal components of RAF kinase on complex eight-component lipid bilayers with ∼1.5 million atoms is discussed in the context of MuMMI.
- 22 July 2022
- Published by American Chemical Society (ACS) in Journal of Chemical Theory and Computation
- Vol. 18 (8) , 5025-5045
Asynchronous Reciprocal Coupling of Martini 2.2 Coarse-Grained and CHARMM36 All-Atom Simulations in an Automated Multiscale Framework
The appeal of multiscale modeling approaches is predicated on the promise of combinatorial synergy. However, this promise can only be realized when distinct scales are combined with reciprocal consistency. Here, we consider multiscale molecular dynamics (MD) simulations that combine the accuracy and macromolecular flexibility accessible to fixed-charge all-atom (AA) representations with the sampling speed accessible to reductive, coarse-grained (CG) representations. AA-to-CG conversions are relatively straightforward because deterministic routines with unique outcomes are achievable. Conversely, CG-to-AA conversions have many solutions due to a surge in the number of degrees of freedom. While automated tools for biomolecular CG-to-AA transformation exist, we find that one popular option, called Backward, is prone to stochastic failure and the AA models that it does generate frequently have compromised protein structure and incorrect stereochemistry. Although these shortcomings can likely be circumvented by human intervention in isolated instances, automated multiscale coupling requires reliable and robust scale conversion. Here, we detail an extension to Multiscale Machine-learned Modeling Infrastructure (MuMMI), including an improved CG-to-AA conversion tool called sinceCG. This tool is reliable (∼98% weakly correlated repeat success rate), automatable (no unrecoverable hangs), and yields AA models that generally preserve protein secondary structure and maintain correct stereochemistry. We describe how the MuMMI framework identifies CG system configurations of interest, converts them to AA representations, and simulates them at the AA scale while on-the-fly analyses provide feedback to update CG parameters. Application to systems containing the peripheral membrane protein RAS and proximal components of RAF kinase on complex eight-component lipid bilayers with ∼1.5 million atoms is discussed in the context of MuMMI.
- 19 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 29 (3) , 1691-1704
Scalable Comparative Visualization of Ensembles of Call Graphs
Optimizing the performance of large-scale parallel codes is critical for efficient utilization of computing resources. Code developers often explore various execution parameters, such as hardware configurations, system software choices, and application parameters, and are interested in detecting and understanding bottlenecks in different executions. They often collect hierarchical performance profiles represented as call graphs, which combine performance metrics with their execution contexts. The crucial task of exploring multiple call graphs together is tedious and challenging because of the many structural differences in the execution contexts and significant variability in the collected performance metrics (e.g., execution runtime). In this paper, we present Ensemble CallFlow to support the exploration of ensembles of call graphs using new types of visualizations, analysis, graph operations, and features. We introduce ensemble-Sankey , a new visual design that combines the strengths of resource-flow (Sankey) and box-plot visualization techniques. Whereas the resource-flow visualization can easily and intuitively describe the graphical nature of the call graph, the box plots overlaid on the nodes of Sankey convey the performance variability within the ensemble. Our interactive visual interface provides linked views to help explore ensembles of call graphs, e.g., by facilitating the analysis of structural differences, and identifying similar or distinct call graphs. We demonstrate the effectiveness and usefulness of our design through case studies on large-scale parallel codes.
- 19 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 29 (3) , 1691-1704
Scalable Comparative Visualization of Ensembles of Call Graphs
Optimizing the performance of large-scale parallel codes is critical for efficient utilization of computing resources. Code developers often explore various execution parameters, such as hardware configurations, system software choices, and application parameters, and are interested in detecting and understanding bottlenecks in different executions. They often collect hierarchical performance profiles represented as call graphs, which combine performance metrics with their execution contexts. The crucial task of exploring multiple call graphs together is tedious and challenging because of the many structural differences in the execution contexts and significant variability in the collected performance metrics (e.g., execution runtime). In this paper, we present Ensemble CallFlow to support the exploration of ensembles of call graphs using new types of visualizations, analysis, graph operations, and features. We introduce ensemble-Sankey , a new visual design that combines the strengths of resource-flow (Sankey) and box-plot visualization techniques. Whereas the resource-flow visualization can easily and intuitively describe the graphical nature of the call graph, the box plots overlaid on the nodes of Sankey convey the performance variability within the ensemble. Our interactive visual interface provides linked views to help explore ensembles of call graphs, e.g., by facilitating the analysis of structural differences, and identifying similar or distinct call graphs. We demonstrate the effectiveness and usefulness of our design through case studies on large-scale parallel codes.
- 22 April 2021
- Published by Springer Nature in Nature Machine Intelligence
- Vol. 3 (5) , 401-409
Machine-learning-based dynamic-importance sampling for adaptive multiscale simulations
- 22 April 2021
- Published by Springer Nature in Nature Machine Intelligence
- Vol. 3 (5) , 401-409
Machine-learning-based dynamic-importance sampling for adaptive multiscale simulations
- 1 January 2021
- Published by Springer Nature
- p. 235-248
Data-Driven Estimation of Temporal-Sampling Errors in Unsteady Flows
- 1 January 2021
- Published by Springer Nature
- p. 235-248
Data-Driven Estimation of Temporal-Sampling Errors in Unsteady Flows
- 13 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (2) , 603-613
Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution
To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as ZFP [52], IDX [58], and JPEG2000 [76]. Finally, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.
- 13 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (2) , 603-613
Efficient and Flexible Hierarchical Data Layouts for a Unified Encoding of Scalar Field Precision and Resolution
To address the problem of ever-growing scientific data sizes making data movement a major hindrance to analysis, we introduce a novel encoding for scalar fields: a unified tree of resolution and precision, specifically constructed so that valid cuts correspond to sensible approximations of the original field in the precision-resolution space. Furthermore, we introduce a highly flexible encoding of such trees that forms a parameterized family of data hierarchies. We discuss how different parameter choices lead to different trade-offs in practice, and show how specific choices result in known data representation schemes such as ZFP [52], IDX [58], and JPEG2000 [76]. Finally, we provide system-level details and empirical evidence on how such hierarchies facilitate common approximate queries with minimal data movement and time, using real-world data sets ranging from a few gigabytes to nearly a terabyte in size. Experiments suggest that our new strategy of combining reductions in resolution and precision is competitive with state-of-the-art compression techniques with respect to data quality, while being significantly more flexible and orders of magnitude faster, and requiring significantly reduced resources.
- 11 August 2020
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 124 (36) , 7819-7829
Capturing Biologically Complex Tissue-Specific Membranes at Different Levels of Compositional Complexity
Plasma membranes (PMs) contain hundreds of different lipid species that contribute differently to overall bilayer properties. By modulation of these properties, membrane protein function can be affected. Furthermore, inhomogeneous lipid mixing and domains of lipid enrichment/depletion can sort proteins and provide optimal local environments. Recent coarse-grained (CG) Martini molecular dynamics efforts have provided glimpses into lipid organization of different PMs; an 'Average', and a 'Brain' PM. Their high complexity and large size require long simulations (~80 microseconds) for proper sampling. Thus, these simulations are computationally taxing. This level of complexity is beyond the possibilities of all-atom simulations, raising the question – what complexity is needed for 'realistic' bilayer properties? We constructed CG Martini PM models of varying complexity (63 down to 8 different lipids). Lipid tail saturations and headgroup combinations were kept as consistent as possible for the 'tissues' (Average/Brain) at three levels of compositional complexity. For each system we analyzed membrane properties to evaluate which features can be retained at lower complexity, and validate eight-component bilayers that can act as reliable mimetics for Average or Brain PMs. Systems of reduced complexity deliver a more robust and malleable tool for computational membrane studies, and allow for equivalent all-atom simulations and experiments.
- 11 August 2020
- Published by American Chemical Society (ACS) in The Journal of Physical Chemistry B
- Vol. 124 (36) , 7819-7829
Capturing Biologically Complex Tissue-Specific Membranes at Different Levels of Compositional Complexity
Plasma membranes (PMs) contain hundreds of different lipid species that contribute differently to overall bilayer properties. By modulation of these properties, membrane protein function can be affected. Furthermore, inhomogeneous lipid mixing and domains of lipid enrichment/depletion can sort proteins and provide optimal local environments. Recent coarse-grained (CG) Martini molecular dynamics efforts have provided glimpses into lipid organization of different PMs; an 'Average', and a 'Brain' PM. Their high complexity and large size require long simulations (~80 microseconds) for proper sampling. Thus, these simulations are computationally taxing. This level of complexity is beyond the possibilities of all-atom simulations, raising the question – what complexity is needed for 'realistic' bilayer properties? We constructed CG Martini PM models of varying complexity (63 down to 8 different lipids). Lipid tail saturations and headgroup combinations were kept as consistent as possible for the 'tissues' (Average/Brain) at three levels of compositional complexity. For each system we analyzed membrane properties to evaluate which features can be retained at lower complexity, and validate eight-component bilayers that can act as reliable mimetics for Average or Brain PMs. Systems of reduced complexity deliver a more robust and malleable tool for computational membrane studies, and allow for equivalent all-atom simulations and experiments.