-
Aizawa, A.; Kohlhase, M.: Mathematical information retrieval (2021)
0.01
0.008009522 = product of:
0.05606665 = sum of:
0.014125523 = weight(_text_:information in 667) [ClassicSimilarity], result of:
0.014125523 = score(doc=667,freq=8.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.27153665 = fieldWeight in 667, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=667)
0.04194113 = weight(_text_:retrieval in 667) [ClassicSimilarity], result of:
0.04194113 = score(doc=667,freq=8.0), product of:
0.08963835 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.029633347 = queryNorm
0.46789268 = fieldWeight in 667, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0546875 = fieldNorm(doc=667)
0.14285715 = coord(2/14)
- Abstract
- We present an overview of the NTCIR Math Tasks organized during NTCIR-10, 11, and 12. These tasks are primarily dedicated to techniques for searching mathematical content with formula expressions. In this chapter, we first summarize the task design and introduce test collections generated in the tasks. We also describe the features and main challenges of mathematical information retrieval systems and discuss future perspectives in the field.
- Series
- ¬The Information retrieval series, vol 43
- Source
- Evaluating information retrieval and access tasks. Eds.: Sakai, T., Oard, D., Kando, N. [https://doi.org/10.1007/978-981-15-5554-1_12]
-
Brown, T.B.; Mann, B.; Ryder, N.; Subbiah, M.; Kaplan, J.; Dhariwal, P.; Neelakantan, A.; Shyam, P.; Sastry, G.; Askell, A.; Agarwal, S.; Herbert-Voss, A.; Krueger, G.; Henighan, T.; Child, R.; Ramesh, A.; Ziegler, D.M.; Wu, J.; Winter, C.; Hesse, C.; Chen, M.; Sigler, E.; Litwin, M.; Gray, S.; Chess, B.; Clark, J.; Berner, C.; McCandlish, S.; Radford, A.; Sutskever, I.; Amodei, D.: Language models are few-shot learners (2020)
0.00
9.962944E-4 = product of:
0.013948122 = sum of:
0.013948122 = weight(_text_:web in 872) [ClassicSimilarity], result of:
0.013948122 = score(doc=872,freq=2.0), product of:
0.09670874 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.029633347 = queryNorm
0.14422815 = fieldWeight in 872, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=872)
0.071428575 = coord(1/14)
- Abstract
- Recent work has demonstrated substantial gains on many NLP tasks and benchmarks by pre-training on a large corpus of text followed by fine-tuning on a specific task. While typically task-agnostic in architecture, this method still requires task-specific fine-tuning datasets of thousands or tens of thousands of examples. By contrast, humans can generally perform a new language task from only a few examples or from simple instructions - something which current NLP systems still largely struggle to do. Here we show that scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuning approaches. Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting. For all tasks, GPT-3 is applied without any gradient updates or fine-tuning, with tasks and few-shot demonstrations specified purely via text interaction with the model. GPT-3 achieves strong performance on many NLP datasets, including translation, question-answering, and cloze tasks, as well as several tasks that require on-the-fly reasoning or domain adaptation, such as unscrambling words, using a novel word in a sentence, or performing 3-digit arithmetic. At the same time, we also identify some datasets where GPT-3's few-shot learning still struggles, as well as some datasets where GPT-3 faces methodological issues related to training on large web corpora. Finally, we find that GPT-3 can generate samples of news articles which human evaluators have difficulty distinguishing from articles written by humans. We discuss broader societal impacts of this finding and of GPT-3 in general.
-
Bager, J.: ¬Die Text-KI ChatGPT schreibt Fachtexte, Prosa, Gedichte und Programmcode (2023)
0.00
7.6474476E-4 = product of:
0.010706427 = sum of:
0.010706427 = product of:
0.032119278 = sum of:
0.032119278 = weight(_text_:22 in 835) [ClassicSimilarity], result of:
0.032119278 = score(doc=835,freq=2.0), product of:
0.103770934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.029633347 = queryNorm
0.30952093 = fieldWeight in 835, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=835)
0.33333334 = coord(1/3)
0.071428575 = coord(1/14)
- Date
- 29.12.2022 18:22:55
-
Rieger, F.: Lügende Computer (2023)
0.00
7.6474476E-4 = product of:
0.010706427 = sum of:
0.010706427 = product of:
0.032119278 = sum of:
0.032119278 = weight(_text_:22 in 912) [ClassicSimilarity], result of:
0.032119278 = score(doc=912,freq=2.0), product of:
0.103770934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.029633347 = queryNorm
0.30952093 = fieldWeight in 912, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0625 = fieldNorm(doc=912)
0.33333334 = coord(1/3)
0.071428575 = coord(1/14)
- Date
- 16. 3.2023 19:22:55
