Fetching the paper…
Reading the bibliography…
Learning from preference-based feedback has recently gained considerable traction as a promising approach to align generative models with human interests.
“A law of comparative judgment.”
Louis Thurstone · 1927
Earlier work this paper cites.
“Rank analysis of incomplete block designs: I. The method of paired comparisons”
Ralph Bradley and Milton Terry · 1952
Earlier work this paper cites.
“Randomized response: A survey technique for eliminating evasive answer bias”
Stanley Warner · 1965
Earlier work this paper cites.
“The analysis of permutations”
Robin Plackett · 1975
Earlier work this paper cites.
“Assouad, fano, and le cam”
Bin Yu · 1997
Earlier work this paper cites.
“Privacy-preserving logistic regression”
Kamalika Chaudhuri and Claire Monteleoni · 2008
Earlier work this paper cites.
“Differential privacy: A survey of results”
Cynthia Dwork · 2008
Earlier work this paper cites.
“Self-concordant analysis for logistic regression”
Francis Bach · 2010
Earlier work this paper cites.
“Sample complexity bounds for differentially private learning”
Kamalika Chaudhuri and Daniel Hsu · 2011
Earlier work this paper cites.
“Differentially private empirical risk minimization.”
Kamalika Chaudhuri, Claire Monteleoni and Anand Sarwate · 2011
Earlier work this paper cites.
“Lower bounds for the minimax risk using f f -divergences, and applications”
Adityanand Guntuboyina · 2011
Earlier work this paper cites.
“Making gradient descent optimal for strongly convex stochastic optimization”
Alexander Rakhlin, Ohad Shamir and Karthik Sridharan · 2011
Earlier work this paper cites.
“How to analyze paired comparison data”
Kristi Tsukida and Maya Gupta · 2011
Earlier work this paper cites.
“Private convex empirical risk minimization and high-dimensional regression”
Daniel Kifer, Adam Smith and Abhradeep Thakurta · 2012
Earlier work this paper cites.
“Individual choice behavior: A theoretical analysis”
R Luce · 2012
Earlier work this paper cites.
“Private learning and sanitization: Pure vs. approximate differential privacy”
Amos Beimel, Kobbi Nissim and Uri Stemmer · 2013
Earlier work this paper cites.
“Learning with noisy labels”
Nagarajan Natarajan, Inderjit Dhillon, Pradeep Ravikumar and Ambuj Tewari · 2013
Earlier work this paper cites.
“Private empirical risk minimization: Efficient algorithms and tight error bounds”
Raef Bassily, Adam Smith and Abhradeep Thakurta · 2014
Earlier work this paper cites.
“Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence”
Nihar Shah, Sivaraman Balakrishnan, Joseph Bradley, Abhay Parekh, Kannan Ramchandran and Martin Wainwright · 2015
Cited alongside, same era.
“An introduction to matrix concentration inequalities”
Joel Tropp · 2015
Cited alongside, same era.
“On Bayes risk lower bounds”
Xi Chen, Adityanand Guntuboyina and Yuchen Zhang · 2016
Cited alongside, same era.
“Deep reinforcement learning from human preferences”
Paul Christiano, Jan Leike, Tom Brown, Miljan Martic, Shane Legg and Dario Amodei · 2017
Cited alongside, same era.
“Interactive learning from policy-dependent human feedback”
James MacGlashan, Mark Ho, Robert Loftin, Bei Peng, Guan Wang, David Roberts, Matthew Taylor and Michael Littman · 2017
Cited alongside, same era.
“Is interaction necessary for distributed private learning?”
Adam Smith, Abhradeep Thakurta and Jalaj Upadhyay · 2017
“Differentially private fine-tuning of language models”
Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin Inan, Gautam Kamath, Janardhan Kulkarni, Yin Lee, Andre Manoel and Lukas Wutschitz · 2021
Later among the works it cites.
“EW-Tune: A Framework for Privately Fine-Tuning Large Language Models with Differential Privacy”
Rouzbeh Behnia, Mohammadreza Ebrahimi, Jason Pacheco and Balaji Padmanabhan · 2022
Later among the works it cites.
“Shuffle Private Linear Contextual Bandits”
Sayak Chowdhury and Xingyu Zhou · 2022
Later among the works it cites.
“Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation”
Xiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang and Liwei Wang · 2022
Later among the works it cites.
“Label differential privacy via clustering”
Hossein Esfandiari, Vahab Mirrokni, Umar Syed and Sergei Vassilvitskii · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Minimax optimal procedures for locally private estimation”
John Duchi, Michael Jordan and Martin Wainwright · 2018
Cited alongside, same era.
“Differentially private contextual linear bandits”
Roshan Shariff and Or Sheffet · 2018
Cited alongside, same era.
“High-dimensional probability: An introduction with applications in data science”
Roman Vershynin · 2018
Cited alongside, same era.
“Private stochastic convex optimization with optimal rates”
Raef Bassily, Vitaly Feldman, Kunal Talwar and Abhradeep Guha · 2019
Cited alongside, same era.
“Towards practical differentially private convex optimization”
Roger Iyengar, Joseph Near, Dawn Song, Om Thakkar, Abhradeep Thakurta and Lun Wang · 2019
Cited alongside, same era.
“What are the statistical limits of offline RL with linear function approximation?”
Ruosong Wang, Dean Foster and Sham Kakade · 2020
Cited alongside, same era.
Amelia Glaese, Nat McAleese, Maja Trebacz, John Aslanides, Vlad Firoiu, Timo Ewalds, Maribeth Rauh, Laura Weidinger, Martin Chadwick and Phoebe Thacker · 2022
Later among the works it cites.
“Pessimism for Offline Linear Contextual Bandits using lp Confidence Sets”
Gene Li, Cong Ma and Nati Srebro · 2022
Later among the works it cites.
“Training language models to follow instructions with human feedback”
Long Ouyang, Jeffrey Wu, Xu Jiang, Diogo Almeida, Carroll Wainwright, Pamela Mishkin, Chong Zhang, Sandhini Agarwal, Katarina Slama and Alex Ray · 2022
Later among the works it cites.
Ming Yin, Yaqi Duan, Mengdi Wang and Yu-Xiang Wang · 2022
Later among the works it cites.
“Differentially Private and Lazy Online Convex Optimization”
Naman Agarwal, Satyen Kale, Karan Singh and Abhradeep Thakurta · 2023
Closest in time.
“Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning”
T Cai, Yichen Wang and Linjun Zhang · 2023
Closest in time.
“On the sample complexity of estimation in logistic regression”
Daniel Hsu and Arya Mazumdar · 2023
Closest in time.
“Multi-step jailbreaking privacy attacks on ChatGPT”
Haoran Li, Dadi Guo, Wei Fan, Mingshi Xu and Yangqiu Song · 2023
Closest in time.
“Benchmarks and Algorithms for Offline Preference-Based Reward Learning”
Daniel Shin, Anca Dragan and Daniel Brown · 2023
Closest in time.
“Principled Reinforcement Learning with Human Feedback from Pairwise or K K -wise Comparisons”
Banghua Zhu, Jiantao Jiao and Michael Jordan · 2023
Closest in time.
“Provable Offline Reinforcement Learning with Human Feedback”
Wenhao Zhan, Masatoshi Uehara, Nathan Kallus, Jason Lee and Wen Sun · 2023
Closest in time.
“A tail inequality for quadratic forms of subgaussian random vectors”
Daniel Hsu, Sham Kakade and Tong Zhang · 2079
Closest in time.