Fetching the paper…
Reading the bibliography…
While the flexible capabilities of large language models (LLMs) allow them to answer a range of queries based on existing learned knowledge, information retrieval to augment generation is an important tool to allow LLMs to answer questions on information not included in pre-training data.
Language Models are Few-Shot Learners
Brown, T.; Mann, B.; Ryder, N.; Subbiah, M.; Kaplan, J. D.; 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.; 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.; and Amodei, D. 2020 · 1901
Earlier work this paper cites.
How to share a secret
Shamir, A. 1979 · 1979
Earlier work this paper cites.
Secret sharing scheme realizing general access structure
Ito, M.; Saito, A.; and Nishizeki, T. 1989 · 1989
Earlier work this paper cites.
Privacy-preserving k-means clustering over vertically partitioned data
Vaidya, J.; and Clifton, C. 2003 · 2003
Earlier work this paper cites.
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Jagannathan, G.; and Wright, R. N. 2005 · 2005
Earlier work this paper cites.
Private Information Retrieval Using Trusted Hardware
Wang, S.; Ding, X.; Deng, R. H.; and Bao, F. 2006 · 2006
Earlier work this paper cites.
Scalable and unconditionally secure multiparty computation
Damgård, I.; and Nielsen, J. B. 2007 · 2007
Earlier work this paper cites.
An Efficient PIR Construction Using Trusted Hardware
Yang, Y.; Ding, X.; Deng, R. H.; and Bao, F. 2008 · 2008
Earlier work this paper cites.
Secure computation with fixed-point numbers
Catrina, O.; and Saxena, A. 2010 · 2010
Earlier work this paper cites.
Nearest neighbor search with strong location privacy
Papadopoulos, S.; Bakiras, S.; and Papadias, D. 2010 · 2010
Earlier work this paper cites.
Product Quantization for Nearest Neighbor Search
Jégou, H.; Douze, M.; and Schmid, C. 2011 · 2011
Earlier work this paper cites.
Practical covertly secure MPC for dishonest majority–or: breaking the SPDZ limits
Damgård, I.; Keller, M.; Larraia, E.; Pastro, V.; Scholl, P.; and Smart, N. P. 2013 · 2013
Earlier work this paper cites.
Compacting privacy-preserving k-nearest neighbor search using logic synthesis
Songhori, E. M.; Hussain, S. U.; Sadeghi, A.-R.; and Koushanfar, F. 2015 · 2015
Earlier work this paper cites.
Privacy-preserving search of similar patients in genomic data
Asharov, G.; Halevi, S.; Lindell, Y.; and Rabin, T. 2017 · 2017
Earlier work this paper cites.
Billion-Scale Similarity Search with GPUs
Johnson, J.; Douze, M.; and Jégou, H. 2017 · 2017
Earlier work this paper cites.
Fast large-scale honest-majority MPC for malicious adversaries
Chida, K.; Genkin, D.; Hamada, K.; Ikarashi, D.; Kikuchi, R.; Lindell, Y.; and Nof, A. 2018 · 2018
Cited alongside, same era.
Chameleon: A hybrid secure computation framework for machine learning applications
Riazi, M. S.; Weinert, C.; Tkachenko, O.; Songhori, E. M.; Schneider, T.; and Koushanfar, F. 2018 · 2018
Cited alongside, same era.
Private Nearest Neighbors Classification in Federated Databases
Schoppmann, P.; Gascón, A.; and Balle, B. 2018 · 2018
Cited alongside, same era.
Advances and Open Problems in Federated Learning
Kairouz, P.; McMahan, H. B.; Avent, B.; Bellet, A.; Bennis, M.; Bhagoji, A. N.; Bonawitz, K.; Charles, Z. B.; Cormode, G.; Cummings, R.; D’Oliveira, R. G. L.; Rouayheb, S. Y. E.; Evans, D.; Gardner, J.; Garrett, Z.; Gascón, A.; Ghazi, B.; Gibbons, P. B.; Gruteser, M.; Harchaoui, Z.; He, C.; He, L.; Huo, Z.; Hutchinson, B.; Hsu, J.; Jaggi, M.; Javidi, T.; Joshi, G.; Khodak, M.; Konecný, J.; Korolova, A.; Koushanfar, F.; Koyejo, O.; Lepoint, T.; Liu, Y.; Mittal, P.; Mohri, M.; Nock, R.; Özgür, A.; Pagh, R.; Raykova, M.; Qi, H.; Ramage, D.; Raskar, R.; Song, D. X.; Song, W.; Stich, S. U.; Sun, Z.; Suresh, A. T.; Tramèr, F.; Vepakomma, P.; Wang, J.; Xiong, L.; Xu, Z.; Yang, Q.; Yu, F. X.; Yu, H.; and Zhao, S. 2019 · 2019
Cited alongside, same era.
Efficient homomorphic evaluation of k-NN classifiers
Zuber, M.; and Sirdey, R. 2021 · 2021
Later among the works it cites.
Reasoning over Public and Private Data in Retrieval-Based Systems
Arora, S.; Lewis, P.; Fan, A.; Kahn, J.; and R’e, C. 2022 · 2022
Later among the works it cites.
Can Foundation Models Help Us Achieve Perfect Secrecy?
Arora, S.; and Ré, C. 2022 · 2022
Later among the works it cites.
The-x: Privacy-preserving transformer inference with homomorphic encryption
Chen, T.; Bao, H.; Huang, S.; Dong, L.; Jiao, B.; Jiang, D.; Zhou, H.; Li, J.; and Wei, F. 2022 · 2022
Later among the works it cites.
Large Language Models are Zero-Shot Reasoners
Kojima, T.; Gu, S. S.; Reid, M.; Matsuo, Y.; and Iwasawa, Y. 2022 · 2022
Later among the works it cites.
MPCFormer: fast, performant and private Transformer inference with MPC
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Reimers, N.; and Gurevych, I. 2019 · 2019
Cited alongside, same era.
Blinder–Scalable, Robust Anonymous Committed Broadcast
Abraham, I.; Pinkas, B.; and Yanai, A. 2020 · 2020
Cited alongside, same era.
{ \{ SANNS } \} : Scaling up secure approximate { \{ k-Nearest } \} neighbors search
Chen, H.; Chillotti, I.; Dong, Y.; Poburinnaya, O.; Razenshteyn, I.; and Riazi, M. S. 2020 · 2020
Cited alongside, same era.
Improved primitives for MPC over mixed arithmetic-binary circuits
Escudero, D.; Ghosh, S.; Keller, M.; Rachuri, R.; and Scholl, P. 2020 · 2020
Cited alongside, same era.
Dense Passage Retrieval for Open-Domain Question Answering
Karpukhin, V.; Oğuz, B.; Min, S.; Lewis, P.; Wu, L. Y.; Edunov, S.; Chen, D.; and tau Yih, W. 2020 · 2020
Cited alongside, same era.
Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks
Lewis, P.; Perez, E.; Piktus, A.; Petroni, F.; Karpukhin, V.; Goyal, N.; Kuttler, H.; Lewis, M.; tau Yih, W.; Rocktäschel, T.; Riedel, S.; and Kiela, D. 2020 · 2020
Cited alongside, same era.
Generation-Augmented Retrieval for Open-Domain Question Answering
Mao, Y.; He, P.; Liu, X.; Shen, Y.; Gao, J.; Han, J.; and Chen, W. 2020 · 2020
Cited alongside, same era.
DarkneTZ: towards model privacy at the edge using trusted execution environments
Mo, F.; Shamsabadi, A. S.; Katevas, K.; Demetriou, S.; Leontiadis, I.; Cavallaro, A.; and Haddadi, H. 2020 · 2020
Cited alongside, same era.
Li, D.; Shao, R.; Wang, H.; Guo, H.; Xing, E. P.; and Zhang, H. 2022 · 2022
Later among the works it cites.
Private approximate nearest neighbor search with sublinear communication
Servan-Schreiber, S.; Langowski, S.; and Devadas, S. 2022 · 2022
Later among the works it cites.
Privformer: Privacy-preserving transformer with mpc
Akimoto, Y.; Fukuchi, K.; Akimoto, Y.; and Sakuma, J. 2023 · 2023
Closest in time.
PUMA: Secure Inference of LLaMA-7B in Five Minutes
Dong, Y.; jie Lu, W.; Zheng, Y.; Wu, H.; Zhao, D.; Tan, J.; Huang, Z.; Hong, C.; Wei, T.; and Cheng, W.-C. 2023 · 2023
Closest in time.
Citadel: Enclaves with Strong Microarchitectural Isolation and Secure Shared Memory on a Speculative Out-of-Order Processor
Drean, J.; Gomez-Garcia, M.; Bourgeat, T.; and Devadas, S. 2023 · 2023
Closest in time.
GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models
Eloundou, T.; Manning, S.; Mishkin, P.; and Rock, D. 2023 · 2023
Closest in time.
SIGMA: Secure GPT Inference with Function Secret Sharing
Gupta, K.; Jawalkar, N.; Mukherjee, A.; Chandran, N.; Gupta, D.; Panwar, A.; and Sharma, R. 2023 · 2023
Closest in time.
GPT-4 Technical Report
OpenAI. 2023 · 2023
Closest in time.
Secure Community Transformers: Private Pooled Data for LLMs
South, T.; Zuskind, G.; Mahari, R.; and Hardjono, T. 2023 · 2023
Closest in time.