In the paper, we study the mini-batch stochastic ADMMs (alternating direction method of multipliers) for the nonconvex nonsmooth optimization. We prove that, given an appropriate mini-batch size, the mini-batch stochastic ADMM without variance reduction (VR) technique is convergent and reaches the convergence rate of O(1/T ) to obtain a stationary point of the nonconvex optimization, where T de...

We now describe the architecture of the networks used in the paper. We use exponential linear unit (elu) [1] as activation function. We also use virtual batch normalization [6], where the reference batch size bref is equal to the batch size used for stochastic gradient descent. We weight the reference batch with bref bref+1 . We define some shorthands for the basic components used in the networks.

The scattering function and radius of gyration of an ideal polymer network are calculated depending on the strength of the bonds that form the crosslinks. Our calculations are based on an exact theorem for the characteristic function of a polydisperse phantom network that allows for treating the crosslinks between pairs of randomly selected monomers as quenched variables without resorting to re...

We propose a traffic measurement system which uses trap and polling methods. To obtain its performance we consider a queueing model with a single server and evaluate a packet delay. In our multi-cast traffic, packets are modeled as a batch with a batch size distribution {gk}. The batch arrival process is observed as two processes on the basis of batch size. For a batch whose size is more than o...

This paper describes our submission to the WMT 2017 Neural MT Training Task. We modified the provided NMT system in order to allow for interrupting and continuing the training of models. This allowed mid-training batch size decrementation and incrementation at variable rates. In addition to the models with variable batch size, we tried different setups with pre-trained word2vec embeddings. Asid...

In traditional batch-service queueing systems, the mean service time of batches are generally assumed to be constant. However, in numerous applications this assumption may not appropriate. telecommunication networks, transmission rates depend on number packets batch which can framed as batch-size-dependent queue. The objective paper is focus both queue and server content distribution an infinit...

We present improvements to the index-calculus algorithm for the computation of the ideal class group and regulator of a real quadratic field. Our improvements consist of applying the double large prime strategy, an improved structured Gaussian elimination strategy, and the use of Bernstein’s batch smoothness algorithm. We achieve a significant speed-up and are able to compute the ideal class gr...

The transient analysis of a queuing system with fixed-size batch Poisson arrivals and a single server with exponential service times is presented. The focus of the paper is on the use of the functions that arise in the analysis of the transient behaviour of the queuing system. These functions are shown to be a generalization of the modified Bessel functions of the first kind, with the batch siz...