Skip to content

Conversation

@rosecers
Copy link
Collaborator

…CUR where you compute the pi score every n iterations, where if n=0 pi is never recomputed, and the default is n=1

This was requested by @eae32 and @victorprincipe in order to reduce the cost of CUR selection by recomputing pi only every so often (basically an accepted loss in performance for a gain in computational efficiency)

@rosecers rosecers force-pushed the feat/flexible_recompute branch from 945a266 to 6d7378d Compare May 20, 2022 10:56
@hurricane642 hurricane642 self-requested a review May 20, 2022 14:34
@victorprincipe victorprincipe force-pushed the feat/flexible_recompute branch from 0e35cb1 to 564fb61 Compare May 23, 2022 17:45
rosecers and others added 4 commits May 25, 2022 15:35
…UR where you compute the pi score every n iterations, where if n=0 pi is never recomputed, and the default is n=1
Co-authored-by: Sergei Kliavinek <klyavinekss@gmail.com>

Update skcosmo/_selection.py

Co-authored-by: Sergei Kliavinek <klyavinekss@gmail.com>
@rosecers rosecers force-pushed the feat/flexible_recompute branch from 564fb61 to a141672 Compare May 25, 2022 13:35
@rosecers rosecers merged commit 777ef41 into main Jun 16, 2022
@rosecers rosecers deleted the feat/flexible_recompute branch June 16, 2022 10:13
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants