Evidence map›Paper›PMID 37822489›Full record

ArticleJournal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America2023

Bayesian Trend Filtering via Proximal Markov Chain Monte Carlo.

Qiang Heng, Hua Zhou, Eric C Chi

Abstract read
In one paragraph

Article in Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. MM optimization: Proximal distance algorithms, path following, and trust regions.Proceedings of the National Academy of Sciences of the United States of America · 2023
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Qiang HengDepartment of Statistics, North Carolina State University.
Hua ZhouDepartments of Biostatistics and Computational Medicine, UCLA.
Eric C ChiDepartment of Statistics, Rice University.

Funding

Genomics, GPUs, and Next Generation Computational StatisticsR01HG006139 · NHGRI · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI SOBEL, ERIC · 2011 to 2023
$5.1M
Modeling, Inference, and Optimization for Genomic and Biomedical Big DataR35GM141798 · NIGMS · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI LANGE, KENNETH L · 2021 to 2025
$2.7M
Modelers and Storytellers: Transdisciplinary Training to Advance Community Health Intervention ResearchR25HD108136 · NICHD · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI NIANOGO, ROCH, PRELIP, MICHAEL LEE · 2022 to 2025
$726k
Imputing Single Cell Rna Sequencing Data: Mathematical, Statistical And Computational ChallengesR01GM135928 · NIGMS · RICE UNIVERSITY · PI CHI, ERIC C · 2019 to 2021
$696k
NHGRI NIH HHS R01 HG006139NICHD NIH HHS R25 HD108136NIGMS NIH HHS R01 GM135928NIGMS NIH HHS R35 GM141798
6 · The paper itself

Abstract

Proximal Markov Chain Monte Carlo is a novel construct that lies at the intersection of Bayesian computation and convex optimization, which helped popularize the use of nondifferentiable priors in Bayesian statistics. Existing formulations of proximal MCMC, however, require hyperparameters and regularization parameters to be prespecified. In this work, we extend the paradigm of proximal MCMC through introducing a novel new class of nondifferentiable priors called epigraph priors. As a proof of concept, we place trend filtering, which was originally a nonparametric regression problem, in a parametric setting to provide a posterior median fit along with credible intervals as measures of uncertainty. The key idea is to replace the nonsmooth term in the posterior density with its Moreau-Yosida envelope, which enables the application of the gradient-based MCMC sampler Hamiltonian Monte Carlo. The proposed method identifies the appropriate amount of smoothing in a data-driven way, thereby automating regularization parameter selection. Compared with conventional proximal MCMC methods, our method is mostly tuning free, achieving simultaneous calibration of the mean, scale and regularization parameters in a fully Bayesian framework.

Indexed as

convex optimizationepigraphsHamiltonian Monte CarloMoreau-Yosida envelopetrend filtering

Identifiers

PMID37822489
PMCPMC10564381

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.