scientific article; zbMATH DE number 6982294

zbMath1437.68200MaRDI QIDQ4558139

David Kempe, Abhimanyu Das

Publication date: 21 November 2018

Full work available at URL: http://jmlr.csail.mit.edu/papers/v19/16-534.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Related Items

Submodular Maximization Subject to a Knapsack Constraint Under Noise Models, Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint, Algorithms for maximizing monotone submodular function minus modular function under noise, Toward a sparsity theory on weighted lattices, 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, A discussion on practical considerations with sparse regression methodologies, Weakly Submodular Function Maximization Using Local Submodularity Ratio., Sparse approximate solutions to max-plus equations, General bounds for incremental maximization

Uses Software

• l1_ls
• foba

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• A note on maximizing a submodular set function subject to a knapsack constraint
• An analysis of the greedy algorithm for the submodular set covering problem
• Restricted strong convexity implies weak submodularity
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• Just relax: convex programming methods for identifying sparse signals in noise
• An analysis of approximations for maximizing submodular set functions—I
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Sparse Approximate Solutions to Linear Systems
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Stable signal recovery from incomplete and inaccurate measurements