Convex Optimization

Minimizing Convex Functionals over Space of Probability Measures via KL Divergence Gradient Flow AISTATS 2024 Mixed Geometry Message and Trainable Convolutional Attention Network for Knowledge Graph Completion AAAI 2024 Multi-View Randomized Kernel Classification via Nonconvex Optimization AAAI 2024 Nearly Optimal Regret for Decentralized Online Convex Optimization COLT 2024 Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity NeurIPS 2024 Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss ICLR 2024 New Sample Complexity Bounds for Sample Average Approximation in Heavy-Tailed Stochastic Programming ICML 2024 Noisy Dual Mirror Descent: A Near Optimal Algorithm for Jointly-DP Convex Resource Allocation NeurIPS 2024 Non-stationary Online Convex Optimization with Arbitrary Delays ICML 2024 On Convex Optimization with Semi-Sensitive Features COLT 2024 Online Newton Method for Bandit Convex Optimisation Extended Abstract COLT 2024 On the Scalability and Memory Efficiency of Semidefinite Programs for Lipschitz Constant Estimation of Neural Networks ICLR 2024 Optimal Multiclass U-Calibration Error and Beyond NeurIPS 2024 Optimization Algorithm Design via Electric Circuits NeurIPS 2024 Optimizing ADMM and Over-Relaxed ADMM Parameters for Linear Quadratic Problems AAAI 2024 Optimizing over Multiple Distributions under Generalized Quasar-Convexity Condition NeurIPS 2024 Performative Prediction with Bandit Feedback: Learning through Reparameterization ICML 2024 Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems ICML 2024 Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses ICML 2024 Projection-Free Online Convex Optimization with Time-Varying Constraints ICML 2024 Quantum Algorithms and Lower Bounds for Finite-Sum Optimization ICML 2024 Robust Blind Text Image Deblurring via Maximum Consensus Framework AAAI 2024 Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage NeurIPS 2024 Safe Linear Bandits over Unknown Polytopes COLT 2024 Second Order Methods for Bandit Optimization and Control COLT 2024