Pith. sign in

REVIEW 1 cited by

Smooth blockwise iterative thresholding: a smooth fixed point estimator based on the likelihood's block gradient

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1110.1012 v1 pith:MHZVG4GQ submitted 2011-10-05 stat.ME

classification stat.ME
keywords smooththresholdingestimatorfunctionsmoothnessblockwisedefinedestimate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The proposed smooth blockwise iterative thresholding estimator (SBITE) is a model selection technique defined as a fixed point reached by iterating a likelihood gradient-based thresholding function. The smooth James-Stein thresholding function has two regularization parameters $\lambda$ and $\nu$, and a smoothness parameter $s$. It enjoys smoothness like ridge regression and selects variables like lasso. Focusing on Gaussian regression, we show that SBITE is uniquely defined, and that its Stein unbiased risk estimate is a smooth function of $\lambda$ and $\nu$, for better selection of the two regularization parameters. We perform a Monte-Carlo simulation to investigate the predictive and oracle properties of this smooth version of adaptive lasso. The motivation is a gravitational wave burst detection problem from several concomitant time series. A nonparametric wavelet-based estimator is developed to combine information from all captors by block-thresholding multiresolution coefficients. We study how the smoothness parameter $s$ tempers the erraticity of the risk estimate, and derive a universal threshold, an information criterion and an oracle inequality in this canonical setting.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Experimental Assortments for Choice Estimation and Nest Identification

    stat.ME 2026-02 conditional novelty 7.0 of 10

    A binary-code experiment design with O(log n) assortments, plus a boost-factor algorithm, provably recovers substitution nests in Nested Logit models and improves choice prediction.

Pith tools