Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Collin Cademartori

dblp:210/2570 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2024
0009-0004-8559-8108ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 70% Mathematical optimization · 30%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › signal processing › compressed sensing
approximate message passing
0.812024
A Non-Asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms With Rotationally Invariant Designs · IEEE Trans. Inf. Theory 2024
Information theory › statistical inference
high-dimensional inference
0.812024
A Non-Asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms With Rotationally Invariant Designs · IEEE Trans. Inf. Theory 2024
Mathematical optimization › convergence analysis
non-asymptotic analysis
0.812024
A Non-Asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms With Rotationally Invariant Designs · IEEE Trans. Inf. Theory 2024
Information theory › signal processing › compressed sensing › approximate message passing
state evolution
0.812024
A Non-Asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms With Rotationally Invariant Designs · IEEE Trans. Inf. Theory 2024

Methods — techniques the papers use, named apart from their topics

state evolution · 0.8concentration inequalities · 0.8approximate message passing · 0.8
YearPublicationVenuePosition
2024 A Non-Asymptotic Analysis of Generalized Vector Approximate Message Passing Algorithms With Rotationally Invariant Designs
abstract
Approximate Message Passing (AMP) algorithms are a class of iterative procedures for computationally-efficient estimation in high-dimensional inference and estimation tasks. Due to the presence of an ‘Onsager’ correction term in its iterates, forN×Mdesign matrices A with i.i.d. Gaussian entries, the asymptotic distribution of the estimate at any iteration of the algorithm can be exactly characterized in the large system limit asM/N→ δ ∈ (0,∞) via a scalar recursion referred to as state evolution. In this paper, we show that appropriate functionals of the iterates, in fact, concentrate around their limiting values predicted by these asymptotic distributions with rates exponentially fast inNfor a large class of AMP-style algorithms, including those that are used when high-dimensional generalized linear regression models are assumed to be the data-generating process, like the generalized AMP algorithm, or those that are used when the measurement matrix is assumed to be rotationally invariant instead of i.i.d. Gaussian, like vector AMP and generalized vector AMP. In practice, these more general AMP algorithms have many applications, for example in communications or imaging, and this work provides the first study of finite sample behavior of such algorithms.
Collin Cademartori, Cynthia Rush
IEEE Trans. Inf. Theory1
2020 Exponentially Fast Concentration of Vector Approximate Message Passing to its State Evolution
abstract
Vector Approximate Message Passing is a computationally-efficient iterative algorithm for estimation in high-dimensional regression problems. Due to the presence of an `Onsager' correction term in its iterates, for a wide class of N × M design matrices, namely those that are right orthogonally-invariant, the asymptotic distribution of the algorithm's estimate of the signal at any iteration can be exactly characterized in the large system limit as M/N → δ ∈ (0,∞) via a scalar recursion referred to as state evolution. In this paper, we show that appropriate functionals of the iterates in fact concentrate around their limiting values predicted by these asymptotic distributions with rates exponentially fast in N.
Collin Cademartori, Cynthia Rush
ISIT1
2018 Automatic Conflict Detection in Police Body-Worn Audio
abstract
Automatic conflict detection has grown in relevance with the advent of body-worn technology, but existing metrics such as turn-taking and overlap are poor indicators of conflict in police-public interactions. Moreover, standard techniques to compute them fall short when applied to such diversified and noisy contexts. We develop a pipeline catered to this task combining adaptive noise removal, non-speech filtering and new measures of conflict based on the repetition and intensity of phrases in speech. We demonstrate the effectiveness of our approach on body-worn audio data collected by the Los Angeles Police Department.
Alistair Letcher, Jelena Trisovic, Collin Cademartori
ICASSP3