{"total":28,"rows":[{"id":"2206.08868","title":"A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem","created":"2022-06-17","cited_by_count":17,"area":null},{"id":"2204.06521","title":"Optimizing generalized Gini indices for fairness in rankings","created":"2022-04-02","cited_by_count":13,"area":null},{"id":"2601.21750","title":"FISMO: Fisher-Structured Momentum-Orthogonalized Optimizer","created":"2026-01-29","cited_by_count":11,"area":null},{"id":"2110.14759","title":"Regularized Frank-Wolfe for Dense CRFs: Generalizing Mean Field and Beyond","created":"2021-10-27","cited_by_count":10,"area":null},{"id":"2102.02029","title":"Frank-Wolfe with a Nearest Extreme Point Oracle","created":"2021-02-03","cited_by_count":8,"area":null},{"id":"2203.12633","title":"Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization","created":"2022-03-23","cited_by_count":8,"area":null},{"id":"2110.04243","title":"Heavy Ball Momentum for Conditional Gradient","created":"2021-10-08","cited_by_count":7,"area":null},{"id":"2102.06806","title":"Parameter-free Locally Accelerated Conditional Gradients","created":"2021-02-12","cited_by_count":5,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2102.05134","title":"Local and Global Uniform Convexity Conditions","created":"2021-02-09","cited_by_count":4,"area":null},{"id":"2205.12751","title":"Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization","created":"2022-05-25","cited_by_count":4,"area":null},{"id":"2106.11943","title":"Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes","created":"2021-06-22","cited_by_count":2,"area":null},{"id":"2210.09957","title":"Contextual bandits with concave rewards, and an application to fair ranking","created":"2022-10-18","cited_by_count":2,"area":null},{"id":"2302.12808","title":"Linearization Algorithms for Fully Composite Optimization","created":"2023-02-24","cited_by_count":2,"area":null},{"id":"2402.07772","title":"End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty","created":"2024-02-12","cited_by_count":2,"area":null},{"id":"2202.13212","title":"Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization","created":"2022-02-26","cited_by_count":1,"area":null},{"id":"2402.05252","title":"Learning Fair Ranking Policies via Differentiable Optimization of Ordered Weighted Averages","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2208.13933","title":"Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization","created":"2022-08-30","cited_by_count":0,"area":null},{"id":"2311.11180","title":"Nonsmooth Projection-Free Optimization with Functional Constraints","created":"2023-11-18","cited_by_count":0,"area":null},{"id":"2507.08543","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","created":"2025-07-11","cited_by_count":0,"area":null},{"id":"2511.02821","title":"Accelerated Frank-Wolfe Algorithms: Complementarity Conditions and Sparsity","created":"2025-11-04","cited_by_count":0,"area":null},{"id":"2512.10936","title":"Empirical evaluation of the Frank-Wolfe methods for constructing white-box adversarial attacks","created":"2025-12-11","cited_by_count":0,"area":null},{"id":"2605.08850","title":"Broximal Gradient Descent: A Projection-Free Sister of Projected Gradient Descent","created":"2026-05-09","cited_by_count":0,"area":null},{"id":"2609.24423","title":"Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.33383","title":"Local LMO is Secretly a Projection Method!","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2609.38375","title":"Lower Bounds for Linear-Oracle Online Learning","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.00254","title":"Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2610.13590","title":"Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}