( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Llama: Open and efficient foundation language models

, , , , , , , , , , и . arXiv preprint arXiv:2302.13971, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Timothée Pecatte

Vincent Lacroix

Emil Lacroix

Ophélie Lacroix

Arild Lacroix

 

Другие публикации лиц с тем же именем

Canonical Tensor Decomposition for Knowledge Base Completion, , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 2869-2878. PMLR, (2018)LLaMA: Open and Efficient Foundation Language Models., , , , , , , , , и 4 other автор(ы). CoRR, (2023)Décompositions tensorielles pour la complétion de bases de connaissance. (Tensor decompositions for knowledge base completion).. University of Paris-Est, France, (2020)Mixtral of Experts, , , , , , , , , и 16 other автор(ы). (2024)Pytorch-BigGraph: A Large Scale Graph Embedding System., , , , , , и . MLSys, mlsys.org, (2019)Mistral 7B., , , , , , , , , и 8 other автор(ы). CoRR, (2023)Tensor Decompositions for Temporal Knowledge Base Completion., , и . ICLR, OpenReview.net, (2020)Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs., , , , , , , , и . CoRR, (2022)HyperTree Proof Search for Neural Theorem Proving., , , , , , , и . NeurIPS, (2022)Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs., , , , , , , , и . ICLR, OpenReview.net, (2023)