Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
From MaRDI portal
Publication:5148398
Recommendations
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- scientific article; zbMATH DE number 7255156
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
Cites work
- A Stochastic Approximation Method
- A submodular function minimization algorithm based on the minimum-norm base
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Conditional gradient sliding for convex optimization
- Determinantal point processes for machine learning
- Deterministic Algorithms for Submodular Maximization Problems
- Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks
- Gradient sliding for composite optimization
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 7064051 (Why is no real title available?)
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Minimizing finite sums with the stochastic average gradient
- On multiplicative weight updates for concave and submodular function maximization
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
- On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
- Online submodular minimization
- Optimal approximation for the submodular welfare problem in the value oracle model
- Reinforcement learning. An introduction
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular functions and optimization.
- Submodular functions: from discrete to continuous domains
- Submodular maximization by simulated annealing
Cited in
(9)- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Improved complexities for stochastic conditional gradient methods under interpolation-like conditions
- Stochastic conditional gradient methods: from convex minimization to submodular maximization
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- A stochastic non-monotone DR-submodular maximization problem over a convex set
- Stochastic Variance Reduction for DR-Submodular Maximization
- Using Taylor-approximated gradients to improve the Frank-Wolfe method for empirical risk minimization
- Maximizing stochastic set function under a matroid constraint from decomposition
- Gradient approximation algorithms for the -OSS + concave function maximization
This page was built for publication: Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148398)
