Stochastic conditional gradient methods: from convex minimization to submodular maximization
From MaRDI portal
Recommendations
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Stochastic-lazier-greedy algorithm for monotone non-submodular maximization
- scientific article; zbMATH DE number 7255156
- Online risk-averse submodular maximization
Cites work
- scientific article; zbMATH DE number 5888315 (Why is no real title available?)
- scientific article; zbMATH DE number 3643047 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- A Stochastic Approximation Method
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- A merit function approach to the subgradient method with averaging
- A submodular function minimization algorithm based on the minimum-norm base
- A threshold of ln n for approximating set cover
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- AdWords and generalized online matching
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Ergodic Stochastic Optimization Algorithms for Wireless Communication and Networking
- Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks
- Feasible direction methods for stochastic programming problems
- Global convergence of online limited memory BFGS
- Large-scale machine learning with stochastic gradient descent
- Lectures on Stochastic Programming
- Maximizing Non-monotone Submodular Functions
- Maximizing a monotone submodular function subject to a matroid constraint
- On multiplicative weight updates for concave and submodular function maximization
- Online matching with concave returns
- Optimal approximation for the submodular welfare problem in the value oracle model
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular functions and optimization.
- Submodular maximization by simulated annealing
- Submodular maximization with cardinality constraints
Cited in
(21)- A unified analysis of stochastic gradient‐free Frank–Wolfe methods
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Global optimization for first order Markov random fields with submodular priors
- Efficient projection-free online convex optimization using stochastic gradients
- Using Taylor-approximated gradients to improve the Frank-Wolfe method for empirical risk minimization
- Distributed strategy selection: a submodular set function maximization approach
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- A stochastic non-monotone DR-submodular maximization problem over a convex set
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Maximizing stochastic set function under a matroid constraint from decomposition
- A functional model method for nonconvex nonsmooth conditional stochastic optimization
- A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
- Online non-monotone diminishing return submodular maximization in the bandit setting
- Improved algorithms and novel applications of the FrankWolfe.jl library
- Improved complexities for stochastic conditional gradient methods under interpolation-like conditions
- FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
- Stochastic Variance Reduction for DR-Submodular Maximization
- Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution
- Projection-free decentralized online learning for submodular maximization over time-varying networks
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points
This page was built for publication: Stochastic conditional gradient methods: from convex minimization to submodular maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969174)
