Kislaya Ravi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kislaya Ravi has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Hans-Joachim Bungartz
Technical University of Munich
2 shared publications - Atul Agrawal
Tech Univ Munich, Professorship Data Driven Mat Modelling, Munich, Germany
1 shared publication - Fabian Buse
Institute of System Dynamics and Control, German Aerospace Center (DLR), Wessling, Germany
1 shared publication - Felix Dietrich
School of Computation, Information and Technology, Munich Data Science Institute, Munich Center for Machine Learning, Technical University of Munich 1 , Munich
1 shared publication - Michael Bergmann
Max-Planck-Institute of Plasma Physics
1 shared publication - Phaedon-Stelios Koutsourelakis
Technical University of Munich
1 shared publication
Latest Publications
- Open Access
- 31 January 2025
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 6 (1) , 015024
Stochastic black-box optimization using multi-fidelity score function estimator
Optimizing parameters of physics-based simulators is crucial in the design process of engineering and scientific systems. This becomes particularly challenging when the simulator is stochastic, computationally expensive, black-box and when a high-dimensional vector of parameters needs to be optimized, as e.g. is the case in complex climate models that involve numerous interdependent variables and uncertain parameters. Many traditional optimization methods rely on gradient information, which is frequently unavailable in legacy black-box codes. To address these challenges, we present SCOUT-Nd (Stochastic Constrained Optimization for N dimensions), a gradient-based algorithm that can be used on non-differentiable objectives. It can be combined with natural gradients in order to further enhance convergence properties. and it also incorporates multi-fidelity schemes and an adaptive selection of samples in order to minimize computational effort. We validate our approach using standard, benchmark problems, demonstrating its superior performance in parameter optimization compared to existing methods. Additionally, we showcase the algorithm’s efficacy in a complex real-world application, i.e. the optimization of a wind farm layout.
- 31 January 2025
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 6 (1) , 015024
Open AccessStochastic black-box optimization using multi-fidelity score function estimator
Optimizing parameters of physics-based simulators is crucial in the design process of engineering and scientific systems. This becomes particularly challenging when the simulator is stochastic, computationally expensive, black-box and when a high-dimensional vector of parameters needs to be optimized, as e.g. is the case in complex climate models that involve numerous interdependent variables and uncertain parameters. Many traditional optimization methods rely on gradient information, which is frequently unavailable in legacy black-box codes. To address these challenges, we present SCOUT-Nd (Stochastic Constrained Optimization for N dimensions), a gradient-based algorithm that can be used on non-differentiable objectives. It can be combined with natural gradients in order to further enhance convergence properties. and it also incorporates multi-fidelity schemes and an adaptive selection of samples in order to minimize computational effort. We validate our approach using standard, benchmark problems, demonstrating its superior performance in parameter optimization compared to existing methods. Additionally, we showcase the algorithm’s efficacy in a complex real-world application, i.e. the optimization of a wind farm layout.
- Open Access
- 15 October 2024
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 5 (4) , 045015
Multi-fidelity Gaussian process surrogate modeling for regression problems in physics
One of the main challenges in surrogate modeling is the limited availability of data due to resource constraints associated with computationally expensive simulations. Multi-fidelity methods provide a solution by chaining models in a hierarchy with increasing fidelity, associated with lower error, but increasing cost. In this paper, we compare different multi-fidelity methods employed in constructing Gaussian process surrogates for regression. Non-linear autoregressive methods in the existing literature are primarily confined to two-fidelity models, and we extend these methods to handle more than two levels of fidelity. Additionally, we propose enhancements for an existing method incorporating delay terms by introducing a structured kernel. We demonstrate the performance of these methods across various academic and real-world scenarios. Our findings reveal that multi-fidelity methods generally have a smaller prediction error for the same computational cost as compared to the single-fidelity method, although their effectiveness varies across different scenarios.
- 15 October 2024
- Published by IOP Publishing in Machine Learning: Science and Technology
- Vol. 5 (4) , 045015
Open AccessMulti-fidelity Gaussian process surrogate modeling for regression problems in physics
One of the main challenges in surrogate modeling is the limited availability of data due to resource constraints associated with computationally expensive simulations. Multi-fidelity methods provide a solution by chaining models in a hierarchy with increasing fidelity, associated with lower error, but increasing cost. In this paper, we compare different multi-fidelity methods employed in constructing Gaussian process surrogates for regression. Non-linear autoregressive methods in the existing literature are primarily confined to two-fidelity models, and we extend these methods to handle more than two levels of fidelity. Additionally, we propose enhancements for an existing method incorporating delay terms by introducing a structured kernel. We demonstrate the performance of these methods across various academic and real-world scenarios. Our findings reveal that multi-fidelity methods generally have a smaller prediction error for the same computational cost as compared to the single-fidelity method, although their effectiveness varies across different scenarios.