conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Continuous Optimization

3,907 papers

Papers per year

6
38
155
367
154
'05
'10
'15
'20
'25

Papers

On the Reducibility of Submodular Functions AISTATS 2016
Accelerated Stochastic Gradient Descent for Minimizing Finite Sums AISTATS 2016
An Improved Convergence Analysis of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization AISTATS 2016
Large-Scale Optimization Algorithms for Sparse Conditional Gaussian Graphical Models AISTATS 2016
Low-Rank and Sparse Structure Pursuit via Alternating Minimization AISTATS 2016
Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization AISTATS 2016
Fast Dictionary Learning with a Smoothed Wasserstein Loss AISTATS 2016
Approximate Inference Using DC Programming For Collective Graphical Models AISTATS 2016
Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with Ordered L1-Norm AISTATS 2016
Fitting Spectral Decay with the k-Support Norm AISTATS 2016
Scalable and Sound Low-Rank Tensor Learning AISTATS 2016
Unwrapping ADMM: Efficient Distributed Computing via Transpose Reduction AISTATS 2016
Efficient Bregman Projections onto the Permutahedron and Related Polytopes AISTATS 2016
Provable Tensor Methods for Learning Mixtures of Generalized Linear Models AISTATS 2016
Scalable Exemplar Clustering and Facility Location via Augmented Block Coordinate Descent with Column Generation AISTATS 2016
Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions AISTATS 2016
Multiresolution Matrix Compression AISTATS 2016
Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees AISTATS 2016
Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization AISTATS 2016
Highly-Smooth Zero-th Order Online Optimization COLT 2016
On the low-rank approach for semidefinite programs arising in synchronization and community detection COLT 2016
Noisy Tensor Completion via the Sum-of-Squares Hierarchy COLT 2016
Basis Learning as an Algorithmic Primitive COLT 2016
On the Approximability of Sparse PCA COLT 2016
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time COLT 2016