High-dimension multilabel problems: convex or nonconvex relaxation?
From MaRDI portal
Publication:2873299
Recommendations
- Tight convex relaxations for vector-valued labeling
- High-dimensional regression and classification under a class of convex loss functions
- A narrow band method for the convex formulation of discrete multilabel problems
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- High dimensional binary classification under label shift: phase transition and regularization
- High-Dimensional Nonconvex Stochastic Optimization by Doubly Stochastic Successive Convex Approximation
Cited in
(10)- On the application of the spectral projected gradient method in image segmentation
- Energy Minimization Methods
- A narrow band method for the convex formulation of discrete multilabel problems
- Convex relaxation of a class of vertex penalizing functionals
- Analysis of multi-stage convex relaxation for sparse regularization
- Convex relaxation of vectorial problems with coupled regularization
- A variational aggregation framework for patch-based optical flow estimation
- scientific article; zbMATH DE number 2040634 (Why is no real title available?)
- Convex histogram-based joint image segmentation with regularized optimal transport cost
- Tight convex relaxations for vector-valued labeling
This page was built for publication: High-dimension multilabel problems: convex or nonconvex relaxation?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873299)