Skip to content
conftrace_

Convex Optimization

864 papers

1
23
39
63
83
'5
'10
'15
'20
'25

Papers

Affine Invariant Analysis of Frank-Wolfe on Strongly Convex Sets ICML 2021 An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021 A Quasiconvex Formulation for Radial Cameras CVPR 2021 A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance ICML 2021 A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples ICML 2021 A Surrogate Objective Framework for Prediction+Programming with Soft Constraints NeurIPS 2021 Black-Box Reductions for Zeroth-Order Gradient Algorithms to Achieve Lower Query Complexity JMLR 2021 Chance-constrained quasi-convex optimization with application to data-driven switched systems control L4DC 2021 Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features AAAI 2021 Contextual Recommendations and Low-Regret Cutting-Plane Algorithms NeurIPS 2021 Convex Regularization in Monte-Carlo Tree Search ICML 2021 ConvexVST: A Convex Optimization Approach to Variance-stabilizing Transformation ICML 2021 DeepLM: Large-Scale Nonlinear Least Squares on Deep Learning Frameworks Using Stochastic Domain Decomposition CVPR 2021 Differentiating the Value Function by using Convex Duality AISTATS 2021 Dueling Convex Optimization ICML 2021 Efficient Bandit Convex Optimization: Beyond Linear Losses COLT 2021 Efficient Empowerment Estimation for Unsupervised Stabilization ICLR 2021 Exploiting Sparsity for Neural Network Verification L4DC 2021 From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021 Globally Optimal Relative Pose Estimation With Gravity Prior CVPR 2021 Gradient Descent Averaging and Primal-dual Averaging for Strongly Convex Optimization AAAI 2021 Graphical Models in Heavy-Tailed Markets NeurIPS 2021 Heavy Ball Momentum for Conditional Gradient NeurIPS 2021 Improved Regret for Zeroth-Order Stochastic Convex Bandits COLT 2021 Increasing Iterate Averaging for Solving Saddle-Point Problems AAAI 2021