-
Notifications
You must be signed in to change notification settings - Fork 0
/
dpga_cpu_sparse.py
163 lines (148 loc) · 5.67 KB
/
dpga_cpu_sparse.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
import numpy as np
from mpi4py import MPI
from scipy import linalg
import time
import tensorflow as tf
import sys
import scipy.sparse as sp
from small_world import small_world
import pandas as pd
comm = MPI.COMM_WORLD
rank = comm.Get_rank()
size = comm.Get_size()
stop1 = 1e-4
stop2 = 1e-3
K = 2000
"sparse lasso"
def sparse_matrix(N, n):
#generate sparse lasso problem
m_i = int(n / (2 * N))
np.random.seed(rank)
A_i = sp.rand(m_i, n, 0.1)
np.random.seed(rank)
A_i.data = np.float32(np.random.randn(A_i.nnz))
N_i = A_i.copy()
N_i.data = N_i.data ** 2
A_i = A_i * sp.diags([1 / np.sqrt(np.ravel(N_i.sum(axis=0)))], [0])
np.random.seed(rank)
xi = np.random.randn(n, 1)
np.random.seed(rank)
b_i = A_i * sp.rand(n, 1, 0.1) + 1e-2 * np.random.randn(m_i, 1)
lam = 0.1 * np.max(np.abs(A_i.T.dot(b_i)))
return A_i, b_i, lam, xi
def get_par(N, e, n, A_i):
seed = 0
# get the small world network in G and E matrix
G, E = small_world(N, e, seed)
# get minimum degree of G
d_min = min(np.diag(G))
# get the total number of edges in G
edges = E.shape[0]
# degree of node i in G
d_i = G.diagonal()[rank]
A_i_temp = sp.csr_matrix.todense(A_i)
l_i = (linalg.norm(A_i_temp, 2)) ** 2 # ||A_i||_2^2
#node specific parameter for DPGA
gamma_i = np.sqrt((2.6 * N) / (edges * d_min))
#step size
c_i = (l_i + gamma_i * d_i) ** (-1)
gamma_ii = 0
for j in range(d_i):
gamma_ii += ((gamma_i * gamma_i) / (gamma_i + gamma_i))
gamma_ij = -(gamma_i * gamma_i) / (gamma_i + gamma_i)
pi = np.zeros((n, 1), np.float64)
return G, E, d_i, l_i, gamma_i, c_i, gamma_ii, gamma_ij, pi
def convert_sparse_matrix_to_sparse_tensor(X):
coo = X.tocoo()
indices = np.mat([coo.row, coo.col]).transpose()
return tf.SparseTensor(indices, coo.data, coo.shape)
def graph_cpu_sparse(A_i, lam, c_i, b_i, n_i):
#construct computation graph for proximal gradient operator on node i
tf.reset_default_graph()
with tf.device('/cpu:0'):
A_i = convert_sparse_matrix_to_sparse_tensor(A_i)
lam = tf.constant(lam, dtype=tf.float32, name='lambda')
b_i = tf.constant(b_i, dtype=tf.float32, name='b_i')
c_i = tf.constant(c_i, dtype=tf.float32, name='c_i')
zeros = tf.zeros((1, 1), dtype=tf.float32, name='zeros')
p_i = tf.placeholder(dtype=tf.float32, shape=[n_i, 1], name='p_i')
s_i = tf.placeholder(dtype=tf.float32, shape=[n_i, 1], name='s_i')
x_i = tf.placeholder(dtype=tf.float32, shape=[n_i, 1], name='x_i')
temp = tf.sparse_tensor_dense_matmul(A_i, x_i) - b_i
xbar_i = x_i - c_i * (p_i + s_i + tf.sparse_tensor_dense_matmul(A_i, temp, adjoint_a=True))
prox_i = tf.multiply(tf.sign(xbar_i), tf.maximum(zeros, tf.abs(xbar_i) - lam * c_i))
return prox_i, p_i, s_i, x_i
def sess_run(sess, prox, p, s, x, pi, si, x_i):
x_i = sess.run(prox, feed_dict={p: pi, s: si, x: x_i})
return x_i
def dpga(N, e, n):
A_i, b_i, lam, xi = sparse_matrix(N, n)
G, E, d_i, l_i, gamma_i, c_i, gamma_ii, gamma_ij, pi = get_par(N, e, n, A_i)
t0 = time.time()
x_j = np.zeros((n, d_i), dtype=np.float64)
j = 0
#communicate information with their neighbors
for i in range(E.shape[0]):
if E[i, rank] == 1:
comm.send(xi, dest=(np.where(E[i, :] == -1))[0])
x_j[:, [j]] = comm.recv(source=(np.where(E[i, :] == -1))[0])
j += 1
elif E[i, rank] == -1:
x_j[:, [j]] = comm.recv(source=(np.where(E[i, :] == 1))[0])
comm.send(xi, dest=(np.where(E[i, :] == 1))[0])
j += 1
#get si
si = np.multiply(gamma_ii, xi)
for i in range(d_i):
si += np.multiply(gamma_ij, x_j[:, [i]])
xbar_k = np.zeros((n, K+1), np.float64)
xbar_k[:, [0]] = xi
for i in range(d_i):
xbar_k[:, [0]] += x_j[:, [i]]
xbar_k[:, [0]] = xbar_k[:, [0]]/(d_i + 1)
prox_c, p_c, s_c, x_c = graph_cpu_sparse(A_i, lam, c_i, b_i, n)
sess = tf.InteractiveSession()
for k in range(K):
xi = sess_run(sess, prox_c, p_c, s_c, x_c, pi, si, xi)
j = 0
for i in range(E.shape[0]):
if E[i, rank] == 1:
comm.send(xi, dest=(np.where(E[i, :] == -1))[0])
x_j[:, [j]] = comm.recv(source=(np.where(E[i, :] == -1))[0])
j += 1
elif E[i, rank] == -1:
x_j[:, [j]] = comm.recv(source=(np.where(E[i, :] == 1))[0])
comm.send(xi, dest=(np.where(E[i, :] == 1))[0])
j += 1
#update si
si = np.multiply(gamma_ii, xi)
for i in range(d_i):
si += np.multiply(gamma_ij, x_j[:, [i]])
#update pi
pi += si
xbar_k[:, [k + 1]] = xi
for i in range(d_i):
xbar_k[:, [k+1]] += x_j[:, [i]]
xbar_k[:, [k + 1]] = xbar_k[:, [k + 1]]/(d_i + 1)
eps_1 = linalg.norm((xi - xbar_k[:, [k+1]]), 2)
for i in range(d_i):
eps_1 += linalg.norm((x_j[:, [i]] - xbar_k[:, [k+1]]), 2)
eps_1 = eps_1/((d_i + 1)*np.sqrt(n))
eps_2 = linalg.norm((xbar_k[:, [k+1]]-xbar_k[:, [k]]), 2)/np.sqrt(n)
if eps_1 <= stop1 and eps_2 <= stop2:
print('elapsed time', time.time() - t0)
print('n:', n, 'iterations:', k)
print 'rank', rank
# if rank == 0:
# xopt = pd.DataFrame(xi, columns=list('A'))
# xopt.to_csv('xopt_s.csv')
sys.stdout.flush()
MPI.Finalize()
if __name__ == "__main__":
_, N_str, e_str, n_str = sys.argv
N = int(N_str)
e = int(e_str)
n = int(n_str)
if rank == 0:
print("Nodes:", N, "Add edges:", e, 'size n:', n)
dpga(N, e, n)