scientific article; zbMATH DE number 7626745

MaRDI QIDQ5053241zbMATH OpenFDO

Authors Stéphane Chrétien, Mihai Cucuringu, Guillaume Lecué, Lucie Neirac

Publication date 6 December 2022

Full work available at URL https://arxiv.org/abs/2004.01869, https://jmlr.csail.mit.edu/papers/v22/21-0021.html

zbMATH Keywords

group synchronizationsemi-definite programmingsigned clusteringstatistical learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A mathematical introduction to compressive sensing
• A Nonlinear Programming Problem in Statistics (Educational Testing)
• A useful variant of the Davis-Kahan theorem for statisticians
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
• Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly
• An extension of the angular synchronization problem to the heterogeneous setting
• An introduction to polynomial and semi-algebraic optimization
• Angular synchronization by eigenvectors and semidefinite programming
• Approximate graph coloring by semidefinite programming
• Approximate kernel clustering
• Approximate optimal designs for multivariate polynomial regression
• Approximating K‐means‐type Clustering via Semidefinite Programming
• Approximation algorithms and semidefinite programming.
• Bounds for the least Laplacian eigenvalue of a signed graph
• Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
• Communities in Networks
• Community detection in sparse networks via Grothendieck's inequality
• Complex Quadratic Optimization and Semidefinite Programming
• Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
• Concentration inequalities. A nonasymptotic theory of independence
• Decomposition through formalization in a product space
• Denoising modulo samples: k-NN regression and tightness of SDP relaxation
• Empirical minimization
• Exact Recovery in the Stochastic Block Model
• Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
• Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality
• Fast unfolding of communities in large networks
• First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
• Grothendieck’s Theorem, past and present
• Guaranteed clustering and biclustering via semidefinite programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Handbook on semidefinite, conic and polynomial optimization
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 3124239 (Why is no real title available?)
• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• scientific article; zbMATH DE number 3607823 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 1420699 (Why is no real title available?)
• scientific article; zbMATH DE number 7626779 (Why is no real title available?)
• scientific article; zbMATH DE number 2222601 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Interactions between compressed sensing random matrices and high dimensional geometry
• Learning Theory and Kernel Machines
• Linear Matrix Inequalities in System and Control Theory
• Local minima and convergence in low-rank semidefinite programming
• Local operator theory, random matrices and Banach spaces.
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Manopt, a Matlab toolbox for optimization on manifolds
• Mean estimation with sub-Gaussian rates in polynomial time
• Multireference alignment using semidefinite programming
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
• New variants of bundle methods
• On the Shannon capacity of a graph
• Optimal aggregation of classifiers in statistical learning.
• Optimal rates for community estimation in the weighted stochastic block model
• Optimization via low-rank approximation for community detection in networks
• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• Partial recovery bounds for clustering with the relaxed K-means
• Phase recovery, MaxCut and complex semidefinite programming
• Phase transitions in semidefinite relaxations
• Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions
• Problems of distance geometry and convex properties of quadratic maps
• Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping
• Quadratic maximization and semidefinite relaxation
• Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
• Rates of convergence for minimum contrast estimators
• Reconstruction and estimation in the planted partition model
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Riemannian trust regions with finite-difference Hessian approximations are globally convergent
• Robust statistical learning with Lipschitz and convex loss functions
• Scalable semidefinite programming
• Semidefinite and Lagrangian relaxations for hard combinatorial problems
• Semidefinite optimization
• Semidefinite Optimization and Convex Algebraic Geometry
• Semidefinite programming in combinatorial optimization
• Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
• Semidefinite relaxations for integer programming
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Singular vectors under random perturbation
• Smooth discrimination analysis
• Stable optimizationless recovery from phaseless linear measurements
• Statistical mechanics of complex networks
• Synchronization overZ₂and community detection in signed multiplex networks with constraints
• The concentration of measure phenomenon
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• The Rotation of Eigenvectors by a Perturbation. III
• Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Using the eigenvalue relaxation for binary least-squares estimation problems
• Weak convergence and empirical processes. With applications to statistics
• Weighted minimum trace factor analysis

Cited in

(3)

• Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions
• Learning with Semi-Definite Programming: new statistical bounds based on fixed point analysis and excess risk curvature
• A diffusion process perspective on posterior contraction rates for parameters

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053241)