Evidence map›Paper›PMID 39926177›Full record

ArticleJournal of applied statistics2025

Robust convex biclustering with a tuning-free method.

Yifan Chen, Chunyin Lei, Chuanquan Li, Haiqiang Ma, Ningyuan Hu

Abstract read
In one paragraph

Article in Journal of applied statistics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

5 authors.

Yifan ChenDepartment of Statistics and Applied Probability, University of California, Santa Barbara, CA, USA.
Chunyin LeiSchool of Statistics and Data Science, Jiangxi University of Finance and Economics, Nanchang, People's Republic of China.
Chuanquan LiSchool of Statistics and Data Science, Jiangxi University of Finance and Economics, Nanchang, People's Republic of China.
Haiqiang MaSchool of Statistics and Data Science, Jiangxi University of Finance and Economics, Nanchang, People's Republic of China.
Ningyuan HuDepartment of Mathematics, University College London, London, UK.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Biclustering is widely used in different kinds of fields including gene information analysis, text mining, and recommendation system by effectively discovering the local correlation between samples and features. However, many biclustering algorithms will collapse when facing heavy-tailed data. In this paper, we propose a robust version of convex biclustering algorithm with Huber loss. Yet, the newly introduced robustification parameter brings an extra burden to selecting the optimal parameters. Therefore, we propose a tuning-free method for automatically selecting the optimal robustification parameter with high efficiency. The simulation study demonstrates the more fabulous performance of our proposed method than traditional biclustering methods when encountering heavy-tailed noise. A real-life biomedical application is also presented. The R package RcvxBiclustr is available at https://github.com/YifanChen3/RcvxBiclustr.

Indexed as

62-0462-0862P10Biclusteringconvex optimizationheavy tailHuber losstuning-free

Identifiers

PMID39926177
PMCPMC11800347

What OpenQuestion holds

Textmetadata
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.