徐宗本，学者全讯担保网主页-全讯担保网

in this paper we propose an l1/2 regularizer which has a nonconvex penalty. the l1/2 regularizer is shown to have many promising properties such as unbiasedness, sparsity and oracle properties. a reweighed iterative algorithm is proposed so that the solution of the l1/2 regularizer can be solved through transforming it into the solution of a series of l1 regularizers. the solution of the l1/2 regularizer is more sparse than that of the l1 regularizer, while solving the l1/2 regularizer ismuch simpler than solving the l0 regularizer. the experiments show that the l1/2 regularizer is very useful and efficient, and can be taken as a representative of the lp(0

the generalization performance is the main concern of machine learning theoretical research. the previous main bounds describing the generalization ability of the empirical risk minimization (erm) algorithm are based on independent and identically distributed (i.i.d.) samples. in order to study the generalization performance of the erm algorithm with dependent observations, we first establish the exponential bound on the rate of relative uniform convergence of the erm algorithm with exponentially strongly mixing observations, and then we obtain the generalization bounds and prove that the erm algorithm with exponentially strongly mixing observations is consistent. the main results obtained in this paper not only extend the previously known results for i.i.d. observations to the case of exponentially strongly mixing observations, but also improve the previous results for strongly mixing samples. because the erm algorithm is usually very time-consuming and overfitting may happen when the complexity of the hypothesis space is high, as an application of our main results we also explore a new strategy to implement the erm algorithm in high complexity hypothesis space.

for the nearly exponential type of feedforward neural networks (nefnns), it is revealed the essential order of their approximation. it is proven that for any continuous function defined on a compact set of rd, there exists a three-layer nefnns with fixed number of hidden neurons that attain the essential order. when the function to be approximated belongs to the α-lipschitz family (0<α≤2), the essential order of approximation is shown to be o(n-α) where n is any integer not less than the reciprocal of the predetermined approximation error. the upper bound and lower bound estimations on approximation precision of the nefnns are provided. the obtained results not only characterize the intrinsic property of approximation of the nefnns, but also uncover the implicit relationship between the precision (speed) and the number of hidden neurons of the nefnns.

the neuron state modeling and the local field modeling provides two fundamental modeling approaches to neural network research, based on which a neural network system can be called either as a static neural network model or as a local field neural network model. these two models are theoretically compared in terms of their trajectory transformation property, equilibrium correspondence property, nontrivial attractive manifold property, global convergence as well as stability in many different senses. the comparison reveals an important stability invariance property of the two models in the sense that the stability (in any sense) of the static model is equivalent to that of a subsystem deduced from the local field model when restricted to a specific manifold. such stability invariance property lays a sound theoretical foundation of validity of a useful, cross-fertilization type stability analysis methodology for various neural network models.

there have been various algorithms designed for simulating natural evolution. this paper proposes a new simulated evolutionary computation model called the abstract evolutionary algorithm (aea), which unifies most of the currently known evolutionary algorithms and describes the evolution as an abstract stochastic process composed of two fundamental operators: selection and evolution operators. by axiomatically characterizing the properties of the fundamental selection and evolution operators, several general convergence theorems and convergence rate estimations for the aea are established. the established theorems are applied to a series of known evolutionary algorithms, directly yielding new convergence conditions and convergence rate estimations of various specific genetic algorithms and evolutionary strategies. the present work provides a significant step toward the establishment of a unified theory of simulated evolutionary computation.

in this paper, a new concept called nonlinear measure is introduced to quantify stability of nonlinear systems in the way similar to the matrix measure for stability of linear systems. based on the new concept, a novel approach for stability analysis of neural networks is developed. with this approach, a series of new sufficient conditions for global and local exponential stability of hopfield type neural networks is presented, which generalizes those existing results. by means of the introduced nonlinear measure, the exponential convergence rate of the neural networks to stable equilibrium point is estimated, and, for local stability, the attraction region of the stable equilibrium point is characterized. the developed approach can be generalized to stability analysis of other general nonlinear systems.

the hopfield-type networks with asymmetric interconnections are studied from the standpoint of taking them as computational models. two fundamental properties, feasibility and reliability, of the networks related to their use are established with a newly-developed convergence principle and a classification theory on energy functions. the convergence principle generalizes that previously known for symmetric networks and underlies the feasibility. the classification theory, which categorizes the traditional energy functions into regular, normal and complete ones according to their roles played in connection with the corresponding networks, implies that the reliability and high efficiency of the networks can follow respectively from the regularity and the normality of the corresponding energy functions. the theories developed have been applied to solve a classical np-hard graph theory problem: finding the maximal independent set of a graph. simulations demonstrate that the algorithms deduced from the asymmetric theories outperform those deduced from the symmetric theory.

a decomposition principle is developed for systematic determination of the dimensionality and the connections of hopfield-type associative memory networks. given a set of high dimensional prototype vectors of given memory objects, we develop decomposition algorithms to extract a set o flower dimensional key features of the pattern vectors. every key feature can be used to build an associative memory with the lowest complexity, and more than one key feature can be simultaneously used to build networks with higher recognition accuracy. in the latter case, we further propose a "decomposed neural network" based on a new encoding scheme to reduce the network complexity. in contrast to the original hopfield network, the decomposed networks not only increase the network's storage capacity, but also reduce the network's connection complexity from quadratic to linear growth with the network dimension. both theoretical analysis and simulation results demonstrate that the proposed principle is powerful.

computing convex hull is one of the central problems账in various applications of computational geometry. in this paper, a convex hull computing neural network (chcnn) is developed to solve the related problems in the n-dimensional spaces. the algorithm is based on a two-layered neural network, topologically similar to art, with a newly developed adaptive training strategy called excited learning. the chcnn provides a parallel on-line and real-time processing of data which, after training, yields two closely related approximations, one from within and one from outside, of the desired convex hull. it is shown that accuracy of the approximate convex hulls obtained is around o[k-1=(n-1)], where k is the number of neurons in the output layer of the chcnn. when k is taken to be sufficiently large, the chcnn can generate any accurate approximate convex hull. we also show that an upper bound exists such that the chcnn will yield the precise convex hull when k is larger than or equal to this bound. a series of simulations and applications is provided to demonstrate the feasibility, effectiveness, and high efficiency of the proposed algorithm.