56 citations · 118 across the 19 of their papers we have counts for
22 papers
Approximating the Permanent with Deep Rejection Sampling
Juha Harviainen, Antti Röyskö, Mikko Koivisto
We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA…
Towards Scalable Bayesian Learning of Causal DAGs
Jussi Viinikka, Antti Hyttinen, Johan Pensar +1
We give methods for Bayesian inference of directed acyclic graphs, DAGs, and the induced causal effects from passively observed complete data. Our methods build on a recent Markov…
Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs
Mikko Koivisto, Antti Röyskö
The zeta and Moebius transforms over the subset lattice of elements and the so-called subset convolution are examples of unary and binary operations on set functions. While the…
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
Per Austrin, Petteri Kaski, Mikko Koivisto +1
Two sets form a Uniquely Decodable Code Pair (UDCP) if every pair , yields a distinct sum , where the addition is over $\mathbb{…
Dense Subset Sum may be the hardest
Per Austrin, Mikko Koivisto, Petteri Kaski +1
The Subset Sum problem asks whether a given set of positive integers contains a subset of elements that sum up to a given target . It is an outstanding open question whether…
Treedy: A Heuristic for Counting and Sampling Subsets
Teppo Niinimaki, Mikko Koivisto
Consider a collection of weighted subsets of a ground set N. Given a query subset Q of N, how fast can one (1) find the weighted sum over all subsets of Q, and (2) sample a subset…