Two-stage BP maximization under p-matroid constraint
From MaRDI portal
Publication:6204535
Parametric inference under constraints (62F30) Quantum computation (81P68) Maximum principles in context of PDEs (35B50) Methods of global Riemannian geometry, including PDE methods; curvature restrictions (53C21) Algorithms for approximation of functions (65D15) Moduli, classification: analytic theory; relations with modular forms (14J15)
Recommendations
Cites work
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- A constrained two-stage submodular maximization
- An analysis of approximations for maximizing submodular set functions—I
- Approximating the least core value and least core of cooperative games with supermodular costs
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- New performance guarantees for the greedy maximization of submodular set functions
- Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
This page was built for publication: Two-stage BP maximization under \(p\)-matroid constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204535)