Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Hosseini, Lucas"'
Autor:
Douze, Matthijs, Guzhva, Alexandr, Deng, Chengqi, Johnson, Jeff, Szilvasy, Gergely, Mazaré, Pierre-Emmanuel, Lomeli, Maria, Hosseini, Lucas, Jégou, Hervé
Vector databases typically manage large collections of embedding vectors. Currently, AI applications are growing rapidly, and so is the number of embeddings that need to be stored and indexed. The Faiss library is dedicated to vector similarity searc
Externí odkaz:
http://arxiv.org/abs/2401.08281
Autor:
Izacard, Gautier, Lewis, Patrick, Lomeli, Maria, Hosseini, Lucas, Petroni, Fabio, Schick, Timo, Dwivedi-Yu, Jane, Joulin, Armand, Riedel, Sebastian, Grave, Edouard
Large language models have shown impressive few-shot results on a wide range of tasks. However, when knowledge is key for such results, as is the case for tasks such as question answering and fact checking, massive parameter counts to store knowledge
Externí odkaz:
http://arxiv.org/abs/2208.03299
Autor:
Petroni, Fabio, Broscheit, Samuel, Piktus, Aleksandra, Lewis, Patrick, Izacard, Gautier, Hosseini, Lucas, Dwivedi-Yu, Jane, Lomeli, Maria, Schick, Timo, Mazaré, Pierre-Emmanuel, Joulin, Armand, Grave, Edouard, Riedel, Sebastian
Verifiability is a core content policy of Wikipedia: claims that are likely to be challenged need to be backed by citations. There are millions of articles available online and thousands of new articles are released each month. For this reason, findi
Externí odkaz:
http://arxiv.org/abs/2207.06220
Autor:
Simhadri, Harsha Vardhan, Williams, George, Aumüller, Martin, Douze, Matthijs, Babenko, Artem, Baranchuk, Dmitry, Chen, Qi, Hosseini, Lucas, Krishnaswamy, Ravishankar, Srinivasa, Gopal, Subramanya, Suhas Jayaram, Wang, Jingdong
Despite the broad range of algorithms for Approximate Nearest Neighbor Search, most empirical evaluations of algorithms have focused on smaller datasets, typically of 1 million points~\citep{Benchmark}. However, deploying recent advances in embedding
Externí odkaz:
http://arxiv.org/abs/2205.03763
Autor:
Izacard, Gautier, Caron, Mathilde, Hosseini, Lucas, Riedel, Sebastian, Bojanowski, Piotr, Joulin, Armand, Grave, Edouard
Recently, information retrieval has seen the emergence of dense retrievers, using neural networks, as an alternative to classical sparse methods based on term-frequency. These models have obtained state-of-the-art results on datasets and tasks where
Externí odkaz:
http://arxiv.org/abs/2112.09118
Autor:
Min, Sewon, Boyd-Graber, Jordan, Alberti, Chris, Chen, Danqi, Choi, Eunsol, Collins, Michael, Guu, Kelvin, Hajishirzi, Hannaneh, Lee, Kenton, Palomaki, Jennimaria, Raffel, Colin, Roberts, Adam, Kwiatkowski, Tom, Lewis, Patrick, Wu, Yuxiang, Küttler, Heinrich, Liu, Linqing, Minervini, Pasquale, Stenetorp, Pontus, Riedel, Sebastian, Yang, Sohee, Seo, Minjoon, Izacard, Gautier, Petroni, Fabio, Hosseini, Lucas, De Cao, Nicola, Grave, Edouard, Yamada, Ikuya, Shimaoka, Sonse, Suzuki, Masatoshi, Miyawaki, Shumpei, Sato, Shun, Takahashi, Ryo, Suzuki, Jun, Fajcik, Martin, Docekal, Martin, Ondrej, Karel, Smrz, Pavel, Cheng, Hao, Shen, Yelong, Liu, Xiaodong, He, Pengcheng, Chen, Weizhu, Gao, Jianfeng, Oguz, Barlas, Chen, Xilun, Karpukhin, Vladimir, Peshterliev, Stan, Okhonko, Dmytro, Schlichtkrull, Michael, Gupta, Sonal, Mehdad, Yashar, Yih, Wen-tau
We review the EfficientQA competition from NeurIPS 2020. The competition focused on open-domain question answering (QA), where systems take natural language questions as input and return natural language answers. The aim of the competition was to bui
Externí odkaz:
http://arxiv.org/abs/2101.00133
Autor:
Izacard, Gautier, Petroni, Fabio, Hosseini, Lucas, De Cao, Nicola, Riedel, Sebastian, Grave, Edouard
Recently, retrieval systems based on dense representations have led to important improvements in open-domain question answering, and related tasks. While very effective, this approach is also memory intensive, as the dense vectors for the whole knowl
Externí odkaz:
http://arxiv.org/abs/2012.15156
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with maximum degr
Externí odkaz:
http://arxiv.org/abs/1601.05580
The notion of left convergent sequences of graphs introduced by Lov\' asz et al. (in relation with homomorphism densities for fixed patterns and Szemer\'edi's regularity lemma) got increasingly studied over the past $10$ years. Recently, Ne\v set\v r
Externí odkaz:
http://arxiv.org/abs/1505.03037
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.