-
```
The following is from a posting by Olivier Grisel. This is something we
should consider learning about and working on.
I wondered if you were aware of the recent developments around sparsity
p…
-
```
The following is from a posting by Olivier Grisel. This is something we
should consider learning about and working on.
I wondered if you were aware of the recent developments around sparsity
p…
-
```
The following is from a posting by Olivier Grisel. This is something we
should consider learning about and working on.
I wondered if you were aware of the recent developments around sparsity
p…
-
Hi!
I was playing a bit with spikecomponents, and I was wondering if someone was already working on it, or if it could be worth it that I add a clustering class (https://github.com/SpikeInterface/s…
-
One of the things that came up during the ImageXD conference, which is also of great interest in our lab, is how to perform dimensionality reductions in Dask particularly on large arrays. These may be…
-
While researching #46 I saw that since `text-embedding-004` the API supports `outputDimensionality` reduction, it's part of the parameter section of the payload: https://cloud.google.com/vertex-ai/gen…
-
Thanks for the wonderful tool!
I was wondering whether it would be okay to perform MILO analysis based on a different latent space and KNN than those used for building the initial UMAP and clusters…
-
For all Mahalanobis metric learners, we should be able to reduce the dimension. For those that optimize the transformation matrix `L`, this can be done explicitely by setting the matrix at init to hav…
-
I think I figured out the general technique for simultaneously finding eigenvalues and eigenvectors for any matrix...numerically.
use power iteration to find largest...this gives both the value and…
-
I recently read about a new non-linear dimensionality reduction algorithm called UMAP ([github](https://github.com/lmcinnes/umap), [arxiv](https://arxiv.org/abs/1802.03426)), which is much faster than…