CN111950194B - Newton momentum-based distributed acceleration composite optimization method and system - Google Patents
Newton momentum-based distributed acceleration composite optimization method and system Download PDFInfo
- Publication number
- CN111950194B CN111950194B CN202010709580.7A CN202010709580A CN111950194B CN 111950194 B CN111950194 B CN 111950194B CN 202010709580 A CN202010709580 A CN 202010709580A CN 111950194 B CN111950194 B CN 111950194B
- Authority
- CN
- China
- Prior art keywords
- agent
- neighbor
- local
- agents
- momentum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 230000001133 acceleration Effects 0.000 title claims abstract description 49
- 238000005457 optimization Methods 0.000 title claims abstract description 25
- 239000002131 composite material Substances 0.000 title claims abstract description 11
- 238000004364 calculation method Methods 0.000 claims description 35
- 238000004891 communication Methods 0.000 claims description 8
- 239000011159 matrix material Substances 0.000 claims description 6
- 238000012545 processing Methods 0.000 abstract description 10
- 239000003795 chemical substances by application Substances 0.000 description 153
- 230000006870 function Effects 0.000 description 55
- 238000004458 analytical method Methods 0.000 description 9
- 239000003245 coal Substances 0.000 description 7
- 230000000875 corresponding effect Effects 0.000 description 5
- 238000012360 testing method Methods 0.000 description 3
- 238000010801 machine learning Methods 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 206010006187 Breast cancer Diseases 0.000 description 1
- 206010006272 Breast mass Diseases 0.000 description 1
- 208000026310 Breast neoplasm Diseases 0.000 description 1
- 230000002238 attenuated effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 150000001875 compounds Chemical group 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000011478 gradient descent method Methods 0.000 description 1
- 230000001939 inductive effect Effects 0.000 description 1
- 230000003902 lesion Effects 0.000 description 1
- 238000007477 logistic regression Methods 0.000 description 1
- 230000003211 malignant effect Effects 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 239000002243 precursor Substances 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Evolutionary Computation (AREA)
- Theoretical Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Medical Informatics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Computer Hardware Design (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a Newton momentum-based distributed acceleration composite optimization method and system, which are characterized in that on the basis that a plurality of intelligent agents are connected into a non-directional network, a smooth structure and a non-smooth structure are combined to establish an objective function, so that the coverage range of the processed problem is wider, the established model is more accurate, the problem can be converged to a global optimal solution at a linear speed, the convergence speed is higher than that of a similar method by introducing a momentum acceleration item and a gradient tracking item, and the processing speed of large-scale intelligent automation equipment data can be effectively improved.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a Newton momentum-based distributed acceleration composite optimization method and system.
Background
Some optimization problems need to be solved in the fields of machine learning, statistical learning, unmanned aerial vehicle formation navigation, non-inductive sensor networks and the like, and the problems can be solved only through a single intelligent body when the problems are simpler. However, as information technology is continuously developed, in order to obtain more accurate solutions, the size of data to be considered and processed is larger and more accurate problem models need to be established, and the problem models are no longer simple smooth functions capable of representing problems, and may involve problems in a non-smooth form.
Considering the limited computing resources of the existing computer, a single agent cannot easily cope with the optimization problem of the large-scale compound form (smooth + non-smooth), resulting in slow data processing speed of a large number of intelligent automation devices.
Disclosure of Invention
The invention aims to solve the technical problem of the prior art, provides a Newton momentum-based distributed acceleration composite optimization method and system, and can effectively improve the data processing speed of large-scale intelligent automation equipment.
The technical scheme for solving the technical problems is as follows: a Newton momentum-based distributed acceleration composite optimization method comprises the following steps:
s1, connecting a plurality of agents into a non-directional communication network, and establishing an objective function combining a smooth structure and a non-smooth structure based on the plurality of agents:
wherein,is a smooth local objective function known only to agent i>Is a non-smooth local function known only to agent i, x is the set of feasible solutions, m is the number of agents;
s2, each agent calculates local estimation value of each agent and sends the local estimation value to a first neighbor agent, wherein the first neighbor agent is a neighbor agent corresponding to the agent, and the neighbor agents are agents directly communicating between the two agents and are neighbor agents;
s3, the first neighbor agent calculates momentum acceleration items according to the received local estimated values and sends the momentum acceleration items to a second neighbor agent, wherein the second neighbor agent is a neighbor agent of the first neighbor agent;
s4, the second neighbor agent calculates a gradient tracking item according to the momentum acceleration item and sends the gradient tracking item to a third neighbor agent, wherein the third neighbor agent is an agent of the second neighbor agent;
and S5, circulating S2 to S4 until a preset condition is met, and terminating the circulation.
The method has the advantages that on the basis that a plurality of intelligent agents are connected into a non-directional network, the coverage range of the processed problems is wider by establishing the target function combining the smooth structure and the non-smooth structure, the established model is more accurate, the problem can be converged to the global optimal solution at a linear speed, the convergence speed is higher than that of a similar method by introducing the momentum acceleration item and the gradient tracking item, and the processing speed of large-scale intelligent automatic equipment data can be effectively improved.
Further, the calculation process of the local estimation in S2 is:
s201, each agent calculates local optimal solution of each agentThe calculation formula is as follows:
s202, calculating local estimation value of the local optimal solution according to the local optimal solutionThe calculation formula is as follows:
wherein,is->In the form of a sequential convex approximation> Is f i In or on>α is a positive constant step.
The method has the advantages that the variable is updated instead of the target function by using the distributed optimization strategy and utilizing the continuous convex approximation replacement of the target function, so that the method can still solve the fixed point for the target problem when the target problem is not convex, and can converge to the global optimal solution at a linear speed for the problem which can be modeled as the convex function when the introduced step length alpha is positive and smaller than a given upper bound.
Further, the calculation process of the momentum acceleration term in S3 is:
s301, carrying out weighted average on the local estimation values to obtain local average estimation valuesThe calculation formula is as follows:
s302, estimating according to the local averageCalculating the momentum acceleration term according to the following calculation formula:
wherein w ij Is weight, 0 is less than or equal to w ij Is < 1, andbeta is a momentum term parameter.
The method has the advantages that the Newton momentum method is used for calculating the gradient in the steps S301 and S302, and the method has the advantages that under the condition that the updating direction is the same as the previous moment, the convergence speed can be accelerated to a certain extent, the updating direction of the gradient is adjusted, the stability of the distributed optimization method is improved, and the time overhead for solving the global optimal solution is reduced. The similar method also has a common momentum method, but the common momentum method is easy to have the condition of large fluctuation of variable values in the iteration process, and the system is unstable.
Further, the specific calculation formula of the gradient tracking term in S4 is as follows:
The method has the advantages that by the aid of gradient tracking, the local intelligent agent can also track global gradient values, and the situation that the intelligent agent only can master local information and gets into solving a local optimal solution is avoided. Further, w is ij The value rule is as follows:
defining an undirected graphWherein +>Is the intelligent bank set, is asserted>Is a set of edges that are to be considered,is a weighted adjacency matrix in which the weights w for the edges (i, j) ij The following conditions are satisfied: if (i, j) ∈ epsilon, then w ij > 0, otherwise w ij =0,/>Wherein d is i Is the number of neighbor agents for agent i.
A Newton momentum-based distributed acceleration composite optimization system comprises an objective function establishing module and a plurality of intelligent agents which are connected into a directionless communication network;
the objective function establishing module is used for establishing an objective function combining a smooth structure and a non-smooth structure according to the plurality of agents:
wherein,is a smooth local objective function known only to agent i>Is a non-smooth local function known only by agent i, χ is the set of feasible solutions, m is the number of agents;
the intelligent agents are used for calculating local estimation values of the intelligent agents and sending the local estimation values to a first neighbor intelligent agent, the first neighbor intelligent agent is a neighbor intelligent agent corresponding to the intelligent agent, the neighbor intelligent agents are intelligent agents which directly communicate between the two intelligent agents, and the neighbor intelligent agents are neighbor intelligent agents;
the first neighbor agent is used for calculating momentum acceleration items according to the received local estimation values and sending the momentum acceleration items to a second neighbor agent, and the second neighbor agent is a neighbor agent of the first neighbor agent;
the second neighbor agent is used for calculating a gradient tracking item according to the momentum acceleration item and sending the gradient tracking item to a third neighbor agent, and the third neighbor agent is an agent of the second neighbor agent;
the plurality of agents are further configured to loop the local estimates, the momentum acceleration term, and the gradient tracking term until a predetermined condition is met.
Further, the calculation process of the local estimation is as follows:
s201, each agent calculates local optimal solution of each agentThe calculation formula is as follows:
s202, calculating the local estimation value of the local optimal solution according to the local optimal solutionThe calculation formula is as follows:
wherein,is->Successive convex approximation ofOr (iv) is present> Is f i In or on>α is a positive constant step.
The method has the advantages that on the basis that a plurality of intelligent agents are connected into a directionless network, the coverage range of the processed problems is wider by establishing the target function combining the smooth structure and the non-smooth structure, the established model is more accurate, the problem can be converged to the global optimal solution at a linear speed, the convergence speed is higher than that of a similar method by introducing the momentum acceleration item and the gradient tracking item, and the processing speed of large-scale intelligent automatic equipment data can be effectively improved.
Further, the computation process of the momentum acceleration term is as follows:
s301, carrying out weighted average on the local estimation values to obtain local average estimation valuesThe calculation formula is as follows:
s302, estimating according to the local averageCalculating the momentum acceleration term according to the following calculation formula:
wherein w ij Is weight, w is more than or equal to 0 ij Is < 1, andbeta is a momentum term parameter.
The method has the advantages that the continuous convex approximation of the objective function is used for replacing and updating variables instead of the objective function by using a distributed optimization strategy, so that when the objective problem is not convex, the fixed point can still be solved for the objective problem, and when the step length alpha is introduced to be positive and smaller than a given upper bound, the problem which can be modeled into the convex function can be converged to the global optimal solution at a linear speed.
Further, the specific calculation formula of the gradient tracking term is as follows:
The beneficial effect of adopting the above further scheme is that by carrying out gradient tracing, the local agent can also trace the global gradient value, and the situation that the agent falls into solving the local optimal solution because the agent can only master the local information is avoided.
Further, w is ij The value rule is as follows:
defining an undirected graphWherein +>Is the intelligent bank set, is asserted>Is a set of edges that are to be considered,is a weighted adjacency matrix in which the weights w for the edges (i, j) ij The following conditions are satisfied: if (i, j) ∈ then w ij > 0, otherwise w ij =0,/>Wherein d is i Is the number of neighbor agents of agent i.
Reference 1: W.Shi, Q.Ling, G.Wu, and W.yin, "A precursor gradient for localized composition optimization," IEEE Transactions on Signal Processing, vol.63, no.22, pp.6013-6023,2015.
Drawings
FIG. 1 is a graph comparing the convergence of PG-EXTRA according to the present invention;
FIG. 2 is a graph comparing the test accuracy of the present invention with PG-EXTRA;
FIG. 3 is a block diagram of a four-class network in one embodiment;
fig. 4 is a graph comparing the performance of four types of networks using the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived from the embodiments of the present invention by a person skilled in the art, are within the scope of the present invention.
Example 1
A Newton momentum-based distributed acceleration composite optimization method comprises the following steps:
s1, connecting a plurality of agents into a directionless communication network, and establishing an objective function combining a smooth structure and a non-smooth structure based on the plurality of agents:
wherein,is a smooth local objective function known only to agent i>Is a non-smooth local function known only by agent i, χ is the set of feasible solutions, m is the number of agents;
s2, each agent calculates local estimation value of each agent and sends the local estimation value to a first neighbor agent, wherein the first neighbor agent is a neighbor agent corresponding to the agent, and the neighbor agents are agents directly communicating between the two agents and are neighbor agents;
s3, the first neighbor agent calculates momentum acceleration items according to the received local estimated values and sends the momentum acceleration items to a second neighbor agent, wherein the second neighbor agent is a neighbor agent of the first neighbor agent;
s4, the second neighbor agent calculates a gradient tracking item according to the momentum acceleration item and sends the gradient tracking item to a third neighbor agent, wherein the third neighbor agent is an agent of the second neighbor agent;
and S5, circulating S2 to S4 until a preset condition is met, and terminating the circulation.
On the basis that a plurality of agents are connected into a non-directional network, a smooth structure and a non-smooth structure are combined to form an objective function, so that the coverage range of the processed problems is wider, the established model is more accurate, the problem can be converged to a global optimal solution at a linear speed, the convergence speed is higher than that of a similar method by introducing a momentum acceleration item and a gradient tracking item, and the processing speed of large-scale intelligent automatic equipment data can be effectively improved. The intelligent agent is a device with computing capability, storage capability and communication capability, and can be a computer, a server, an unmanned aerial vehicle, an automobile and the like. The corresponding neighbor agent should be understood as: since each agent calculates its own local estimate in S2, each agent transmits a local estimate at the same time, and each agent has its own neighbor agent, i.e., the first neighbor agent. Undirected networks should be understood as: and the connection mode enables a plurality of intelligent agents to mutually send and receive information. The preset conditions include: the iteration number, the running time or the value of the target problem are within a preset interval, and the like. A smooth function is a function of infinite order, continuously derivable within its domain of definition. A non-smooth function is a function that is not infinitely derivable within its domain of definition. The calculation process of the local estimation in the S2 is as follows:
s201, each agent calculates local optimal solution of each agentThe calculation formula is as follows:
s202, calculating local estimation value of the local optimal solution according to the local optimal solutionThe calculation formula is as follows:
wherein,is->In the form of a sequential convex approximation> Is f i In or on>Is a positive constant step.
The method has the advantages that when the target problem is not convex, the fixed point can still be solved for the target problem, and when the step length alpha is introduced to be positive and smaller than a given upper bound, the problem which can be modeled as a convex function can be converged to the global optimal solution at a linear speed.
The calculation process of the momentum acceleration term in S3 is as follows:
s301, carrying out weighted average on the local estimated value to obtain a local average estimated valueThe calculation formula is as follows:
s302, estimating values according to local averageAnd calculating a momentum acceleration term, wherein the calculation formula is as follows:
wherein, w ij Is weight, w is more than or equal to 0 ij Is < 1, andbeta is a momentum term parameter.
In the steps S301 and S302, the gradient is calculated by using a Newton momentum method, and the method has the advantages that under the condition that the updating direction is the same as the previous moment, the convergence speed can be accelerated to a certain extent, the updating direction of the gradient is adjusted, the stability of the distributed optimization method is improved, and the time overhead for solving the global optimal solution is reduced. The similar method also has a common momentum method, but the common momentum method is easy to have the condition of large fluctuation of variable values in the iteration process, and the system is unstable.
In this embodiment:
defining an undirected graphWherein->Is an intelligent agent set, <' > is present>Is a set of edges that are to be considered,is a weighted adjacency matrix in which the weights w for the edges (i, j) ij Satisfying the following condition w if (i, j) ∈ epsilon ij > 0, otherwise w ij =0,/>Wherein d is i Is the number of neighbor agents for agent i, has a self-loop exist, i.e., (i, j) ∈ ε, and has £ bright>Agents i and j can communicate directly if and only if there is an edge (i, j) epsilon.
The specific calculation formula of the gradient tracking term in the S4 is as follows:
By carrying out gradient tracking, the local intelligent agent can also track the global gradient value, and the situation that the intelligent agent only can master local information and gets into the situation of solving a local optimal solution is avoided.
To verify the convergence of the present invention, the following assumptions are made:
assume that 1: (i) Collection ofIs a closed and convex set; (ii) Local objective functionIs first order consecutive, wherein->Is an open set; gradient->In the set->Upper L i Liphoz continuous; (iii) Function->Is convex and may be non-smooth; (iv) Function U is in>The upper boundary is lower boundary.
Assume 2: the function F is mu-strong convex in the set χ, the strong convex is used in optimization, and particularly one of the conditions for ensuring the linear convergence rate of a plurality of algorithms based on the gradient descent method is defined as follows:
it is noted that strong convexity does not require that the function be differentiable from place to place, and when the function is not smooth, the gradient is replaced by a sub-gradient in which strong convexity is more strictly a quadratic term than a normal convex functionThis strongly convex nature is important. Intuitive from a one-dimensional function, a convex function generally only requires that the function curve be above its tangent, and there is little to no requirement for "up", meaning that the curve can "follow" the tangent indefinitely, as long as it remains above it. It goes without saying that in optimization, in particular in gradient optimization, such weak gradient changes make it difficult to achieve fast optimization, possibly with a limited number of times that convergence has not yet been reached. This is also difficult if we take a solution close to the minimum. "very" close is only a qualitative understanding, in which case a bad situation occurs where the optimal solution is very similar but the decision variables differ greatly. At this time, a secondary term is added, so that a secondary lower bound is ensured, the condition of 'clinging' to a tangent line is avoided, and the optimization is simpler.
Assume 3: undirected graph G is connected.
Definition 1: for a function with continuous first order gradientWherein->And the set χ is a closed and convex set. If +>Is continuous and satisfies the condition that (i) for all x e x,(ii) Gradient->Is/>-rishoz continuous; (iii) Function->In the set->Up is>And (4) strong convex. Then the function->Is f i Function>-smooth,. Or>Successive convex approximation alternatives of strong convex, in which ∑ is @>Is referred to as>Partial derivatives in the parameters (x, y).
Assume 4: function(s)Is f i Is/are>Smooth and->Successive convex approximations of strong convex to the substitution function.
And (3) convergence analysis:
introduction 1: let 1-4 be true, for all k ≧ 0 available,
p k+1 ≤σ(α,β)p k +η(α+β)||δ k || 2 (4)
wherein the parameters σ (α, β) and η (α, β) are defined as follows
And (3) proving that: according to the proposed method and p k Definition of (1), to know
By utilizing the continuous property of the Lipruztz,
The combined formulas (8) and (9) are obtained,
Wherein,in the next step the determination will be made>The lower bound of (c). Review->Can be defined by
Using the mu-strong convex nature of the function F, it can be demonstrated that the following holds
And finishing the guiding certification.
2, leading: let hypothesis 1-3 hold, for all k ≧ 0, the following holds
Wherein L is max =max{L i },i∈v
And (3) proving that: according to | | δ k || 2 By definition in Lesion 1, it is understood that
Because of the gradient of the magnetic field, the gradient,is/>-Liphoz continuous, analytically available
And finishing the guiding certification.
And 3, introduction: let hypothesis 3 be true, for all k ≧ 0, the following equation holds
Thus, it is known that
Wherein epsilon s Is greater than 0. And finishing the guiding certification.
And (4) introduction: the following equation holds under the condition that 1 to 4 hold
Wherein epsilon y >0。
Thus, it is possible to obtain
Wherein epsilon y Is greater than 0. And finishing the guiding certification.
And (5) introduction: let 1-4 be true, the following equation holds
Thus, the analysis can be found
Using x * Global optimality of (c) and convexity of G (-) can be obtained
The combination of formulas (26) and (27) is known
And finishing the guiding certification.
And (6) introduction: according to the sequence s k For all k ≧ 0, defineAndwhere z ∈ (0, 1). If S (z) is bounded, | | S k ||=O(z k )。
To analyze the linear convergence speed of the present invention using lemma 6, the following variables were defined:
the next step will be to process the sequence { p ] using the lemmas 1,3-6 k },/> And { | | d k And thus demonstrates linear convergence.
The main results are:
proposition 1: let assumptions 1-4 hold. Considering sigma (alpha), eta (alpha) and two free variables epsilon s > 0 and ε y > 0, for arbitrary
z∈(max{σ(α,β),(1+ε s )((1-β)ρ+β) 2 ,(1+ε y )ρ 2 },1) (29)
The following inequality holds
S K (z)≤G S (α,β,z)D K (z)+R S (31)
Y K (z)≤G Y (β,z)(8S K (z)+2α 2 D K (z))+R Y (32)
D K (z)≤C 1 P K (z)+C 2 K K (z) (33)
Wherein,
and (3) proving that: using theorem 1 and considering s for positive sequences k And z ∈ {0,1}, having
When z ∈ (σ (α, β), 1), the expression (42) is found to hold. Similar to the analysis process for equation (30), equations (31) and (32) hold.
Consider the introduction of 5.3.5 and P k (z) and Y K (z) is defined in
And finishing the guiding certification.
Theorem 1: let assumptions 1-4 hold if α and β satisfy
α∈[min{α * α max },α max ) When the utility model is used, the water is discharged,and when α ∈ (0,min { α) * α max Z =1- α (1- β) M).
And (3) proving that: according to proposition 1, it can be known
D K (z)≤Ω(α,β,z)D K (z) + R (44), wherein,
and is
Using lemma 6, it can be seen that if some parameters exist, thenI.e. omega (alpha, beta, z) < 1, then->Will be at a linear rate O (z) k ) Converge to 0. For this purpose, a suitable parameter is chosen to minimize G P (α,β,z),G S (alpha, beta, z) and G Y (β,z)。
Considering z > σ (α, β), there is therefore a parameter θ > 0 such that
In thatThe minimum value is obtained. In other words, it is possible to provide a high-quality image
Wherein z > ((1- β) ρ + β) 2 . By similar analysis it can be seen
And z > p 2 . Based on the previous analysis, the appropriate 3 variables ε were selected opt ,ε s ,ε y So that the sufficient condition of omega (alpha, beta, z) < 1 becomes
The value range of z is analyzed if
Then
Thus, it can be seen that if α ∈ [ min { α ] * ,α max },α max ) Then the
If α ∈ (0,min { α [) * ,α max }) z =1- α (1- β) M is certified.
In this embodiment, logistic regression simulation experiments are performed based on breast cancer data provided by the UCI machine learning database to verify the effectiveness of the method. Features of this data include Radius (Radius), texture (Texture), circumference (Perimeter), area (Area), and Smoothness (Smoothness) of the nucleus, etc., as calculated from digitized images of breast masses. The experiment is intended to predict whether a patient's condition is malignant based on the sample values given in the data set. The prediction probability can be expressed as
Where c and l are the data and label of the sample, respectively. From 683 data in the dataset, N =200 samples were assigned to m networked agents for trainingRemainder of483 samples were used for the test. The jth data and sample of agent i are @, respectively>And l i,h E { -1,1}, wherein
Based on the model, classifierAbout sample data (c) i,h ,l i,h ) The maximum log-likelihood estimate of (c) is the optimal solution of the following optimization problem:
wherein the regularization termFor avoiding overfitting>For increasing the sparsity of the solution. The residual is defined as ≥ in the following simulation>
In this example, the convergence of the PG-EXTRA method and the proposed method is compared in reference 1. Defining initial valuesAnd &>Setting step length α =0.01, momentum term coefficient β =0.5, and presetting condition as iteration number, setting as 70, it should be understood that different data samplesThe iteration times are different and are set according to actual requirements. A undirected network of m =10 agents is randomly generated with a 70% probability of being able to communicate directly between each pair of agents. The evolution of the residual with respect to the different methods is shown in fig. 1, and the test accuracy is shown in fig. 2. As can be seen from fig. 1, when α =0.01, the convergence rate of the proposed method is faster than that of reference 1, and the data processing speed is greatly improved.
It should be noted that the disclosure in reference 1 is mainly used for comparison with the present invention, and does not disclose the technical contents of the present invention, nor suggest the technical problems and technical solutions solved by the present invention.
In the present embodiment, a network including a star network a, a ring network b, a tree network c, and a fully connected network d as shown in fig. 3 is also studied. Setting an initial value toAnd &>And step size α =0.01 and momentum parameter β =0.5 are set. The performance of the proposed method under each type of network is shown in fig. 4, and the result shows that the convergence speed is higher and the data processing speed is higher when the network is dense.
Example 2
On the basis of the embodiment 1, the Newton momentum-based distributed acceleration composite optimization system comprises an objective function establishing module and a plurality of intelligent agents which are connected into a non-directional communication network;
the target function establishing module is used for establishing a target function combining a smooth structure and a non-smooth structure according to a plurality of agents:
wherein,is a smooth local objective function known only to agent i>Is a non-smooth local function known only by agent i, χ is the set of feasible solutions, m is the number of agents;
the system comprises a plurality of intelligent agents, a first neighbor intelligent agent and a second neighbor intelligent agent, wherein the plurality of intelligent agents are used for calculating local estimated values of the intelligent agents and sending the local estimated values to the first neighbor intelligent agent;
the first neighbor agent is used for calculating momentum acceleration terms according to the received local estimated values and sending the momentum acceleration terms to the second neighbor agent, and the second neighbor agent is a neighbor agent of the first neighbor agent;
the second neighbor agent is used for calculating a gradient tracking item according to the momentum acceleration item and sending the gradient tracking item to a third neighbor agent, and the third neighbor agent is an agent of the second neighbor agent;
the plurality of agents are further configured to loop the local estimates, the momentum acceleration term, and the gradient tracking term until a predetermined condition is met.
In this embodiment, a single agent is a drone with traffic capacity, computing capacity and storage capacity, and a undirected network connected by a plurality of agents means that the agents can communicate with each other. The first neighbor agent, the second neighbor agent and the third neighbor agent are all contained in a plurality of agents, and the target function is solved by the cooperation of the plurality of agents; the preset conditions include: the iteration number, the running time or the value of the target problem are within a preset interval and the like.
The calculation process of the local estimation is as follows:
s201, each agent calculates local optimal solution of each agentThe calculation formula is as follows:
s202, calculating local estimation value of the local optimal solution according to the local optimal solutionThe calculation formula is as follows:
wherein,is->In the form of a successive convex approximation> Is f i Is at>Is a positive constant step.
On the basis that a plurality of intelligent agents are connected into a directionless network, the coverage range of the processed problems is wider by establishing an objective function combining a smooth structure and a non-smooth structure, the established model is more accurate, the problem can be converged to a global optimal solution at a linear speed, the convergence speed is higher than that of a similar method by introducing a momentum acceleration item and a gradient tracking item, and the processing speed of large-scale intelligent automation equipment data can be effectively improved.
The momentum acceleration term is calculated as follows:
s301, carrying out weighted average on the local estimation to obtain local average estimationThe calculation formula is as follows:
s302, estimating according to local averageAnd calculating a momentum acceleration term, wherein the calculation formula is as follows:
wherein, w ij Is weight, 0 is less than or equal to w ij Is < 1, andbeta is a momentum term parameter.
The variable updating is carried out by using a distributed optimization strategy and using continuous convex approximation replacement of the objective function instead of the objective function, so that the advantage that when the objective problem is not convex, the immobile point can still be solved for the objective problem, and when the introduced step length alpha is positive and smaller than a given upper bound, the problem which can be modeled as a convex function can be converged to the global optimal solution at a linear speed.
The specific calculation formula of the gradient tracking term is as follows:
By carrying out gradient tracking, the local agent can also track the global gradient value, and the situation that the local optimal solution is solved because the agent can only master local information is avoided.
w ij The value rule is as follows:
defining an undirected graphWherein->Is the intelligent bank set, is asserted>Is a set of edges that are to be considered,is a weighted adjacency matrix in which the weights w for the edges (i, j) ij Satisfying the following condition w if (i, j) ∈ epsilon ij > 0, otherwise w ij =0,/>Wherein d is i Is the number of neighbor agents for agent i.
In this embodiment, adopt a plurality of unmanned aerial vehicles to solve the problem of target location, every unmanned aerial vehicle can all be regarded as an agent, and specific implementation process is as follows:
a sound source/energy source is firstly drawn up to send signals outwards continuously, a plurality of unmanned aerial vehicles establish an objective function about distance and information intensity according to the received intensity as the volume transmission is attenuated gradually along with the increase of the distance, and the unmanned aerial vehicles are communicated and calculate information to finally obtain the target position so as to realize quick positioning.
Example 3
On the basis of embodiment 1, solve the resource allocation problem with the intelligent generator of many microprocessor control, be intelligent agent at every microprocessor:
for example, assuming that there are several different power generators, the power generators generate power with coal, the relationship between the amount of coal used and the amount of power generated is positively correlated, and each power generator has different utilization rates of coal, some of them have high utilization rates, and some of them have low utilization rates. How to effectively utilize limited coal is the problem solved by the case.
Aiming at the performances of different generators, a mathematical model between the generated energy and the coal consumption is established, and an objective function about the generated energy is obtained, and a function value is the coal consumption. The microprocessors are combined with the specific conditions of the corresponding generators, communication and information calculation are carried out among the microprocessors, and finally the coal consumption of each generator is obtained.
The technical solutions provided by the embodiments of the present invention are described in detail above, and the principles and embodiments of the present invention are explained herein by using specific examples, and the descriptions of the embodiments are only used to help understanding the principles of the embodiments of the present invention; also, to those skilled in the art that changes may be made in the embodiment of the present invention described above without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims.
Claims (10)
1. A Newton momentum-based distributed acceleration composite optimization method is characterized by comprising the following steps:
s1, connecting a plurality of agents into a directionless communication network, and establishing an objective function combining a smooth structure and a non-smooth structure based on the agents:
wherein,is a smooth local objective function known only to agent i>Is a non-smooth local function known only to agent i>Is the set of feasible solutions, m is the number of agents;
s2, each agent calculates local estimation value of each agent and sends the local estimation value to a first neighbor agent, wherein the first neighbor agent is a neighbor agent corresponding to the agent, and the neighbor agents are agents directly communicating between the two agents and are neighbor agents;
s3, the first neighbor agent calculates momentum acceleration items according to the received local estimated values and sends the momentum acceleration items to a second neighbor agent, wherein the second neighbor agent is a neighbor agent of the first neighbor agent;
s4, the second neighbor agent calculates a gradient tracking item according to the momentum acceleration item and sends the gradient tracking item to a third neighbor agent, wherein the third neighbor agent is an agent of the second neighbor agent;
and S5, circulating S2 to S4 until a preset condition is met, and terminating the circulation.
2. The method of claim 1, wherein the local estimation in S2 is calculated by:
s201, each agent calculates local optimal solution of each agentThe calculation formula is as follows:
s202, calculating local estimation value of the local optimal solution according to the local optimal solutionThe calculation formula is as follows:
3. The method of claim 2, wherein the momentum acceleration term in S3 is calculated by:
s301, carrying out weighted average on the local estimation values to obtain local average estimation valuesThe calculation formula is as follows:
s302, estimating according to the local averageCalculating the momentum acceleration term according to the following calculation formula:
5. The method of claim 4, wherein w is ij The value rule is as follows: defining an undirected graphWherein->Is the intelligent bank set, is asserted>Is a side set, is asserted>Is a weighted adjacency matrix in which the weights w for the edges (i, j) ij The following conditions are satisfied: if (i, j) ∈ then w ij > 0, otherwise w ij =0,Wherein d is i Is the number of neighbor agents for agent i.
6. A Newton momentum-based distributed acceleration composite optimization system is characterized by comprising an objective function establishing module and a plurality of agents which are connected into a directionless communication network;
the objective function establishing module is used for establishing an objective function combining a smooth structure and a non-smooth structure according to the plurality of agents:
wherein,is a smooth local objective function known only to agent i>Is a non-smooth local function known only to agent i>Is a feasible solutionM is the number of agents;
the intelligent agents are used for calculating local estimation values of the intelligent agents and sending the local estimation values to a first neighbor intelligent agent, the first neighbor intelligent agent is a neighbor intelligent agent corresponding to the intelligent agent, the neighbor intelligent agents are intelligent agents which directly communicate between the two intelligent agents, and the neighbor intelligent agents are neighbor intelligent agents;
the first neighbor agent is used for calculating momentum acceleration items according to the received local estimation values and sending the momentum acceleration items to a second neighbor agent, and the second neighbor agent is a neighbor agent of the first neighbor agent;
the second neighbor agent is used for calculating a gradient tracking item according to the momentum acceleration item and sending the gradient tracking item to a third neighbor agent, and the third neighbor agent is an agent of the second neighbor agent;
the plurality of agents are further configured to loop the local estimates, the momentum acceleration term, the gradient tracking term until a predetermined condition is met and terminate the loop.
7. The system of claim 6, wherein the local estimate is calculated by:
s201, each agent calculates local optimal solution of each agentThe calculation formula is as follows:
s202, calculating the local estimation value of the local optimal solution according to the local optimal solutionThe calculation formula is as follows:
8. The system of claim 7, wherein the momentum acceleration term is calculated by:
s301, carrying out weighted average on the local estimated value to obtain a local average estimated valueThe calculation formula is as follows:
s302, estimating according to the local averageCalculating the momentum acceleration term according to the following calculation formula:
10. The system of claim 9, wherein w is ij The value rule is as follows: defining an undirected graphWherein->Is the intelligent bank set, is asserted>Is a side set, is asserted>Is a weighted adjacency matrix in which the weights w for the edges (i, j) ij The following conditions are satisfied: if (i, j) ∈ then w ij > 0, otherwise w ij =0,Wherein d is i Is the number of neighbor agents of agent i. />
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010709580.7A CN111950194B (en) | 2020-07-22 | 2020-07-22 | Newton momentum-based distributed acceleration composite optimization method and system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010709580.7A CN111950194B (en) | 2020-07-22 | 2020-07-22 | Newton momentum-based distributed acceleration composite optimization method and system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN111950194A CN111950194A (en) | 2020-11-17 |
CN111950194B true CN111950194B (en) | 2023-04-07 |
Family
ID=73341190
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010709580.7A Active CN111950194B (en) | 2020-07-22 | 2020-07-22 | Newton momentum-based distributed acceleration composite optimization method and system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN111950194B (en) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110933056A (en) * | 2019-11-21 | 2020-03-27 | 博智安全科技股份有限公司 | Anti-attack multi-agent control system and method thereof |
AU2020100842A4 (en) * | 2020-05-26 | 2020-07-02 | Southwest University | An efficient and accelerated distributed algorithm for smart grids |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102393709A (en) * | 2011-10-27 | 2012-03-28 | 上海交通大学 | Optimization method of multi-agent synchronization problem |
US20170337682A1 (en) * | 2016-05-18 | 2017-11-23 | Siemens Healthcare Gmbh | Method and System for Image Registration Using an Intelligent Artificial Agent |
US10642285B2 (en) * | 2016-09-27 | 2020-05-05 | Arizona Board Of Regents On Behalf Of Arizona State University | Systems and methods for dynamics, modeling, simulation and control of mid-flight coupling of quadrotors |
CN111259327A (en) * | 2020-01-15 | 2020-06-09 | 桂林电子科技大学 | Subgraph processing-based optimization method for consistency problem of multi-agent system |
AU2020100078A4 (en) * | 2020-01-16 | 2020-02-13 | Southwest University | A Distributed Generalization and Acceleration Strategy for Convex Optimization Problem |
-
2020
- 2020-07-22 CN CN202010709580.7A patent/CN111950194B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110933056A (en) * | 2019-11-21 | 2020-03-27 | 博智安全科技股份有限公司 | Anti-attack multi-agent control system and method thereof |
AU2020100842A4 (en) * | 2020-05-26 | 2020-07-02 | Southwest University | An efficient and accelerated distributed algorithm for smart grids |
Also Published As
Publication number | Publication date |
---|---|
CN111950194A (en) | 2020-11-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109271015B (en) | Method for reducing energy consumption of large-scale distributed machine learning system | |
Strathmann et al. | Gradient-free Hamiltonian Monte Carlo with efficient kernel exponential families | |
CN110968426B (en) | Edge cloud collaborative k-means clustering model optimization method based on online learning | |
Han et al. | Real-time short-term trajectory prediction based on GRU neural network | |
Han et al. | Network traffic prediction using variational mode decomposition and multi-reservoirs echo state network | |
CN109086291B (en) | Parallel anomaly detection method and system based on MapReduce | |
CN115525038A (en) | Equipment fault diagnosis method based on federal hierarchical optimization learning | |
CN111079827B (en) | Railway data state evaluation method and system | |
CN112883651A (en) | System-level testability design multi-objective optimization method based on improved PBI method | |
Wang et al. | Joint tracking and classification of extended targets using random matrix and Bernoulli filter for time-varying scenarios | |
Jarvenpaa et al. | Batch simulations and uncertainty quantification in Gaussian process surrogate approximate Bayesian computation | |
Zhang et al. | Method of predicting bus arrival time based on MapReduce combining clustering with neural network | |
CN115146478A (en) | Running condition construction method and device based on optimization algorithm and related equipment | |
Zhao et al. | Adaptive swarm intelligent offloading based on digital twin-assisted prediction in VEC | |
CN111159406A (en) | Big data text clustering method and system based on parallel improved K-means algorithm | |
CN111950194B (en) | Newton momentum-based distributed acceleration composite optimization method and system | |
CN116546429B (en) | Vehicle selection method and system in federal learning of Internet of vehicles | |
CN117454416A (en) | Federal learning method and system for air computing network with privacy protection incentive | |
Kim et al. | K-FL: Kalman Filter-Based Clustering Federated Learning Method | |
CN109961085B (en) | Method and device for establishing flight delay prediction model based on Bayesian estimation | |
Wu et al. | Historical information-based differential evolution for dynamic optimization problem | |
CN116192665B (en) | Data processing method, device, computer equipment and storage medium | |
CN113112092A (en) | Short-term probability density load prediction method, device, equipment and storage medium | |
CN112241811A (en) | Method for predicting hierarchical mixed performance of customized product in 'Internet +' environment | |
Gong et al. | A mixture model parameters estimation algorithm for inter-contact times in internet of vehicles |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |