The paper proves a faster O(nP ln(1/epsilon)) analysis of Pareto optimization, but its new biased Pareto algorithm relies on an invalid Chernoff step and is not established.
De- terminantal point processes for machine learning.Founda- tions and Trends® in Machine Learning, 5(2–3):123–286,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions
The paper proves a faster O(nP ln(1/epsilon)) analysis of Pareto optimization, but its new biased Pareto algorithm relies on an invalid Chernoff step and is not established.