Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
From MaRDI portal
Recommendations
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Applied multivariate statistical analysis.
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 5888315 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 5485514 (Why is no real title available?)
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Just relax: convex programming methods for identifying sparse signals in noise
- Maximizing a monotone submodular function subject to a matroid constraint
- On the consistency of feature selection using greedy least squares regression
- Optimal approximation for the submodular welfare problem in the value oracle model
- Restricted strong convexity implies weak submodularity
- Sparse Approximate Solutions to Linear Systems
- Stable signal recovery from incomplete and inaccurate measurements
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Cited in
(28)- Restricted strong convexity implies weak submodularity
- Sparse approximate solutions to max-plus equations
- General bounds for incremental maximization
- A discussion on practical considerations with sparse regression methodologies
- Toward a sparsity theory on weighted lattices
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
- Greedy minimization of weakly supermodular set functions
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- A Bidirectional Greedy Heuristic for the Subspace Selection Problem
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
- LATIN 2004: Theoretical Informatics
- Backward sequential elimination for sparse vector subset selection
- Algorithms for maximizing monotone submodular function minus modular function under noise
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- Maximization of nonsubmodular functions under multiple constraints with applications
- Unified Greedy Approximability beyond Submodular Maximization
- Forward-selected panel data approach for program evaluation
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions
- Unified greedy approximability beyond submodular maximization
- Randomized greedy methods for weak submodular sensor selection with robustness considerations
- Incremental-decremental maximization
- Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
- Separating coverage and submodular: maximization subject to a cardinality constraint
- Submodular maximization subject to a knapsack constraint: combinatorial algorithms with near-optimal adaptive complexity
- Efficient parallel algorithm for minimum cost submodular cover problem with lower adaptive complexity
- Online mixed discrete and continuous optimization: algorithms, regret analysis and applications
- Incremental maximization for a broad class of objectives
- Incremental-decremental maximization
This page was built for publication: Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558139)
