Accelerate your Neural Architecture Search (NAS) through fast, reproducible and modular research.
Перейти к файлу
piero2c a9439b1461 fix(prog_eval): load_checkpoint docstring 2023-03-31 13:17:52 -03:00
.github chore(.github): Adds archai as a path for triggering run-notebook-tests. 2023-03-21 14:59:45 -03:00
.vscode fix(supergraph): Adds Shital's fixes for working with FP16. 2023-02-23 09:41:43 -03:00
archai fix(prog_eval): load_checkpoint docstring 2023-03-31 13:17:52 -03:00
confs All-No_pareto functional again 2023-01-21 02:41:49 -08:00
docker chore(docker): Adds a Dockerfile with DeepSpeed and Flash-Attention. 2023-03-20 09:55:03 -03:00
docs Fixing Notebook HTML tables to fit the documentation. 2023-03-28 10:27:27 -03:00
research/lm_eval_harness fix(research): Adds evaluate requirement. 2023-03-28 12:05:32 -03:00
scripts fix(scripts): Improves evaluation with DeepSpeed trainer. 2023-03-28 13:45:55 -03:00
tasks/text_generation fix(text_gen): sets save_pareto_weights to false 2023-03-07 12:09:47 -08:00
tests Merge pull request #199 from microsoft/ds_config_fix 2023-03-24 10:34:31 -03:00
.amltignore fix(root): Fixes typo on readme and .amltignore. 2023-01-31 15:19:00 -03:00
.gitattributes Update .gitattributes 2023-01-02 13:23:23 -03:00
.gitignore add tutorial on multi node search on azure (#195) 2023-03-24 16:30:05 -07:00
AUTHORS.md fix(root): Fixes AUTHORS extension to .md. 2023-02-13 10:04:13 -03:00
CODEOWNERS fix(root): Also prevents research/ and tasks/ from calling every codeowner. 2023-02-13 12:04:04 -03:00
CODE_OF_CONDUCT.md Updated code of conduct, licence, security.md 2020-05-18 03:23:58 -07:00
CONTRIBUTING.md initial 2020-05-18 03:11:07 -07:00
LICENSE chore(archai): Adds updated files. 2022-12-16 16:26:45 -03:00
NOTICE.md Updated notice of cyclic cosine 2022-12-16 16:31:48 -03:00
README.md fix(root): Fixes objectives to search_objectives in readme and quick start doc. 2023-02-27 15:52:46 -03:00
SECURITY.md chore(archai): Adds updated files. 2022-12-16 16:26:45 -03:00
pyproject.toml chore(root): Bumps version for release. 2022-12-16 16:51:13 -03:00
pytest.ini chore(tests): Adds nlp.objectives tests. 2022-12-16 18:42:03 -03:00
setup.cfg chore(scripts): Moves scripts to their corresponding folders. 2023-01-24 14:38:22 -03:00
setup.py add tutorial on multi node search on azure (#195) 2023-03-24 16:30:05 -07:00

README.md

Archai logo

Archai accelerates your Neural Architecture Search (NAS) through fast, reproducible and modular research, enabling the generation of efficient deep networks for various applications.

Release version Open issues Contributors PyPI downloads License

Installation

Archai can be installed through various methods, however, it is recommended to utilize a virtual environment such as conda or pyenv for optimal results.

To install Archai via PyPI, the following command can be executed:

pip install archai

Archai requires Python 3.7+ and PyTorch 1.7.0+ to function properly.

For further information, please consult the installation guide.

Quickstart

In this quickstart example, we will apply Archai in Natural Language Processing to find the optimal Pareto-frontier Transformers' configurations according to a set of objectives.

Creating the Search Space

We start by importing the TransformerFlexSearchSpace class which represents the search space for the Transformer architecture:

from archai.discrete_search.search_spaces.nlp.transformer_flex.search_space import TransformerFlexSearchSpace

space = TransformerFlexSearchSpace("gpt2")

Defining Search Objectives

Next, we define the objectives we want to optimize. In this example, we use NonEmbeddingParamsProxy, TransformerFlexOnnxLatency, and TransformerFlexOnnxMemory to define the objectives:

from archai.discrete_search.api.search_objectives import SearchObjectives
from archai.discrete_search.evaluators.nlp.parameters import NonEmbeddingParamsProxy
from archai.discrete_search.evaluators.nlp.transformer_flex_latency import TransformerFlexOnnxLatency
from archai.discrete_search.evaluators.nlp.transformer_flex_memory import TransformerFlexOnnxMemory

search_objectives = SearchObjectives()
search_objectives.add_objective(
   "non_embedding_params",
   NonEmbeddingParamsProxy(),
   higher_is_better=True,
   compute_intensive=False,
   constraint=(1e6, 1e9),
)
search_objectives.add_objective(
   "onnx_latency",
   TransformerFlexOnnxLatency(space),
   higher_is_better=False,
   compute_intensive=False,
)
search_objectives.add_objective(
   "onnx_memory",
   TransformerFlexOnnxMemory(space),
   higher_is_better=False,
   compute_intensive=False,
)

Initializing the Algorithm

We use the EvolutionParetoSearch algorithm to conduct the search:

from archai.discrete_search.algos.evolution_pareto import EvolutionParetoSearch

algo = EvolutionParetoSearch(
   space,
   search_objectives,
   None,
   "tmp",
   num_iters=5,
   init_num_models=10,
   seed=1234,
)

Finally, we call the search() method to start the NAS process:

algo.search()

The algorithm will iterate through different network architectures, evaluate their performance based on the defined objectives, and ultimately produce a frontier of Pareto-optimal results.

Tasks

To demonstrate and showcase the capabilities/functionalities of Archai, a set of end-to-end tasks are provided:

Documentation

The official documentation also provides a series of notebooks.

Support

If you have any questions or feedback about the Archai project or the open problems in Neural Architecture Search, please feel free to contact us using the following information:

We welcome any questions, feedback, or suggestions you may have and look forward to hearing from you.

Team

Archai has been created and maintained by Shital Shah, Debadeepta Dey, Gustavo de Rosa, Caio Mendes, Piero Kauffmann, Chris Lovett, Allie Del Giorno, Mojan Javaheripi, and Ofer Dekel at Microsoft Research.

Contributions

This project welcomes contributions and suggestions. Most contributions require you to agree to a Contributor License Agreement (CLA) declaring that you have the right to, and actually do, grant us the rights to use your contribution. For details, visit https://cla.microsoft.com.

When you submit a pull request, a CLA-bot will automatically determine whether you need to provide a CLA and decorate the PR appropriately (e.g., label, comment). Simply follow the instructions provided by the bot. You will only need to do this once across all repositories using our CLA.

This project has adopted the Microsoft Open Source Code of Conduct. For more information see the Code of Conduct FAQ or contact opencode@microsoft.com with any additional questions or comments.

Trademark

This project may contain trademarks or logos for projects, products, or services. Authorized use of Microsoft trademarks or logos is subject to and must follow Microsoft's Trademark & Brand Guidelines. Use of Microsoft trademarks or logos in modified versions of this project must not cause confusion or imply Microsoft sponsorship. Any use of third-party trademarks or logos are subject to those third-party's policies.

License

This project is released under the MIT License. Please review the file for more details.