Co-occurring keywords · papers mentioning both
Papers
Revisiting Projection-Free Online Learning with Time-Varying Constraints
AAAI 2025
Faster Projection-Free Augmented Lagrangian Methods via Weak Proximal Oracle
AISTATS 2023
Projection-Free Methods for Solving Nonconvex-Concave Saddle Point Problems
NeurIPS 2023
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem
NeurIPS 2023
Projection-free Online Exp-concave Optimization
COLT 2023
Efficient Projection-Free Online Convex Optimization with Membership Oracle
COLT 2022
High-probability bounds for robust stochastic Frank-Wolfe algorithm
UAI 2022
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees
COLT 2022
Online Boosting with Bandit Feedback
ALT 2021
Parameter-free Locally Accelerated Conditional Gradients
ICML 2021
Revisiting Projection-free Online Learning: the Strongly Convex Case
AISTATS 2021
Boosting Frank-Wolfe by Chasing Gradients
ICML 2020
Efficient Projection-free Algorithms for Saddle Point Problems
NeurIPS 2020
Efficient Projection-Free Online Methods with Stochastic Recursive Gradient
AAAI 2020
Faster Projection-free Online Learning
COLT 2020
Locally Accelerated Conditional Gradients
AISTATS 2020
Self-Concordant Analysis of Frank-Wolfe Algorithms
ICML 2020
Complexities in Projection-Free Stochastic Non-convex Minimization
AISTATS 2019
Projection Free Online Learning over Smooth Sets
AISTATS 2019
Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets
AAAI 2019
Towards Gradient Free and Projection Free Stochastic Optimization
AISTATS 2019
Conditional Accelerated Lazy Stochastic Gradient Descent
ICML 2017
Projection-free Distributed Online Learning in Networks
ICML 2017
Projection Free Rank-Drop Steps
IJCAI 2017
Variance-Reduced and Projection-Free Stochastic Optimization
ICML 2016