{"total":15,"rows":[{"id":"2202.12183","title":"Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence","created":"2022-02-24","cited_by_count":22,"area":null},{"id":"2108.00331","title":"Faster Rates of Private Stochastic Convex Optimization","created":"2021-07-31","cited_by_count":12,"area":null},{"id":"2301.13314","title":"Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization","created":"2023-01-30","cited_by_count":11,"area":null},{"id":"2201.06487","title":"Minimax risk classifiers with 0-1 loss","created":"2022-01-17","cited_by_count":9,"area":null},{"id":"2506.06599","title":"Direct Prediction Set Minimization via Bilevel Conformal Classifier Training","created":"2025-06-07","cited_by_count":8,"area":null},{"id":"2207.10751","title":"Federated Learning on Adaptively Weighted Nodes by Bilevel Optimization","created":"2022-07-21","cited_by_count":6,"area":null},{"id":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2402.06271","title":"Adaptive proximal gradient methods are universal without approximation","created":"2024-02-09","cited_by_count":4,"area":null},{"id":"2501.02761","title":"Beyond $\\mathcal{O}(\\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming","created":"2025-01-06","cited_by_count":4,"area":null},{"id":"2402.07108","title":"Decoupling Learning and Decision-Making: Breaking the $\\mathcal{O}(\\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods","created":"2024-02-11","cited_by_count":3,"area":null},{"id":"2111.05530","title":"Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming","created":"2021-11-10","cited_by_count":1,"area":null},{"id":"2502.19764","title":"Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions","created":"2025-02-27","cited_by_count":1,"area":null},{"id":"2502.20414","title":"Transfer Learning through Enhanced Sufficient Representation: Enriching Source Domain Knowledge with Target Data","created":"2025-02-22","cited_by_count":1,"area":null},{"id":"2108.04482","title":"Complexity of Inexact Proximal Point Algorithm for minimizing convex functions with Holderian Growth","created":"2021-08-10","cited_by_count":0,"area":null},{"id":"2305.17323","title":"Some Primal-Dual Theory for Subgradient Methods for Strongly Convex Optimization","created":"2023-05-27","cited_by_count":0,"area":null}],"next_cursor":null}