-
**Is your feature request related to a problem? Please describe.**
It is a common scenario for a database to calculate top-n from a dataset, sort a column and return the Top elements. TopN could use…
-
### Feature
I kindly request the addition of support for the Kronecker-Factored Approximate Curvature (KFAC) optimization technique in LSTM and GRU layers within the existing KFAC Optimizer. Curren…
-
The fast Lomb-Scargle method implemented in ``astropy.stats.LombScargle`` is based on a what is effectively fast nonuniform Fourier transform approximation proposed by Press & Rybicki (1989); the util…
-
Consider the following resources for machine learning, probability, and classic AI
## tagged machine learning
[Wheel/Rail Adhesion State Identification of Heavy-Haul Locomotive Based on Particle…
-
Firstly, I'm rather new around here; I hope this is the correct place for proposing replacement of algorithms. If it isn't, it would be awful kind of someone to point me in the right direction.
###…
-
### Detailed description
Times change
so does the development of algorithms and documentation
Some of the older algorithms existing in this repository do not fit the [contribution guidelines…
-
This task is to implement the multiclass version of the Laplace approximation for GPs. This is based on the soft-max likelihood from #1898 and will be used from the GP multiclass machines from #1900
…
-
The [Biosimulators_mpbn](https://github.com/colomoto/Biosimulators_mpbn) wrapper for [mpbn](https://mpbn.readthedocs.io) implements algorithms which require new KiSAO terms for algorithms and algorit…
-
Because I like computer science these days, here are some computer science algorithm suggestions:
- Data Structures
- Array
- Linked List
- Hash Table
- Stack
- Queue
- Priority Q…
-
## Background
The current implementation has a probability limit of `1 / (2^32-1)` for the integer constructor and a limit of `1 / (2^64)` for the f64 constructor. Assuming a couple nanoseconds per…