A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper proposes AMP with spectral initialization for robust signal estimation.
Combines PCA and AMP for better signal estimation in noisy data.
New framework predicts AMP behavior in spiked models for finite iterations.
AMP regularization improves deep learning models by favoring flat minima.
This paper applies AMP theory to improve learning tasks.
Simple AMP algorithm robust to adversarial corruption.
This paper deals with chain graphs under the alternative Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. We also show that the extension of Meek's conjecture to AMP chain graphs does n…
Approximate Message Passing (AMP) has been shown to be a superior method for inference problems, such as the recovery of signals from sets of noisy, lower-dimensionality measurements, both in terms of reconstruction accuracy and in computational efficiency. However, AMP suffers from serious convergence issues in contex…
New method improves sparse signal reconstruction using 1RSB-AMP.
The paper develops AMP theory for sparse and robust regression with polynomial iterations.
Unified tutorial on AMP for high-dimensional problems.
This paper introduces SS-MAMP to address convergence issues in AMP algorithms.
AMP method reconstructs rank-one matrices from noisy data efficiently.
New AMP algorithms for rotationally invariant models with reduced complexity.
Plug-and-play L-GM-AMP improves CS recovery for any i.i.d. source prior.
AMP algorithms can be efficiently simulated by SDPs even with corrupted data.
We address some computational issues that may hinder the use of AMP chain graphs in practice. Specifically, we show how a discrete probability distribution that satisfies all the independencies represented by an AMP chain graph factorizes according to it. We show how this factorization makes it possible to perform infe…
Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the regime where the problem dimension is large but finite. For concreteness, we co…
New algorithm improves signal reconstruction from noisy measurements with side information.
Unified framework for AMP iterations using graph indexing.
Novel AMP framework for multi-environment transfer learning.
Study on identifying AMP chain graph models under known and unknown component decompositions.
New AMP algorithms improve multi-layer signal reconstruction.
A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorit…
We study optimal estimation for sparse principal component analysis when the number of non-zero elements is small but on the same order as the dimension of the data. We employ approximate message passing (AMP) algorithm and its state evolution to analyze what is the information theoretically minimal mean-squared error …
A new AMP-based method speeds up conformal prediction intervals.
A fast, robust AMP algorithm for quadratic optimization problems.
Given the emerging global threat of antimicrobial resistance, new methods for next-generation antimicrobial design are urgently needed. We report a peptide generation framework PepCVAE, based on a semi-supervised variational autoencoder (VAE) model, for designing novel antimicrobial peptide (AMP) sequences. Our model l…
Compressive image recovery is a challenging problem that requires fast and accurate algorithms. Recently, neural networks have been applied to this problem with promising results. By exploiting massively parallel GPU processing architectures and oodles of training data, they can run orders of magnitude faster than exis…
This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meek's conjecture to AMP chain graphs does not hold…
We compare various notions of weak subsolutions to degenerate complex Monge-Amp{è}re flows, showing that they all coincide. This allows us to show that the viscosity solution coincides with the envelope of pluripotential subsolutions. Dedicated to Duong Hong Phong on the occasion of his 65th birthday.
The paper constructs invariant Calabi-Yau structures on complexified symmetric spaces.
New AMP algorithm estimates signals and latent variables in mixed regression models.
We address the problem of finding a minimal separator in an Andersson-Madigan-Perlman chain graph (AMP CG), namely, finding a set Z of nodes that separates a given nonadjacent pair of nodes such that no proper subset of Z separates that pair. We analyze several versions of this problem and offer polynomial-time algorit…
Approximate Message Passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problem. The AMP framework provides modularity in the choice of signal prior; here we propose a hierarchical form of the Gauss-Bernouilli prior which utilizes a Restricted Boltzmann Machin…
We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl…
AMP algorithm for matrix tensor product model provides recovery conditions.
SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty renders many existing techniques invalid or inconclusive in analyzing the SLOPE solution. In this pa…
New method combines regional HIV prevention trial data without sharing individual patient info.
Any regular Gaussian probability distribution that can be represented by an AMP chain graph (CG) can be expressed as a system of linear equations with correlated errors whose structure depends on the CG. However, the CG represents the errors implicitly, as no nodes in the CG correspond to the errors. We propose in this…
We analyse a linear regression problem with nonconvex regularization called smoothly clipped absolute deviation (SCAD) under an overcomplete Gaussian basis for Gaussian random data. We propose an approximate message passing (AMP) algorithm considering nonconvex regularization, namely SCAD-AMP, and analytically show tha…
We come up with infinite-dimensional prequantum line bundles and moment map interpretations of three different sets of equations - the generalised Monge-Amp`ere equation, the almost Hitchin system, and the Calabi-Yang-Mills equations. These are all perturbations of already existing equations. Our construction for the g…
New AMP algorithm detects change points in high-dimensional GLMs.
RBM learns in high dimensions via AMP and GD, reaching optimal weak recovery.
Often, large, high dimensional datasets collected across multiple modalities can be organized as a higher order tensor. Low-rank tensor decomposition then arises as a powerful and widely used tool to discover simple low dimensional structures underlying such data. However, we currently lack a theoretical understanding …
We consider compressed sensing formulated as a minimization problem of nonconvex sparse penalties, Smoothly Clipped Absolute deviation (SCAD) and Minimax Concave Penalty (MCP). The nonconvexity of these penalties is controlled by nonconvexity parameters, and L1 penalty is contained as a limit with respect to these para…
Paper tackles robust graph matching in dense graphs with AMP type algorithm.
Tree-AMP simplifies inference in complex tree-structured models.