scientific article; zbMATH DE number 6860785

zbMath1440.62243arXiv1608.08052MaRDI QIDQ4636989

Nicolas Flammarion, Balamurugan Palaniappan, Francis Bach

Publication date: 17 April 2018

Full work available at URL: https://arxiv.org/abs/1608.08052

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

robustnessclusteringsparse regularizers

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items

Discriminative clustering with representation learning with any ratio of labeled to unlabeled data

Uses Software

• CVX
• FastICA
• Manopt
• ImageNet
• k-means++
• DIFFRAC

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Sparse non Gaussian component analysis by semidefinite programming
• User-friendly tail bounds for sums of random matrices
• Smoothing technique and its applications in semidefinite optimization
• On the singularity probability of discrete random matrices
• Some simplified NP-complete graph problems
• A note on cluster analysis and dynamic programming
• Convex analysis and nonlinear optimization. Theory and examples
• Ultra-contractivity for Keller-Segel model with diffusion exponent \(m>1-2/d\)
• A generalized solution of the orthogonal Procrustes problem
• Block Coordinate Descent Methods for Semidefinite Programming
• Efficiently learning mixtures of two Gaussians
• Studies on the difference equationx_n+1 = 1/(x_n+x_n − 2)
• Optimization with Sparsity-Inducing Penalties
• Manopt, a Matlab toolbox for optimization on manifolds
• Graph Implementations for Nonsmooth Convex Programs
• Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
• Complementary Slackness and Dynamic Programming
• The diophantine equations $(x^2 - c)^2 = (t^2 ± 2) y^2 + 1$
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Reducibility among Combinatorial Problems
• Statistical Models
• The effectiveness of lloyd-type methods for the k-means problem
• Die projektive Theorie der “ paths” $x^{\left( 3 \right)i} + A_k^i x^{\left( 2 \right)k} + B^i = 0$
• On Non-Linear Differential Equations of the Second Order: I. the Equation y¨ − k (1-y ² )y˙ + y = b λk cos(λl + α), k Large
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item