{"total":17,"rows":[{"id":"2106.09481","title":"Stochastic Bias-Reduced Gradient Methods","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2106.11938","title":"Robust Regression Revisited: Acceleration and Improved Estimation Rates","created":"2021-06-22","cited_by_count":15,"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":"2106.09920","title":"Being Properly Improper","created":"2021-06-18","cited_by_count":11,"area":null},{"id":"2109.11135","title":"Memory-Efficient Convex Optimization for Self-Dictionary Separable Nonnegative Matrix Factorization: A Frank-Wolfe Approach","created":"2021-09-23","cited_by_count":6,"area":null},{"id":"2202.04026","title":"Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-02-08","cited_by_count":3,"area":null},{"id":"2206.09370","title":"Frank-Wolfe-based Algorithms for Approximating Tyler's M-estimator","created":"2022-06-19","cited_by_count":3,"area":null},{"id":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","cited_by_count":3,"area":null},{"id":"2403.12859","title":"Primal Methods for Variational Inequality Problems with Functional Constraints","created":"2024-03-19","cited_by_count":3,"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":"2107.00472","title":"Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets","created":"2021-06-29","cited_by_count":0,"area":null},{"id":"2206.11523","title":"Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems","created":"2022-06-23","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":"2503.21627","title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","created":"2025-03-27","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":"2610.00254","title":"Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization","created":"2026-09-23","cited_by_count":0,"area":null}],"next_cursor":null}