AUTOMATED SYNCHRONIZATION OF CLONE DIRECTED ACYCLIC GRAPHS

A method is disclosed for synchronization of clone directed acyclic graphs. The method can include identifying a directed acyclic graph (“DAG”) including a plurality of vertices linked in pairwise relationships via a plurality of edges. At least one clone DAG can be created, which at least one clone DAG can be identical to at least a portion of the DAG. For each of the vertices of the DAG, a corresponding clone vertex from the clone vertices of the at least one clone DAG can be identified. Aggregate gradient data can be calculated based on gradient data from each of the clone vertices and its corresponding vertex in the DAG, and at least one weight of the DAG and of the at least one clone DAG can be updated based on the aggregate gradient data.