Fetching the paper…
Reading the bibliography…
We prove in this paper that, perhaps surprisingly, incentivizing data misreporting is not a fatality.
Manipulation of voting schemes: a general result
Allan Gibbard · 1973
Earlier work this paper cites.
Strategy-proofness and arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions
Mark Allen Satterthwaite · 1975
Earlier work this paper cites.
Straightforwardness of game forms with lotteries as outcomes
Allan Gibbard · 1978
Earlier work this paper cites.
Nonmanipulability in two dimensions
K.H. Kim and F.W. Roush · 1984
Earlier work this paper cites.
A theory of the learnable
Leslie G. Valiant · 1984
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
Deterministic edge-preserving regularization in computed imaging
Pierre Charbonnier, Laure Blanc-Féraud, Gilles Aubert, and Michel Barlaud · 1997
Earlier work this paper cites.
The impossibility of strategy-proof clustering
Javier Perote and Olavide Sevilla · 2003
Earlier work this paper cites.
Strategy-proof estimators for simple regression
Javier Perote and Juan Perote-Peña · 2004
Earlier work this paper cites.
Multiple view geometry in computer vision (2. ed.)
Andrew Harltey and Andrew Zisserman · 2006
Earlier work this paper cites.
Robust regression and lasso
Huan Xu, Constantine Caramanis, and Shie Mannor · 2008
Earlier work this paper cites.
Incentive compatible regression learning
Ofer Dekel, Felix Fischer, and Ariel D. Procaccia · 2010
Earlier work this paper cites.
Tight bounds for strategyproof classification
Reshef Meir, Shaull Almagor, Assaf Michaely, and Jeffrey S. Rosenschein · 2011
Earlier work this paper cites.
Introduction to recommender systems handbook
Francesco Ricci, Lior Rokach, and Bracha Shapira · 2011
Earlier work this paper cites.
Algorithms for strategyproof classification
Reshef Meir, Ariel D. Procaccia, and Jeffrey S. Rosenschein · 2012
Earlier work this paper cites.
Dirt cheap web-scale parallel text from the common crawl
Jason R. Smith, Herve Saint-Amand, Magdalena Plamada, Philipp Koehn, Chris Callison-Burch, and Adam Lopez · 2013
Earlier work this paper cites.
The l1 penalized lad estimator for high dimensional linear regression
Lie Wang · 2013
Earlier work this paper cites.
Optimum statistical estimation with strategic data sources
Yang Cai, Constantinos Daskalakis, and Christos H. Papadimitriou · 2015
Earlier work this paper cites.
Strategic classification
Moritz Hardt, Nimrod Megiddo, Christos Papadimitriou, and Mary Wootters · 2016
Earlier work this paper cites.
Machine learning with adversaries: Byzantine tolerant gradient descent
Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, and Julien Stainer · 2017
Earlier work this paper cites.
Best response regression
Omer Ben-Porat and Moshe Tennenholtz · 2017
Cited alongside, same era.
L1-norm error function robustness and outlier regularization
Chris Ding and Bo Jiang · 2017
Cited alongside, same era.
Strategyproof linear regression in high dimensions
Yiling Chen, Chara Podimata, Ariel D. Procaccia, and Nisarg Shah · 2018
Cited alongside, same era.
The hidden vulnerability of distributed learning in byzantium
El Mahdi El Mhamdi, Rachid Guerraoui, and Sébastien Rouault · 2018
Cited alongside, same era.
A voting-based system for ethical decision making
Ritesh Noothigattu, Snehalkumar (Neil) S. Gaikwad, Edmond Awad, Sohan Dsouza, Iyad Rahwan, Pradeep Ravikumar, and Ariel D. Procaccia · 2018
Cited alongside, same era.
From eliza to xiaoice: challenges and opportunities with social chatbots
Personalized federated learning with theoretical guarantees: A model-agnostic meta-learning approach
Alireza Fallah, Aryan Mokhtari, and Asuman E. Ozdaglar · 2020
Later among the works it cites.
Coordinate-wise median: Not bad, not bad, pretty good
Sumit Goel and Wade Hann-Caruthers · 2020
Later among the works it cites.
Lower bounds and optimal algorithms for personalized federated learning
Filip Hanzely, Slavomír Hanzely, Samuel Horváth, and Peter Richtárik · 2020
Later among the works it cites.
Science communication desperately needs more aligned recommendation algorithms
Lê Nguyên Hoang · 2020
Later among the works it cites.
The radicalization risks of GPT-3 and advanced neural language models
Kris McGuffie and Alex Newhouse · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Heung-Yeung Shum, Xiaodong He, and Di Li · 2018
Cited alongside, same era.
Youtube’s ai is the puppet master over most of what you watch
Joan E. Solsman · 2018
Cited alongside, same era.
A little is enough: Circumventing defenses for distributed learning
Gilad Baruch, Moran Baruch, and Yoav Goldberg · 2019
Cited alongside, same era.
The global disinformation order: 2019 global inventory of organised social media manipulation
Samantha Bradshaw and Philip N Howard · 2019
Cited alongside, same era.
Slateq: A tractable decomposition for reinforcement learning with recommendation sets
Eugene Ie, Vihan Jain, Jing Wang, Sanmit Narvekar, Ritesh Agarwal, Rui Wu, Heng-Tze Cheng, Tushar Chandra, and Craig Boutilier · 2019
Cited alongside, same era.
The existential threat from cyber-enabled information warfare
Herbert Lin · 2019
Cited alongside, same era.
Webuildai: Participatory framework for algorithmic governance
Min Kyung Lee, Daniel Kusbit, Anson Kahng, Ji Tae Kim, Xinran Yuan, Allissa Chan, Daniel See, Ritesh Noothigattu, Siheon Lee, Alexandros Psomas, and Ariel D. Procaccia · 2019
Cited alongside, same era.
Online robust regression via SGD on the l1 loss
Scott Pesme and Nicolas Flammarion · 2020
Later among the works it cites.
Fake online reviews: Literature review, synthesis, and directions for future research
Yuanyuan Wu, Eric W. T. Ngai, Pengkun Wu, and Chong Wu · 2020
Later among the works it cites.
On the dangers of stochastic parrots: Can language models be too big?
Emily M. Bender, Timnit Gebru, Angelina McMillan-Major, and Shmargaret Shmitchell · 2021
Closest in time.
Facebook removed over 15 billion fake accounts in 2 years
Lara Dolden · 2021
Closest in time.
Strategyproofness of the geometric median
El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui, and Lê Nguyên Hoang · 2021
Closest in time.
Recommendation algorithms, a neglected opportunity for public health
Lê Nguyên Hoang, Louis Faucon, and El-Mahdi El-Mhamdi · 2021
Closest in time.
Learning from history for byzantine robust optimization
Sai Praneeth Karimireddy, Lie He, and Martin Jaggi · 2021
Closest in time.
Examining autocompletion as a basic concept for interaction with generative AI
Florian Lehmann and Daniel Buschek · 2021
Closest in time.
Collaborative learning in the jungle (decentralized, byzantine, heterogeneous, asynchronous and nonconvex learning)
El Mahdi El Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui, Arsany Guirguis, Lê-Nguyên Hoang, and Sébastien Rouault · 2021
Closest in time.
The disconcerting potential of online disinformation: Persuasive effects of astroturfing comments and three strategies for inoculation against them
Thomas Zerback, Florian Töpfl, and Maria Knöpfle · 2021
Closest in time.
An equivalence between data poisoning and byzantine gradient attacks, 2022
Sadegh Farhadkhani, Rachid Guerraoui, Lê-Nguyên Hoang, and Oscar Villemaud · 2022
Closest in time.
Byzantine-robust learning on heterogeneous datasets via bucketing
Sai Praneeth Karimireddy, Lie He, and Martin Jaggi · 2022
Closest in time.
Tek fog: An app with bjp footprints for cyber troops to automate hate, manipulate trends
Ayushman Kaul and Devesh Kumar · 2022
Closest in time.
Novel L1 regularized extreme learning machine for soft-sensing of an industrial process
Xudong Shi, Qi Kang, Jing An, and MengChu Zhou · 2022
Closest in time.