Hyperparameter on-line learning of stochastic resonance based threshold networks

Aiming at training the feed-forward threshold neural network consisting of nondifferentiable activation functions, the approach of noise injection forms a stochastic resonance based threshold network that can be optimized by various gradient-based optimizers. The introduction of injected noise extends the noise level into the parameter space of the designed threshold network, but leads to a highly non-convex optimization landscape of the loss function. Thus, the hyperparameter on-line learning procedure with respective to network weights and noise levels becomes of challenge. It is shown that the Adam optimizer, as an adaptive variant of stochastic gradient descent, manifests its superior learning ability in training the stochastic resonance based threshold network effectively. Experimental results demonstrate the significant improvement of performance of the designed threshold network trained by the Adam optimizer for function approximation and image classification.     

Properties of bounded stochastic processes employed in biophysics

Abstract

Realistic stochastic modeling is increasingly requiring the use of bounded noises. In this work, properties and relationships of commonly employed bounded stochastic processes are investigated within a solid mathematical ground. Four families are object of investigation: the Sine-Wiener (SW), the Doering–Cai–Lin (DCL), the Tsallis–Stariolo–Borland (TSB), and the Kessler–Sørensen (KS) families. We address mathematical questions on existence and uniqueness of the processes defined through Stochastic Differential Equations, which often conceal non-obvious behavior, and we explore the behavior of the solutions near the boundaries of the state space. The expression of the time-dependent probability density of the Sine-Wiener noise is provided in closed form, and a close connection with the Doering–Cai–Lin noise is shown. Further relationships among the different families are explored, pathwise and in distribution. Finally, we illustrate an analogy between the Kessler–Sørensen family and Bessel processes, which allows to relate the respective local times at the boundaries.     

Gravitational wave imprint of new symmetry breaking

It is believed that there are more fundamental gauge symmetries beyond those described by the Standard Model of particle physics. The scales of these new gauge symmetries are usually too high to be reachable by particle colliders. Considering that the phase transition (PT) relating to the spontaneous breaking of new gauge symmetries to the electroweak symmetry might be strongly first order, we propose considering the stochastic gravitational waves (GW) arising from this phase transition as an indirect way of detecting these new fundamental gauge symmetries. As an illustration, we explore the possibility of detecting the stochastic GW generated from the PT of \begin{document}$ {\bf{B}}-{\bf{L}}$\end{document} in the space-based interferometer detectors. Our study demonstrates that the GW energy spectrum is reachable by the LISA, Tianqin, Taiji, BBO, and DECIGO experiments only for the case where the spontaneous breaking of \begin{document}$ {\bf{B}}-{\bf{L}}$\end{document} is triggered by at least two electroweak singlet scalars.     

Integral Kernel Operators on Fock Space – Generalizations and Applications to Quantum Dynamics

A general theory of operators on Boson Fock space is discussed in terms of the white noise distribution theory on Gaussian space (white noise calculus). An integral kernel operator is generalized from two aspects: (i) The use of an operator-valued distribution as an integral kernel leads us to the Fubini type theorem which allows an iterated integration in an integral kernel operator. As an application a white noise approach to quantum stochastic integrals is discussed and a quantum Hitsuda–Skorokhod integral is introduced. (ii) The use of pointwise derivatives of annihilation and creation operators assures the partial integration in an integral kernel operator. In particular, the particle flux density becomes a distribution with values in continuous operators on white noise functions and yields a representation of a Lie algebra of vector fields by means of such operators.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

随机发展方程适度解的存在唯一性(Ⅱ)

讨论如下Hilbert空间中的半线性随机发展方程的Cauchy问题 dy(t)=[Ay(t) f(t,y(t))]dt G(t,y(t))dw(t) y(O)=V_u的适度解的存在唯一性,在更一般的条件下,得到了该问题的适度解的存在唯一性。     

An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines

In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison with a widely used decomposition package.