30 research outputs found

    Smoothed Functional Algorithms for Stochastic Optimization using q-Gaussian Distributions

    Full text link
    Smoothed functional (SF) schemes for gradient estimation are known to be efficient in stochastic optimization algorithms, specially when the objective is to improve the performance of a stochastic system. However, the performance of these methods depends on several parameters, such as the choice of a suitable smoothing kernel. Different kernels have been studied in literature, which include Gaussian, Cauchy and uniform distributions among others. This paper studies a new class of kernels based on the q-Gaussian distribution, that has gained popularity in statistical physics over the last decade. Though the importance of this family of distributions is attributed to its ability to generalize the Gaussian distribution, we observe that this class encompasses almost all existing smoothing kernels. This motivates us to study SF schemes for gradient estimation using the q-Gaussian distribution. Using the derived gradient estimates, we propose two-timescale algorithms for optimization of a stochastic objective function in a constrained setting with projected gradient search approach. We prove the convergence of our algorithms to the set of stationary points of an associated ODE. We also demonstrate their performance numerically through simulations on a queuing model

    Validation, reproducibility and safety of trans dermal electrical stimulation in chronic pain patients and healthy volunteers

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Surrogate pain models have been extensively tested in Normal Human Volunteers (NHV). There are few studies that examined pain models in chronic pain patients. Patients are likely to have altered pain mechanisms. It is of interest to test patient pain responses to selective pain stimuli under controlled laboratory conditions.</p> <p>Methods</p> <p>The Institutional Ethic Committee approved the study. 16 patients with chronic neuropathic radiculopathy and 16 healthy volunteers were enrolled to the study after obtaining informed consent. During electrical stimulation (150 minutes for volunteers and 75 minutes for patients) the following parameters were measured every 10 minutes:</p> <p>Ongoing pain: Visual Analogue Scale (VAS) and Numeric Rate Scale (NRS)</p> <p>Allodynia (soft foam brush)</p> <p>Hyperalgesia (von Frey monofilament 20 g)</p> <p>Flare</p> <p>For each endpoint, the area under the curve (AUC) was estimated from the start of stimulation to the end of stimulation by the trapezoidal rule. The individual AUC values for both periods were plotted to show the inter- and intra-subject variability. For each endpoint a mixed effect model was fitted with random effect subject and fixed effect visit. The estimate of intra-subject variance and the mean value were then used to estimate the sample size of a crossover study required to have a probability of 0.80 to detect a 25% change in the mean value. Analysis was done using GenStat 8<sup>th </sup>edition.</p> <p>Results</p> <p>Each endpoint achieved very good reproducibility for patients and NHV. Comparison between groups revealed trends towards:</p> <p>Faster habituation to painful stimuli in patients</p> <p>Bigger areas of hyperalgesia in patients</p> <p>Similar area of allodynia and flare (no statistical significance)</p> <p>Conclusion</p> <p>The differences demonstrated between patients and NHVs suggest that the electrical stimulation device used here may stimulate pathways that are affected in the pathological state.</p

    Best Increments for the Average Case of Shellsort

    No full text
    This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousand elements. The obtained sequences outperform by about 3% the best ones known so far, and there is a plausible evidence that they are the optimal ones

    HOLISMOKES VII. Time-delay measurement of strongly lensed Type Ia supernovae using machine learning

    No full text
    The Hubble constant (H0H_0) is one of the fundamental parameters in cosmology, but there is a heated debate around the >>4σ\sigma tension between the local Cepheid distance ladder and the early Universe measurements. Strongly lensed Type Ia supernovae (LSNe Ia) are an independent and direct way to measure H0H_0, where a time-delay measurement between the multiple supernova (SN) images is required. In this work, we present two machine learning approaches for measuring time delays in LSNe Ia, namely, a fully connected neural network (FCNN) and a random forest (RF). For the training of the FCNN and the RF, we simulate mock LSNe Ia from theoretical SN Ia models that include observational noise and microlensing. We test the generalizability of the machine learning models by using a final test set based on empirical LSN Ia light curves not used in the training process, and we find that only the RF provides a low enough bias to achieve precision cosmology; as such, RF is therefore preferred over our FCNN approach for applications to real systems. For the RF with single-band photometry in the ii band, we obtain an accuracy better than 1\% in all investigated cases for time delays longer than 15 days, assuming follow-up observations with a 5σ\sigma point-source depth of 24.7, a two day cadence with a few random gaps, and a detection of the LSNe Ia 8 to 10 days before peak in the observer frame. In terms of precision, we can achieve an approximately 1.5-day uncertainty for a typical source redshift of \sim0.8 on the ii band under the same assumptions. To improve the measurement, we find that using three bands, where we train a RF for each band separately and combine them afterward, helps to reduce the uncertainty to \sim1.0 day. We have publicly released the microlensed spectra and light curves used in this work.Comment: 25 pages, 28 figures; accepted for publication in A&
    corecore