Lachaux, Marie-Anne
7 papers on CoChat
Most cited papers
- Verified
LLaMA: Open and Efficient Foundation Language Models
Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.-A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al. (2023) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 4,602
- Verified
Llama 2: Open Foundation and Fine-Tuned Chat Models
Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., et al. (2023) · arXiv
Artificial Intelligence in Healthcare and EducationMachine Learning in Healthcare
Cited by 2,604
- Verified
Mistral 7B
Jiang, A. Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D. S., Casas, D. D. L., Bressand, F., Lengyel, G., Lample, G., Saulnier, L., et al. (2023) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 340
- Verified
Mixtral of Experts
Jiang, A. Q., Sablayrolles, A., Roux, A., Mensch, A., Savary, B., Bamford, C., Chaplot, D. S., Casas, D. D. L., Hanna, E. B., Bressand, F., et al. (2024) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 143
- Verified
Unsupervised translation of programming languages
Lachaux, M.-A., Roziere, B., Chanussot, L., & Lample, G. (2020) · arXiv
Software Engineering ResearchNatural Language Processing Techniques
Cited by 83
- Verified
HyperTree Proof Search for Neural Theorem Proving
Lample, G., Lachaux, M.-A., Lavril, T., Martinet, X., Hayat, A., Ebner, G., Rodriguez, A., & Lacroix, T. (2022) · arXiv
Logic, programming, and type systemsLogic, Reasoning, and Knowledge
Cited by 45
- Verified
HyperTree Proof Search for Neural Theorem Proving
Lample, G., Lacroix, T., Lachaux, M.-A., Rodriguez, A., Hayat, A., Lavril, T., Ebner, G., & Martinet, X. (2022) · Advances in Neural Information Processing Systems 35
Logic, programming, and type systemsLogic, Reasoning, and Knowledge
Cited by 45
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free