Zobrazeno 1 - 10
of 101 228
pro vyhledávání: '"Plain text"'
Autor:
Dennis Tenen
This book challenges the ways we read, write, store, and retrieve information in the digital age. Computers—from electronic books to smart phones—play an active role in our social lives. Our technological choices thus entail theoretical and polit
Retrieval-Augmented Generation (RAG) has been shown to improve knowledge capabilities and alleviate the hallucination problem of LLMs. The Web is a major source of external knowledge used in RAG systems, and many commercial systems such as ChatGPT an
Externí odkaz:
http://arxiv.org/abs/2411.02959
Autor:
Mathew, Yohan, Matthews, Ollie, McCarthy, Robert, Velja, Joan, de Witt, Christian Schroeder, Cope, Dylan, Schoots, Nandi
The rapid proliferation of frontier model agents promises significant societal advances but also raises concerns about systemic risks arising from unsafe interactions. Collusion to the disadvantage of others has been identified as a central form of u
Externí odkaz:
http://arxiv.org/abs/2410.03768
Autor:
Bonds, Chloe E.
Publikováno v:
Mercer Law Review. 2024, Vol. 75 Issue 4, p1343-1358. 16p.
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.
Data contamination has become prevalent and challenging with the rise of models pretrained on large automatically-crawled corpora. For closed models, the training data becomes a trade secret, and even for open models, it is not trivial to detect cont
Externí odkaz:
http://arxiv.org/abs/2305.10160
Recent advancements in large scale text-to-image models have opened new possibilities for guiding the creation of images through human-devised natural language. However, while prior literature has primarily focused on the generation of individual ima
Externí odkaz:
http://arxiv.org/abs/2302.03900
Publikováno v:
Genome Biology, Vol 24, Iss 1, Pp 1-32 (2023)
Abstract We propose a polynomial algorithm computing a minimum plain-text representation of k-mer sets, as well as an efficient near-minimum greedy heuristic. When compressing read sets of large model organisms or bacterial pangenomes, with only a mi
Externí odkaz:
https://doaj.org/article/a58fe2d18cc44bdfa56a3c93873dd863