Learning Optimized Structure of Neural Networks by Hidden Node Pruning With Regularization

X **e, H Zhang, J Wang, Q Chang… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
We propose three different methods to determine the optimal number of hidden nodes
based on L 1 regularization for a multilayer perceptron network. The first two methods …

ALR-HT: A fast and efficient Lasso regression without hyperparameter tuning

Y Wang, B Zou, J Xu, C Xu, YY Tang - Neural Networks, 2025 - Elsevier
Lasso regression, known for its efficacy in high-dimensional data analysis and feature
selection, stands as a cornerstone in the realm of supervised learning for regression …

Survivability modeling and resource planning for self-repairing reconfigurable device fabrics

RS Oreifej, R Al-Haddad, R Zand… - IEEE Transactions …, 2017 - ieeexplore.ieee.org
A resilient system design problem is formulated as the quantification of uncommitted
reconfigurable resources required for a system of components to survive its lifetime within …

Federated Learning based on Kernel Local Differential Privacy and Low Gradient Sampling

Y Chen, D Chen, N Tang - IEEE Access, 2025 - ieeexplore.ieee.org
Federated learning that is an approach to addressing the “data silo” problem in a
collaborative fashion may face the risk of data leakage in real-world contexts. To solve this …

Markov subsampling based on Huber criterion

T Gong, Y Dong, H Chen, B Dong… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Subsampling is an important technique to tackle the computational challenges brought by
big data. Many subsampling procedures fall within the framework of importance sampling …

Regularized modal regression on markov-dependent observations: a theoretical assessment

T Gong, Y Dong, H Chen, W Feng, B Dong… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Modal regression, a widely used regression protocol, has been extensively investigated in
statistical and machine learning communities due to its robustness to outlier and heavy …

Robust Gradient-Based Markov Subsampling

T Gong, Q **, C Xu - Proceedings of the AAAI Conference on Artificial …, 2020 - ojs.aaai.org
Subsampling is a widely used and effective method to deal with the challenges brought by
big data. Most subsampling procedures are designed based on the importance sampling …

Learning with coefficient-based regularized regression on Markov resampling

L Li, W Li, B Zou, Y Wang, YY Tang… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Big data research has become a globally hot topic in recent years. One of the core problems
in big data learning is how to extract effective information from the huge data. In this paper …

Learning performance of regularized regression with multiscale kernels based on Markov observations

L Liu, W Huang, L Shen - Applied Mathematics and Computation, 2021 - Elsevier
We analyze a least square regularized regression (LSRR) problem with multiscale kernels
on the assumption that observations are subject to be non-independent and identically …

Generalization Performance of -Coefficient Regularized Regression With Multiscale Kernels Based on Markov Chain Samples

L Liu, B Liu - IEEE Access, 2019 - ieeexplore.ieee.org
This paper considers a ℓ 1-coefficient regularized regression algorithm with multiscale
kernels based on non-independent and identically distributed (non-iid) samples. The data …