Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 33 for “"Almost sure convergence"”.

  1. Some Almost Sure Convergence Results

    The first chapter of the thesis consists of an almost sure invariance principle for random variables in the Domain of Attraction of a Stable Law. Let {Y,Y(,1),Y(,2),...} be a sequence of i.i.d. symmetric random variables with Y in the domain of attraction of X where X is symmetric and stable of …

    uiuc Repository record for Some Almost Sure Convergence Results (opens in a new tab)

  2. On Convergence Analysis of Stochastic and Distributed Gradient-Based Algorithms

    … 2 provides a concise and rigorous proof of the almost sure convergence guarantees towards a critical point in the context of smooth and non-convex objective functions. To the best of our knowledge, this work offers the first almost sure convergence rates for these stochastic adaptive …

    waterloo Repository record for On Convergence Analysis of Stochastic and Distributed Gradient-Based Algorithms (opens in a new tab)

  3. Push-sum Algorithm on Time-varying Random Graphs

    … away from zero infinitely often, we prove the almost sure convergence of the evolutions of this class of algorithms to the average of initial states. Moreover, for a random sequence of graphs generated using a time-varying B-irreducible sequence of probability matrices, we establish convergence …

    queens Repository record for Push-sum Algorithm on Time-varying Random Graphs (opens in a new tab)

  4. Adaptive sampling trust-region methods for derivative-based and derivative-free simulation optimization problems

    … is a derivative-based algorithm and provides almost sure convergence to a first-order critical point with good practical performance. In the second study the Monte Carlo simulation is assumed to provide no direct observations of the function gradient. We present ASTRO-DF, which is a class of …

    purdue-thes Repository record for Adaptive sampling trust-region methods for derivative-based and derivative-free simulation optimization problems (opens in a new tab)

  5. Adaptive Prediction of Stationary Time Series by Modified Conjugate Direction Methods

    … a sequence of estimators {xn}n=1∞ which converge almost surely to Ө, the solution of φ x = φ. Both are modifications of conjugate direction methods originally proposed by Hestenes and Stiefel. A convergence rate for almost sure convergence is obtained for the first modification when the process …

    unm Repository record for Adaptive Prediction of Stationary Time Series by Modified Conjugate Direction Methods (opens in a new tab)

  6. Ergodicity Conditions For Controlled Stochastic Non-Linear Systems Under Information Constraints

    … version of invariance entropy and utilizing the almost sure convergence of sample paths guaranteed by the pointwise ergodic theorem. The fundamental bounds obtained generalize well-known formulas for linear systems, and are in some cases more refined than those obtained for non-linear systems via …

    queens Repository record for Ergodicity Conditions For Controlled Stochastic Non-Linear Systems Under Information Constraints (opens in a new tab)

  7. Nonparametric maximum likelihood estimation in cure-rate models based on uncensored and censored data

    … censoring models. A proof is also given for the almost sure convergence of [Special characters omitted.] F ( x ) to (1 - s), where [Special characters omitted.] F ( x ) is the supremum of the MLE of the underlying distribution function, and s is the true underlying cure-rate, for random censoring …

    concordia Download PDF for Nonparametric maximum likelihood estimation in cure-rate models based on uncensored and censored data (opens in a new tab)

  8. On the resolution of misspecification in stochastic optimization, variational inequality, and game-theoretic problems

    … obtained schemes are shown to be equipped with almost sure convergence properties in regimes when the function $f$ is either strongly convex as well as merely convex. Importantly, the scheme displays the optimal rate for strongly convex problems while in merely convex regimes, through an …

    uiuc Repository record for On the resolution of misspecification in stochastic optimization, variational inequality, and game-theoretic problems (opens in a new tab)

  9. Multivariate First-Passage Models in Credit Risk

    … simulating approximate losses and demonstrate almost sure convergence of this approximation. We show that the model calibrates well, across both tranches and maturities, to market quotes for CDX index tranches. In particular we are able to calibrate to data from 2006, as well as more recent …

    waterloo Repository record for Multivariate First-Passage Models in Credit Risk (opens in a new tab)

  10. On admissibility of deterministic and stochastic linear Volterra operators with applications to inefficient financial markets

    … and sufficient conditions for mean square convergence and sufficient conditions for almost sure convergence are established for stochastic integrals. This theory is then applied to stochastic linear functional equations of Volterra and finite delay type. Lastly, we introduce a particular …

    dcu Download PDF for On admissibility of deterministic and stochastic linear Volterra operators with applications to inefficient financial markets (opens in a new tab)

  11. Renormalisation of random hierarchial systems

    … initial distribution we show that there exists almost sure convergence to a constant.</p> <p>In Chapters 3 to 5 we consider the asymptotics of some examples of random hierarchical systems, some of which arise when considering certain properties of random fractal graphs. In one example, which is …

    oxford Repository record for Renormalisation of random hierarchial systems (opens in a new tab)

  12. Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization

    … two adaptive steplength schemes equipped with convergence theory that aim to overcome some of the reliance on user-specefi c parameters. Of these, the first scheme, referred to as a recursive steplength stochastic approximation (RSA) scheme, minimizes the error bounds to derive a rule that …

    uiuc Repository record for Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization (opens in a new tab)

  13. ESSAYS IN STATISTICAL ANALYSIS: ISOTONIC REGRESSION AND FILTERING

    … The second part of this thesis focuses on the convergence of the bias-adjusted Kalman filter (BAKF). The BAKF algorithm is designed to optimize the statistical estimation of a non-stationary signal that can only be observed with stochastic noise. The algorithm has numerous applications in …

    maryland Repository record for ESSAYS IN STATISTICAL ANALYSIS: ISOTONIC REGRESSION AND FILTERING (opens in a new tab)

  14. Nonlinear Convergent Dynamics for Temporal Information Processing on Novel Quantum and Classical Devices

    … optimized to perform temporal tasks. The uniform convergence property ensures that the computation performed is asymptotically independent of the reservoir computer’s initial condition. Physical reservoir computers are hardware implementations of reservoir computers for fast signal processing. We …

    unsw Repository record for Nonlinear Convergent Dynamics for Temporal Information Processing on Novel Quantum and Classical Devices (opens in a new tab)

  15. Advances in System Identification and Stochastic Optimization

    … we provide the formal conditions for the convergence of the estimates to the true full system and subsystem parameters. The asymptotic normalities for the estimates and their connections to Fisher information matrices are also established, which are useful in providing the asymptotic or …

    jhu Repository record for Advances in System Identification and Stochastic Optimization (opens in a new tab)

  16. On the asymptotic behaviour of deterministic and stochastic volterra integro-differential equations

    … to be necessary and sufficient for exponential convergence to a nontrivial limit. Next, a Volterra equation with a fading stochastic perturbation is studied. Two types f stochastic convergence are considered: mean square and almost sure convergence. Conditions re found which ensure that the …

    dcu Download PDF for On the asymptotic behaviour of deterministic and stochastic volterra integro-differential equations (opens in a new tab)

  17. LEARNING ALGORITHMS FOR MARKOV DECISION PROCESSES

    … algorithms for solving POMDPs. We extend the almost sure convergence result of a very general stochastic approximation algorithm to the case when the underlying Markov process exhibits periodicity. This result is used to extend the proof of convergence of Temporal Difference (TD) reinforcement …

    maryland Repository record for LEARNING ALGORITHMS FOR MARKOV DECISION PROCESSES (opens in a new tab)

Page 1 of 2