scientific article; zbMATH DE number 7255156
From MaRDI portal
Publication:4969210
Authors: Rad Niazadeh, Tim Roughgarden, Joshua R. Wang 
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1805.09480
Title of this publication is not available (Why is that?)
Recommendations
- A stochastic non-monotone DR-submodular maximization problem over a convex set
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- A fast double greedy algorithm for non-monotone DR-submodular function maximization
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
- Improved deterministic algorithms for non-monotone submodular maximization
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
- A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave
- Streaming algorithms for maximizing DR-submodular functions with \(d\)-knapsack constraints
- Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret
Cites Work
- Determinantal point processes for machine learning
- Penalized likelihood regression for generalized linear models with non-quadratic penalties
- An efficient algorithm for determining the convex hull of a finite planar set
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Symmetry and approximability of submodular maximization problems
- Deterministic algorithms for submodular maximization problems
- Learning with submodular functions: a convex optimization perspective
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Online submodular welfare maximization: greedy is optimal
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Online submodular maximization with preemption
Cited In (16)
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- On multiplicative weight updates for concave and submodular function maximization
- DR-submodular function maximization with adaptive stepsize
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- A stochastic non-monotone DR-submodular maximization problem over a convex set
- Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret
- Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
- Online non-monotone diminishing return submodular maximization in the bandit setting
- Auctions with interdependence and SOS: improved approximation
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- A binary search double greedy algorithm for non-monotone DR-submodular maximization
- Stochastic Variance Reduction for DR-Submodular Maximization
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969210)
