The new generation brain-inspired sparse learning: A comprehensive survey
In recent years, the enormous demand for computing resources resulting from massive data
and complex network models has become the limitation of deep learning. In the large-scale …
and complex network models has become the limitation of deep learning. In the large-scale …
{xNIDS}: Explaining Deep Learning-based Network Intrusion Detection Systems for Active Intrusion Responses
While Deep Learning-based Network Intrusion Detection Systems (DL-NIDS) have recently
been significantly explored and shown superior performance, they are insufficient to actively …
been significantly explored and shown superior performance, they are insufficient to actively …
Neural architecture search as sparse supernet
This paper aims at enlarging the problem of Neural Architecture Search (NAS) from Single-
Path and Multi-Path Search to automated Mixed-Path Search. In particular, we model the …
Path and Multi-Path Search to automated Mixed-Path Search. In particular, we model the …
Estimating Double Sparse Structures over ℓu(ℓq)-Balls: Minimax Rates and Phase Transition
In this paper, we focus on the high-dimensional double sparse structures, where the
parameter of interest simultaneously encourages group-wise and element-wise sparsity. By …
parameter of interest simultaneously encourages group-wise and element-wise sparsity. By …
A minimax optimal approach to high-dimensional double sparse linear regression
In this paper, we focus our attention on the high-dimensional double sparse linear
regression, that is, a combination of element-wise and group-wise sparsity. To address this …
regression, that is, a combination of element-wise and group-wise sparsity. To address this …
A user-guided Bayesian framework for ensemble feature selection in life science applications (UBayFS)
Feature selection reduces the complexity of high-dimensional datasets and helps to gain
insights into systematic variation in the data. These aspects are essential in domains that …
insights into systematic variation in the data. These aspects are essential in domains that …
Self-concordant smoothing for convex composite optimization
AD Adeoye, A Bemporad - arXiv preprint arXiv:2309.01781, 2023 - arxiv.org
We introduce the notion of self-concordant smoothing for minimizing the sum of two convex
functions: the first is smooth and the second may be nonsmooth. Our framework results …
functions: the first is smooth and the second may be nonsmooth. Our framework results …
Joint selection of brain network nodes and edges for MCI identification
Abstract Background and Objective Functional brain graph (FBG), by describing the
interactions between different brain regions, provides an effective representation of fMRI …
interactions between different brain regions, provides an effective representation of fMRI …
Fast deterministic CUR matrix decomposition with accuracy assurance
The deterministic CUR matrix decomposition is a low-rank approximation method to analyze
a data matrix. It has attracted considerable attention due to its high interpretability, which …
a data matrix. It has attracted considerable attention due to its high interpretability, which …
Fast similarity computation for t-SNE
Data visualization has become a fundamental process of data engineering. t-SNE is one of
the most popular data visualization approaches. However, its computation cost is quadratic …
the most popular data visualization approaches. However, its computation cost is quadratic …