A non-parametric optimal design algorithm for population pharmacokinetics
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.
Tom: We're looking at the paper: "A non-parametric optimal design algorithm for population pharmacokinetics".
Jane: Here's the gist of the paper. A non-parametric optimal design algorithm for population pharmacokinetics introduces an algorithm that estimates the joint distribution of model parameters with application to population pharmacokinetics.
Tom: This paper demonstrates that the NPOD algorithm achieves similar solutions to NPAG across two datasets, while being significantly more efficient in both the number of cycles required and overall runtime.
Jane: Algorithm Comparison The paper compares the non-parametric optimal design (NPOD) algorithm with the non-parametric adaptive grid (NPAG) algorithm on two datasets, one synthetic and one using real pharmacokinetic data.
Tom: For dataset A, NPOD was able to achieve convergence at a much faster rate compared to NPAG, requiring almost one twentieth the number of cycles for a high number of initial points.
Title and authors: Tom: So we're talking about this paper called "A non-parametric optimal design algorithm for population pharmacokinetics". Jane, what does that title actually mean in plain English?
Jane: Well, it sounds very technical, but basically, it means they made a new way to figure out the common set of parameters for a whole population model. It's about finding the best set of guesses for those model parameters when you have data from many subjects.
Lu: Exactly. The core idea here is estimating the joint distribution of all those model parameters using non-parametric methods, which means they aren't assuming the data comes from a neat bell curve or some other fixed shape like a normal distribution <ref:2502.15848#pg2>.
Meng: So, if I understand this right, it’s about designing an experiment or setting up the model parameters so we get the best possible picture of what's happening across a whole group of people? That sounds like something we do every day in PK modeling.
Tom: Right. And the authors are Hovd, Kryshchenko, Neely and Otalvaro, plus Schumitzky and Yamada. They’ve been working in this space before with something called NPAG <ref:2502.15848#pg1>.
Jane: And they’re proposing a new algorithm called NPOD which aims to be better than what they already have, specifically by how it finds those best guesses for the parameters.
Lu: They're moving away from just suggesting new support points in a general way, and instead using something called a gradient approach with interior-point methods for convex programming to find the optimal weights of that mixing distribution <ref:2502.15848#pg1>.
Tom: A gradient approach sounds promising if it means less wasted computation. So what's the actual gist of this paper about how NPOD works compared to NPAG?
Jane: The main point is that they show NPOD gets solutions that are just as good as the older NPAG algorithm when tested on two different types of datasets, but it does it much faster in both cycles and in total run time.
Meng: Faster cycles are crucial because running these kinds of optimization routines can take a long time on real hardware <ref:2502.15848#pg1>. That efficiency gain is something I care about when we're trying to deploy models at scale, even if it’s just for research right now.
Tom: So the takeaway here is that they found a way to get similar quality results but with significantly less computational overhead. This paper, "A non-parametric optimal design algorithm for population pharmacokinetics," is showing us a more efficient route to estimating those complex parameter distributions.
The paper's summary: Jane: So we know NPOD and NPAG give similar results, but what's the actual mechanism they use to achieve that similarity in the first place? I mean, how does this algorithm actually estimate that joint distribution of parameters?
Lu: They are maximizing a likelihood function, called L(F), with respect to all possible probability distributions F on that parameter space Θ <ref:2502.15848#pg3>. The goal is to find the distribution FM L which maximizes that likelihood function.
Tom: So they take the data from N subjects, and they have known how each individual subject's measurements relate to their specific model parameters, and then they try to figure out the distribution F that best explains all those measurements at once.
Jane: Right. And what’s interesting is that this likelihood function L(F) is convex with respect to F <ref:2502.15848#pg3>. That convexity helps them find a maximum, which they call the global maximizer FM L.
Meng: So they're essentially using optimization techniques to search for the best set of parameter values, which have non-zero probability in the population model <ref:2502.15848#pg3>. That’s a pretty standard statistical setup, but the algorithm is what makes it efficient.
Tom: The paper focuses on how NPOD uses this gradient approach—specifically the directional derivative of the likelihood function—to suggest new support points rather than just using an ad-hoc method like NPAG <ref:2502.15848#pg1>.
Jane: That directional derivative idea is what they use to intelligently suggest where to look next, which cuts down on evaluating non-relevant points and saves time <ref:2502.15848#pg1>. It’s an improvement in how the search happens within that convex programming framework.
Lu: And they fine-tune a hyperparameter called t, which controls the number of steps in a Nelder-Mead optimization, which lets them focus their search on promising regions instead of just blindly exploring the whole space <ref:2502.15848#pg1>.
Tom: So we’re talking about using calculus to guide the search process to make it smarter and quicker. That's a tangible improvement for computational efficiency.
The paper's improvements: Jane: Okay, so we know NPOD is faster, but what are the specific ways they improved things? What’s the actual technical step that makes it better than just being a slightly different search method?
Lu: The key improvement is replacing the ad-hoc method for finding optimal support points with an optimization of the directional derivative of the likelihood function <ref:2502.15848#pg1>. That’s what guides their new set of support points.
Tom: So they are using this derivative to see which direction is most likely to lead them to a better estimate, which should be more targeted than what NPAG does <ref:2502.15848#pg1>.
Meng: From an engineering standpoint, that targeting ability is what matters when you're dealing with complex models, because it means the search isn't just random exploration; it’s directed exploration <ref:2502.15848#pg3>.
Jane: And they also mentioned using a memory safe and computationally efficient framework in Rust for both NPAG and NPOD to handle the increased complexity of these models and large datasets Improvement two <ref:2502.15848#pg1>. That’s a big deal for deployment concerns.
Tom: A Rust implementation suggests they are thinking about the practical reality of running this sort of system on modern hardware, maybe even something like an M3 Max processor with one hundred twenty-eight gigabytes of RAM Improvement two.
Lu: And they've also added a clever trick for outlier detection. They use QR decomposition at each cycle to remove any support points that aren't in the orthonormal basis for the column space of the Psi matrix Improvement three <ref:2502.15848#pg1>.
Meng: Removing those non-basis points sounds like a robust way to handle outliers, which is super important because we know outliers are a huge problem when you’re looking at population data <ref:2502.15848#pg1>.
Jane: So they're not just making it faster; they're also making the process more robust against bad data points without losing accuracy, which is important for real-world applications.
Conclusion: Tom: So to wrap up on this paper, the authors have shown that NPOD achieves solutions as accurate as NPAG across two different datasets but requires far fewer cycles to converge <ref:2502.15848#pg1>. It’s a solid performance gain in terms of computational cost.
Jane: That efficiency comes from using a directional derivative approach to suggest new support points, which allows the system to focus its search on promising regions rather than just blindly exploring the whole parameter space Improvement one <ref:2502.15848#pg1,approach to suggest new support points, which>.
Lu: And they also showed that by tuning hyperparameters like t in the Nelder-Mead optimization, they can really fine-tune how much computational cost you want to spend versus how good your final estimate is Improvement four.
Meng: From a deployment view, having those efficiency gains and built-in outlier removal means this algorithm has a better chance of running reliably on actual production traffic than the older NPAG <ref:2502.15848#pg1>.
Lalam: I'm pretty sure the joint parameter distribution estimated by both NPOD and NPAG was very similar, as seen in Figure two where the support points are close to perfectly overlapping <ref:2502.15848#pg1>.
Tom: And that similarity is what makes this algorithm interesting—it’s not just a marginal improvement; it’s a different way of doing the estimation that cuts down on cycles by almost one twentieth for a high number of initial points in one case <ref:2502.15848#pg1>.
Jane: It sounds like the biggest implication is that we can get more accurate population estimates with less computational time, which is a huge deal for anyone working on PK or PD modeling.
Lu: The paper's limitation they point out is that the performance of NPOD really depends on the initial grid or prior Future Directions.
Meng: And they admit that formal convergence guarantees and algorithmic complexity for both NPAG and NPOD are limited, which means we can't predict exactly how it will behave in totally weird scenarios yet.
Lalam: So, in short, this paper "A non-parametric optimal design algorithm for population pharmacokinetics" gives us a way to estimate the joint parameter distribution as accurately as what we could get with NPAG but much faster.
Tom: We’re wrapping up on this one and moving on now. Next time we look at a new arXiv paper that’s got us."
Oslo University Hospital · California State University Channel Islands · Children’s Hospital Los Angeles
stat.ME, cs.LG, q-bio.QM, stat.AP, stat.ML
Submitted: 2025-02-20
Updated: 2025-02-20
Journal ref: Advances in Data Science, Association for Women in Mathematics Series 37 (2025) 259-274
DOI: 10.1007/978-3-031-87804-6_12.
Code: https://github.com/LAPKB/Pmetrics
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 77/100
The gist: A non-parametric optimal design algorithm for population pharmacokinetics introduces an algorithm that estimates the joint distribution of model parameters with application to population…
Key concepts
- Non-parametric Optimal Design (NPOD)
- This is a new algorithm that estimates the joint distribution of model parameters without assuming a specific functional form. It uses a primal-dual interior-point method to find optimal weights for the mixing distribution and employs directional derivatives to intelligently search for the best support points.
- Non-parametric Adaptive Grid (NPAG)
- This is a comparison algorithm used in population pharmacokinetics that estimates parameter distributions. NPOD is shown to achieve similar solutions as NPAG but is more efficient, requiring fewer cycles and less overall runtime on both synthetic and real data sets.
- Directional Derivative Approach
- NPOD uses the directional derivative of the log-likelihood function to suggest new support points. This technique helps the algorithm focus its search on promising regions of parameter space, avoiding unnecessary computations and speeding up convergence compared to traditional methods.
- Outlier Detection via QR Decomposition
- A robust feature of NPOD is its ability to detect outliers by using QR decomposition. This method identifies support points that are not in the orthonormal basis for the column space of the Psi matrix, effectively removing points that deviate significantly from the main data structure, which is vital for population studies.
Terminology
Summary
A non-parametric optimal design algorithm for population pharmacokinetics introduces an algorithm that estimates the joint distribution of model parameters with application to population pharmacokinetics. p. 0 Neely[0000−0002−1675−8276]
and
Julian Otalvaro[0000−0001−5202−1645]
and
Alan Schumitzky and
Walter M. Yamada[0000−0003−3512−9202]
Abstract This paper introduces a non-parametric estimation algorithm designed to effectively estimate the
joint distribution of model parameters with application to population pharmacokinetics. In contrast, the non-parametric
optimal design (NPOD) algorithm uses a gradient approach to suggest new support points, which reduces
the amount of time spent evaluating non-relevant points and by this the overall number of cycles required
to reach convergence. In this paper, we demonstrate that the NPOD algorithm achieves similar solutions to
NPAG across two datasets, while being significantly more efficient in both the number of cycles required
and overall runtime.Where the paper says it
Where the paper says it
Algorithm Comparison
The paper compares the non-parametric optimal design (NPOD) algorithm with the non-parametric adaptive grid (NPAG) algorithm on two datasets, one synthetic and one using real pharmacokinetic data. For dataset A, NPOD was able to achieve convergence at a much faster rate compared to NPAG, requiring almost one twentieth the number of cycles for a high number of initial points. p. 6 8) between the two algorithms were almost identical. Furthermore,
for all the different initial grid densities evaluated, ranging from 51 to 104 448, NPOD was able to achieve
convergence at a much faster rate compared to NPAG, requiring almost one twentieth the number of cycles for
a high number of initial points (Table 1). Furthermore,
for all the different initial grid densities evaluated, ranging from 51 to 104 448, NPOD was able to achieve
convergence at a much faster rate compared to NPAG, requiring almost one twentieth the number of cycles for
a high number of initial points (Table 1). However, the difference in overall computation time is negligible. The bimodal distribution of 𝐾𝑒 is readily apparent, with the univariate
distribution of 𝑉𝑑, and the inclusion of an extreme outlier. For dataset B, which to reiterate consists of real-world data, NPOD was able to obtain a solution as
likely or more compared with NPAG with a lower number of cycles. For dataset B, which to reiterate consists of real-world data, NPOD was able to obtain a solution as
likely or more compared with NPAG with a lower number of cycles. However, for this dataset, the overall
computation time was lower, with up to 5-fold difference, as seen in Table 2.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
NPOD Design Principles
The NPOD algorithm is an alternative to the NPAG algorithm and is different from it in the step of finding optimal support points. It utilizes the primal-dual interior-point method for convex programming to find optimal weights of the mixing distribution. p. 2 The algorithm described here is an alternative to the NPAG algorithm and is different from it in the step of
finding optimal support points. It utilizes the primal-dual interior-point method for convex programming to
find optimal weights of the 𝐹
𝑀 𝐿 and introduces the optimization of the directional derivative of the likelihood
function to address the search for optimal support points of the 𝐹
𝑀𝐿. The algorithm described here is an alternative to the NPAG algorithm and is different from it in the step of
finding optimal support points. It utilizes the primal-dual interior-point method for convex programming to
find optimal weights of the 𝐹
𝑀 𝐿 and introduces the optimization of the directional derivative of the likelihood
function to address the search for optimal support points of the 𝐹
𝑀𝐿. (3)
Additionally, in the same paper, Lindsay showed when
max
𝜉 ∈Ω
𝐷(𝜉, 𝐹∗
) ≠ 0, (4)
it is still true that
𝐿(𝐹
𝑀𝐿) − 𝐿(𝐹
∗
) ≤ max
𝜉 ∈Ω
𝐷(𝜉, 𝐹∗
) (5)
for 𝐹
∗
, 𝐹𝑀 𝐿 ∈ F𝐾 . In NPOD the updated set of support points is found as follows: for 𝑘 = 1, . In NPOD the updated set of support points is found as follows: for 𝑘 = 1, . , 𝐾 where 𝐾 is the current
grid size and 𝐹
(𝑛)
is the current distribution:
𝜃
(𝑛+1)
𝑘
= 𝑎𝑟𝑔𝑚𝑎𝑥𝑡
𝜉 ∈Ω
(𝐷(𝜉, 𝐹(𝑛)
)), (6)
𝐷(𝜉, 𝐹(𝑛)
) =
∑︁
𝑁
𝑖=1
𝑃(𝑌𝑖
| 𝜉)
𝑃(𝑌𝑖
| 𝐹(𝑛)
)
!Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Efficiency Gains
The efficiency of NPOD compared to NPAG stems from its directional derivative approach. The idea originates in a text by Fedorov [4], which covers D-optimal design theory. p. 3 The directional derivatives of the log-likelihood of 𝐹 in the direction of the atomic density function
centered at each support point is denoted as 𝐷𝛿𝜉
ℓ(𝐹). The idea originates in a text by Fedorov [4], which
covers 𝐷-optimal design theory. (3)
Additionally, in the same paper, Lindsay showed when
max
𝜉 ∈Ω
𝐷(𝜉, 𝐹∗
) ≠ 0, (4)
it is still true that
𝐿(𝐹
𝑀𝐿) − 𝐿(𝐹
∗
) ≤ max
𝜉 ∈Ω
𝐷(𝜉, 𝐹∗
) (5)
for 𝐹
∗
, 𝐹𝑀 𝐿 ∈ F𝐾 . In NPOD the updated set of support points is found as follows: for 𝑘 = 1, . In NPOD the updated set of support points is found as follows: for 𝑘 = 1, . , 𝐾 where 𝐾 is the current
grid size and 𝐹
(𝑛)
is the current distribution:
𝜃
(𝑛+1)
𝑘
= 𝑎𝑟𝑔𝑚𝑎𝑥𝑡
𝜉 ∈Ω
(𝐷(𝜉, 𝐹(𝑛)
)), (6)
𝐷(𝜉, 𝐹(𝑛)
) =
∑︁
𝑁
𝑖=1
𝑃(𝑌𝑖
| 𝜉)
𝑃(𝑌𝑖
| 𝐹(𝑛)
)
! This adjustment plays a
pivotal role in enhancing the efficiency of NPOD compared to NPAG, particularly in achieving convergence
to local maxima. The parameter 𝑡 is regarded as one of the hyperparameters that can be fine-tuned to optimize the performance of the algorithm. By limiting the number of steps in the Nelder-Mead optimization, we can focus the algorithm’s search on
promising regions of the parameter space while avoiding excessive computational overhead. This targeted
approach enables NPOD to converge more efficiently towards local maxima, making it a valuable tool for
solving optimization problems in diverse domains.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Convergence and Robustness
The estimated joint parameter distribution from both NPOD and NPAG was very similar, as seen in Figure 2, where the support points are close to perfectly overlapping. The simulated dataset included an extreme outlier, whose parameter values deviated greatly from the population weighted mean. p. 8 The bimodal distribution of 𝐾𝑒 is readily apparent, with the univariate
distribution of 𝑉𝑑, and the inclusion of an extreme outlier. For dataset B, which to reiterate consists of real-world data, NPOD was able to obtain a solution as
likely or more compared with NPAG with a lower number of cycles. Non-parametric approaches allow for more accurate a priori detection
of sub-populations and outliers [17, 6]. The non-parametric adaptive grid (NPAG) algorithm is a well-established non-parametric estimation
method widely used in pharmacokinetics and pharmacodynamics (PK/PD) [6]. The two algorithms have some important differences, which is elucidated by the results in Table 1. Most
importantly, NPOD was able to determine a solution that was as likely as that of NPAG.Where the paper says it
Where the paper says it
Where the paper says it
Future Directions
In our experience thus far, NPOD converges at a faster rate when compared with NPAG for a larger population with a given model and prior. However, it is not a given that NPOD will always outperform NPAG. p. 9 However, the optimization step of NPOD, which is guided by the D-function value, is more
expensive than the adaptive grid in NPAG, and as such requires more time in each cycle. Because we expect
NPOD to always converge in fewer cycles than NPAG, we also expect that time to convergence will be at
worst similar, and at best shorter than NPAG, although this remains to be empirically demonstrated as we
gain experience with NPOD. While the original NPAG algorithm was written in Fortran, both the NPAG and NPOD
algorithm has been rewritten in Rust, a memory-safe and computationally efficient programming language. While the framework itself will be presented in a future work, both algorithms are available to use in the
development branch of the Pmetrics code repository [11]. In
the present implementation of NPOD we are using a modified version of the Sobol pseudo-random sequence
generator based on the work by Burley et al [2] with an improved hash by Kuo et al [8, 9]
Likelihood Calculation:
The next step is the calculation of the likelihood or the objective function. This is the most computationally
expensive step in the algorithm, as it is calculated by solving the differential equation representing the
pharmacokinetic model for each subject for each point in the initial grid. Our research group
has previously developed the non-parametric adaptive grid (NPAG) algorithm, which while accurate, explores
parameter space using an ad-hoc method to suggest new support points. In contrast, the non-parametric
optimal design (NPOD) algorithm uses a gradient approach to suggest new support points, which reduces
the amount of time spent evaluating non-relevant points and by this the overall number of cycles required
to reach convergence. Our research group
has previously developed the non-parametric adaptive grid (NPAG) algorithm, which while accurate, explores
parameter space using an ad-hoc method to suggest new support points. In contrast, the non-parametric
optimal design (NPOD) algorithm uses a gradient approach to suggest new support points, which reduces
the amount of time spent evaluating non-relevant points and by this the overall number of cycles required
to reach convergence.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Conclusion
We have developed and demonstrated a new algorithm, NPOD, for non-parametric parameter estimation with application to population pharmacokinetics. The algorithm was able to estimate the population joint parameter distribution as accurate as NPAG, but requires far fewer cycles to reach convergence. p. 0 Yamada[0000−0003−3512−9202]
Abstract This paper introduces a non-parametric estimation algorithm designed to effectively estimate the
joint distribution of model parameters with application to population pharmacokinetics. Our research group
has previously developed the non-parametric adaptive grid (NPAG) algorithm, which while accurate, explores
parameter space using an ad-hoc method to suggest new support points. 4 Discussion
We have developed and demonstrated an algorithm for non-parametric parameter estimation with application
to population pharmacokinetics. The algorithm relies on directional derivatives, which constitutes a new
approach to parameter estimation in pharmacometrics.Where the paper says it
Where the paper says it
Competing Interests
Michael N. Neely, Julian Otalvaro and Walter M. p. 0 A non-parametric optimal design algorithm for population
pharmacokinetics
Markus Hovd[0000−0002−6077−0934]
and
Alona Kryshchenko[0000−0002−5049−0293]
and
Michael N. Neely[0000−0002−1675−8276]
and
Julian Otalvaro[0000−0001−5202−1645]
and
Alan Schumitzky and
Walter M. Neely[0000−0002−1675−8276]
and
Julian Otalvaro[0000−0001−5202−1645]
and
Alan Schumitzky and
Walter M. Yamada[0000−0003−3512−9202]
Abstract This paper introduces a non-parametric estimation algorithm designed to effectively estimate the
joint distribution of model parameters with application to population pharmacokinetics. Our research group
has previously developed the non-parametric adaptive grid (NPAG) algorithm, which while accurate, explores
parameter space using an ad-hoc method to suggest new support points. In contrast, the non-parametric
optimal design (NPOD) algorithm uses a gradient approach to suggest new support points, which reduces
the amount of time spent evaluating non-relevant points and by this the overall number of cycles required
to reach convergence.Where the paper says it
Where the paper says it
Where the paper says it
References
The references listed support the claims made in the paper. The references include works on mixture models, optimal design theory, and specific software packages like Pmetrics. p. 3 The directional derivatives of the log-likelihood of 𝐹 in the direction of the atomic density function
centered at each support point is denoted as 𝐷𝛿𝜉
ℓ(𝐹). The idea originates in a text by Fedorov [4], which
covers 𝐷-optimal design theory. The design of the NPOD algorithm is summarized in the steps below. 1 Design principles and theoretical foundation
Traditionally, non-parametric maximum likelihood methods rely on iterative approaches such as the
expectation-maximization algorithm, which entails optimizing conditional expectation. Yamada
may also be initialized with the joint distribution obtained from previous searches, or other algorithms. In
the present implementation of NPOD we are using a modified version of the Sobol pseudo-random sequence
generator based on the work by Burley et al [2] with an improved hash by Kuo et al [8, 9]
Likelihood Calculation:
The next step is the calculation of the likelihood or the objective function. Neely, Julian Otalvaro, Alan Schumitzky, Walter M. Yamada
1 Introduction
Pharmacokinetic modeling and simulation have become a cornerstone in both drug development and therapeutic drug monitoring. The model includes an individual lag-term on the
input dose 𝐷, modeled as a delayed unit Dirac delta function 𝛿. 𝑑𝐴1
𝑑𝑡
= −𝐾𝑎 · 𝐴1 + 𝐷 ∗ 𝛿(𝑡 − 𝑡𝑙𝑎𝑔),
𝑑𝐴2
𝑑𝑡
= 𝐾𝑎 · 𝐴1 − 𝐾𝑒 · 𝐴2, 𝐶 =
𝐴2
𝑉𝑑
+ 𝜖 (10)
Dataset B was originally provided as one of the example datasets available in the Pmetrics package for R
[17].Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Adaptive parameter space exploration using directional derivatives can be integrated into existing non-parametric algorithms to significantly reduce cycle counts while maintaining accuracy, as NPOD
employs a directional derivative of the log-likelihood function using Nelder-Mead algorithm
to suggest new support points. This allows the system to focus its search on promising regions, potentially leading to convergence inalmost one twentieth the number of cycles for a high number of initial points
compared to NPAG. -
Implementation of a memory safe and computationally efficient framework in Rust can be used for both NPAG and NPOD algorithms, ensuring that computations are performed on modern hardware like an M3 Max processor with 128GB of RAM, which is crucial for handling
increasingly complex PK-PD models
and large datasets. -
The system can perform robust outlier detection by utilizing the property that
the maximum number of support points can at most be equal to the number of subjects,
achieved through QR decomposition toremove all the support points that are not in the orthonormal basis for the column space of Psi matrix
at each cycle. This ensuresthe detection of outliers is an important aspect in population pharmacokinetics.
-
The algorithm can dynamically tune its search strategy by adjusting hyperparameters, specifically the number of steps in Nelder-Mead optimization t, which can be
fine-tuned to optimize the performance of the algorithm,
balancing computational cost and optimization effectiveness.
Abstract
This paper introduces a non-parametric estimation algorithm designed to effectively estimate the joint distribution of model parameters with application to population pharmacokinetics. Our research group has previously developed the non-parametric adaptive grid (NPAG) algorithm, which while accurate, explores parameter space using an ad-hoc method to suggest new support points. In contrast, the non-parametric optimal design (NPOD) algorithm uses a gradient approach to suggest new support points, which reduces the amount of time spent evaluating non-relevant points and by this the overall number of cycles required to reach convergence. In this paper, we demonstrate that the NPOD algorithm achieves similar solutions to NPAG across two datasets, while being significantly more efficient in both the number of cycles required and overall runtime. Given the importance of developing robust and efficient algorithms for determining drug doses quickly in pharmacokinetics, the NPOD algorithm represents a valuable advancement in non-parametric modeling. Further analysis is needed to determine which algorithm performs better under specific conditions.
Related papers
- Learning Robust Treatment Rules for Censored Data
- Neural Estimation of Summary Statistics for Simulation-Based Inference with Non-Asymptotic Guarantees
- Spectral divide-and-conquer MCMC for long stationary time series
- Improving the Efficiency of Subgroup Analysis in Randomized Controlled Trials with TMLE
- Personalized Federated Vector Autoregression with Personalization Diversity
- Doubly Robust and Efficient Calibration of Prediction Sets for Right-Censored Time-to-Event Outcomes