Statistical Learning
19bc916108fc6938f52cb96f7e087941-Reviews.html
First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The authors study a variant of ratio cut with R clusters where the balancing function is biased towards partitions where each cluster has the same size. The main contribution of the paper is a continuous formulation and an algorithm to optimize the criterion directly, whereas previous algorithms are mostly limited to recursive splitting. The direct solution of multi-cut problems instead of using recursive splitting is an important problem given the new developments in finding balanced graph cuts [3,4,5,11,12,18]. The authors first describe the discrete problem (P) and then derive a relaxation of the problem (P-rlx).
115f89503138416a242f40fb7d7f338e-Reviews.html
First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The paper proposes a variational bound on the length scale parameters of square-exponential-kernel Gaussian process regression models. The main idea is to separate the function to be inferred into a standardised sample from a unit-length-scale square-exponential kernel, and a linear scaling map of that latent function, then to impose factorisation between these two objects via a variational bound. The paper is well written. It uses clear language and provides a compact introduction to previous work.
Block Coordinate Regularization by Denoising
Yu Sun, Jiaming Liu, Ulugbek Kamilov
We consider the problem of estimating a vector from its noisy measurements using a prior specified only through a denoising function. Recent work on plug-and-play priors (PnP) and regularization-by-denoising (RED) has shown the state-of-the-art performance of estimators under such priors in a range of imaging tasks.