|
| 1 | +#include "00_main.h" |
| 2 | + |
| 3 | +// Halperin method with aggressive precomputing and optimized memory use |
| 4 | +void center_variables_(mat &V, const vec &w, const list &klist, |
| 5 | + const double &tol, const size_t &maxiter, |
| 6 | + const size_t &interrupt_iter) { |
| 7 | + // Auxiliary variables (fixed) |
| 8 | + const size_t N = V.n_rows; |
| 9 | + const size_t P = V.n_cols; |
| 10 | + const size_t K = klist.size(); |
| 11 | + const double inv_sw = 1.0 / accu(w); |
| 12 | + |
| 13 | + // Auxiliary variables (storage) |
| 14 | + vec x(N), x0(N); |
| 15 | + field<field<uvec>> group_indices(K); |
| 16 | + field<vec> group_inverse_weights(K); |
| 17 | + |
| 18 | + // Precompute indices and inverse weights once |
| 19 | + for (size_t k = 0; k < K; ++k) { |
| 20 | + const list &jlist = klist[k]; |
| 21 | + size_t J = jlist.size(); |
| 22 | + |
| 23 | + field<uvec> indices(J); |
| 24 | + vec inverse_weights(J); |
| 25 | + |
| 26 | + for (size_t j = 0; j < J; ++j) { |
| 27 | + indices(j) = as_uvec(as_cpp<integers>(jlist[j])); |
| 28 | + inverse_weights(j) = 1.0 / accu(w.elem(indices(j))); |
| 29 | + } |
| 30 | + |
| 31 | + group_indices(k) = std::move(indices); |
| 32 | + group_inverse_weights(k) = std::move(inverse_weights); |
| 33 | + } |
| 34 | + |
| 35 | +// Perform Halperin projections, parallelizing columns |
| 36 | +#ifdef _OPENMP |
| 37 | +#pragma omp parallel for schedule(static) num_threads(n_threads) private(x, x0) |
| 38 | +#endif |
| 39 | + for (size_t p = 0; p < P; ++p) { |
| 40 | + x = V.col(p); |
| 41 | + size_t interrupt = interrupt_iter; |
| 42 | + |
| 43 | + for (size_t iter = 0; iter < maxiter; ++iter) { |
| 44 | + if (iter == interrupt) { |
| 45 | + // Only main thread checks for interrupts |
| 46 | +#ifdef _OPENMP |
| 47 | + if (omp_get_thread_num() == 0) { |
| 48 | + check_user_interrupt(); |
| 49 | + } |
| 50 | +#else |
| 51 | + check_user_interrupt(); |
| 52 | +#endif |
| 53 | + interrupt += interrupt_iter; |
| 54 | + } |
| 55 | + |
| 56 | + x0 = x; |
| 57 | + |
| 58 | + // Project onto group means |
| 59 | + for (size_t l = 0; l < K; ++l) { |
| 60 | + const size_t L = group_indices(l).size(); |
| 61 | + for (size_t m = 0; m < L; ++m) { |
| 62 | + const uvec &coords = group_indices(l)(m); |
| 63 | + const double xbar = |
| 64 | + dot(w.elem(coords), x.elem(coords)) * group_inverse_weights(l)(m); |
| 65 | + x.elem(coords) -= xbar; |
| 66 | + } |
| 67 | + } |
| 68 | + |
| 69 | + // Check convergence (correct placement) |
| 70 | + double ratio = dot(abs(x - x0) / (1.0 + abs(x0)), w) * inv_sw; |
| 71 | + if (ratio < tol) { |
| 72 | + break; |
| 73 | + } |
| 74 | + } |
| 75 | + |
| 76 | + // Assign back at convergence |
| 77 | + V.col(p) = std::move(x); |
| 78 | + } |
| 79 | +} |
| 80 | + |
| 81 | +[[cpp11::register]] doubles_matrix<> center_variables_r_( |
| 82 | + const doubles_matrix<> &V_r, const doubles &w_r, const list &klist, |
| 83 | + const double &tol, const int &maxiter, const int &interrupt_iter) { |
| 84 | + mat V = as_Mat(V_r); |
| 85 | + vec w = as_Col(w_r); |
| 86 | + center_variables_(V, w, klist, tol, maxiter, interrupt_iter); |
| 87 | + return as_doubles_matrix(std::move(V)); |
| 88 | +} |
| 89 | + |
| 90 | +// Kaczmarz demeaning |
| 91 | +// void center_variables_(mat &V, const vec &w, const list &klist, |
| 92 | +// const double &tol, const size_t &maxiter, |
| 93 | +// const size_t &interrupt_iter) { |
| 94 | +// // Auxiliary variables (fixed) |
| 95 | +// const size_t P = V.n_cols; |
| 96 | +// const size_t K = klist.size(); |
| 97 | +// const double inv_sw = 1.0 / accu(w); |
| 98 | + |
| 99 | +// // Auxiliary variables (storage) |
| 100 | +// size_t interrupt = static_cast<size_t>(interrupt_iter); |
| 101 | +// uvec coords; |
| 102 | + |
| 103 | +// // Precompute group indices and weights parallelizing over groups |
| 104 | +// field<field<uvec>> group_indices(K); |
| 105 | +// field<vec> group_inverse_weights(K); |
| 106 | + |
| 107 | +// #ifdef _OPENMP |
| 108 | +// #pragma omp parallel for schedule(static, n_threads) |
| 109 | +// #endif |
| 110 | +// for (size_t k = 0; k < K; ++k) { |
| 111 | +// const list &jlist = klist[k]; |
| 112 | +// size_t J = jlist.size(); |
| 113 | + |
| 114 | +// field<uvec> indices(J); |
| 115 | +// vec inverse_weights(J); |
| 116 | + |
| 117 | +// for (size_t j = 0; j < J; ++j) { |
| 118 | +// indices(j) = as_uvec(as_cpp<integers>(jlist[j])); |
| 119 | +// inverse_weights(j) = 1.0 / accu(w.elem(indices(j))); |
| 120 | +// } |
| 121 | + |
| 122 | +// group_indices(k) = std::move(indices); |
| 123 | +// group_inverse_weights(k) = std::move(inverse_weights); |
| 124 | +// } |
| 125 | + |
| 126 | +// // Kaczmarz iterations parallelizing over columns |
| 127 | +// #ifdef _OPENMP |
| 128 | +// #pragma omp parallel for schedule(static, n_threads) |
| 129 | +// #endif |
| 130 | +// for (size_t p = 0; p < P; ++p) { |
| 131 | +// for (size_t iter = 0; iter < maxiter; ++iter) { |
| 132 | +// if (iter == interrupt) { |
| 133 | +// check_user_interrupt(); |
| 134 | +// interrupt += 1000; |
| 135 | +// } |
| 136 | + |
| 137 | +// vec x = V.col(p); |
| 138 | +// vec x0 = x; |
| 139 | +// double ratio; |
| 140 | + |
| 141 | +// for (size_t l = 0; l < K; ++l) { |
| 142 | +// size_t L = group_indices(l).size(); |
| 143 | +// if (L == 0) continue; |
| 144 | + |
| 145 | +// for (size_t m = 0; m < L; ++m) { |
| 146 | +// const uvec &coords = group_indices(l)(m); |
| 147 | +// double xbar = |
| 148 | +// dot(w.elem(coords), x.elem(coords)) / accu(w.elem(coords)); |
| 149 | +// x.elem(coords) -= xbar; |
| 150 | +// } |
| 151 | +// } |
| 152 | + |
| 153 | +// ratio = dot(abs(x - x0) / (1.0 + abs(x0)), w) * inv_sw; |
| 154 | +// if (ratio < tol) { |
| 155 | +// break; |
| 156 | +// } |
| 157 | + |
| 158 | +// V.col(p) = x; |
| 159 | +// } |
| 160 | +// } |
| 161 | +// } |
0 commit comments