Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

MLP: classify in the matrices-based implementation is actually slower #1

Open
Dettorer opened this issue May 1, 2020 · 1 comment
Open

MLP: classify in the matrices-based implementation is actually slower #1

Dettorer opened this issue May 1, 2020 · 1 comment

Comments

@Dettorer
Copy link
Owner

Dettorer commented May 1, 2020 •
edited
Loading 

test bench_classify_mlp   ... bench:         761 ns/iter (+/- 56)
test bench_classify_mmlp  ... bench:       1,154 ns/iter (+/- 50)
Dettorer added a commit that referenced this issue May 10, 2020
@Dettorer
mmlp: use nalgebra instead of ndarray
2d29841 
This is an attempt to improve on issue #1. The performance is slightly
better than with ndarray but still worse than the struct-and-vec
implementation:

```
test bench_classify_mlp   ... bench:         783 ns/iter (+/- 19)
test bench_classify_mmlp  ... bench:       1,058 ns/iter (+/- 26)
```

or at least not enough to beat the structs-and-vecs approach.
@Dettorer
Copy link
Owner Author

with the new nalgebra implementation:

test bench_classify_mlp   ... bench:         783 ns/iter (+/- 19)
test bench_classify_mmlp  ... bench:       1,058 ns/iter (+/- 26)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@Dettorer