Fetching the paper…
Reading the bibliography…
Data valuation is an essential task in a data marketplace.
L. Shapely, “A value for n-person games. contributions to the theory of games,” pp. 307–318, 1953
1953
Earlier work this paper cites.
O. Goldreich, “Secure multi-party computation,” Manuscript. Preliminary version , vol. 78, 1998
1998
Earlier work this paper cites.
J. Kleinberg, C. H. Papadimitriou, and P. Raghavan, “On the value of private information,” in Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge , ser. TARK ’01. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2001, p. 249–257
2001
Earlier work this paper cites.
J. Hoffman, E. Tzeng, T. Park, J. Zhu, P. Isola, K. Saenko, A. A. Efros, and T. Darrell, “Cycada: Cycle-consistent adversarial domain adaptation,” in Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018 , ser. Proceedings of Machine Learning Research, J. G. Dy and A. Krause, Eds., vol. 80. PMLR, 2018, pp. 1994–2003. [Online]. Available: http://proceedings.mlr.press/v80/hoffman18a.html
2003
Earlier work this paper cites.
Z.-Q. Zeng, H.-B. Yu, H.-R. Xu, Y.-Q. Xie, and J. Gao, “Fast training support vector machines using parallel sequential minimal optimization,” in 2008 3rd international conference on intelligent system and knowledge engineering , vol. 1. IEEE, 2008, pp. 997–1001
2008
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
Y. LeCun and C. Cortes, “MNIST handwritten digit database,” 2010. [Online]. Available: http://yann.lecun.com/exdb/mnist/
2010
Earlier work this paper cites.
A. Coates, A. Ng, and H. Lee, “An analysis of single-layer networks in unsupervised feature learning,” in Proceedings of the fourteenth international conference on artificial intelligence and statistics . JMLR Workshop and Conference Proceedings, 2011, pp. 215–223
2011
Earlier work this paper cites.
I. Damgård, V. Pastro, N. P. Smart, and S. Zakarias, “Multiparty computation from somewhat homomorphic encryption,” in Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings , ser. Lecture Notes in Computer Science, R. Safavi-Naini and R. Canetti, Eds., vol. 7417. Springer, 2012, pp. 643–662. [Online]. Available: https://doi.org/10.1007/978-3-642-32009-5\_38
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
B. Lin and D. Kifer, “On arbitrage-free pricing for general data queries,” Proc. VLDB Endow. , vol. 7, no. 9, pp. 757–768, 2014. [Online]. Available: http://www.vldb.org/pvldb/vol7/p757-lin.pdf
2014
Earlier work this paper cites.
P. Koutris, P. Upadhyaya, M. Balazinska, B. Howe, and D. Suciu, “Query-based data pricing,” J. ACM , vol. 62, no. 5, pp. 43:1–43:44, 2015. [Online]. Available: https://doi.org/10.1145/2770870
2015
Earlier work this paper cites.
M. Campanelli, R. Gennaro, S. Goldfeder, and L. Nizzardo, “Zero-knowledge contingent payments revisited: Attacks and payments for services,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017 , B. M. Thuraisingham, D. Evans, T. Malkin, and D. Xu, Eds. ACM, 2017, pp. 229–243. [Online]. Available: https://doi.org/10.1145/3133956.3134060
2017
Earlier work this paper cites.
P. W. Koh and P. Liang, “Understanding black-box predictions via influence functions,” in Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017 , ser. Proceedings of Machine Learning Research, D. Precup and Y. W. Teh, Eds., vol. 70. PMLR, 2017, pp. 1885–1894. [Online]. Available: http://proceedings.mlr.press/v70/koh17a.html
2017
Earlier work this paper cites.
M. Zaheer, S. Kottur, S. Ravanbakhsh, B. Póczos, R. Salakhutdinov, and A. J. Smola, “Deep sets,” in Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA , I. Guyon, U. von Luxburg, S. Bengio, H. M. Wallach, R. Fergus, S. V. N. Vishwanathan, and R. Garnett, Eds., 2017, pp. 3391–3401. [Online]. Available: https://proceedings.neurips.cc/paper/2017/hash/f22e4747da1aa27e363d86d40ff442fe-Abstract.html
2017
Cited alongside, same era.
P. Mohassel and Y. Zhang, “Secureml: A system for scalable privacy-preserving machine learning,” in 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-26, 2017 . IEEE Computer Society, 2017, pp. 19–38. [Online]. Available: https://doi.org/10.1109/SP.2017.12
2017
Cited alongside, same era.
J. Liu, M. Juuti, Y. Lu, and N. Asokan, “Oblivious neural network predictions via minionn transformations,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , ser. CCS ’17. New York, NY, USA: Association for Computing Machinery, 2017, p. 619–631. [Online]. Available: https://doi.org/10.1145/3133956.3134056
Y. Li, C. Ye, Y. Hu, I. Morpheus, Y. Guo, C. Zhang, Y. Zhang, Z. Sun, Y. Lu, and H. Wang, “Zkcplus: Optimized fair-exchange protocol supporting practical and flexible data exchange,” in CCS ’21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021 , Y. Kim, J. Kim, G. Vigna, and E. Shi, Eds. ACM, 2021, pp. 3002–3021. [Online]. Available: https://doi.org/10.1145/3460120.3484558
2021
Later among the works it cites.
J. Liu, J. Lou, J. Liu, L. Xiong, J. Pei, and J. Sun, “Dealer: An end-to-end model marketplace with differential privacy,” Proc. VLDB Endow. , vol. 14, no. 6, pp. 957–969, 2021. [Online]. Available: http://www.vldb.org/pvldb/vol14/p957-liu.pdf
2021
Later among the works it cites.
B. Ghazi, N. Golowich, R. Kumar, P. Manurangsi, and C. Zhang, “Deep learning with label differential privacy,” in Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual , M. Ranzato, A. Beygelzimer, Y. N. Dauphin, P. Liang, and J. W. Vaughan, Eds., 2021, pp. 27 131–27 145. [Online]. Available: https://proceedings.neurips.cc/paper/2021/hash/e3a54649aeec04cf1c13907bc6c5c8aa-Abstract.html
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
D. Dua and C. Graff, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
R. Cramer, I. Damgård, D. Escudero, P. Scholl, and C. Xing, “Spd ℤ 2 k \mathbb{Z}2^{k} : Efficient mpc mod 2 k 2^{k} for dishonest majority,” in Advances in Cryptology – CRYPTO 2018 , H. Shacham and A. Boldyreva, Eds. Cham: Springer International Publishing, 2018, pp. 769–798
2018
Cited alongside, same era.
S. Delgado-Segura, C. Pérez-Solà, J. Herrera-Joancomartí, and G. Navarro-Arribas, “Bitcoin private key locked transactions,” Inf. Process. Lett. , vol. 140, pp. 37–41, 2018. [Online]. Available: https://doi.org/10.1016/j.ipl.2018.08.004
2018
Cited alongside, same era.
A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu, “Towards deep learning models resistant to adversarial attacks,” in 6th International Conference on Learning Representations, ICLR 2018, Vancouver, BC, Canada, April 30 - May 3, 2018, Conference Track Proceedings . OpenReview.net, 2018. [Online]. Available: https://openreview.net/forum?id=rJzIBfZAb
2018
Cited alongside, same era.
R. Jia, D. Dao, B. Wang, F. A. Hubis, N. M. Gürel, B. Li, C. Zhang, C. J. Spanos, and D. Song, “Efficient task-specific data valuation for nearest neighbor algorithms,” Proc. VLDB Endow. , vol. 12, no. 11, pp. 1610–1623, 2019. [Online]. Available: http://www.vldb.org/pvldb/vol12/p1610-jia.pdf
2019
Cited alongside, same era.
R. Jia, D. Dao, B. Wang, F. A. Hubis, N. Hynes, N. M. Gürel, B. Li, C. Zhang, D. Song, and C. J. Spanos, “Towards efficient data valuation based on the shapley value,” in The 22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019, 16-18 April 2019, Naha, Okinawa, Japan , ser. Proceedings of Machine Learning Research, K. Chaudhuri and M. Sugiyama, Eds., vol. 89. PMLR, 2019, pp. 1167–1176. [Online]. Available: http://proceedings.mlr.press/v89/jia19a.html
2019
Cited alongside, same era.
A. Ghorbani and J. Y. Zou, “Data shapley: Equitable valuation of data for machine learning,” in Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA , ser. Proceedings of Machine Learning Research, K. Chaudhuri and R. Salakhutdinov, Eds., vol. 97. PMLR, 2019, pp. 2242–2251. [Online]. Available: http://proceedings.mlr.press/v97/ghorbani19c.html
2019
Cited alongside, same era.
L. Chen, P. Koutris, and A. Kumar, “Towards model-based pricing for machine learning in a data marketplace,” in Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019 , P. A. Boncz, S. Manegold, A. Ailamaki, A. Deshpande, and T. Kraska, Eds. ACM, 2019, pp. 1535–1552. [Online]. Available: https://doi.org/10.1145/3299869.3300078
2019
Cited alongside, same era.
K. Nguyen, M. Ambrona, and M. Abe, “WI is almost enough: Contingent payment all over again,” in CCS ’20: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9-13, 2020 , J. Ligatti, X. Ou, J. Katz, and G. Vigna, Eds. ACM, 2020, pp. 641–656. [Online]. Available: https://doi.org/10.1145/3372297.3417888
2020
Cited alongside, same era.
2021
Later among the works it cites.
2021
Later among the works it cites.
Dawex, “Dawex,” https://www.dawex.com/en/
2022
Closest in time.
Datarade, “Datarade,” https://datarade.ai/
2022
Closest in time.
Quandl, “Quandl,” https://data.nasdaq.com/
2022
Closest in time.
Bloomberg, “Bloomberg,” https://www.bloomberg.com/markets/
2022
Closest in time.
BigQuery, “Google bigquery,” https://cloud.google.com/bigquery/
2022
Closest in time.
Hashlock, “Hashlock,” 2022. [Online]. Available: https://en.bitcoin.it/wiki/Hashlock
2022
Closest in time.
Y. Kwon and J. Zou, “Beta shapley: a unified and noise-reduced data valuation framework for machine learning,” in International Conference on Artificial Intelligence and Statistics, AISTATS 2022, 28-30 March 2022, Virtual Event , ser. Proceedings of Machine Learning Research, G. Camps-Valls, F. J. R. Ruiz, and I. Valera, Eds., vol. 151. PMLR, 2022, pp. 8780–8802. [Online]. Available: https://proceedings.mlr.press/v151/kwon22a.html
2022
Closest in time.
2022
Closest in time.
B. Fashion, “Bristol fashion,” https://bit.ly/3aDWBFp, 2022
2022
Closest in time.
Wikipedia, “Spearman’s rank correlation coefficient,” https://bit.ly/3EmUOB3, 2022
2022
Closest in time.
——, “Dirichlet distribution,” https://bit.ly/3cgG9vs, 2022
2022
Closest in time.