Search results for "sparsity"

showing 4 items of 14 documents

On the sign recovery by LASSO, thresholded LASSO and thresholded Basis Pursuit Denoising

2020

Basis Pursuit (BP), Basis Pursuit DeNoising (BPDN), and LASSO are popular methods for identifyingimportant predictors in the high-dimensional linear regression model Y = Xβ + ε. By definition, whenε = 0, BP uniquely recovers β when Xβ = Xb and β different than b implies L1 norm of β is smaller than the L1 norm of b (identifiability condition). Furthermore, LASSO can recover the sign of β only under a much stronger irrepresentability condition. Meanwhile, it is known that the model selection properties of LASSO can be improved by hard-thresholdingits estimates. This article supports these findings by proving that thresholded LASSO, thresholded BPDNand thresholded BP recover the sign of β in …

Statistics::TheoryStatistics::Machine Learning[STAT.AP]Statistics [stat]/Applications [stat.AP][STAT.AP] Statistics [stat]/Applications [stat.AP]Basis PursuitIdentifiability conditionMultiple regressionStatistics::MethodologyLASSOActive set estimationSign estimationSparsityIrrepresentability condition
researchProduct

The conditional censored graphical lasso estimator

2020

© 2020, Springer Science+Business Media, LLC, part of Springer Nature. In many applied fields, such as genomics, different types of data are collected on the same system, and it is not uncommon that some of these datasets are subject to censoring as a result of the measurement technologies used, such as data generated by polymerase chain reactions and flow cytometer. When the overall objective is that of network inference, at possibly different levels of a system, information coming from different sources and/or different steps of the analysis can be integrated into one model with the use of conditional graphical models. In this paper, we develop a doubly penalized inferential procedure for…

Statistics and ProbabilityFOS: Computer and information sciencesComputer scienceGaussianInferenceData typeTheoretical Computer Sciencehigh-dimensional settingDatabase normalizationMethodology (stat.ME)symbols.namesakeLasso (statistics)Graphical modelConditional Gaussian graphical modelcensored graphical lassoStatistics - MethodologyHigh-dimensional settingconditional Gaussian graphical modelssparsityEstimatorCensoring (statistics)Censored graphical lassoComputational Theory and MathematicssymbolsCensored dataStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaSparsityAlgorithm
researchProduct

A Sparsity-Aware Approach for NBI Estimation and Mitigation in Large Cognitive Radio Networks

2016

Underlay cognitive networks should follow strict interference thresholds to operate in parallel with primary networks. This constraint limits their transmission power and eventually the coverage area. Therefore, in this paper, we first design a new approach for asynchronous narrow-band interference (NBI) estimation and mitigation in orthogonal frequency-division multiplexing cognitive radio networks that does not require prior knowledge of the NBI characteristics. Our proposed approach allows the primary user to exploit the sparsity of the secondary users' interference signal to recover it and cancel it based on sparse signal recovery theory. We also propose two subcarrier selection schemes…

EngineeringOrthogonal frequency-division multiplexingComputer system recoveryCognitive radio02 engineering and technologyInterference (wave propagation)SubcarrierFrequency-division multiplexingRecovery0502 economics and business0202 electrical engineering electronic engineering information engineeringElectronic engineeringCost constraintsUnderlaySignal reconstructionOrthogonal frequency division multiplexingbusiness.industry05 social sciences020206 networking & telecommunicationsCompressive sensingWave interferenceCognitive networkNarrow band interferenceCognitive radioCompressed sensingSecondary recoverySignal interferenceFrequency estimationbusinessCognitive networkSparsity050203 business & management2016 IEEE 84th Vehicular Technology Conference (VTC-Fall)
researchProduct

Low-Rank Tucker-2 Model for Multi-Subject fMRI Data Decomposition with Spatial Sparsity Constraint

2022

Tucker decomposition can provide an intuitive summary to understand brain function by decomposing multi-subject fMRI data into a core tensor and multiple factor matrices, and was mostly used to extract functional connectivity patterns across time/subjects using orthogonality constraints. However, these algorithms are unsuitable for extracting common spatial and temporal patterns across subjects due to distinct characteristics such as high-level noise. Motivated by a successful application of Tucker decomposition to image denoising and the intrinsic sparsity of spatial activations in fMRI, we propose a low-rank Tucker-2 model with spatial sparsity constraint to analyze multi-subject fMRI dat…

Rank (linear algebra)Computer scienceMatrix normlow-rankmatrix decompositionsymbols.namesaketoiminnallinen magneettikuvausOrthogonalitytensorsTensor (intrinsic definition)Kronecker deltaTucker decompositionHumansElectrical and Electronic Engineeringcore tensorsparsity constraintRadiological and Ultrasound Technologybusiness.industrysignaalinkäsittelyfeature extractionsparse matricesBrainPattern recognitionbrain modelingMagnetic Resonance Imagingfunctional magnetic resonance imagingComputer Science ApplicationsConstraint (information theory)data modelssymbolsNoise (video)Artificial intelligencebusinessmulti-subject fMRI dataSoftwareAlgorithmsTucker decomposition
researchProduct