Aleksei G. Sorokin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aleksei G. Sorokin has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Fred J. Hickernell
Illinois Institute of Technology, USA
7 shared publications - Sou-Cheng T. Choi
Illinois Institute of Technology
5 shared publications - Rathinavel Jagadeeswaran
Illinois Institute of Technology
4 shared publications Bolong Cheng
2 shared publications- Eda Gjergo
Nanjing University
2 shared publications - Jagadeeswaran Rathinavel
Illinois Institute of Technology
2 shared publications
Latest Publications
- 24 October 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 569
Fast Bayesian multilevel quasi-Monte Carlo
- 24 October 2026
- Published by Elsevier in Journal of Computational Physics
- Vol. 569
Fast Bayesian multilevel quasi-Monte Carlo
- Open Access
- 19 January 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (117) , 9705
QMCPy: A Python Framework for (Quasi-)Monte Carlo Algorithms
- 19 January 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (117) , 9705
Open AccessQMCPy: A Python Framework for (Quasi-)Monte Carlo Algorithms
- 17 December 2025
- Published by IOP Publishing in Research in Astronomy and Astrophysics
- Vol. 26 (2) , 025003
Massive Star Formation at Supersolar Metallicities: Constraints on the Initial Mass Function
Metals enhance the cooling efficiency of molecular clouds, promoting fragmentation. Consequently, increasing the metallicity may boost the formation of low-mass stars. Within the integrated galactic initial mass function (IGIMF) theory, this effect is empirically captured by a linear relation between the slope of the low-mass stellar IMF, α 1 , and the metal mass fraction, Z . This linear α 1 – Z relation has been calibrated up to ≈2 Z ⊙ , though higher metallicity environments are known to exist. We show that if the linear α 1 – Z relation extends to higher metallicities ([ Z ] ≳ 0.5), massive star formation is suppressed entirely. Alternatively, fragmentation efficiency may saturate beyond some metallicity threshold if gravitational collapse cascades rapidly enough. To model this behavior, we propose a logistic function describing the transition from metallicity-sensitive to metallicity-insensitive fragmentation regimes. We provide a user-friendly public code, pyIGIMF , which enables the instantaneous computation of the IGIMF theory with both linear and logistic α 1 – Z relations.
- 17 December 2025
- Published by IOP Publishing in Research in Astronomy and Astrophysics
- Vol. 26 (2) , 025003
Massive Star Formation at Supersolar Metallicities: Constraints on the Initial Mass Function
Metals enhance the cooling efficiency of molecular clouds, promoting fragmentation. Consequently, increasing the metallicity may boost the formation of low-mass stars. Within the integrated galactic initial mass function (IGIMF) theory, this effect is empirically captured by a linear relation between the slope of the low-mass stellar IMF, α 1 , and the metal mass fraction, Z . This linear α 1 – Z relation has been calibrated up to ≈2 Z ⊙ , though higher metallicity environments are known to exist. We show that if the linear α 1 – Z relation extends to higher metallicities ([ Z ] ≳ 0.5), massive star formation is suppressed entirely. Alternatively, fragmentation efficiency may saturate beyond some metallicity threshold if gravitational collapse cascades rapidly enough. To model this behavior, we propose a logistic function describing the transition from metallicity-sensitive to metallicity-insensitive fragmentation regimes. We provide a user-friendly public code, pyIGIMF , which enables the instantaneous computation of the IGIMF theory with both linear and logistic α 1 – Z relations.
- Open Access
Quasi-Monte Carlo Methods: What, Why, and How?
Many questions in quantitative finance, uncertainty quantification, and other disciplines are answered by computing the population mean, $μ:= \mathbb{E}(Y)$, where instances of $Y:=f(\boldsymbol{X})$ may be generated by numerical simulation and $\boldsymbol{X}$ has a simple probability distribution. The population mean can be approximated by the sample mean, $\hatμ_n := n^{-1} \sum_{i=0}^{n-1} f(\boldsymbol{x}_i)$ for a well chosen sequence of nodes, $\{\boldsymbol{x}_0, \boldsymbol{x}_1, \ldots\}$ and a sufficiently large sample size, $n$. Computing $μ$ is equivalent to computing a $d$-dimensional integral, $\int f(\boldsymbol{x}) \varrho(\boldsymbol{x}) \, \mathrm{d} \boldsymbol{x}$, where $\varrho$ is the probability density for $\boldsymbol{X}$. Quasi-Monte Carlo methods replace independent and identically distributed sequences of random vector nodes, $\{\boldsymbol{x}_i \}_{i = 0}^{\infty}$, by low discrepancy sequences. This accelerates the convergence of $\hatμ_n$ to $μ$ as $n \to \infty$. This tutorial describes low discrepancy sequences and their quality measures. We demonstrate the performance gains possible with quasi-Monte Carlo methods. Moreover, we describe how to formulate problems to realize the greatest performance gains using quasi-Monte Carlo. We also briefly describe the use of quasi-Monte Carlo methods for problems beyond computing the mean, $μ$.Open AccessQuasi-Monte Carlo Methods: What, Why, and How?
Many questions in quantitative finance, uncertainty quantification, and other disciplines are answered by computing the population mean, $μ:= \mathbb{E}(Y)$, where instances of $Y:=f(\boldsymbol{X})$ may be generated by numerical simulation and $\boldsymbol{X}$ has a simple probability distribution. The population mean can be approximated by the sample mean, $\hatμ_n := n^{-1} \sum_{i=0}^{n-1} f(\boldsymbol{x}_i)$ for a well chosen sequence of nodes, $\{\boldsymbol{x}_0, \boldsymbol{x}_1, \ldots\}$ and a sufficiently large sample size, $n$. Computing $μ$ is equivalent to computing a $d$-dimensional integral, $\int f(\boldsymbol{x}) \varrho(\boldsymbol{x}) \, \mathrm{d} \boldsymbol{x}$, where $\varrho$ is the probability density for $\boldsymbol{X}$. Quasi-Monte Carlo methods replace independent and identically distributed sequences of random vector nodes, $\{\boldsymbol{x}_i \}_{i = 0}^{\infty}$, by low discrepancy sequences. This accelerates the convergence of $\hatμ_n$ to $μ$ as $n \to \infty$. This tutorial describes low discrepancy sequences and their quality measures. We demonstrate the performance gains possible with quasi-Monte Carlo methods. Moreover, we describe how to formulate problems to realize the greatest performance gains using quasi-Monte Carlo. We also briefly describe the use of quasi-Monte Carlo methods for problems beyond computing the mean, $μ$. - 19 October 2024
- Published by Elsevier in Advances in Water Resources
- Vol. 193
Computationally efficient and error aware surrogate construction for numerical solutions of subsurface flow through porous media
- 19 October 2024
- Published by Elsevier in Advances in Water Resources
- Vol. 193
Computationally efficient and error aware surrogate construction for numerical solutions of subsurface flow through porous media
- 13 July 2024
- Published by Springer Nature
- p. 583-599
On Bounding and Approximating Functions of Multiple Expectations Using Quasi-Monte Carlo
- 13 July 2024
- Published by Springer Nature
- p. 583-599
On Bounding and Approximating Functions of Multiple Expectations Using Quasi-Monte Carlo
- 13 July 2024
- Published by Springer Nature
- p. 209-222
Challenges in Developing Great Quasi-Monte Carlo Software
- 13 July 2024
- Published by Springer Nature
- p. 209-222
Challenges in Developing Great Quasi-Monte Carlo Software
- Open Access
On Bounding and Approximating Functions of Multiple Expectations using Quasi-Monte Carlo
Monte Carlo and Quasi-Monte Carlo methods present a convenient approach for approximating the expected value of a random variable. Algorithms exist to adaptively sample the random variable until a user defined absolute error tolerance is satisfied with high probability. This work describes an extension of such methods which supports adaptive sampling to satisfy general error criteria for functions of a common array of expectations. Although several functions involving multiple expectations are being evaluated, only one random sequence is required, albeit sometimes of larger dimension than the underlying randomness. These enhanced Monte Carlo and Quasi-Monte Carlo algorithms are implemented in the QMCPy Python package with support for economic and parallel function evaluation. We exemplify these capabilities on problems from machine learning and global sensitivity analysis.
Open AccessOn Bounding and Approximating Functions of Multiple Expectations using Quasi-Monte Carlo
Monte Carlo and Quasi-Monte Carlo methods present a convenient approach for approximating the expected value of a random variable. Algorithms exist to adaptively sample the random variable until a user defined absolute error tolerance is satisfied with high probability. This work describes an extension of such methods which supports adaptive sampling to satisfy general error criteria for functions of a common array of expectations. Although several functions involving multiple expectations are being evaluated, only one random sequence is required, albeit sometimes of larger dimension than the underlying randomness. These enhanced Monte Carlo and Quasi-Monte Carlo algorithms are implemented in the QMCPy Python package with support for economic and parallel function evaluation. We exemplify these capabilities on problems from machine learning and global sensitivity analysis.
- Open Access
Challenges in Developing Great Quasi-Monte Carlo Software
Quasi-Monte Carlo (QMC) methods have developed over several decades. With the explosion in computational science, there is a need for great software that implements QMC algorithms. We summarize the QMC software that has been developed to date, propose some criteria for developing great QMC software, and suggest some steps toward achieving great software. We illustrate these criteria and steps with the Quasi-Monte Carlo Python library (QMCPy), an open-source community software framework, extensible by design with common programming interfaces to an increasing number of existing or emerging QMC libraries developed by the greater community of QMC researchers.
Open AccessChallenges in Developing Great Quasi-Monte Carlo Software
Quasi-Monte Carlo (QMC) methods have developed over several decades. With the explosion in computational science, there is a need for great software that implements QMC algorithms. We summarize the QMC software that has been developed to date, propose some criteria for developing great QMC software, and suggest some steps toward achieving great software. We illustrate these criteria and steps with the Quasi-Monte Carlo Python library (QMCPy), an open-source community software framework, extensible by design with common programming interfaces to an increasing number of existing or emerging QMC libraries developed by the greater community of QMC researchers.
- Open Access
SigOpt Mulch: An Intelligent System for AutoML of Gradient Boosted Trees
Gradient boosted trees (GBTs) are ubiquitous models used by researchers, machine learning (ML) practitioners, and data scientists because of their robust performance, interpretable behavior, and ease-of-use. One critical challenge in training GBTs is the tuning of their hyperparameters. In practice, selecting these hyperparameters is often done manually. Recently, the ML community has advocated for tuning hyperparameters through black-box optimization and developed state-of-the-art systems to do so. However, applying such systems to tune GBTs suffers from two drawbacks. First, these systems are not \textit{model-aware}, rather they are designed to apply to a \textit{generic} model; this leaves significant optimization performance on the table. Second, using these systems requires \textit{domain knowledge} such as the choice of hyperparameter search space, which is an antithesis to the automatic experimentation that black-box optimization aims to provide. In this paper, we present SigOpt Mulch, a model-aware hyperparameter tuning system specifically designed for automated tuning of GBTs that provides two improvements over existing systems. First, Mulch leverages powerful techniques in metalearning and multifidelity optimization to perform model-aware hyperparameter optimization. Second, it automates the process of learning performant hyperparameters by making intelligent decisions about the optimization search space, thus reducing the need for user domain knowledge. These innovations allow Mulch to identify good GBT hyperparameters far more efficiently -- and in a more seamless and user-friendly way -- than existing black-box hyperparameter tuning systems.
Open AccessSigOpt Mulch: An Intelligent System for AutoML of Gradient Boosted Trees
Gradient boosted trees (GBTs) are ubiquitous models used by researchers, machine learning (ML) practitioners, and data scientists because of their robust performance, interpretable behavior, and ease-of-use. One critical challenge in training GBTs is the tuning of their hyperparameters. In practice, selecting these hyperparameters is often done manually. Recently, the ML community has advocated for tuning hyperparameters through black-box optimization and developed state-of-the-art systems to do so. However, applying such systems to tune GBTs suffers from two drawbacks. First, these systems are not \textit{model-aware}, rather they are designed to apply to a \textit{generic} model; this leaves significant optimization performance on the table. Second, using these systems requires \textit{domain knowledge} such as the choice of hyperparameter search space, which is an antithesis to the automatic experimentation that black-box optimization aims to provide. In this paper, we present SigOpt Mulch, a model-aware hyperparameter tuning system specifically designed for automated tuning of GBTs that provides two improvements over existing systems. First, Mulch leverages powerful techniques in metalearning and multifidelity optimization to perform model-aware hyperparameter optimization. Second, it automates the process of learning performant hyperparameters by making intelligent decisions about the optimization search space, thus reducing the need for user domain knowledge. These innovations allow Mulch to identify good GBT hyperparameters far more efficiently -- and in a more seamless and user-friendly way -- than existing black-box hyperparameter tuning systems.