The problem of learning using connectionist networks, in which network connection strengths are modified systematically so that the response of the network increasingly approximates the desired response can be structured as an optimization problem. The widely used back propagation method of connectionist learning [19, 21, 18] is set in the context of nonlinear optimization. In this framework, t...

In this paper, a new criterion for the evaluation of theoretical efficiency greedy algorithm is suggested. Using criterion, we prove some results on rate convergence algorithms, which provide expansions. We consider both case Hilbert spaces and more general Banach spaces. The component paper that bound error approximation by product two norms—the norm f A1-norm f. Typically, only used. particul...

In this article, we propose a sampling-based motion planning algorithm equipped with an information-theoretic convergence criterion for incremental informative motion planning. The proposed approach allows dense map representations and incorporates the full state uncertainty into the planning process. The problem is formulated as a maximization problem with a budget constraint. Our approach is ...

A soft-input soft-output decoder based on the least mean square error (LMSE) criterion is presented and employed for iterative decoding of product codes. The residual estimation error is derived and used for analyzing the convergence of the iterative process as well as a stopping criterion. A relation between the LMSE and the MAP decoders is also established. Simulation results are presented fo...

Mean Squared Error (MSE) has been the most widely used tool to solve the linear filter estimation or system identification problem. However, MSE gives biased results when the input signals are noisy. This paper presents a novel Error Whitening Criterion (EWC) to tackle the problem of linear system identification in the presence of additive white disturbances. We will motivate the theory behind ...

We propose an effective stopping criterion for higher-order fast sweeping schemes for static Hamilton-Jacobi equations based on ratios of three consecutive iterations. To design the new stopping criterion we analyze the convergence of the first-order Lax-Friedrichs sweeping scheme by using the theory of nonlinear iteration. In addition, we propose a fifth-order Weighted PowerENO sweeping scheme...

In this paper we develop a novel criterion for choosing regularization parameters for nonsmooth Tikhonov functionals. The proposed criterion is solely based on the value function, and thus applicable to a broad range of functionals. It is analytically compared with the local minimum criterion, and a posteriori error estimates are derived. An efficient numerical algorithm for computing the minim...

We analyze the random sequential dynamics of a message passing algorithm for Ising models with interactions in large system limit. derive exact results two-time correlation functions and speed convergence. The {\em de Almedia-Thouless} stability criterion static problem is found to be necessary sufficient global convergence dynamics.

Convergence criterion of the inexact methods is established for operators with hölder continuous first derivatives. An application to a special nonlinear Hammerstein integral equation of the second kind is provided.