No label defined (Q5053241)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7626745

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7626745

Statements

scholarly article

0 references

Stéphane Chrétien

0 references

Mihai Cucuringu

0 references

Guillaume Lecué

0 references

0 references

publication date

6 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2004.01869

0 references

https://jmlr.csail.mit.edu/papers/v22/21-0021.html

0 references

zbMATH Keywords

semi-definite programming

0 references

statistical learning

0 references

group synchronization

0 references

signed clustering

0 references

MaRDI profile type

MaRDI publication profile

0 references

Exact Recovery in the Stochastic Block Model

0 references

Statistical mechanics of complex networks

0 references

Guaranteed clustering and biclustering via semidefinite programming

0 references

Handbook on semidefinite, conic and polynomial optimization

0 references

Sharp nonasymptotic bounds on the norm of random matrices with independent entries

0 references

Multireference alignment using semidefinite programming

0 references

Tightness of the maximum likelihood semidefinite relaxation for angular synchronization

0 references

Empirical minimization

0 references

Problems of distance geometry and convex properties of quadratic maps

0 references

Rates of convergence for minimum contrast estimators

0 references

Semidefinite Optimization and Convex Algebraic Geometry

0 references

Fast unfolding of communities in large networks

0 references

0 references

Manopt, a Matlab toolbox for optimization on manifolds

0 references

Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent

0 references

0 references

Linear Matrix Inequalities in System and Control Theory

0 references

Local minima and convergence in low-rank semidefinite programming

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

0 references

Robust statistical learning with Lipschitz and convex loss functions

0 references

Using the eigenvalue relaxation for binary least-squares estimation problems

0 references

Synchronization over<i>Z</i><sub>2</sub>and community detection in signed multiplex networks with constraints

0 references

0 references

An extension of the angular synchronization problem to the heterogeneous setting

0 references

0 references

0 references

The Rotation of Eigenvectors by a Perturbation. III

0 references

Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions

0 references

Approximate optimal designs for multivariate polynomial regression

0 references

Stable optimizationless recovery from phaseless linear measurements

0 references

Denoising modulo samples: <i>k</i>-NN regression and tightness of SDP relaxation

0 references

Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions

0 references

Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality

0 references

Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly

0 references

A Nonlinear Programming Problem in Statistics (Educational Testing)

0 references

A mathematical introduction to compressive sensing

0 references

Approximation Algorithms and Semidefinite Programming

0 references

Partial recovery bounds for clustering with the relaxed \(K\)-means

0 references

Semidefinite programming in combinatorial optimization

0 references

New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators

0 references

0 references

Community detection in sparse networks via Grothendieck's inequality

0 references

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming

0 references

Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization

0 references

Mean estimation with sub-Gaussian rates in polynomial time

0 references

Bounds for the least Laplacian eigenvalue of a signed graph

0 references

Phase transitions in semidefinite relaxations

0 references

Approximate graph coloring by semidefinite programming

0 references

Approximate Kernel Clustering

0 references

Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)

0 references

Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.

0 references

An Introduction to Polynomial and Semi-Algebraic Optimization

0 references

Optimization via low-rank approximation for community detection in networks

0 references

0 references

0 references

New variants of bundle methods

0 references

On the Shannon capacity of a graph

0 references

Smooth discrimination analysis

0 references

Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.

0 references

First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules

0 references

Reconstruction and estimation in the planted partition model

0 references

Approximating K‐means‐type Clustering via Semidefinite Programming

0 references

0 references

Decomposition through formalization in a product space

0 references

Grothendieck’s Theorem, past and present

0 references

Communities in Networks

0 references

Semidefinite Relaxations for Integer Programming

0 references

0 references

Weighted minimum trace factor analysis

0 references

Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming

0 references

Angular synchronization by eigenvectors and semidefinite programming

0 references

The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem

0 references

0 references

Semidefinite optimization

0 references

Learning Theory and Kernel Machines

0 references

Optimal aggregation of classifiers in statistical learning.

0 references

0 references

Weak convergence and empirical processes. With applications to statistics

0 references

0 references

High-Dimensional Probability

0 references

Singular vectors under random perturbation

0 references

Phase recovery, MaxCut and complex semidefinite programming

0 references

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

Optimal rates for community estimation in the weighted stochastic block model

0 references

A useful variant of the Davis–Kahan theorem for statisticians

0 references

Scalable Semidefinite Programming

0 references

Complex Quadratic Optimization and Semidefinite Programming

0 references

Quadratic maximization and semidefinite relaxation

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5053241

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5053241&oldid=37467806"