Online submodular minimization
From MaRDI portal
Recommendations
Cited in
(22)- Restricted strong convexity implies weak submodularity
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions
- Online Submodular Maximization with Free Disposal
- Online dynamic submodular optimization
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- Kernel-based online regression with canal loss
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- Online learning based on online DCA and application to online classification
- Online Submodular Maximization Problem with Vector Packing Constraint.
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Geometric rescaling algorithms for submodular function minimization
- A low complexity algorithm with \(O(\sqrt{T})\) regret and \(O(1)\) constraint violations for online convex optimization with long term constraints
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Online learning for min-max discrete problems
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD)
- Online risk-averse submodular maximization
- Online Algorithms for Multilevel Aggregation
- Online prediction under submodular constraints
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- scientific article; zbMATH DE number 7525448 (Why is no real title available?)
- Bipartite secret sharing and staircases
This page was built for publication: Online submodular minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405212)
