12
12
class PDCD_WS :
13
13
r"""Primal-Dual Coordinate Descent solver with working sets.
14
14
15
- It solves::
15
+ It solves
16
+
17
+ .. math::
16
18
17
19
\min_w F(Xw) + G(w)
18
20
19
- using a primal-dual method on the saddle point problem::
20
21
21
- \min_w \max_z <Xw, z> + G(w) - F^*(z)
22
+ using a primal-dual method on the saddle point problem
23
+
24
+ .. math::
25
+
26
+ \min_w \max_z \langle Xw, z \rangle + G(w) - F^*(z)
22
27
23
28
where :math:`F` is the datafit term (:math:`F^*` its Fenchel conjugate)
24
29
and :math:`G` is the penalty term.
@@ -29,11 +34,14 @@ class PDCD_WS:
29
34
The solver is an adaptation of algorithm [1] to working sets [2].
30
35
The working sets are built using a fixed point distance strategy
31
36
where each feature is assigned a score based how much its coefficient varies
32
- when performing a primal update::
37
+ when performing a primal update
38
+
39
+ .. math::
33
40
34
- \text{score}_j = \abs{w_j - prox_{\tau_j, G_j}(w_j - \tau_j <X_j, z>)}
41
+ \mathrm{score}_j = \lvert w_j -
42
+ \mathrm{prox}_{\tau_j, G_j}(w_j - \tau_j \langle X_j, z \rangle) \rvert
35
43
36
- where :maths :`\tau_j` is the primal step associated with the j-th feature.
44
+ where :math :`\tau_j` is the primal step associated with the j-th feature.
37
45
38
46
Parameters
39
47
----------
@@ -46,7 +54,7 @@ class PDCD_WS:
46
54
47
55
dual_init : array, shape (n_samples,) default None
48
56
The initialization of dual variables.
49
- If None, they are initialized as the 0 vector ``np.zeros(n_samples)``.
57
+ If `` None`` , they are initialized as the 0 vector ``np.zeros(n_samples)``.
50
58
51
59
p0 : int, optional
52
60
First working set size.
0 commit comments