-
## Reference
- 2011 [Sequential Model-Based Optimization for General Algorithm Configuration](https://www.cs.ubc.ca/~hutter/papers/10-TR-SMAC.pdf)
- [SMAC3](https://github.com/automl/SMAC3)
## Br…
-
**Prerequisite**: Issue #10 task 3 (so the code doesn't become a disaster to manage)
Currently, all matrices perform multiplication using a slight variant of the naïve `O(n*m)` algorithm. However, …
-
**This is a(n):**
- [x] New algorithm
- [ ] Update to an existing algorithm
- [ ] Error
- [ ] Proposal to the Repository
**Details:**
-
I don't see a lot of testing apart from a few non randomized tests in the `lib.rs` file. The `benches/graphs.rs` file is just benchmarking, not actually testing the correctness of the algorithm, or is…
-
#### Description
The codes [https://github.com/dask/dask-ml/blob/master/dask_ml/decomposition/pca.py](url) and https://github.com/dask/dask-ml/blob/master/dask_ml/decomposition/truncated_svd.py suppo…
-
Handling sparse abundance matrices is tricky because one of the
first steps is to center it, which destroys sparsity. On the other
hand, it could be helpful to use scipy.sparse.svds instead of
np.lina…
-
BestSplitBigCatIter is too slow. Possibly investigate using fully randomized search earlier or "Stochastic Greedy Algorithms: A leaning based approach to combinatorial optimization" [1] as in rf-ace.
…
-
Hi Vasili,
I am investigating the microstructure of materials using Voronoi tesselation based on randomized sphere packing. Your work is well programmed and documented for implementation. Thank you…
-
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad …
-
https://github.com/oasisprotocol/oasis-core/blob/18da8bc49d92a543795246b8bb7fb574df070eec/secret-sharing/src/poly/univariate.rs#L19
Since there is no trimming, adding two polynomials together can r…