Fetching the paper…
Reading the bibliography…
Many applications of machine learning on discrete domains, such as learning preference functions in recommender systems or auctions, can be reduced to estimating a set function that is sparse in the Fourier domain.
SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver
Wang, P.-W.; Donti, P. L.; Wilder, B.; and Kolter, Z. 2019 · 1905
Earlier work this paper cites.
Machine Learning-powered Iterative Combinatorial Auctions
Brero, G.; Lubin, B.; and Seuken, S. 2019 · 1911
Earlier work this paper cites.
Differentiation of Blackbox Combinatorial Solvers
Vlastelica, M.; Paulus, A.; Musil, V.; Martius, G.; and Rolínek, M. 2019 · 1912
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions — I
Nemhauser, G. L.; Wolsey, L. A.; and Fisher, M. L. 1978 · 1978
Earlier work this paper cites.
On the Fourier analysis of Boolean functions
Bernasconi, A.; Codenotti, B.; and Simon, J. 1996 · 1996
Earlier work this paper cites.
Discrete Signal Processing with Set Functions
Püschel, M.; and Wendler, C. 2020 · 2001
Earlier work this paper cites.
Fourier Meets Möbius: Fast Subset Convolution
Björklund, A.; Husfeldt, T.; Kaski, P.; and Koivisto, M. 2007 · 2007
Earlier work this paper cites.
Cost-effective Outbreak Detection in Networks
Leskovec, J.; Krause, A.; Guestrin, C.; Faloutsos, C.; VanBriesen, J.; and Glance, N. 2007 · 2007
Earlier work this paper cites.
A brief introduction to Fourier analysis on the Boolean cube
De Wolf, R. 2008 · 2008
Earlier work this paper cites.
Near-optimal Sensor Placements in Gaussian processes: Theory, Efficient Algorithms and Empirical Studies
Krause, A.; Singh, A.; and Guestrin, C. 2008 · 2008
Earlier work this paper cites.
The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms
Ostfeld, A.; Uber, J. G.; Salomons, E.; Berry, J. W.; Hart, W. E.; Phillips, C. A.; Watson, J.-P.; Dorini, G.; Jonkergouw, P.; Kapelan, Z.; et al. 2008 · 2008
Earlier work this paper cites.
Algebraic signal processing theory: Foundation and 1-D time
Püschel, M.; and Moura, J. M. 2008 · 2008
Earlier work this paper cites.
Vector spaces as unions of proper subspaces
Khare, A. 2009 · 2009
Earlier work this paper cites.
Fourier Analysis-based Iterative Combinatorial Auctions
Weissteiner, J.; Wendler, C.; Seuken, S.; Lubin, B.; and Püschel, M. 2020 · 2009
Cited alongside, same era.
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Srinivas, N.; Krause, A.; Kakade, S. M.; and Seeger, M. 2010 · 2010
Cited alongside, same era.
Testing Coverage Functions
Chakrabarty, D.; and Huang, Z. 2012 · 2012
Cited alongside, same era.
Nearly Optimal Sparse Fourier Transform
Hassanieh, H.; Indyk, P.; Katabi, D.; and Price, E. 2012 · 2012
Cited alongside, same era.
Learning Fourier Sparse Set Functions
Stobbe, P.; and Krause, A. 2012 · 2012
Cited alongside, same era.
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
Feldman, V.; Kothari, P.; and Vondrák, J. 2013 · 2013
Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
Cheraghchi, M.; and Indyk, P. 2017 · 2017
Later among the works it cites.
Differentiable Learning of Submodular Models
Djolonga, J.; and Krause, A. 2017 · 2017
Later among the works it cites.
SATS: A Universal Spectrum Auction Test Suite
Weiss, M.; Lubin, B.; and Seuken, S. 2017 · 2017
Later among the works it cites.
Zaheer, M.; Kottur, S.; Ravanbakhsh, S.; Poczos, B.; Salakhutdinov, R. R.; and Smola, A. J. 2017 · 2017
Later among the works it cites.
A Discrete Signal Processing Framework for Set Functions
Püschel, M. 2018 · 2018
Later among the works it cites.
Differentiable Submodular Maximization
Tschiatschek, S.; Sahin, A.; and Krause, A. 2018 · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning pseudo-Boolean k-DNF and Submodular Functions
Raskhodnikova, S.; and Yaroslavtsev, G. 2013 · 2013
Cited alongside, same era.
A Fast Hadamard Transform for Signals with Sub-linear Sparsity
Scheibler, R.; Haghighatshoar, S.; and Vetterli, M. 2013 · 2013
Cited alongside, same era.
Sparse Polynomial Learning and Graph Sketching
Kocaoglu, M.; Shanmugam, K.; Dimakis, A. G.; and Klivans, A. 2014 · 2014
Cited alongside, same era.
Submodular function maximization
Krause, A.; and Golovin, D. 2014 · 2014
Cited alongside, same era.
An Active Learning Framework using Sparse-Graph Codes for Sparse Polynomials and Graph Sketching
Li, X.; and Ramchandran, K. 2015 · 2015
Cited alongside, same era.
Variational Inference in Mixed Probabilistic Submodular Models
Djolonga, J.; Tschiatschek, S.; and Krause, A. 2016 · 2016
Cited alongside, same era.
Later among the works it cites.
Efficiently Learning Fourier Sparse Set Functions
Amrollahi, A.; Zandieh, A.; Kapralov, M.; and Krause, A. 2019 · 2019
Later among the works it cites.
Transparent, Scrutable and Explainable User Models for Personalized Recommendation
Balog, K.; Radlinski, F.; and Arakelyan, S. 2019 · 2019
Later among the works it cites.
Learning from Sets of Items in Recommender Systems
Sharma, M.; Harper, F. M.; and Karypis, G. 2019 · 2019
Later among the works it cites.
Sampling Signals on Meet/Join Lattices
Wendler, C.; and Püschel, M. 2019 · 2019
Later among the works it cites.
Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimization
Buathong, P.; Ginsbourger, D.; and Krityakierne, T. 2020 · 2020
Closest in time.
Deep Learning-powered Iterative Combinatorial Auctions
Weissteiner, J.; and Seuken, S. 2020 · 2020
Closest in time.