On Universality of Non-Separable Approximate Message Passing Algorithms | Paper Citation Record

Observation f51b24e6-d054-4e31-8282-1bcc5ee943ef · outbound

This paper cites Unsourced random access with coded compressed sensing: Integrating amp and belief propagation.IEEE Transactions on Information Theory, 68(4):2384–2409, 2021.

On Universality of Non-Separable Approximate Message Passing Algorithms Unsourced random access with coded compressed sensing: Integrating amp and belief propagation.IEEE Transactions on Information Theory, 68(4):2384–2409, 2021

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:50.814414Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation dedc440d-e178-44ad-8924-8c68014f6019 · outbound

This paper cites Operator-lipschitz estimates for the singular value functional calculus.Proceedings of the American Mathematical Society, 144(5):1867–1875, 2016.

On Universality of Non-Separable Approximate Message Passing Algorithms Operator-lipschitz estimates for the singular value functional calculus.Proceedings of the American Mathematical Society, 144(5):1867–1875, 2016

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:50.618203Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation bf739c87-13a3-42f1-bc1d-e6e929b7d58b · outbound

This paper cites Large deviations for langevin spin glass dynamics.

On Universality of Non-Separable Approximate Message Passing Algorithms Large deviations for langevin spin glass dynamics

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:50.413665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d9b8aa31-eedc-4b65-9ed3-9e7ead87803d · outbound

This paper cites Symmetric langevin spin glass dynamics.The Annals of Probability, 25(3):1367–1422, 1997.

On Universality of Non-Separable Approximate Message Passing Algorithms Symmetric langevin spin glass dynamics.The Annals of Probability, 25(3):1367–1422, 1997

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:50.242029Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 81bf343b-37e4-49ba-9d02-2c1bc7516abe · outbound

This paper cites Inferring change points in high- dimensional linear regression via approximate message passing.

On Universality of Non-Separable Approximate Message Passing Algorithms Inferring change points in high- dimensional linear regression via approximate message passing

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:50.019123Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a833d76d-87a3-4465-958f-0e6a2bc471fb · outbound

This paper cites The spiked matrix model with generative priors.Advances in Neural Information Processing Systems, 32, 2019.

On Universality of Non-Separable Approximate Message Passing Algorithms The spiked matrix model with generative priors.Advances in Neural Information Processing Systems, 32, 2019

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:49.826275Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7c7351a7-ccd2-4ac2-aa1c-140f50fa7610 · outbound

This paper cites A leave-one-out approach to approximate message passing.

On Universality of Non-Separable Approximate Message Passing Algorithms A leave-one-out approach to approximate message passing

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:30.744813Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bea1e261-459a-4061-967a-cac7b5459c73 · outbound

This paper cites Universality in polytope phase transitions and message passing algorithms.The Annals of Applied Probability, 25(2), April 2015.

On Universality of Non-Separable Approximate Message Passing Algorithms Universality in polytope phase transitions and message passing algorithms.The Annals of Applied Probability, 25(2), April 2015

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:49.627737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0ded2bfc-f8d5-40d4-a1d1-76ef8f599b1d · outbound

This paper cites The dynamics of message passing on dense graphs, with applications to compressed sensing.IEEE Transactions on Information Theory, 57(2):764–785, February 2011.

On Universality of Non-Separable Approximate Message Passing Algorithms The dynamics of message passing on dense graphs, with applications to compressed sensing.IEEE Transactions on Information Theory, 57(2):764–785, February 2011

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:49.432798Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0bcf0d12-62ce-49a6-b13d-bd68069becbe · outbound

This paper cites Online stochastic gradient descent on non-convex losses from high-dimensional inference.Journal of Machine Learning Research, 22(106):1–51, 2021.

On Universality of Non-Separable Approximate Message Passing Algorithms Online stochastic gradient descent on non-convex losses from high-dimensional inference.Journal of Machine Learning Research, 22(106):1–51, 2021

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:31.062747Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51d37649-510c-492f-bbd5-c66890107280 · outbound

This paper cites High-dimensional limit theorems for sgd: Effective dynamics and critical scaling.Advances in neural information processing systems, 35:25349–25362, 2022.

On Universality of Non-Separable Approximate Message Passing Algorithms High-dimensional limit theorems for sgd: Effective dynamics and critical scaling.Advances in neural information processing systems, 35:25349–25362, 2022

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:49.203700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation eeb2b3ad-3ab6-451d-8ef8-24dcbdaf3c61 · outbound

This paper cites State evolution for approximate message passing with non-separable functions.Information and Inference: A Journal of the IMA, 9(1):33–79, 01 2019.

On Universality of Non-Separable Approximate Message Passing Algorithms State evolution for approximate message passing with non-separable functions.Information and Inference: A Journal of the IMA, 9(1):33–79, 01 2019

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:49.006999Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 06209d77-f845-4939-a55e-a07d844c5d82 · outbound

This paper cites Billingsley.Probability and Measure.

On Universality of Non-Separable Approximate Message Passing Algorithms Billingsley.Probability and Measure

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:48.817873Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 89948a2a-f4b8-4f8f-84a6-02d839d82b6f · outbound

This paper cites An iterative construction of solutions of the tap equations for the sherrington– kirkpatrick model.

On Universality of Non-Separable Approximate Message Passing Algorithms An iterative construction of solutions of the tap equations for the sherrington– kirkpatrick model

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:48.658651Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6e6d25a9-6886-425b-abe3-bb3eb9af89a0 · outbound

This paper cites Algorithmic analysis and statis- tical estimation of slope via approximate message passing.IEEE Transactions on Information Theory, 67(1):506–537, 2020.

On Universality of Non-Separable Approximate Message Passing Algorithms Algorithmic analysis and statis- tical estimation of slope via approximate message passing.IEEE Transactions on Information Theory, 67(1):506–537, 2020

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:48.474599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f5c2429a-e435-4c37-ac83-c475f000ba88 · outbound

This paper cites Characterizing the slope trade-off: A variational perspective and the donoho–tanner limit.The Annals of Statistics, 51(1):33–61, 2023.

On Universality of Non-Separable Approximate Message Passing Algorithms Characterizing the slope trade-off: A variational perspective and the donoho–tanner limit.The Annals of Statistics, 51(1):33–61, 2023

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:48.266830Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 654f91ff-147b-4df7-a19c-1dd0483ad428 · outbound

This paper cites The high-dimensional asymptotics of first order methods with random data.

On Universality of Non-Separable Approximate Message Passing Algorithms The high-dimensional asymptotics of first order methods with random data

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:31.791376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 75db0a33-1cfe-420a-95a9-3a8c7477d05d · outbound

This paper cites The estimation error of general first order methods.

On Universality of Non-Separable Approximate Message Passing Algorithms The estimation error of general first order methods

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:48.046807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f8082dde-e65e-4e44-a90d-5395598fad12 · outbound

This paper cites Universality of approximate message passing algorithms.

On Universality of Non-Separable Approximate Message Passing Algorithms Universality of approximate message passing algorithms

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:47.910433Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6cb1e9d8-c10f-4d86-a2ee-53809ff1a75c · outbound

This paper cites Weingarten calculus via orthogonality relations: new applications.

On Universality of Non-Separable Approximate Message Passing Algorithms Weingarten calculus via orthogonality relations: new applications

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:47.752695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1fac4a3f-5b47-4ee0-9ddb-1c83ee64d127 · outbound

This paper cites Integration with respect to the haar measure on unitary, orthogonal and symplectic group.Communications in Mathematical Physics, 264(3):773–795, 2006.

On Universality of Non-Separable Approximate Message Passing Algorithms Integration with respect to the haar measure on unitary, orthogonal and symplectic group.Communications in Mathematical Physics, 264(3):773–795, 2006

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:47.573607Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2fc53f5a-b07c-495a-a777-24929a9d9f68 · outbound

This paper cites Hitting the high-dimensional notes: An ode for sgd learning dynamics on glms and multi-index models.

On Universality of Non-Separable Approximate Message Passing Algorithms Hitting the high-dimensional notes: An ode for sgd learning dynamics on glms and multi-index models

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:47.343340Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ee5b3bdc-70eb-489e-bfd4-2da899927e1e · outbound

This paper cites Diffusions interacting through a random matrix: universality via stochastic taylor expansion.Probability Theory and Related Fields, 180:1057–1097, 2021.

On Universality of Non-Separable Approximate Message Passing Algorithms Diffusions interacting through a random matrix: universality via stochastic taylor expansion.Probability Theory and Related Fields, 180:1057–1097, 2021

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:47.182863Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 89e66dfe-3402-4b57-923f-2cce96992756 · outbound

This paper cites Universality for langevin-like spin glass dynamics.

On Universality of Non-Separable Approximate Message Passing Algorithms Universality for langevin-like spin glass dynamics

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:47.025315Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5fb993e3-68b3-4974-b4f4-d881915cae4d · outbound

This paper cites an unresolved cited work.

On Universality of Non-Separable Approximate Message Passing Algorithms Unresolved cited work

Reference 25

Resolution: unresolved; raw_fallback, observed 2026-08-06T22:07:46.827076Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation e2d3b447-aaac-403a-81ed-3552a6bd17ec · outbound

This paper cites Donoho, Arian Maleki, and Andrea Montanari.

On Universality of Non-Separable Approximate Message Passing Algorithms Donoho, Arian Maleki, and Andrea Montanari

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:46.597588Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 713fd9b6-adcd-4f8e-b815-6a7adaf20eee · outbound

This paper cites Lu, and Subhabrata Sen.

On Universality of Non-Separable Approximate Message Passing Algorithms Lu, and Subhabrata Sen

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:46.395667Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9aebc0b7-d517-4a5e-b525-0403bad319fd · outbound

This paper cites an unresolved cited work.

On Universality of Non-Separable Approximate Message Passing Algorithms Unresolved cited work

Reference 28

Resolution: unresolved; raw_fallback, observed 2026-08-06T22:07:46.166578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 25cd6d34-f281-427b-99fe-2f1b7673606e · outbound

This paper cites On weighted uniform approximation by polynomials of functions of several variables.Matematicheskii Sbornik, 85(2):227–256, 1957.

On Universality of Non-Separable Approximate Message Passing Algorithms On weighted uniform approximation by polynomials of functions of several variables.Matematicheskii Sbornik, 85(2):227–256, 1957

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:46.000385Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f2926914-473e-482f-ad96-ba9369bd9efa · outbound

This paper cites Dynamical mean-field analysis of adaptive langevin diffusions: Propagation-of-chaos and convergence of the linear response.

On Universality of Non-Separable Approximate Message Passing Algorithms Dynamical mean-field analysis of adaptive langevin diffusions: Propagation-of-chaos and convergence of the linear response

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:33.098647Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea40b67b-6a49-4442-b235-510f1306320f · outbound

This paper cites Dynamical mean-field analysis of adaptive langevin diffusions: Replica-symmetric fixed point and empirical bayes.

On Universality of Non-Separable Approximate Message Passing Algorithms Dynamical mean-field analysis of adaptive langevin diffusions: Replica-symmetric fixed point and empirical bayes

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:33.215336Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af0bafaa-83e7-4234-9ce2-16a20ee49ad6 · outbound

This paper cites Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J.

On Universality of Non-Separable Approximate Message Passing Algorithms Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:45.798307Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1cc7d62a-c92a-4f65-879a-ce8b37acd7e7 · outbound

This paper cites On complete functions in jucys-murphy elements.Annals of Combinatorics, 16:677–707, 2012.

On Universality of Non-Separable Approximate Message Passing Algorithms On complete functions in jucys-murphy elements.Annals of Combinatorics, 16:677–707, 2012

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:45.446963Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a05d523b-3845-4f1a-91d5-e27c7422c540 · outbound

This paper cites Rigorous dynamical mean-field theory for stochastic gradient descent methods.SIAM Journal on Mathematics of Data Science, 6(2):400–427, 2024.

On Universality of Non-Separable Approximate Message Passing Algorithms Rigorous dynamical mean-field theory for stochastic gradient descent methods.SIAM Journal on Mathematics of Data Science, 6(2):400–427, 2024

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:45.308774Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f95a6d4c-964a-4933-aa73-f2a904124292 · outbound

This paper cites Graph-based approximate message passing iterations†.

On Universality of Non-Separable Approximate Message Passing Algorithms Graph-based approximate message passing iterations†

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:45.166894Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c5b1d740-ee86-4df9-9e2b-76af924d0264 · outbound

This paper cites an unresolved cited work.

On Universality of Non-Separable Approximate Message Passing Algorithms Unresolved cited work

Reference 36

Resolution: unresolved; raw_fallback, observed 2026-08-06T22:07:44.981720Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7bd35809-4f8c-4e11-91d8-7090b11afc01 · outbound

This paper cites Entrywise dynamics and universality of general first order methods.

On Universality of Non-Separable Approximate Message Passing Algorithms Entrywise dynamics and universality of general first order methods

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:33.940603Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee282170-9089-49cf-935f-3191cee98056 · outbound

This paper cites Gradient descent inference in empirical risk minimization.arXiv preprint arXiv:2412.09498, 2024.

On Universality of Non-Separable Approximate Message Passing Algorithms Gradient descent inference in empirical risk minimization.arXiv preprint arXiv:2412.09498, 2024

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:34.050701Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77466dd4-3373-4eb3-b164-7ac8bfd61854 · outbound

This paper cites On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables.Biometrika, 12(1/2):134–139, 1918.

On Universality of Non-Separable Approximate Message Passing Algorithms On a formula for the product-moment coefficient of any order of a normal frequency distribution in any number of variables.Biometrika, 12(1/2):134–139, 1918

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:34.138364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 041b16f9-4486-4ce3-8e93-91062232b466 · outbound

This paper cites State evolution for general approximate message passing algorithms, with applications to spatial coupling.Information and Inference: A Journal of the IMA, 2(2):115–144, 12 2013.

On Universality of Non-Separable Approximate Message Passing Algorithms State evolution for general approximate message passing algorithms, with applications to spatial coupling.Information and Inference: A Journal of the IMA, 2(2):115–144, 12 2013

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:44.810312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a724ea45-f3da-4294-a478-68d482ea6329 · outbound

This paper cites Fourier Analysis of Iterative Algorithms.

On Universality of Non-Separable Approximate Message Passing Algorithms Fourier Analysis of Iterative Algorithms

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:34.493763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57590f3a-1f29-4e5e-8938-6fa33370a201 · outbound

This paper cites Approximate message passing from random initialization with applications to z2 synchronization.Proceedings of the National Academy of Sciences, 120(31):e2302930120, 2023.

On Universality of Non-Separable Approximate Message Passing Algorithms Approximate message passing from random initialization with applications to z2 synchronization.Proceedings of the National Academy of Sciences, 120(31):e2302930120, 2023

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:44.608742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 16707a71-c762-4ba2-a997-f301d1871cc8 · outbound

This paper cites Fluctuations, bias, variance & ensemble of learners: Exact asymptotics for convex losses in high-dimension.

On Universality of Non-Separable Approximate Message Passing Algorithms Fluctuations, bias, variance & ensemble of learners: Exact asymptotics for convex losses in high-dimension

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:44.434512Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 57b65ccd-2a81-446b-8a2d-70bca9c99297 · outbound

This paper cites Learning gaussian mixtures with generalized linear models: Precise asymp- totics in high-dimensions.Advances in Neural Information Processing Systems, 34:10144–10157, 2021.

On Universality of Non-Separable Approximate Message Passing Algorithms Learning gaussian mixtures with generalized linear models: Precise asymp- totics in high-dimensions.Advances in Neural Information Processing Systems, 34:10144–10157, 2021

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:44.251330Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation efa9328e-d418-4d9e-98b7-3de3d9f9b85e · outbound

This paper cites Analysis of approximate message passing with non-separable denoisers and markov random field priors.IEEE Transactions on Information Theory, 65(11):7367–7389, 2019.

On Universality of Non-Separable Approximate Message Passing Algorithms Analysis of approximate message passing with non-separable denoisers and markov random field priors.IEEE Transactions on Information Theory, 65(11):7367–7389, 2019

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:44.015096Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 482e873e-a9fd-4b1e-81c3-a9d86596b0c2 · outbound

This paper cites Approximate message passing algorithm with universal denoising and gaussian mixture learning.IEEE Transactions on Signal Processing, 64(21):5611–5622, 2016.

On Universality of Non-Separable Approximate Message Passing Algorithms Approximate message passing algorithm with universal denoising and gaussian mixture learning.IEEE Transactions on Signal Processing, 64(21):5611–5622, 2016

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:43.820521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b60ca3fb-890a-414d-a628-c31cdf479e63 · outbound

This paper cites Complex dynamics in simple neural networks: Understanding gradient flow in phase retrieval.Advances in Neural Information Processing Systems, 33:3265– 3274, 2020.

On Universality of Non-Separable Approximate Message Passing Algorithms Complex dynamics in simple neural networks: Understanding gradient flow in phase retrieval.Advances in Neural Information Processing Systems, 33:3265– 3274, 2020

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:43.663400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6a0e4431-660a-4d0a-be80-360c26c98bc4 · outbound

This paper cites Marvels and pitfalls of the langevin algorithm in noisy high- dimensional inference.

On Universality of Non-Separable Approximate Message Passing Algorithms Marvels and pitfalls of the langevin algorithm in noisy high- dimensional inference

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:43.462225Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aaf93d3a-cb5c-4d72-a58e-64f9e477ff3d · outbound

This paper cites Passed& spurious: Descent algorithms and local minima in spiked matrix-tensor models.

On Universality of Non-Separable Approximate Message Passing Algorithms Passed& spurious: Descent algorithms and local minima in spiked matrix-tensor models

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:43.280619Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4f9f4c9f-b5e6-4b64-988f-91036a798d64 · outbound

This paper cites Approximate message-passing for convex optimization with non-separable penalties.

On Universality of Non-Separable Approximate Message Passing Algorithms Approximate message-passing for convex optimization with non-separable penalties

Reference 51

Resolution: verified exact; local_arxiv, observed 2026-08-06T22:07:38.750701Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2edcd16a-941a-4b6d-90da-283ebd3fa993 · outbound

This paper cites Learned d-amp: Principled neural network based compressive image recovery.Advances in neural information processing systems, 30, 2017.

On Universality of Non-Separable Approximate Message Passing Algorithms Learned d-amp: Principled neural network based compressive image recovery.Advances in neural information processing systems, 30, 2017

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:43.071185Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9a050a31-22e4-47bc-b685-384e48a22139 · outbound

This paper cites Bm3d-amp: A new image recovery algorithm based on bm3d denoising.

On Universality of Non-Separable Approximate Message Passing Algorithms Bm3d-amp: A new image recovery algorithm based on bm3d denoising

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:42.876596Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 41d0801d-6321-4025-9268-07f051df76f7 · outbound

This paper cites From denoising to compressed sensing.

On Universality of Non-Separable Approximate Message Passing Algorithms From denoising to compressed sensing

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:42.667361Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f58629cc-655d-4224-bfc7-6aa8e55ee7ca · outbound

This paper cites Dynamical decoupling of generalization and overfitting in large two-layer networks.arXiv preprint arXiv:2502.21269, 2025.

On Universality of Non-Separable Approximate Message Passing Algorithms Dynamical decoupling of generalization and overfitting in large two-layer networks.arXiv preprint arXiv:2502.21269, 2025

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-06T22:07:36.204822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2fefbba5-c975-4392-90b6-ebb7668d8526 · outbound

This paper cites Homogenization of sgd in high-dimensions: Exact dynamics and generalization properties.Mathematical Programming, pages 1–90, 2024.

On Universality of Non-Separable Approximate Message Passing Algorithms Homogenization of sgd in high-dimensions: Exact dynamics and generalization properties.Mathematical Programming, pages 1–90, 2024

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:42.504194Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 78793430-688c-4fec-9503-8b1bd3f50b26 · outbound

This paper cites Generalized approximate message passing for estimation with random linear mixing.

On Universality of Non-Separable Approximate Message Passing Algorithms Generalized approximate message passing for estimation with random linear mixing

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:42.289600Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f205f779-37cb-4a07-8730-24cb7282148e · outbound

This paper cites Fletcher.

On Universality of Non-Separable Approximate Message Passing Algorithms Fletcher

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:42.053937Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7ac2b4df-193c-4285-a47a-38a690467128 · outbound

This paper cites Near-optimal matrix recovery from random linear measure- ments.

On Universality of Non-Separable Approximate Message Passing Algorithms Near-optimal matrix recovery from random linear measure- ments

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:41.855990Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 039b19b2-c63a-40f7-99c3-8c0d702b34a5 · outbound

This paper cites Finite sample analysis of approximate message passing algorithms.

On Universality of Non-Separable Approximate Message Passing Algorithms Finite sample analysis of approximate message passing algorithms

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:41.692284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation edd4d62b-0373-49a5-92d7-b3f530364d93 · outbound

This paper cites Turbo reconstruction of structured sparse signals.

On Universality of Non-Separable Approximate Message Passing Algorithms Turbo reconstruction of structured sparse signals

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:41.456479Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 41992d4a-1f74-4b8b-aa7f-b5c4675ada6d · outbound

This paper cites Concentration and moment inequalities for polynomials of independent random variables.

On Universality of Non-Separable Approximate Message Passing Algorithms Concentration and moment inequalities for polynomials of independent random variables

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:41.229446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation bac485e5-1599-4efb-b1eb-b302733b2eec · outbound

This paper cites On the empirical distribution of eigenvalues of a class of large dimensional random matrices.Journal of Multivariate analysis, 54(2):175–192, 1995.

On Universality of Non-Separable Approximate Message Passing Algorithms On the empirical distribution of eigenvalues of a class of large dimensional random matrices.Journal of Multivariate analysis, 54(2):175–192, 1995

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:41.027445Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d0d09298-8459-45e1-b00d-d46452144d36 · outbound

This paper cites Compressive imaging using approximate message passing and a markov-tree prior.IEEE transactions on signal processing, 60(7):3439–3448, 2012.

On Universality of Non-Separable Approximate Message Passing Algorithms Compressive imaging using approximate message passing and a markov-tree prior.IEEE transactions on signal processing, 60(7):3439–3448, 2012

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:40.832714Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6a5ad485-90b2-4e53-bbcf-cd71d73ea4ee · outbound

This paper cites Compressive imaging via approximate message passing with image denoising.IEEE Transactions on Signal Processing, 63(8):2085–2092, 2015.

On Universality of Non-Separable Approximate Message Passing Algorithms Compressive imaging via approximate message passing with image denoising.IEEE Transactions on Signal Processing, 63(8):2085–2092, 2015

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:40.600214Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 624297a1-3e95-4c83-9a7e-d24931ea2c88 · outbound

This paper cites Approximate message passing with restricted boltzmann machine priors.Journal of Statistical Mechanics: Theory and Experiment, 2016(7):073401, 2016.

On Universality of Non-Separable Approximate Message Passing Algorithms Approximate message passing with restricted boltzmann machine priors.Journal of Statistical Mechanics: Theory and Experiment, 2016(7):073401, 2016

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:40.415049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 0da56ab1-b650-4ad7-b38c-1c883e3ffbba · outbound

This paper cites Springer, 2008.

On Universality of Non-Separable Approximate Message Passing Algorithms Springer, 2008

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:40.257647Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation cdfc9c57-1ca9-4a5c-a06a-e1d2fba01bfb · outbound

This paper cites Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators.

On Universality of Non-Separable Approximate Message Passing Algorithms Multi-Environment GLAMP: Approximate Message Passing for Transfer Learning with Applications to Lasso-based Estimators

Reference 68

Resolution: verified exact; local_arxiv, observed 2026-08-06T22:07:38.504313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a7707c33-de6f-4fd7-9201-cb2e94c2caac · outbound

This paper cites Universality of approximate message passing algorithms and tensor networks.The Annals of Applied Probability, 34(4):3943–3994, 2024.

On Universality of Non-Separable Approximate Message Passing Algorithms Universality of approximate message passing algorithms and tensor networks.The Annals of Applied Probability, 34(4):3943–3994, 2024

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:40.027132Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation b0d7a779-1f2a-4a3f-b8a6-3bcbd4c93025 · outbound

This paper cites Fundamental lim- its of matrix sensing: Exact asymptotics, universality, and applications.

On Universality of Non-Separable Approximate Message Passing Algorithms Fundamental lim- its of matrix sensing: Exact asymptotics, universality, and applications

Reference 70

Resolution: verified exact; raw_fallback, observed 2026-08-06T22:07:38.284916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9cb92d94-a630-4979-bd3f-be1c511de9d6 · outbound

This paper cites Matrix denoising with doubly heteroscedastic noise: Fun- damental limits and optimal spectral methods.

On Universality of Non-Separable Approximate Message Passing Algorithms Matrix denoising with doubly heteroscedastic noise: Fun- damental limits and optimal spectral methods

Reference 71

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:39.845568Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 8482af90-5699-40e9-82b6-48f0881ee448 · outbound

This paper cites LetPu1 = u1u⊤ 1/∥u1∥2 2 be the projection onto the span ofu1, and P⊥ u1 = Id− Pu1.

On Universality of Non-Separable Approximate Message Passing Algorithms LetPu1 = u1u⊤ 1/∥u1∥2 2 be the projection onto the span ofu1, and P⊥ u1 = Id− Pu1

Reference 72

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:39.655513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 89a45ecd-52bb-450e-a9e5-b12112381c16 · outbound

This paper cites An example conversion from(G,L)→ ( ˇG, ˇL)→ ( ˜G, ˜L).

On Universality of Non-Separable Approximate Message Passing Algorithms An example conversion from(G,L)→ ( ˇG, ˇL)→ ( ˜G, ˜L)

Reference 73

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:39.485853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2d6b4385-af1d-487d-8b0b-04eddfc7b23b · outbound

This paper cites Since z1 = W u1 and ˜z1 = W˜u1, (3) holds by (1) and the operator norm bound∥W∥op< 3 a.s.

On Universality of Non-Separable Approximate Message Passing Algorithms Since z1 = W u1 and ˜z1 = W˜u1, (3) holds by (1) and the operator norm bound∥W∥op< 3 a.s

Reference 74

Resolution: malformed identifier; raw_fallback, observed 2026-08-06T22:07:39.318259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 746d0cf5-967a-4d09-9582-76c8374a3f33 · outbound

This paper cites placeholders.

On Universality of Non-Separable Approximate Message Passing Algorithms placeholders

Reference 75

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T22:07:39.183730Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers