Optimal link prediction with matrix logistic regression

03/19/2018
by   Nicolai Baldin, et al.
0

We consider the problem of link prediction, based on partial observation of a large network, and on side information associated to its vertices. The generative model is formulated as a matrix logistic regression. The performance of the model is analysed in a high-dimensional regime under a structural assumption. The minimax rate for the Frobenius-norm risk is established and a combinatorial estimator based on the penalised maximum likelihood approach is shown to achieve it. Furthermore, it is shown that this rate cannot be attained by any (randomised) algorithm computable in polynomial time under a computational complexity assumption.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2017

High-dimensional classification by sparse logistic regression

We consider high-dimensional binary classification by sparse logistic re...
research
03/04/2020

Multiclass classification by sparse multinomial logistic regression

In this paper we consider high-dimensional multiclass classification by ...
research
05/25/2023

Finite sample rates for logistic regression with small noise or few samples

The logistic regression estimator is known to inflate the magnitude of i...
research
05/13/2020

An Asymptotic Result of Conditional Logistic Regression Estimator

In cluster-specific studies, ordinary logistic regression and conditiona...
research
05/31/2021

A Minimax Lower Bound for Low-Rank Matrix-Variate Logistic Regression

This paper considers the problem of matrix-variate logistic regression. ...
research
10/03/2017

Bayesian Fused Lasso regression for dynamic binary networks

We propose a multinomial logistic regression model for link prediction i...
research
06/26/2019

A global approach for learning sparse Ising models

We consider the problem of learning the link parameters as well as the s...

Please sign up or login with your details

Forgot password? Click here to reset