Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.
Amartya Shankha BiswasTalya EdenRonitt RubinfeldPublished in: CoRR (2021)
Keyphrases
- optimal strategy
- monte carlo
- cost function
- optimization algorithm
- learning algorithm
- search space
- dynamic programming
- decomposition method
- genetic algorithm
- globally optimal
- closed form
- linear programming
- worst case
- upper bound
- probabilistic model
- experimental evaluation
- k means
- preprocessing
- computational complexity
- reinforcement learning