paper-with-me

홈 › Papers

Randomized Structural Sparsity via Constrained Block Subsampling for Improved Sensitivity of Discriminative Voxel Identification

2014-10-17 · Yi-Lun Wang, Junjie Zheng, Sheng Zhang, Xujun Duan, Huafu Chen

In this paper, we consider voxel selection for functional Magnetic Resonance Imaging (fMRI) brain data with the aim of finding a more complete set of probably correlated discriminative voxels, thus improving interpretation of the discovered potential biomarkers. The main difficulty in doing this is an extremely high dimensional voxel space and few training samples, resulting in unreliable feature selection. In order to deal with the difficulty, stability selection has received a great deal of attention lately, especially due to its finite sample control of false discoveries and transparent principle for choosing a proper amount of regularization. However, it fails to make explicit use of the correlation property or structural information of these discriminative features and leads to large false negative rates. In other words, many relevant but probably correlated discriminative voxels are missed. Thus, we propose a new variant on stability selection "randomized structural sparsity", which incorporates the idea of structural sparsity. Numerical experiments demonstrate that our method can be superior in controlling for false negatives while also keeping the control of false positives inherited from stability selection.

📄 PDF Abstract BibTeX arXiv:1410.4650

Code (0)

등록된 구현이 없습니다.

Tasks

feature selectionSensitivity

Similar Papers 제목 키워드 기반

Stochastic Convolutional Sparse Coding

2019-08-31 · Jinhui Xiong, Peter Richtárik, Wolfgang Heidrich

State-of-the-art methods for Convolutional Sparse Coding usually employ Fourier-domain solvers in order to speed up the convolution operators. However, this approach is not without shortcomings. For example, Fourier-doma…

NYTRO: When Subsampling Meets Early Stopping

2015-10-19 · Tomas Angles, Raffaello Camoriano, Alessandro Rudi, Lorenzo Rosasco

Early stopping is a well known approach to reduce the time complexity for performing training and model selection of large scale learning machines. On the other hand, memory/space (rather than time) complexity is the mai…

Model Selectionregression

Theoretical Analysis for Extended Target Recovery in Randomized Stepped Frequency Radars

2019-08-08 · Lei Wang, Tianyao Huang, Yimin Liu

Randomized Stepped Frequency Radar (RSFR) is very attractive for tasks under complex electromagnetic environment. Due to the synthetic high range resolution in RSRFs, a target usually occupies a series of range cells and…

Adaptive Iterative Hessian Sketch via A-Optimal Subsampling

2019-02-20 · Aijun Zhang, Hengtao Zhang, Guosheng Yin

Iterative Hessian sketch (IHS) is an effective sketching method for modeling large-scale data. It was originally proposed by Pilanci and Wainwright (2016; JMLR) based on randomized sketching matrices. However, it is comp…

Optimized Tradeoffs for Private Prediction with Majority Ensembling

2024-11-27 · Shuli Jiang, Qiuyi, Zhang, Gauri Joshi

We study a classical problem in private prediction, the problem of computing an $(m\epsilon, \delta)$-differentially private majority of $K$ $(\epsilon, \Delta)$-differentially private algorithms for $1 \leq m \leq K$ an…

image-classificationImage ClassificationPrediction