27 citations · 87 across the 12 of their papers we have counts for
4 papers · 1 filter
Discrete Signal Processing on Meet/Join Lattices
Markus Püschel, Bastian Seifert, Chris Wendler
A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices a…
Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases
Chris Wendler, Andisheh Amrollahi, Bastian Seifert +2
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 tha…
Fourier Analysis-based Iterative Combinatorial Auctions
Jakob Weissteiner, Chris Wendler, Sven Seuken +2
Recent advances in Fourier analysis have brought new tools to efficiently represent and learn set functions. In this paper, we bring the power of Fourier analysis to the design of…
Discrete Signal Processing with Set Functions
Markus Püschel, Chris Wendler
Set functions are functions (or signals) indexed by the powerset (set of all subsets) of a finite set N. They are fundamental and ubiquitous in many application domains and have be…