Publication:4969210
From MaRDI portal
Joshua R. Wang, Rad Niazadeh, Tim Roughgarden
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1805.09480
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Auctions with interdependence and SOS: improved approximation, Profit maximization in social networks and non-monotone DR-submodular maximization
Cites Work
- Penalized likelihood regression for generalized linear models with non-quadratic penalties
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- An efficient algorithm for determining the convex hull of a finite planar set
- Symmetry and Approximability of Submodular Maximization Problems
- Determinantal Point Processes for Machine Learning
- Maximizing Non-monotone Submodular Functions
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Deterministic Algorithms for Submodular Maximization Problems
- Online Submodular Maximization with Preemption
- Learning with Submodular Functions: A Convex Optimization Perspective
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Online submodular welfare maximization: Greedy is optimal
