The following pages link to (Q5405212):
Displayed 15 items.
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD) (Q493732) (← links)
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm (Q1631800) (← links)
- Restricted strong convexity implies weak submodularity (Q1990594) (← links)
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute'' gradient for structured convex optimization (Q2020608) (← links)
- Two approximation algorithms for maximizing nonnegative weakly monotonic set functions (Q2111542) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Kernel-based online regression with canal loss (Q2242215) (← links)
- Geometric Rescaling Algorithms for Submodular Function Minimization (Q4958557) (← links)
- A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints (Q4969032) (← links)
- Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals (Q5214272) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
- Bipartite secret sharing and staircases (Q6124455) (← links)