convex optimization

RedEx: Beyond Fixed Representation Methods via Convex Optimization ALT 2024 REGLO: Provable Neural Network Repair for Global Robustness Properties AAAI 2024 Regression under demographic parity constraints via unlabeled post-processing NeurIPS 2024 Revisiting the Last-Iterate Convergence of Stochastic Gradient Methods ICLR 2024 Reward Certification for Policy Smoothed Reinforcement Learning AAAI 2024 Robust Reinforcement Learning with General Utility NeurIPS 2024 Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage NeurIPS 2024 Safe dynamic pricing for nonstationary network resource allocation L4DC 2024 Scalable Distance-based Multi-Agent Relative State Estimation via Block Multiconvex Optimization RSS 2024 Scalable Kernel Inverse Optimization NeurIPS 2024 Scaling Convex Neural Networks with Burer-Monteiro Factorization ICLR 2024 Scaling the Convex Barrier with Sparse Dual Algorithms JMLR 2024 Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions NeurIPS 2024 skscope: Fast Sparsity-Constrained Optimization in Python JMLR 2024 SPRINQL: Sub-optimal Demonstrations driven Offline Imitation Learning NeurIPS 2024 Stochastic Newton Proximal Extragradient Method NeurIPS 2024 Superposed Atomic Representation for Robust High-Dimensional Data Recovery of Multiple Low-Dimensional Structures AAAI 2024 The Nyström method for convex loss functions JMLR 2024 The Reliability of OKRidge Method in Solving Sparse Ridge Regression Problems NeurIPS 2024 The Road Less Scheduled NeurIPS 2024 Tighter Convergence Bounds for Shuffled SGD via Primal-Dual Perspective NeurIPS 2024 Tight Rates for Bandit Control Beyond Quadratics NeurIPS 2024 Towards Sharper Risk Bounds for Minimax Problems IJCAI 2024 Towards Tight Convex Relaxations for Contact-Rich Manipulation RSS 2024 Trading off Consistency and Dimensionality of Convex Surrogates for Multiclass Classification NeurIPS 2024