检索结果-内蒙古大学图书馆

accelerated gradient algorithm for RBF neural network

NEUROCOMPUTING 2021年 441卷 237-247页

作者： Han, Hong-Gui Ma, Miao-Li Qiao, Jun-Fei Beijing Univ Technol Fac Informat Technol Beijing 100124 Peoples R China Beijing Key Lab Computat Intelligence & Intellige Beijing 100124 Peoples R China Minist Educ Engn Res Ctr Digital Community Beijing 100124 Peoples R China

gradient-based algorithms are commonly used for training radial basis function neural network (RBFNN). However, one of the challenges in the training process is determining how to avoid vanishing gradient. To solve this problem, an accelerated gradient algorithm (AGA) is designed to improve the learning perfor-mance of RBFNN in this paper. First, an indirect detection mechanism, based on the instantaneous gradi-ent decay rate (IGDR) and instantaneous convergence rate (ICR), is developed to identify the vanishing gradient in learning process. Second, an amplification gradient strategy (AGS), which can increase the gradient value of learning parameters, is designed to accelerate the learning speed of RBFNN. Third, the analysis of AGA-based RBFNN (AGA-RBFNN) is given to guarantee the successful application. Finally, some benchmark and real problems are used to illustrate the effectiveness of AGA-RBFNN. The results demonstrate the effectiveness of AGA-RBFNN. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Radial basis function neural network Instantaneous gradient decay rate Instantaneous convergence rate Amplification gradient strategy accelerated gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm

引用

OPTIMIZATION METHODS & SOFTWARE 2019年第3期34卷 612-633页

作者： Li, Qian Bai, Yanqin Yan, Xin Zhang, Wei Shanghai Univ Dept Math Shanghai Peoples R China Shanghai Univ Int Business & Econ Sch Stat & Informat Shanghai Peoples R China

In this paper, we propose an optimal trade-off model for portfolio selection with the effect of systematic risk diversification, measured by the maximum marginal systematic risk of all the risk contributors. First, the classical portfolio selection model with constraints on allocation of systematic risk is shown to be equivalent to our trade-off model under certain conditions. Then, we transform the trade-off model into a special non-convex and non-smooth composite problem equivalently. Thus a modified accelerated gradient (AG) algorithm can be introduced to solve the composite problem. The efficiency of the algorithm for solving the composite problem is demonstrated by theoretical results on both the convergence rate and the iteration complexity bound. Finally, empirical analysis demonstrates that the proposed model is a preferred tool for active portfolio risk management when compared with the existing models. We also carry out a series of numerical experiments to compare the performance of the modified AG algorithm with the other three first-order algorithms.

关键词： mean-variance model systematic risk branch-and-bound non-convex programming accelerated gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved accelerated gradient algorithms with Line Search for Smooth Convex Optimization Problems

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2024年第3期41卷 2350030-2350030页

作者： Li, Ting Song, Yongzhong Cai, Xingju Nanjing Normal Univ Sch Math Sci Jiangsu Key Lab NSLSCS Nanjing 210023 Peoples R China

For smooth convex optimization problems, the optimal convergence rate of first-order algorithm is O(1/k(2)) in theory. This paper proposes three improved accelerated gradient algorithms with the gradient information at the latest point. For the step size, to avoid using the global Lipschitz constant and make the algorithm converge faster, new adaptive line search strategies are adopted. By constructing a descent Lyapunov function, we prove that the proposed algorithms can preserve the convergence rate of O(1/k(2)). Numerical experiments demonstrate that our algorithms perform better than some existing algorithms which have optimal convergence rate.

关键词： Adaptive step size Nesterov acceleration algorithm accelerated gradient algorithm Lyapunov function l(2) regularized logistic regression

来源：评论

学校读者我要写书评

暂无评论

accelerated gradient Flow for Directed Graphs With Event-Based Broadcasting

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2024年第1期11卷 510-522页

作者： Dhullipalla, Mani H. Yu, Hao Chen, Tongwen Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 1H9 Canada Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China

accelerated gradients algorithms are currently at the receiving end of widespread interest in optimization theory, both under discrete- and continuous-time (CT) frameworks. In light of recent developments, in the first part of our work, we design a CT accelerated gradient algorithm for strongly connected directed graphs. We show that the convergence is exponential and the convergence rate is proportional to the gradient gain which is chosen arbitrarily. To facilitate implementation of the algorithm over communication networks, in the second part of our work, we design an event-based broadcasting protocol that intermittently checks for events by evaluating an event-triggering condition and accordingly makes decision on broadcasting. The distributed system, with CT dynamics and discrete-time (event-based) broadcasts, is reformulated as a hybrid dynamical system which is devoid of Zeno solutions. Finally, we provide a numerical example to demonstrate our results.

关键词： Directed graphs Convergence Laplace equations Control systems Network systems Broadcasting Protocols accelerated gradient algorithm asynchronous broadcasts directed graphs event-based broadcasting continuous-time (CT) distributed optimization

来源：评论

学校读者我要写书评

暂无评论

Fast identification of coherent sound sources with the covariance matrix fitting method based on non-synchronous measurements

引用

MECHANICAL SYSTEMS AND SIGNAL PROCESSING 2024年 213卷

作者： Chen, Lin Xiao, Youhong Yu, Liang Yang, Tiejun Chen, Fangchao Zhang, Chenyu Ji, Huizhi Harbin Engn Univ Coll Power & Energy Engn Harbin 150001 Peoples R China Northwestern Polytech Univ Sch Civil Aviat Xian 710072 Peoples R China State Key Lab Airliner Integrat Technol & Flight S Shanghai 200126 Peoples R China

The Non -Synchronous Measurements is particularly effective at expanding the operating frequency range of a single microphone array. The completed cross -spectral matrix of the synthetic array, when combined with high -resolution imaging algorithms, can yield accurate sound source identification results. However, when matrix completion algorithms are applied to large synthetic arrays, their computational complexity increases significantly. Furthermore, existing integrations with high -resolution imaging algorithms often encounter difficulties in the presence of coherent sound sources. To address this problem, this paper introduces the accelerated gradient descent algorithm for the covariance matrix fitting by orthogonal least squares. The matrix completion model for non -synchronous measurements is initially simplified through matrix decomposition, thereby enabling the rapid completion of the cross -spectral matrix using the accelerated gradient descent algorithm. This is then followed by the application of the covariance matrix fitting by orthogonal least squares to achieve quick and precise identification of coherent sound sources employing the completed cross -spectral matrix. The performance of the algorithm is evaluated using numerical simulations and validated through loudspeaker experiments in an anechoic chamber. The results from these simulations and experiments reveal that the proposed algorithm not only improves matrix completion performance on large synthetic arrays but also accurately identifies the locations and correlation coefficients of coherent sound sources.

关键词： Sound source identification Non-synchronous measurements Coherent sources accelerated gradient algorithm Covariance matrix fitting

来源：评论

学校读者我要写书评

暂无评论

A non-convex piecewise quadratic approximation of l0 regularization: theory and accelerated algorithm

引用

JOURNAL OF GLOBAL OPTIMIZATION 2023年第2期86卷 323-353页

作者： Li, Qian Zhang, Wei Bai, Yanqin Wang, Guoqiang Shanghai Univ Engn Sci Sch Math Phys & Stat Shanghai 201620 Peoples R China South China Univ Technol Sch Math Guangzhou 510640 Peoples R China Shanghai Univ Dept Math Shanghai 200444 Peoples R China

Non-convex regularization has been recognized as an especially important approach in recent studies to promote sparsity. In this paper, we study the non-convex piecewise quadratic approximation (PQA) regularization for sparse solutions of the linear inverse problem. It is shown that exact recovery of sparse signals and stable recovery of compressible signals are possible through local optimum of this regularization. After developing a thresholding representation theory for PQA regularization, we propose an iterative PQA thresholding algorithm (PQA algorithm) to solve this problem. The PQA algorithm converges to a local minimizer of the regularization, with an eventually linear convergence rate. Furthermore, we adopt the idea of accelerated gradient method to design the accelerated iterative PQA thresholding algorithm (APQA algorithm), which is also linearly convergent, but with a faster convergence rate. Finally, we carry out a series of numerical experiments to assess the performance of both algorithms for PQA regularization. The results show that PQA regularization outperforms L-1 and L(1/2 )regularizations in terms of accuracy and sparsity, while the APQA algorithm is demonstrated to be significantly better than the PQA algorithm.

关键词： Iterative thresholding algorithm Exact recovery Sparsity optimization Non-convex approximation accelerated gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed accelerated gradient algorithm for distributed model predictive control of a hydro power valley

引用

CONTROL ENGINEERING PRACTICE 2013年第11期21卷 1594-1605页

作者： Minh Dang Doan Giselsson, Pontus Keviczky, Tamas De Schutter, Bart Rantzer, Anders Cantho Univ Technol Fac Elect Elect & Telecommun Engn Ho Chi Minh City Vietnam Lund Univ Dept Automat Control S-22100 Lund Sweden Delft Univ Technol Delft Ctr Syst & Control NL-2600 AA Delft Netherlands

A distributed model predictive control (DMPC) approach based on distributed optimization is applied to the power reference tracking problem of a hydro power valley (HPV) system. The applied optimization algorithm is based on accelerated gradient methods and achieves a convergence rate of O(1/k(2)), where k is the iteration number. Major challenges in the control of the HPV include a nonlinear and large-scale model, nonsmoothness in the power-production functions, and a globally coupled cost function that prevents distributed schemes to be applied directly. We propose a linearization and approximation approach that accommodates the proposed the DMPC framework and provides very similar performance compared to a centralized solution in simulations. The provided numerical studies also suggest that for the sparsely interconnected system at hand, the distributed algorithm we propose is faster than a centralized state-of-the-art solver such as CPLEX. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Hydro power control Distributed optimization accelerated gradient algorithm Model predictive control Distributed model predictive control

来源：评论

学校读者我要写书评

暂无评论

FSMRank: Feature Selection algorithm for Learning to Rank

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2013年第6期24卷 940-952页

作者： Lai, Han-Jiang Pan, Yan Tang, Yong Yu, Rong Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China Sun Yat Sen Univ Sch Software Guangzhou 510006 Guangdong Peoples R China S China Normal Univ Sch Comp Sci Guangzhou 510006 Guangdong Peoples R China Guangdong Univ Technol Inst Intelligent Informat Proc Guangzhou 510006 Guangdong Peoples R China

In recent years, there has been growing interest in learning to rank. The introduction of feature selection into different learning problems has been proven effective. These facts motivate us to investigate the problem of feature selection for learning to rank. We propose a joint convex optimization formulation which minimizes ranking errors while simultaneously conducting feature selection. This optimization formulation provides a flexible framework in which we can easily incorporate various importance measures and similarity measures of the features. To solve this optimization problem, we use the Nesterov's approach to derive an accelerated gradient algorithm with a fast convergence rate O(1/T-2). We further develop a generalization bound for the proposed optimization problem using the Rademacher complexities. Extensive experimental evaluations are conducted on the public LETOR benchmark datasets. The results demonstrate that the proposed method shows: 1) significant ranking performance gain compared to several feature selection baselines for ranking, and 2) very competitive performance compared to several state-of-the-art learning-to-rank algorithms.

关键词： accelerated gradient algorithm feature selection generalization bound learning to rank

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT LARGE-SCALE SERVICE CLUSTERING VIA SPARSE FUNCTIONAL REPRESENTATION AND accelerated OPTIMIZATION

引用

INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS 2013年第4期22卷 1341001-1341001页

作者： Yu, Qi Rochester Inst Technol Coll Comp & Informat Sci Rochester NY 14623 USA

Clustering techniques offer a systematic approach to organize the diverse and fast increasing Web services by assigning relevant services into homogeneous service communities. However, the ever increasing number of Web services poses key challenges for building large-scale service communities. In this paper, we tackle the scalability issue in service clustering, aiming to accurately and efficiently discover service communities over very large-scale services. A key observation is that service descriptions are usually represented by long but very sparse term vectors as each service is only described by a limited number of terms. This inspires us to seek a new service representation that is economical to store, efficient to process, and intuitive to interpret. This new representation enables service clustering to scale to massive number of services. More specifically, a set of anchor services are identified that allows each service to represent as a linear combination of a small number of anchor services. In this way, the large number of services are encoded with a much more compact anchor service space. Despite service clustering can be performed much more efficiently in the compact anchor service space, discovery of anchor services from large-scale service descriptions may incur high computational cost. We develop principled optimization strategies for efficient anchor service discovery. Extensive experiments are conducted on real-world service data to assess both the effectiveness and efficiency of the proposed approach. Results on a dataset with over 3,700 Web services clearly demonstrate the good scalability of sparse functional representation and the efficiency of the optimization algorithms for anchor service discovery.

关键词： Service clustering sparse coding anchor service accelerated gradient algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient and effective algorithms for training single-hidden-layer neural networks

引用

PATTERN RECOGNITION LETTERS 2012年第5期33卷 554-558页

作者： Yu, Dong Deng, Li Microsoft Res Redmond WA 98052 USA

Recently there have been renewed interests in single-hidden-layer neural networks (SHLNNs). This is due to its powerful modeling ability as well as the existence of some efficient learning algorithms. A prominent example of such algorithms is extreme learning machine (ELM), which assigns random values to the lower-layer weights. While ELM can be trained efficiently, it requires many more hidden units than is typically needed by the conventional neural networks to achieve matched classification accuracy. The use of a large number of hidden units translates to significantly increased test time, which is more valuable than training time in practice. In this paper, we propose a series of new efficient learning algorithms for SHLNNs. Our algorithms exploit both the structure of SHLNNs and the gradient information over all training epochs, and update the weights in the direction along which the overall square error is reduced the most. Experiments on the MNIST handwritten digit recognition task and the MAGIC gamma telescope dataset show that the algorithms proposed in this paper obtain significantly better classification accuracy than ELM when the same number of hidden units is used. For obtaining the same classification accuracy, our best algorithm requires only 1/16 of the model size and thus approximately 1/16 of test time compared with ELM. This huge advantage is gained at the expense of 5 times or less the training cost incurred by the ELM training. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Neural network Extreme learning machine accelerated gradient algorithm Weighted algorithm MNIST

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：