Skip to content
conftrace_

convex optimization

1,445 papers

CO

Papers

Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023 Randomized Primal-Dual Methods with Adaptive Step Sizes AISTATS 2023 Real-Time Detection of Robotic Traffic in Online Advertising AAAI 2023 Recovery Bounds on Class-Based Optimal Transport: A Sum-of-Norms Regularization Framework ICML 2023 Reducing Discretization Error in the Frank-Wolfe Method AISTATS 2023 ReHLine: Regularized Composite ReLU-ReHU Loss Minimization with Linear Computation and Linear Convergence NeurIPS 2023 Rethinking Initialization of the Sinkhorn Algorithm AISTATS 2023 Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization ICML 2023 Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations NeurIPS 2023 Risk-aware linear bandits with convex loss AISTATS 2023 Safeguarded Learned Convex Optimization AAAI 2023 Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking NeurIPS 2023 Semi-Dual Unbalanced Quadratic Optimal Transport: fast statistical rates and convergent algorithm. ICML 2023 Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation JMLR 2023 Single-shot General Hyper-parameter Optimization for Federated Learning ICLR 2023 Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization ICML 2023 Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond ICML 2023 Time-Reversed Dissipation Induces Duality Between Minimizing Gradient Norm and Function Value NeurIPS 2023 Top-k data selection via distributed sample quantile inference L4DC 2023 Unifying Nesterov’s Accelerated Gradient Methods for Convex and Strongly Convex Objective Functions ICML 2023 “Why Not Looking backward?” A Robust Two-Step Method to Automatically Terminate Bayesian Optimization NeurIPS 2023 Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling NeurIPS 2022 Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling JMLR 2022 A Completely Tuning-Free and Robust Approach to Sparse Precision Matrix Estimation ICML 2022 Adapting to Mixing Time in Stochastic Optimization with Markovian Data ICML 2022