rjd3highfreq
rjd3highfreq ships whatever the Java side ships, and only occasionally says what that was.
A side-by-side editorial comparison of kernelshap and n1qn1c — release velocity, themes, recent moves, and the top alternatives to consider.
kernelshap makes permutation SHAP practical past eight features, then fixes the kernel weights it had wrong.
kernelshap computes model-agnostic SHAP values in R through Kernel SHAP, permutation SHAP and an exact additive explainer. Version 0.8.0 added a sampling permutation-SHAP algorithm with standard errors and early stopping, lifting the practical feature ceiling past what the exact method allows. Version 0.9.0 then corrected a bug in how kernel weights were computed — exact Kernel SHAP now agrees with exact permutation SHAP — and moved parallelism from foreach to doFuture.
A Fortran-descended optimizer got thread-safe, then found two flags that never worked.
n1qn1c is a quasi-Newton optimization routine translated from Fortran to C, used as a solver backend by the nlmixr2 modeling stack rather than called directly by most users. Its two 2026 releases are a concentrated safety pass: global state converted to thread_local, static removed from local variables in the translated code, integer overflow guards added, and memory leaks closed in the R callback wrappers — plus the gcc-asan and valgrind fixes CRAN asked for.
kernelshap computes model-agnostic SHAP values in R through Kernel SHAP, permutation SHAP and an exact additive explainer. Version 0.8.0 added a sampling permutation-SHAP algorithm with standard errors and early stopping, lifting the practical feature ceiling past what the exact method allows. Version 0.9.0 then corrected a bug in how kernel weights were computed — exact Kernel SHAP now agrees with exact permutation SHAP — and moved parallelism from foreach to doFuture.
Two concerns drive this package: making exact methods reach further, and being demonstrably right. The first shows in the additive explainer, the optional background dataset and the sampling permutation algorithm; the second in unit tests written against Python's shap, credited fixes from outside contributors, and a willingness to ship a correctness fix that changes numbers people have already published. Speed work runs continuously underneath — direct solves replacing the Moore-Penrose pseudo-inverse, roughly 10% less memory.
The 0.6.0 and 0.7.0 notes each promised a stable 1.0.0 that has not arrived; with the weighting bug fixed and parallelism reworked, a 1.0 release is the most plausible next step.
n1qn1c is a quasi-Newton optimization routine translated from Fortran to C, used as a solver backend by the nlmixr2 modeling stack rather than called directly by most users. Its two 2026 releases are a concentrated safety pass: global state converted to thread_local, static removed from local variables in the translated code, integer overflow guards added, and memory leaks closed in the R callback wrappers — plus the gcc-asan and valgrind fixes CRAN asked for.
The package is being hardened for use inside a parallel modeling framework rather than extended. The audit that produced the thread-safety work also surfaced two plain bugs in features users would have assumed worked: restart = TRUE left the mode at 2 instead of 3 because of a typo, and assign = TRUE referenced the wrong field name so the compressed Hessian was never written to the supplied environment. Earlier work points the same direction — the 6.0.1-12 function-pointer interface exists so nlmixr2est does not need resubmission when this package changes.
Expect further memory-safety and sanitizer work rather than algorithmic change; a Fortran-translated numerical core under CRAN's checking regime generates that kind of release indefinitely.
Other Analytics products tracked by Sparkpulse, ranked by recent ship velocity. Each card links to a full editorial trajectory and lets you pivot into a head-to-head comparison with either kernelshap or n1qn1c.
rjd3highfreq ships whatever the Java side ships, and only occasionally says what that was.
audubon's release feed is almost entirely Renovate bumping the JavaScript toolchain behind its Japanese text splitter.
affiner is quietly turning a grid transformation helper into a small computational geometry library.
ageproR spent two years chasing a moving file format, then added the recruitment models that justify the effort.
ledger adds a Rust toolchain fallback, so beancount imports work whether or not the Python tooling is installed.
gridpattern keeps widening its catalogue, and the newest patterns finally use the device's own line rendering.
See all kernelshap alternatives → · See all n1qn1c alternatives →
Latest ship moves from both products, interleaved chronologically. ⚡ = editorial spark.
They serve adjacent needs but don't currently overlap on shipped themes. kernelshap and n1qn1c are shipping at a similar cadence (velocity 0.0 vs 0.0, both within Sparkpulse's "active" band). See the at-a-glance table above for a side-by-side breakdown of velocity, recent sparks, and editorial themes.
Sparkpulse doesn't pick a winner — we score release velocity, not feature parity. kernelshap and n1qn1c are shipping at a similar cadence (velocity 0.0 vs 0.0, both within Sparkpulse's "active" band). For your specific use case, the alternatives sections above list other Analytics products to evaluate alongside.
Top kernelshap alternatives in Analytics are ranked by recent ship velocity. Browse the "kernelshap alternatives" section above for the current picks, or visit /alternatives/kernelshap for the full list with editorial commentary on each.
Top n1qn1c alternatives in Analytics are ranked by recent ship velocity. Browse the "n1qn1c alternatives" section above for the current picks, or visit /alternatives/n1qn1c for the full list with editorial commentary on each.