back to top
Home NHSJS Reports Simulation-Based Comparison of Sequential Optimization Methods for Personalized taVNS Parameter Selection

Simulation-Based Comparison of Sequential Optimization Methods for Personalized taVNS Parameter Selection

0
17

Abstract      

Transcutaneous auricular vagal nerve stimulation (taVNS) is a cutting-edge form of neuromodulation that could provide more equitable access to vagal nerve stimulation for lower-income households or people at high risk of surgical complications. Optimizing taVNS parameters, such as amplitude and frequency, is difficult due to each person’s unique physiology, however. Applying machine learning to tailor VNS parameters to each unique subject could improve this issue. In this fully synthetic experiment, Bayesian optimization algorithms Bayesian Optimization Gaussian Process, Tree-structured Parzen Estimator, Sequential Model-Based Algorithm Configuration, and a random search control were performed against simulated patients to determine the most effective machine learning optimizer for taVNS in the simulated experiment. A Friedman and paired permutation test was conducted to judge whether there was a statistical difference in effectiveness between the 4 optimizers. Only the Friedman test indicated a statistical difference (p = .049); the paired permutation test failed to find a statistical difference (p = .137). A post-hoc test showed no pair of optimizers had statistically significant differences in effectiveness after Holm correction. This simulation was purely synthetic, with the patient response being motivated by taVNS experiments, but not based empirically on them. Running a Bayesian optimizer-taVNS simulation on empirical data, or comparing Bayesian optimizers of taVNS in real life, is needed to see whether this simulation’s results generalize to real life. In the future, Bayesian optimizers and/or other forms of machine learning should be explored with taVNS to maximize taVNS effectiveness for each unique individual.

Keywords: Vagal Nerve Stimulation, Bayesian Optimization, Neuromodulation, Neurology, Tree-structured Parzen Estimator, Sequential Model-based Algorithm Configuration.

Introduction

Vagal Nerve Stimulation (VNS) is a type of neuromodulation of the vagus nerve. It stimulates the Locus Coeruleus LC and Nucleus Tractus Solitarius through the brainstem1. VNS treatment has been explored for various diseases, including depression, traumatic brain damage, Alzheimer’s disease, and epilepsy2. VNS has ameliorative effects on brain diseases, one possible pathway being through neurotransmitters. The LC is responsible for norepinephrine (NE) production throughout most of the brain and shows upregulated cell activation via the nucleus tractus solitarius during invasive VNS (iVNS). iVNS is invasive due to its requirement of an expensive surgery to implant the neuromodulating device in the neck. This release of NE can improve symptoms in diseases by encouraging brain plasticity and decreasing neuroinflammation. Via stimulation of the medial septum, the neurotransmitter acetylcholine may also be released in VNS, binding to nicotinic receptors known as α7nAChR in astrocytes and another glial cell called microglia, possibly reducing neuroinflammation through this cholinergic anti-inflammatory pathway. VNS can also regulate other neurotransmitters such as dopamine, serotonin, and GABA. Modulation of these neurotransmitters can explain its positive effects for neurological conditions1.

VNS once required invasive surgery to implant the neuromodulation device onto the vagus nerve, thus being considered iVNS. Due to the costs and risks of the VNS method, noninvasive forms of VNS, one being Transcutaneous Auricular Vagal Nerve Stimulation (taVNS), are being investigated for use in diseases that iVNS treats, such as epilepsy, and other diseases, such as AD3.  taVNS has been shown to act on common pathways in the NTS with Invasive VNS (iVNS) and evoke similar cerebral activation patterns as iVNS. Additionally, taVNS is known for its low cost and portability, with a 2026 systematic review reviewing taVNS application for major depressive disorder mentioning taVNS’s similar effectiveness with iVNS in mental health treatment, and its advantages of non-invasiveness and low economic burden compared to iVNS4. taVNS is also under exploration for use in neurodegenerative conditions such as AD, as those patients are often older and have more comorbidities, increasing the risk of complications in iVNS implantation surgeries5.

VNS effectiveness can be changed through altering VNS parameters such as intensity, frequency, pulse width, and duty cycle6. Intensity determines the amount of current that goes through the device, frequency determines the electrical pulses per second, pulse width determines the length of time electricity is passed through per pulse, and duty cycle is the percentage of time the VNS is on compared to the total stimulation time7.

Finding the best parameters for taVNS is a troubling task for clinicians, however. A wide range of taVNS parameters, differing pain thresholds, and different physiological responses to the parameters based on factors such as age, sex, ear tissue anatomy, and time of day could possibly create difficulties in finding optimal taVNS parameters for brain activation in a patient6,8,9. There are also significant differences in vagus nerve fiber morphology from person to person, providing another possible reason for differing clinical reactions to VNS10. No consensus on optimal taVNS parameters exists11, and a review article cites the need for extensive testing of different taVNS parameters in AD12. A way to adapt taVNS treatment to function optimally based on a subject’s unique physiology would be helpful, and machine learning presents itself as a possible solution. Machine learning optimization could tune taVNS parameters, optimizing them to give the most effect for a patient. A study has demonstrated the feasibility of applying machine learning optimization in VNS, utilizing Bayesian Optimization Gaussian Process (BOGP) for invasive VNS in porcine subjects, showing Bayesian optimizers are well suited for supporting iVNS parameter optimization13.

Few studies have looked at the application of machine learning algorithms to optimize taVNS parameters. A systematic literature review was done to confirm this potential literature gap.

Search Strategy

A systematic review was conducted in the PubMed, IEEE, and Web of Science databases to identify research articles comparing the relative effectiveness of different forms of Bayesian optimization in taVNS.

The following search terms were entered into PubMed, IEEE, and Web of Science: (“transcutaneous auricular vagus nerve stimulation” OR “taVNS” OR “vagus nerve stimulation” OR “VNS”) AND (“Bayesian optimization” OR “sequential model-based” OR “SMAC” OR “Tree-structured Parzen” OR “TPE” OR “hyperparameter optimization” OR “machine learning parameter tuning” OR “optimization algorithm parameter tuning”).

  This search query was confirmed to function in the 3 databases PubMed, IEEE, and Web of Science. The search was conducted in September 2026.

Inclusion Criteria

Articles were included if they:

  1. Mentioned taVNS and compared optimizers of all forms to the VNS or taVNS parameter tuning process.

Articles were excluded if they:

  1. Were not in English
  2. Did not reference the medical procedure of VNS
  3. Did not compare the efficiency of parameter tuning optimizers.

9 articles were found in total: PubMed (n = 3), IEEE (n = 1), Web of Science (n = 5). 2 duplicate articles were then removed before screening. During screening, 3 articles were excluded based on title and abstract irrelevance. 4 articles were reviewed in full text, and no articles reviewed the application or comparison of Bayesian optimizers to taVNS procedures. Only 1 article was found to compare Bayesian Optimization Gaussian Process (BOGP) with the control parameter tuning optimizer, random search, in iVNS, providing adjacent evidence. This review highlights a literature gap on finding the comparative effectiveness of Bayesian optimizers in optimizing taVNS parameters.

Heart Rate Variability and Pupillometry as VNS metrics

Heart rate variability (HRV) and pupillometry are noninvasive measures of the autonomic nervous system and brain arousal, both of which can be affected indirectly under taVNS stimulation. They have thus been used as indirect indicators of taVNS effectiveness, with a study using both metrics concurrently when experimenting on taVNS’s effect on working memory14, demonstrating the feasibility of using both metrics at once to measure taVNS effect. For this simulation, HRV and pupillometry are simply used as simulated response components.

HRV functions as a metric of autonomic nervous system function, which is made up of the sympathetic and parasympathetic nervous systems. This metric measures millisecond changes in time in heartbeat fluctuations. Because taVNS has an effect on the autonomic nervous system, studies have used HRV measurements to indirectly measure taVNS effectiveness. A 2014 study conducted on 48 participants found that taVNS significantly increased HRV, signaling a decrease in sympathetic nervous system activity15. However, a 2021 meta-analysis of 16 articles determining whether taVNS has an effect on vagally mediated HRV found stronger evidence for the null hypothesis16. HRV is not a conclusive indicator of taVNS effectiveness and shows wide metric variability between studies.

Pupillometry is a measure of neurological arousal and of Locus Coeruleus (LC) NE production, thus acting as an alternative but indirect proxy for measuring NE levels, as there is a lack of noninvasive devices that directly measure NE in human brains. An increase in LC neural firing through iVNS has been shown to increase pupil dilation in rats. A study found that taVNS induced significant pupil dilation in an experiment done among 24 healthy males17. In another study, iVNS was shown to increase pupil dilation in humans18, with the pupillometry response in humans following an inverted U response based on VNS amplitude. This study also demonstrated the inverted-U pupillometry response closely aligned with a Gaussian or a sigmoid function distribution.

Similar to HRV, there are studies that give conflicting evidence of pupillometry as a reliable metric. A study stating pupillometry as likely the most reliable noninvasive marker of LC-NE activity found null results with pupillometry when subjects were treated with taVNS19. A meta-analysis of 18 articles determining if taVNS alters pupil dilation found null results with conventional taVNS protocols, and only found evidence for pupil dilation with pulsed taVNS20. A large 2026 experiment with 94 healthy participants found no increased pupil dilation effect by pulsed taVNS when the sham device mimicked the sensation of the real taVNS device21.

Both HRV and pupillometry have been acknowledged as promising noninvasive indicators of taVNS effectiveness in studies, but demonstrate both positive and null results. They are under scrutiny for this demonstrably mixed effectiveness. They are noninvasive and relatively quick metrics that might theoretically suit the application of taVNS hyperparameter tuning, which would require multiple taVNS readings in a real-life given patient to adapt to their physiology. They aren’t proven, direct indicators of taVNS’s cognitive efficacy, but they’ll still be used as simulated objective components for the sake of this experiment.

Machine Learning Optimization Algorithm Types

Bayesian Optimization (BO), also termed sequential model-based optimization (SMBO), is a family of machine learning algorithms that are able to “learn” from previous data points. Simply, when modeling a real-life function such as a real person’s pupillometry response to taVNS parameters, the algorithm creates a simplified function, or the surrogate model, and attempts to optimize or minimize a value with the finite amount of data points it is allowed to collect. A Bayesian optimizer consists of 2 parts: a statistical model that calculates the uncertainty of the values on a real-life function based on known data points, and an acquisition function, a function that decides the next point to sample in the real-life function, or objective function, to gather data or improve the modeled function. This acquisition function balances exploration vs exploitation. It chooses points on the real-life function, or objective function, that will likely maximize the surrogate function’s value, or decrease the uncertainty of the objective function. In general, accuracy of the statistical model is more important than the acquisition function, as an inaccurate model of the objective function cannot be made up for with better decisions on prioritizing exploration vs exploitation via the acquisition function22.

There are three main subtypes of SMBO that will be tested in this experiment: BOGP optimization, tree-structured parzen estimator (TPE) optimization, and sequential model-based algorithm configuration (SMAC) optimization. These Bayesian optimizers differ in the ways they construct their statistical model and also slightly differ in their acquisition functions, and can thus be stronger or weaker in different optimization scenarios.

Bayesian Optimization Gaussian Process

In Bayesian Optimization Gaussian Process (BOGP), every point on the surrogate model has 2 values: the predicted value and its predicted variance/uncertainty. When calculating the statistical map, the values far from tested values will have high uncertainty, while values next to a tested value will have very low uncertainty. As the optimizer tests more numbers, the statistical model also fits a value that controls the scale through which this certainty will decrease given the point’s distance from an established point. For example, if you have a very unpredictable curve, a point far out will probably have extremely high variance, while a slow-changing curve will not see as much variance in a point the same distance away. This allows for an adjustment in variance values for points on really sensitive objective functions, or less variable objective functions.

To calculate the value of each point and its uncertainty, BOGP predominantly uses a kernel known as Matern. This kernel differs from the other optimizers in that it is unable to handle categorical variables. As stated above, it attempts to assign a predicted value along with an uncertainty value to every point in the objective function through mathematics. Thus, variables like “blue” and “red” cannot be put into BOGP. As such, BOGP is restricted to quantitative optimization, unlike TPE and SMAC, which can handle categorical optimization.

BOGP’s acquisition function, or the function selecting the next point on an objective function based on the statistical graph of the objective function, is usually a function called Expected Improvement. This function, when trying to find the target objective value, the best reachable value in the objective function, factors in the size of the gain that may occur, along with the probability that the gain will occur. This allows it to balance trying to capitalize on, say, the local max in a small portion of the graph with experimenting with other areas on the objective function to find the global max23.

BOGP has already been used as a way to optimize iVNS parameters in porcine subjects as previously mentioned, with the study stating it converges on optimal stimulation of the nerves with far fewer tests than would have been the alternate optimization method random search, reducing potential side effects and demonstrating the possibility of optimization algorithm implementation into VNS13.

Tree-Structured Parzen Estimator

Tree-Structured Parzen Estimator (TPE) is another form of Bayesian optimization. It shares the acquisition model Expected Improvement with BOGP, but differs in the statistical model it constructs.

Imagine you put 3 continuous variables into an objective function, and it gives an output variable, which you want to optimize. TPE separates the input parameters into a “good” function map and an “average” function map. Parameters are considered good if they’re within the top n% of output values of the function, commonly used numbers being 15% or 25%, and considered mediocre if they are not. If the parameters are considered good, normal distributions with their means at each input variable are added to a “good” map line created for each variable. The good map line for each variable is denoted by L(x1), L(x2) and et cetera.

If the 3 variables returned a mediocre output value, not within the 15% or 25%, normal distributions with each mean at each input variable are put onto each respective “mediocre” map line that was created for each variable. This mediocre function is denoted by G(x1), G(x2), and et cetera, for each map line.

L(x1), L(x2), and any other variable’s good map line are all multiplied together to create L(x), as well as all the mediocre G(x) map lines. This creates a statistical map of good parameter values and bad parameter values.

The fraction L(x) / G(x) is then used as the acquisition function for TPE to predict the next location to test. The Expected Improvement function from BOGP is similar to TPE’s acquisition function, as maximizing the TPE ratio is equivalent to maximizing the expected improvement24. 

Sequential Model-based Algorithm Configuration

            Sequential Model-based Algorithm Configuration (SMAC) uses multiple decision makers, or trees, which have access to different subsets of trials to make its statistical model. SMAC first gets data from a few trials. Then, it assigns random subsets of those trials to each tree with replacement, there being usually 10 trees in total. For example, if 5 trials have been run, tree 1 may be trained with trial 1, 2, 2, 4, and 5. Tree 2 could be trained with trial 1, 1, 3, 5, 5. In each trial, a series of conditional inequalities are made to separate those trials into groups with the least variance between their output scores. For example, Tree 1 got output scores 90, 92, 92, 96, and 21 for its respective assigned trials. Let’s say the first 4 trials had an amplitude of 2.0, but the 5th had an amplitude of 1.0. The tree would create a condition checking whether the amplitude is more than 1.5. If so, it’d assign the average of the 4 outputs. If not, it’d assign the average of the 2nd group, which is simply 21 because the 5th trial stands alone.

Each tree creates its own conditions through the trials it is assigned. Through this, the 10 trees can act similarly to BOGP, determining the predicted value and variance of each point on the objective function through a combined average decision on each point based on the output that each tree predicts. Once a new trial is conducted, random trials with replacement are assigned to every tree again, and the statistical map is recreated25.

This explains SMAC’s method of constructing a statistical model. For its acquisition function, it is able to utilize Expected Improvement, but usually utilizes Log Expected Improvement. Log expected improvement is preferred over Expected Improvement in SMAC because when testing a far-off unknown value, say a really low amplitude, many trees may default to their lowest inequality. This may make the variance extremely low, which could thus cause an underflow error when calculating the Z score of the expected improvement function, which is assigned to each point based on its expected magnitude of improvement and amount of uncertainty. Log expected error allows the Z score not to underflow to 0, but to remain as a very small number26.

BOGP tends to have higher efficacy in low-parameter and continuous parameter environments. TPE tends to have higher effectiveness in terms of speed, but struggles to capture parameter interdependence, and requires many startup evaluations. SMAC is stronger with categorical variables than BOGP, but may be less effective in continuous parameter environments due to its use of piecewise approximations.

A simulation will be conducted to determine the Bayesian optimizer that responds most effectively to the response surface families it is put through.

Methodology

Study Design

This is a fully synthetic experiment. The simulation wasn’t built directly modeling empirical clinical taVNS data. Instead, due to a lack of standardized taVNS procedures and consistent measurement metrics, published taVNS parameter ranges and clinical taVNS response patterns were used to simply motivate the search bounds and response surface family creation. Also, once again, for a reminder, HRV and pupillometry scores are only coded simulation objectives.

Response-Surface Model

The patient response function takes in 3 parameters: Amplitude, Frequency, and Pulse-width.

Studies on rats have shown amplitude parameters may create an inverted U shape with regard to the effectiveness of VNS27,28. VNS possibly demonstrates this shape of effectiveness drop-off with regard to frequency and pulse-width also, in a study done on healthy adults8. This shape isn’t clinically confirmed, due to a lack of studies on taVNS distributions, but will be implemented into the patient response function, as the inverted U curve theory is still a recurring theme in VNS scientific literature.

Hx,μ,L,R=11+(x−μsx)4−(1)\begin{equation} H_{x, \mu, L, R} = \frac{1}{1 + \left(\frac{x – \mu}{s_x}\right)^4} \hspace{1em} – \hspace{1em} (1) \end{equation}
sx=Lwhen x<μ,sx=Rwhen x≥μ.\begin{equation} s_x = L \quad \text{when } x < \mu, \quad s_x = R \quad \text{when } x \ge \mu. \end{equation}
Aa=50Ha;μpup,Lpup,Rpup+50Ha;μHRV,LHRV,RHRV−(2)\begin{equation} A_a = 50 H_{a; \mu_{\text{pup}}, L_{\text{pup}}, R_{\text{pup}}} + 50 H_{a; \mu_{\text{HRV}}, L_{\text{HRV}}, R_{\text{HRV}}} \hspace{1em} – \hspace{1em} (2) \end{equation}
Qa,f,w=Hf;fr,a,Lf,Rf⋅Hw;wr,a,Lw,RwQ_{a,f,w} = H_{f; f_{r,a}, L_f, R_f} \cdot H_{w; w_{r,a}, L_w, R_w}
Ja,f,wNF=Aa⋅Qa,f,wJa,f,wobs=Ja,f,wNF+ϵ−(3)\begin{equation} J^{\text{NF}}_{a,f,w} = A_a \cdot Q_{a,f,w} \quad \quad J^{\text{obs}}_{a,f,w} = J^{\text{NF}}_{a,f,w} + \epsilon \hspace{1em} – \hspace{1em} (3) \end{equation}

This shows the functions describing the simulated patient response. In 1), the asymmetric hill function H takes in the input parameter x, the optimal parameter value µ, and a left and right scale. When the input score is less than the optimum, the function uses the left scale. When the input score is more than the optimum, the function uses the right scale. This allows for an asymmetric hill function response. At 2), function A represents the amplitude, which is made up of the equally weighted sum of pupillometry and HRV. The amplitude score for pupillometry and HRV is calculated using the asymmetric Hill function effectiveness drop-off for pupillometry and HRV, and adding them together. Q(a,f,w) is the max value of the product of the K number of simulated peaks, representing the multiplied frequency and pulse-width score. f represents the frequency, and w represents the pulse width. At 3), the A and Q functions are multiplied together to create the noise-free function J. J obs represents the observed values by the optimizers, and epsilon represents the random noise score added to the noise-free function J to make J obs.

As demonstrated, the pupillometry and HRV metrics each have a weight of 0.5. The figure demonstrates the whole method by which the calculated score, and therefore simple regret, is calculated. Using the max possible score along with simple regret, this allows for the creation of normalized regret, which allows for better comparison of different optimizers because simple regret is scaled to the max possible score the optimizer could actually reach.

There is also a unique surface response family, known as the unique parameter interaction family. The 2 optimal frequency and pulse-width locations change location depending on the amplitude parameter in that family. Their movement is ensured in this way not to go out of the search boundaries: If the optimal frequency is greater than or equal to 25 Hz, then the optimal frequency decreases by the raw guessed amplitude. If the optimal frequency is less than 25 Hz, then the optimal frequency increases by the raw guessed amplitude. For pulse width, if the optimal pulse width is greater than or equal to 350 µs, the optimal width decreases by the raw guessed amplitude multiplied by 20. If the optimal pulse width is less than 350 µs, then the optimal pulse width increases by the raw guessed amplitude multiplied by 20.

Simulated Profile Generation

FamilyOptimaAmplitude Rise/Fall scalesFrequency rise/fall scalesPulse-width rise/fall scales.
Quick_rise_slow_fall (Considered baseline)2Pup: U(0.25,0.35)/U(0.55,0.75); HRV: U(0.2, 0.3) / U(0.45,0.65)U(1,2)/U(5,6) HzU(20,50) / U(125, 175) µseconds
Symmetric2Pup: 0.25; HRV: 0.25 mA1.5 / 1.5 Hz75 / 75 µseconds
slow_rise_quick_fall2Pup: U(0.55, 0.75) / U(0.25,0.35); HRV: U(0.45, 0.65) / U(0.2,0.3)U(5,6) / U(1,2) HzU(125, 175) / U(20,50)
3 Optima3Same as quick_rise_slow_fallSame as quick_rise_slow_fallSame as quick_rise_slow_fall
broad_optima2Quick_rise_slow_fall amplitude falloffs, multiplied by 2Quick_rise_slow_fall frequency falloffs, multiplied by 2Quick_rise_slow_fall pulse-width falloffs, multiplied by 2
sharp_optima2Quick_rise_slow_fall amplitude falloffs, multiplied by 0.4Quick_rise_slow_fall frequency falloffs, multiplied by 0.4Quick_rise_slow_fall pulse-width falloffs, multiplied by 0.4
heteroscedastic noise, heavy-tailed noise, and unique-interaction families2Same as quick_rise_slow_fallSame as quick_rise_slow_fallSame as quick_rise_slow_fall
Table 1 | This table describes the scales of the asymmetric hill functions of the different optimizers. U stands for uniform, a randomly chosen value between the 2 numbers based on the patient and machine start seed.

Random Noise Score

FamilyNoise Distribution
HeteroscedasticAs the amplitude inputted as a parameter increases, the standard deviation of the noise added to the noise-free function increases. The standard deviation matches the amplitude number directly, with an input of 5.0 mA setting a 5-point standard deviation.
Heavy-tailed noiseThe noise added to the score follows a Student’s t distribution with 3 degrees of freedom, multiplied by 2.
Other FamiliesA normal distribution with a mean of 0 and a standard deviation of 2 is used to create the random score. That score is then added on top of the noise-free function like the others as epsilon in the graph from Figure 1.
Table 2 | Table describing epsilon from Figure 1. Demonstrates how the random noise is added depending on the optimizer family.

It should be noted in advance that truncation rules were not added to this simulation. Thus, adding the noise distributions present in Table 2 on top of the noise-free function can possibly produce scores outside of the 0 to 100 range. This will be mentioned in the discussion.

Optimizer Configurations

A computational simulation based on clinical taVNS parameter boundaries and reported taVNS effectiveness function shapes was created for this experiment. Here are the models and variables for creating this simulation.

Libraries used:

  • Python: 3.13
  • NumPy: 2.1.3
  • SciPy: 1.16.3
  • Scikit-learn: 1.6.1

Optimizer search bounds: Amplitude: [0.5, 5.0] mA; Frequency: [1.0,50.0] Hz; Pulse width [50, 600] µseconds; These search boundaries are modeled after an international review article on taVNS, which included taVNS study parameter data, and an experiment that tested many frequency and pulse-width combinations9,29.

Trials/queries per optimizer: 40; Permutations per inferential test: 20000; Bootstrap replicates per confidence interval: 10000; Regret tolerance: 0.05; Analysis random seed: 10001

Optimizer Presets

OptimizerConfig
BOGPBayesian-optimization version 3.3.0; Expected Improvement with xi value of 0.01; Initial random sample of 4 points; Iterations = 36; Random state = profile seed; Matérn kernel with length scale 1.0, nu = 2.5; GP alpha = 1 * 10^-6; n_restarts_optimizer = 5; Optimizer = fmin_l_bfgs_b; Duplicate points disallowed.
TPEHyperopt version 0.3.0; Uniform distributions across all parameters; Prior weight 1.0; Startup jobs = 20; Expected Improvement with candidates = 24; Gamma = 0.25 (Defines “Good/Bad” division as has been mentioned); np.random.default_rng(profile_seed); return_argmin=True; max_queue_len = 1;
SMACSMAC version 2.4.1; Config Space ver. 1.2.2; Iterations = num_simulation_trials times per patient; Random forest model with 10 trees; Feature ratio of 1.0; Minimum split of 2; Minimum leaf of 1; Maximum depth of 1048576; Bootstrapping enabled; (The default) Log Expected Improvement with xi value of 0; Sobol initial design with n_configs = None; 10 configurations per hyperparameter, but max ratio of 0.25; Random design probability of 0.2; Intensifier: max_config_calls = 3, max_incumbents = 10;
Config selector: Retrain_after = 8, retries = 16; Deterministic = false; 1 worker;
Random SearchIndependent Uniform selections per parameter per trial, with replacement. Random number generation = np.random.default_rng(profile_seed) Runs num_simulation_trials times per patient.
Table 3 | Settings, such as initializations, priors, and acquisition functions to configure each Bayesian optimizer.

In Table 3, these settings are usually the default settings that these optimizers are set to. No hyperparameter tuning was performed. Settings not explicitly stated here use the default settings from packages.

Other Experimental Variables

VariableQuantityPurpose
patient_and_machine_start_seed10000Used as the starting seed for all trials.
1st optimum frequency & pulse-width10 + U(-2,2) Hz, 500 + U(-25,25) µsecondsGenerates a patient’s first optimal frequency and pulse-width combination.
2nd optimum frequency & pulse-width25 + U(-2,2) Hz, 100 + U(-25,25) µsecondsGenerates a patient’s second optimal frequency and pulse-width combination.
3rd optimum frequency & pulse-widthU(5,50) Hz, U(150,450) µsecondsGenerates a 3rd combination for the patient, only if from the 3 optima family.
Hill exponent4.0Dictates the steepness of the hill function falloffs, with lower numbers being less steep.
Ideal pupillometry amplitudeNormal(mean = 4.4, standard deviation = 0.15) mA.Using a normal distribution, chooses a random amplitude number to be the most effective.
Ideal heart rate variability amplitudeNormal(mean = 4.0, standard deviation = 0.15) mAChooses an amplitude number that would make HRV metric respond most effectively for a given patient.
Table 4 | Other variables that were set in order to make the simulation function. 

In this simulation, the statistical tests will importantly use seed block pairing between the optimizers’ results. Each optimizer will be run through 9 families with 40 profiles per family. Directly treating the 360 profiles from an optimizer as independent and therefore conducting paired permutation tests or Friedman tests with each 360-profile set would be erroneous due to the shared profile-generation seeds between each of the 40 profiles. Doing so would artificially lower the p-value. Thus, seed block pairing was done.

Essentially, the test function starts with a seed of 10000. Then, for all the patient profiles in the 9 response surface families that share that first seed, an optimizer’s mean normalized regret score across the nine patient profiles with that first seed is calculated. We do this for every seed.

Then, we compare the four optimizers across the 40 seed blocks using a Friedman omnibus test and a paired permutation test; pairwise comparisons between the optimizers are then applied with seed-level sign-flip tests and Holm correction. The sample size is also thus considered 40 seed blocks, and not 360 independent profiles. All profiles related by the same patient and machine start seed are paired.

The simulation code can be accessed here: https://github.com/BurningAesthetics/Simulation-Based-Comparison-of-Sequential-Optimization-Methods-for-taVNS-Parameter-Selection

Results

The Bayesian Optimizers demonstrated differing responses based on response families. In Tables 5 and 6, the tables demonstrate the effectiveness, standard deviation, and computation time of the quick rise slow fall (baseline), symmetric, slow rise quick fall, 3 optima, and broad optima families. Interestingly, the broad optima showed lower scores than the mean/median of the other families, likely because broader, larger responses of the family made parameter selection easier. Conversely, in Table 6, the sharp peaks family had relatively consistently high normalized regret scores, highlighting a difficulty in searching for the optimum values. This difficulty was also reflected in the symmetric family.

FamilyOptimization MethodMean Normalized Regret (%)Median Normalized Regret (%)SD Normalized Regret (%)Mean Simple RegretProbability Regret <= ToleranceMean Computational Time
Quick_rise_slow_fall (Baseline)BOGP45.8837.1237.3442.960.15010.88
 TPE44.4241.7729.5242.040.1000.14
 SMAC58.2652.9236.9153.630.0007.40
 Random Search64.6767.1829.8260.670.0250.01
SymmetricBOGP76.3299.9235.4760.790.0756.18
 TPE82.8510029.1964.010.0000.16
 SMAC78.3498.0631.0460.810.0508.09
 Random Search80.9190.9323.5363.060.0000.01
Slow_rise_quick_fallBOGP57.5871.4338.9355.820.2507.31
 TPE59.7459.5529.3557.690.0250.17
 SMAC65.7884.4135.3762.380.0258.20
 Random Search56.5853.2428.1553.180.0250.01
3_optimaBOGP41.1329.7535.2637.920.27514.73
 TPE41.4141.7225.0037.650.0750.17
 SMAC49.5045.0434.2345.410.0757.12
 Random Search50.9054.6327.7746.820.0000.01
broad_optimaBOGP24.9815.9523.7324.660.25022.68
 TPE9.047.468.298.940.3750.17
 SMAC19.3911.1920.7318.90.3006.82
 Random Search22.1317.4117.7621.830.2000.01
Table 5 | Statistics of the optimizers’ performance across the simulated response-surface families. The table shows mean and median normalized regret, standard deviation, mean simple regret, probability of regret within the prespecified tolerance, and mean computational time. Lower regret values mean better optimizer performance, and the probability of regret utilizes the normalized regret. Interestingly, TPE had a much lower standard deviation and mean normalized regret when performing in the broad optima family than the other families.
FamilyOptimization methodMean Normalized Regret (%)Median Normalized Regret (%)SD Normalized Regret (%)Mean Simple RegretProbability Regret <= ToleranceMean Computational Time (s)
sharp_optimaBOGP87.4710023.0958.1105.63
 TPE96.981008.7163.3600.17
 SMAC91.0810018.5359.1708.96
 Random Search93.0510016.6260.9900.01
heteroscedastic_noiseBOGP47.1242.5137.2744.360.22511.20
 TPE48.0935.8933.9544.400.1000.19
 SMAC59.1055.2434.8554.750.0508.53
 Random Search65.3367.1830.4861.320.0250.01
heavy_tailed_noiseBOGP47.2844.5936.8144.510.17515.72
 TPE56.4062.2431.4052.560.0250.19
 SMAC61.7562.2436.0457.180.07510.28
 Random Search65.0467.1830.2961.030.0250.01
unique_parameter_interactionBOGP53.9961.5031.5250.310.10011.92
 TPE31.7627.9224.1329.940.1250.16
 SMAC61.0666.5033.0057.070.0758.41
 Random Search53.8560.1430.5049.970.0000.01
Table 6 | Continued summary including the optimizer methods and the sharp optima, heteroscedastic noise, heavy-tailed noise, and unique parameter interaction families. Between the heteroscedastic and heavy-tailed noise families, one optimizer interestingly did not come out as most effective regarding handling noise. TPE demonstrated a lower median normalized regret with the heteroscedastic noise, while BOGP did so with the heavy-tailed noise family.

Mean Normalized Regret Matrix

Iteration BudgetSurface FamilyBayesian OptimizationTPE OptimizationSMAC OptimizationRandom Search
403optima41.1341.4149.5050.90
40broad_optima24.989.0419.3922.13
40heavy_tailed_noise47.2856.4061.7565.04
40heteroscedastic_noise47.1248.0959.1065.33
40quick_rise_slow_fall45.8844.4258.2664.67
40sharp_optima87.4796.9891.0893.05
40slow_rise_quick_fall57.5859.7465.7856.58
40symmetric76.3282.8578.3480.91
40unique_parameter_interaction53.9931.7661.0653.85
Table 7 | A table describing the mean normalized regret score of each family with their Bayesian optimizer.

Through the data shown in Table 7, the best performances of the different optimization methods are demonstrated. The quick rise slow fall family, considered the baseline family, was best optimized by TPE optimization, with the mean normalized regret being 44.42. The symmetric family was best optimized by Bayesian optimization with a mean normalized regret of 76.32. Slow rise quick fall family was best optimized by random search with a mean normalized regret score of 56.58. The 3 optima family was best optimized by Bayesian optimization with a mean normalized score of 41.13. With a mean normalized score of 9.04, TPE best optimized the broad optima family. Bayesian optimization best optimized sharp optima with a mean normalized regret score of 87.47. Heteroscedastic noise was technically best optimized by BOGP optimization with a mean normalized regret score of 47.12, although TPE had a lower median normalized regret score of 35.89 compared to BOGP’s median normalized regret score of 42.51. Heavy-tailed noise was optimized best by Bayesian optimization, with a mean normalized regret score of 47.28. Finally, unique parameter interaction was best optimized by TPE optimization with a normalized regret score of 31.76.

Overall Descriptive Performance Across Simulated Families

MethodMean Regret (%)95% Seed-Block CI Low (%)95% Seed-Block CI High (%)Median Normalized Regret Across All 360 Profile Runs (%)Success Rate (Regret <= 5%)Mean Profile Rank (descriptive)Families Won (of N Families)Mean Seconds
Bayesian Optimization53.5347.1559.8760.480.172.42512.6
TPE Optimization52.348.0256.6145.690.092.2930.17
SMAC Optimization60.4753.9966.96650.072.6408.26
Random Search61.3855.9766.6264.350.032.6510.01
Table 8 | Optimizer performance statistics after 40 evaluations per profile across 9 families with 40 profiles per family, 360 profiles per optimizer. Demonstrates the mean normalized regrets of each of the optimizers, the 95% confidence interval of where their mean normalized regrets lie, probability of reaching a 5 or less normalized regret, how many families won, and mean seconds of computation time per synthetic patient.

In Table 8, 95% “seed block” confidence intervals are calculated. For context, the 95% seed-block CI is the confidence interval of the mean normalized regret of each of the 40 profile seeds for that optimizer. Remember, each profile seed consists of an average normalized regret of the 9 families that all use the same seed.

Global Paired Omnibus Tests

N Paired Seed BlocksN FamiliesFamily WeightingEndpointFriedman StatisticFriedman P ValueKendall’s WPaired Permutation Range StatisticPaired Permutation P Value
409EqualMean normalized noise-free regret across families7.860.0490.0660.0910.137
Table 9 | Only the Friedman test indicates a statistical difference in the effectiveness of optimization methods. The paired permutation p-value fails to find a statistical difference. Kendall’s W value of 0.066 indicates the difference in mean normalized regret is small. Thus, this omnibus test gives mixed results for a significant difference between the optimizers.

Global Paired Post-hoc tests with Holm correction

Method AMethod BN Paired Seed BlocksN FamiliesMean Regret Difference (A – B) (%)95% Seed-Block CI Low (%)95% Seed-Block CI High (%)Paired Effect Size dzProportion Method A Lower RegretPaired Sign-Flip P ValueHolm Adjusted P Value
Bayesian OptimizationTPE Optimization4091.23-5.337.510.060.480.711
Bayesian OptimizationSMAC Optimization409-6.95-16.723.08-0.210.60.190.56
Bayesian OptimizationRandom Search409-7.85-16.621.27-0.270.60.090.36
TPE OptimizationSMAC Optimization409-8.18-15.6-0.8-0.340.630.040.2
TPE OptimizationRandom Search409-9.08-15.41-2.15-0.420.730.010.06
SMAC OptimizationRandom Search409-0.9-9.117.46-0.030.50.831
Table 10 | This table shows the results of post hoc tests on the optimizer family pairs, with Holm correction applied. The mean normalized regret difference is shown, as well as the 95% seed-block bootstrap confidence intervals. Paired effect size in standard deviations, proportion of seed blocks where method A has lower regret, paired sign flip values, and Holm-adjusted p-values are also shown.

Optimizer Convergence Trajectory Summary

Surface FamilyQueryBOGPTPESMACRandom Search
3optima2077.3 [12.8, 99.3]69.0 [44.1, 90.0]81.1 [53.4, 99.6]69.0 [42.9, 93.1]
3optima4029.7 [4.8, 72.2]41.7 [22.8, 59.6]45.0 [18.0, 85.9]54.6 [29.2, 71.7]
broad_optima2038.8 [9.7, 73.2]28.7 [9.5, 52.7]33.4 [15.4, 63.0]48.0 [14.3, 57.1]
broad_optima4016.0 [5.3, 40.2]7.5 [2.8, 11.7]10.8 [2.8, 26.4]17.4 [6.5, 34.2]
heavy_tailed_noise2088.8 [28.4, 100.0]83.7 [61.4, 100.0]93.1 [53.0, 99.9]96.0 [61.7, 100.0]
heavy_tailed_noise4044.6 [7.0, 84.8]62.2 [32.0, 80.8]55.9 [30.9, 99.8]67.2 [43.0, 91.6]
heteroscedastic_noise2088.8 [27.8, 99.8]82.9 [61.4, 99.6]91.1 [58.7, 99.9]96.6 [61.7, 100.0]
heteroscedastic_noise4042.5 [8.2, 87.8]35.9 [19.6, 86.5]51.0 [28.7, 98.7]67.2 [44.2, 92.8]
quick_rise_slow_fall2088.0 [23.6, 100.0]79.1 [61.4, 97.2]93.1 [59.8, 99.9]94.9 [61.7, 100.0]
quick_rise_slow_fall4037.1 [8.4, 86.6]41.8 [21.8, 65.3]52.9 [21.8, 98.5]67.2 [44.2, 90.5]
sharp_optima20100.0 [100.0, 100.0]100.0 [100.0, 100.0]100.0 [100.0, 100.0]100.0 [100.0, 100.0]
sharp_optima40100.0 [88.9, 100.0]100.0 [100.0, 100.0]100.0 [88.3, 100.0]100.0 [96.8, 100.0]
slow_rise_quick_fall2093.8 [68.6, 98.4]92.5 [79.1, 99.9]93.4 [79.3, 100.0]81.2 [53.3, 99.9]
slow_rise_quick_fall4071.4 [5.8, 94.6]59.6 [39.0, 84.4]84.6 [34.1, 99.6]53.2 [36.0, 81.1]
symmetric20100.0 [89.4, 100.0]100.0 [96.0, 100.0]100.0 [84.9, 100.0]100.0 [92.4, 100.0]
symmetric4099.9 [65.8, 100.0]100.0 [80.6, 100.0]98.1 [66.1, 100.0]90.9 [66.0, 100.0]
unique_parameter_interaction2083.2 [43.0, 95.5]72.5 [46.2, 97.2]87.0 [46.4, 99.9]77.0 [49.1, 95.8]
unique_parameter_interaction4061.5 [25.9, 78.5]27.9 [12.9, 44.4]66.5 [35.7, 95.4]60.1 [26.6, 76.1]
Table 11 | A table summarizing the convergence trajectory of the normalized regrets of each optimizer at each family at trial/query 20 and 40. Values are in the form median [Q1, Q3] through the incumbent normalized regret %.

Throughout the surface-response families, it’s been noticed that TPE tends to have a lower standard deviation than BOGP, as shown in Tables 5 and 6. In fact, in all 9 optimizer families, BOGP had a higher normalized regret variability than random search. In specific instances, TPE performed surprisingly well, not only performing well in just the broad optima family as shown in Table 5. In Table 8, TPE’s average computation time per simulated patient profile is a surprising 0.17 seconds, while BOGP’s average computation time per simulated patient is 12.6 seconds. Although BOGP won more families in that table, BOGP’s median family profile regret is 60.48, while TPE’s median family profile regret is 45.69. Nonetheless, BOGP has a higher probability of reaching the prespecified tolerance, at 0.17, compared to TPE’s 0.09.

Discussion

BOGP performed the strongest among 5 of the optimizer families: namely, the 3 optima family, the heavy-tailed noise family, the sharp optima family, the symmetric family, and the heteroscedastic family. TPE performed strongest in 3 families: the broad optima family, the unique interaction family, and the quick rise slow fall family. Random search performed best in the slow rise quick fall family. However, first, the omnibus evidence was mixed: the Friedman test suggested a difference (p = .049), whereas the paired permutation test did not. After the pairwise comparison with Holm’s correction, no optimizers were considered statistically different from each other.

The optimizer results across the different response-surface families highlight seemingly poor optimization quality, due to their high normalized regret scores. On top of this, the high standard deviation of the optimizers in certain response surface families, such as the heteroscedastic family, also highlights consistency issues among the Bayesian optimizers. On the other hand, some optimizers performed exceptionally well in certain families, with TPE demonstrating surprising accuracy and small variability in finding the lowest normalized regret scores in the broad optima family.

There were some limitations in this study. For one, the noise added to the noise-free score was not truncated if the resulting value went over 100 or below 0. This thus could’ve created issues regarding the accuracy and realism of parameter selection in the optimizers.

Also, this purely synthetic simulation at times necessitated more arbitrarily chosen values due to the lack of empirical data in this field, such as the magnitude of the random noise applied to the calculated scores. Basing this function on more empirical data could prevent unhelpful results such as the sharp optima family, where each optimizer was mostly unable to get close to the prespecified normalized regret tolerance of 5 or below. This computational experiment’s findings would be made stronger if more data on taVNS effectiveness were available to guide the synthetic simulation. Another strong future idea to pursue is a computational project designed solely on empirical taVNS data. More empirical pupillometry and HRV data would create more accurate surface response families, and more accurate patient parameter variability and measurement noise.

Hyperparameter tuning, which was not implemented in this simulation, could’ve also improved optimizer effectiveness. For example, under TPE’s default configuration, 20 of the trials are simply random samples, while the remaining 20 queries actually apply the TPE optimizer. It would be interesting to see how changing that initial random sample hyperparameter in the optimizers could change their performance and convergence trajectories.

If this experiment were to be done again, a reexamination of ideal indirect taVNS effectiveness indicators would be done, as pupillometry and heart rate variability may show potential issues in their reliability. A search would be done for similarly designed taVNS clinical studies so their findings could help make the experiment empirically based.

Bayesian optimizer application should be explored in clinical trials of taVNS. Implementing these optimizers in taVNS may in the future exert a positive effect on the many diseases taVNS is under research for use in, such as depression and Alzheimer’s disease. With more empirical taVNS data, machine learning optimizers could possibly incorporate patterns of prior taVNS tuning to become even more efficient in optimizing taVNS.

Acknowledgements

Google Colab and AI were used in the making of the sequential model-based optimization experiment script. I thank Dr Ti’Air Riggins, PhD, for fostering my interest in neuroengineering, her support, and proofreading.

References

  1. Z. Chen, K. Liu. Mechanism and applications of vagus nerve stimulation. Current Issues in Molecular Biology. Vol. 47, pg. 122, 2025 https://doi.org/10.3390/cimb47020122 [↩] [↩]
  2. Y. Bu, A. Liang, B. U. Hoffman, D. M. Schiehser, O. Case, A. Simmons, R. Klaming, A. Gottfried‐Blackmore, R. K. Mittal, C. Puleo, H. Lim, I. Lerman. A review of vagus nerve stimulation for disease: comprehensive theory and evidence for mechanisms of action. Comprehensive Physiology. Vol. 16, pg. e70109, 2026 https://doi.org/10.1002/cph4.70109 [↩]
  3. R. Kamoga, G. Z. Rukundo, S. Kalungi, W. Adriko, G. Nakidde, C. Obua, J. Obongoloch, A. O. Ihunwo. Vagus nerve stimulation in dementia: a scoping review of clinical and pre-clinical studies. AIMS Neuroscience. Vol. 11, pg. 398–420, 2024 https://doi.org/10.3934/Neuroscience.2024024 [↩]
  4. J. Sun, D. Gao, J. Zhang, H. Liu, Y. Zhou, C. Ma, X. Zhang, S. Liu, J. Zhao, C. Hao, X. Xiao. Transcutaneous auricular vagus nerve stimulation for major depressive disorder: current evidence and future research directions. Frontiers in Psychiatry. Vol. 17, pg. 1788611, 2026 https://doi.org/10.3389/fpsyt.2026.1788611 [↩]
  5. M. Vargas-Caballero, H. Warming, R. Walker, C. Holmes, G. Cruickshank, B. Patel. Vagus nerve stimulation as a potential therapy in early alzheimer’s disease: a review. Frontiers in Human Neuroscience. Vol. 16, pg. 866434, 2022 https://doi.org/10.3389/fnhum.2022.866434 [↩]
  6. B. W. Badran, A. B. Yu, D. Adair, G. Mappin, W. H. DeVries, D. D. Jenkins, M. S. George, M. Bikson. Laboratory administration of transcutaneous auricular vagus nerve stimulation (tavns): technique, targeting, and considerations. Journal of Visualized Experiments: JoVE. 2019 https://doi.org/10.3791/58984 [↩] [↩]
  7. S. L. Thompson, G. H. O’Leary, C. W. Austelle, E. Gruber, A. T. Kahn, A. J. Manett, B. Short, B. W. Badran. A review of parameter settings for invasive and non-invasive vagus nerve stimulation (vns) applied in neurological and psychiatric disorders. Frontiers in Neuroscience. Vol. 15, pg. 709436, 2021 https://doi.org/10.3389/fnins.2021.709436 [↩]
  8. P. Atanackov, J. Peterlin, M. Derlink, U. Kovačič, N. Kejžar, F. F. Bajrović. The acute effects of varying frequency and pulse width of transcutaneous auricular vagus nerve stimulation on heart rate variability in healthy adults: a randomized crossover controlled trial. Biomedicines. Vol. 13, pg. 700, 2025 https://doi.org/10.3390/biomedicines13030700 [↩] [↩]
  9. A. D. Farmer, A. Strzelczyk, A. Finisguerra, A. V. Gourine, A. Gharabaghi, A. Hasan, A. M. Burger, A. M. Jaramillo, A. Mertens, A. Majid, B. Verkuil, B. W. Badran, C. Ventura-Bort, C. Gaul, C. Beste, C. M. Warren, D. S. Quintana, D. Hämmerer, E. Freri, E. Frangos, E. Tobaldini, E. Kaniusas, F. Rosenow, F. Capone, F. Panetsos, G. L. Ackland, G. Kaithwas, G. H. O’Leary, H. Genheimer, H. I. L. Jacobs, I. Van Diest, J. Schoenen, J. Redgrave, J. Fang, J. Deuchars, J. C. Széles, J. F. Thayer, K. More, K. Vonck, L. Steenbergen, L. C. Vianna, L. M. McTeague, M. Ludwig, M. G. Veldhuizen, M. De Couck, M. Casazza, M. Keute, M. Bikson, M. Andreatta, M. D’Agostini, M. Weymar, M. Betts, M. Prigge, M. Kaess, M. Roden, M. Thai, N. M. Schuster, N. Montano, N. Hansen, N. B. Kroemer, P. Rong, R. Fischer, R. H. Howland, R. Sclocco, R. Sellaro, R. G. Garcia, S. Bauer, S. Gancheva, S. Stavrakis, S. Kampusch, S. A. Deuchars, S. Wehner, S. Laborde, T. Usichenko, T. Polak, T. Zaehle, U. Borges, V. Teckentrup, V. K. Jandackova, V. Napadow, J. Koenig. International consensus based review and recommendations for minimum reporting standards in research on transcutaneous vagus nerve stimulation (version 2020). Frontiers in Human Neuroscience. Vol. 14, pg. 568051, 2021 https://doi.org/10.3389/fnhum.2020.568051 [↩] [↩]
  10. A. R. Upadhye, C. Kolluru, L. Druschel, L. Al Lababidi, S. S. Ahmad, D. M. Menendez, O. N. Buyukcelik, M. L. Settell, S. L. Blanz, M. W. Jenkins, D. L. Wilson, J. Zhang, C. Tatsuoka, W. M. Grill, N. A. Pelot, K. A. Ludwig, K. J. Gustafson, A. J. Shoffstall. Fascicles split or merge every ∼560 microns within the human cervical vagus nerve. Journal of Neural Engineering. Vol. 19, pg. 054001, 2022 https://doi.org/10.1088/1741-2552/ac9643 [↩]
  11. L. Wang, Y. Wang, Y. Wang, F. Wang, J. Zhang, S. Li, M. Wu, L. Li, P. Rong. Transcutaneous auricular vagus nerve stimulators: a review of past, present, and future devices. Expert Review of Medical Devices. Vol. 19, pg. 43–61, 2022 https://doi.org/10.1080/17434440.2022.2020095 [↩]
  12. L. Yan, H. Li, Y. Qian, J. Zhang, S. Cong, X. Zhang, L. Wu, Y. Wang, M. Wang, T. Yu. Transcutaneous vagus nerve stimulation: a new strategy for alzheimer’s disease intervention through the brain-gut-microbiota axis? Frontiers in Aging Neuroscience. Vol. 16, pg. 1334887, 2024 https://doi.org/10.3389/fnagi.2024.1334887 [↩]
  13. L. Wernisch, T. Edwards, A. Berthon, O. Tessier-Lariviere, E. Sarkans, M. Stoukidi, P. Fortier-Poisson, M. Pinkney, M. Thornton, C. Hanley, S. Lee, J. Jennings, B. Appleton, P. Garsed, B. Patterson, W. Buttinger, S. Gonshaw, M. Jakopec, S. Shunmugam, J. Mamen, A. Tukiainen, G. Lajoie, O. Armitage, E. Hewage. Online bayesian optimization of vagus nerve stimulation. Journal of Neural Engineering. Vol. 21, pg. 026019, 2024 https://doi.org/10.1088/1741-2552/ad33ae [↩] [↩]
  14. J. Chen, Y. Ke, G. Ni, S. Liu, D. Ming. Tonic and event-related phasic transcutaneous auricular vagus nerve stimulation alters pupil responses in the change-detection task. Neuromodulation: Technology at the Neural Interface. Vol. 28, pg. 652–662, 2025 https://doi.org/10.1016/j.neurom.2025.01.003 [↩]
  15. J. A. Clancy, D. A. Mary, K. K. Witte, J. P. Greenwood, S. A. Deuchars, J. Deuchars. Non-invasive vagus nerve stimulation in healthy humans reduces sympathetic nerve activity. Brain Stimulation. Vol. 7, pg. 871–877, 2014 https://doi.org/10.1016/j.brs.2014.07.031 [↩]
  16. V. Wolf, A. Kühnel, V. Teckentrup, J. Koenig, N. B. Kroemer. Does transcutaneous auricular vagus nerve stimulation affect vagally mediated heart rate variability? a living and interactive bayesian meta-analysis. Psychophysiology. Vol. 58, pg. e13933, 2021 https://doi.org/10.1111/psyp.13933 [↩]
  17. O. Sharon, F. Fahoum, Y. Nir. Transcutaneous vagus nerve stimulation in humans induces pupil dilation and attenuates alpha oscillations. The Journal of Neuroscience. Vol. 41, pg. 320–330, 2021 https://doi.org/10.1523/JNEUROSCI.1361-20.2020 [↩]
  18. S. Vespa, L. Stumpp, G. Liberati, J. Delbeke, A. Nonclercq, A. Mouraux, R. El Tahry. Characterization of vagus nerve stimulation-induced pupillary responses in epileptic patients. Brain Stimulation. Vol. 15, pg. 1498–1507, 2022 https://doi.org/10.1016/j.brs.2022.11.002 [↩]
  19. M. Keute, M. Demirezen, A. Graf, N. G. Mueller, T. Zaehle. No modulation of pupil size and event-related pupil response by transcutaneous auricular vagus nerve stimulation (tavns). Scientific Reports. Vol. 9, pg. 11452, 2019 https://doi.org/10.1038/s41598-019-47961-4 [↩]
  20. I. Pervaz, L. Thurn, C. Vezzani, L. Kaluza, A. Kühnel, N. B. Kroemer. Does transcutaneous auricular vagus nerve stimulation alter pupil dilation? a living bayesian meta-analysis. Brain Stimulation. Vol. 18, pg. 148–157, 2025 https://doi.org/10.1016/j.brs.2025.01.022 [↩]
  21. C. Vezzani, R.-M. Breakspear, L. Thurn, U. Ettinger, A. Kühnel, N. B. Kroemer. Effects of non-invasive vagus nerve stimulation on pupil dilation are dependent on sensory matching. iScience. Vol. 29, pg. 114795, 2026 https://doi.org/10.1016/j.isci.2026.114795 [↩]
  22. B. Shahriari, K. Swersky, Z. Wang, R. P. Adams, N. De Freitas. Taking the human out of the loop: a review of bayesian optimization. Proceedings of the IEEE. Vol. 104, pg. 148–175, 2016 https://doi.org/10.1109/JPROC.2015.2494218 [↩]
  23. J. Snoek, H. Larochelle, R. Adams. Practical bayesian optimization of machine learning algorithms. in Advances in Neural Information Processing Systems (eds F. Pereira, C. J. Burges, L. Bottou & K. Weinberger) Vol. 25 pg. 2951–2959, Curran Associates, Inc., 2012 [↩]
  24. J. Bergstra, R. Bardenet, Y. Bengio, B. Kégl. Algorithms for hyper-parameter optimization. in Advances in Neural Information Processing Systems Vol. 24 pg. 2546–2554, Curran Associates, Inc., 2011 [↩]
  25. F. Hutter, H. H. Hoos, K. Leyton-Brown. Sequential model-based optimization for general algorithm configuration. in Learning and Intelligent Optimization (ed. C. A. C. Coello) Vol. 6683 pg. 507–523, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011 https://doi.org/10.1007/978-3-642-25566-3_40 [↩]
  26. S. Ament, S. Daulton, D. Eriksson, M. Balandat, E. Bakshy. Unexpected improvements to expected improvement for bayesian optimization. in Advances in Neural Information Processing Systems (eds A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt & S. Levine) Vol. 36 pg. 20577–20612, Curran Associates, Inc., 2023 https://doi.org/10.52202/075280-0904 [↩]
  27. R. R. Souza, N. M. Robertson, C. K. McIntyre, R. L. Rennaker, S. A. Hays, M. P. Kilgard. Vagus nerve stimulation enhances fear extinction as an inverted-u function of stimulation intensity. Experimental Neurology. Vol. 341, 2021 https://doi.org/10.1016/j.expneurol.2021.113718 [↩]
  28. M. S. Borland, W. A. Vrana, N. A. Moreno, E. A. Fogarty, E. P. Buell, P. Sharma, C. T. Engineer, M. P. Kilgard. Cortical map plasticity as a function of vagus nerve stimulation intensity. Brain Stimulation. Vol. 9, pg. 117–123, 2016 https://doi.org/10.1016/j.brs.2015.08.018 [↩]
  29. B. W. Badran, O. J. Mithoefer, C. E. Summer, N. T. LaBate, C. E. Glusman, A. W. Badran, W. H. DeVries, P. M. Summers, C. W. Austelle, L. M. McTeague, J. J. Borckardt, M. S. George. Short trains of transcutaneous auricular vagus nerve stimulation (tavns) have parameter-specific effects on heart rate. Brain Stimulation. Vol. 11, pg. 699–708, 2018 https://doi.org/10.1016/j.brs.2018.04.004 [↩]

LEAVE A REPLY

Please enter your comment!
Please enter your name here