github/concrete
1
1
Fork 0
mirror of https://github.com/zama-ai/concrete.git synced 2026-02-08 19:44:57 -05:00
Code Issues Packages Projects Releases Wiki Activity

docs: Update future_features.md

Browse Source
This commit is contained in:
Jeremy Bradley-Silverio Donato
2022-01-06 17:49:24 +01:00
committed by Benoit Chevallier
parent cb660d89f9
commit be090ddb27
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
docs/user/explanation/future_features.md
View File

@@ -1,14 +1,14 @@
# Future Features
As explained in [this section](fhe_and_framework_limits.md#limits-of-this-project), the **Concrete Numpy** package
is currently in its first version, and quite constrained in term of functionalities. However, the good
news is that we are going to release new versions regularly, where a lot of functionalities will be added progressively.
is currently in its first version, and is sometimes constrained in term of functionalities. However, the good
news is that we are going to release new versions regularly, and more functionality will be added progressively.
In this page, we briefly list what the plans for next versions of **Concrete Numpy** are:
- **better performance**: further versions will contain improved versions of the **Concrete Library**, with faster
execution; also, the **Concrete Compiler** will be improved, to have faster local execution (with multi-threading
for example) and faster production execution (with distribution over a set of machines or use of hardware accelerations)
- **more complete benchmarks**: we will have an extended benchmark, containing lots of functions that one day one would want to compile; then, we will measure the framework progress by tracking the number of successfully compiled functions over time. Also, this public benchmark will be a way for other competing frameworks or technologies to compare fairly with us, in terms of functionality or performance
- **more complete benchmarks**: we will have an extended benchmark, containing lots of functions that you may want to compile; then, we will measure the framework progress by tracking the number of successfully compiled functions over time. Also, this public benchmark will be a way for other competing frameworks or technologies to compare fairly with us, in terms of functionality or performance
- **client/server APIs**: today, the `run` function is performing the key generation, the encryption, the inference and the decryption to allow machine learning practitioners to test both performance and accuracy of FHE friendly models. Soon, we are going to have separated APIs to perform the steps one by one, and thus, a full client / server API
- **serialization**: we are going to add several utils, to serialize ciphertexts or keys
@@ -18,10 +18,10 @@ We will continue to consider our `NPFHECompiler` class (compilation of numpy pro
Our plans to extend machine learning support in the future are:
- **extend support for torch**: having more layers and more complex `forward `patterns, and also having ready to use neural networks and neural network blocks that are compatible with FHE
- **support for other ML frameworks**: we will provide FHE compatible model architectures for classical ML models which will be trainable with popular frameworks such as sklearn. Tools for quantization aware training and FHE compatible algorithms are also in our plans
- **extend support for torch**: having more layers and more complex `forward `patterns, and also having ready-to-use neural networks and neural network blocks that are compatible with FHE
- **support for other ML frameworks**: we will provide FHE compatible model architectures for classical ML models which will be trainable with popular frameworks such as sklearn. Tools for quantization aware training and FHE compatible algorithms are also in our plans.
Also, if you are especially looking for some new feature, you can drop a message to <hello@zama.ai>.
If you are looking for a specific new feature, you can drop a message to <hello@zama.ai>.