Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery

Neural Computation (2016) 28 (3): 525–562.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Fast robust kernel regression through sign gradient descent with early stopping
  • Oskar Allerbo
Electronic Journal of Statistics (2025) 19 (1)
Iterative kernel regression with preconditioning
  • Lei Shi
  • Zihan Zhang
Analysis and Applications (2024) 22 (06): 1095.
An Instance-Frequency-Weighted Regularization Scheme for Non-Negative Latent Factor Analysis on High-Dimensional and Sparse Data
  • Xin Luo
  • Zidong Wang
  • Mingsheng Shang
IEEE Transactions on Systems, Man, and Cybernetics: Systems (2021) 51 (6): 3522.
Adaptive function-on-scalar regression with a smoothing elastic net
  • Ardalan Mirshani
  • Matthew Reimherr
Journal of Multivariate Analysis (2021) 185: 104765.
Sparse additive machine with ramp loss
  • Hong Chen
  • Changying Guo
  • Huijuan Xiong
  • Yingjie Wang
Analysis and Applications (2021) 19 (03): 509.
Generalized support vector regression: Duality and tensor-kernel representation
  • Saverio Salzo
  • Johan A. K. Suykens
Analysis and Applications (2020) 18 (01): 149.
Convergence analysis of distributed multi-penalty regularized pairwise learning
  • Ting Hu
  • Jun Fan
  • Dao-Hong Xiang
Analysis and Applications (2020) 18 (01): 109.
Kernelized Elastic Net Regularization based on Markov selective sampling
  • Weijian Chen
  • Chen Xu
  • Bin Zou
  • Huidong Jin
  • Jie Xu
Knowledge-Based Systems (2019) 163: 57.
Optimal rates for coefficient-based regularized regression
  • Zheng-Chu Guo
  • Lei Shi
Applied and Computational Harmonic Analysis (2019) 47 (3): 662.
Regularized modal regression with data-dependent hypothesis spaces
  • Yingjie Wang
  • Hong Chen
  • Biqin Song
  • Han Li
International Journal of Wavelets, Multiresolution and Information Processing (2019) 17 (06): 1950047.
Distributed learning with indefinite kernels
  • Lei Shi
Analysis and Applications (2019) 17 (06): 947.
Nyström subsampling method for coefficient-based regularized regression
  • Longda Ma
  • Lei Shi
  • Zongmin Wu
Inverse Problems (2019) 35 (7): 075002.
Distributed learning with multi-penalty regularization
  • Zheng-Chu Guo
  • Shao-Bo Lin
  • Lei Shi
Applied and Computational Harmonic Analysis (2019) 46 (3): 478.
Spectral stochastic isogeometric analysis for linear stability analysis of plate
  • Keyan Li
  • Di Wu
  • Wei Gao
Computer Methods in Applied Mechanics and Engineering (2019) 352: 1.
Variable Selection for Nonparametric Learning with Power Series Kernels
  • Kota Matsui
  • Wataru Kumagai
  • Kenta Kanamori
  • Mitsuaki Nishikimi
  • Takafumi Kanamori
Neural Computation (2019) 31 (8): 1718.
Dynamic reliability analysis using the extended support vector regression (X-SVR)
  • Jinwen Feng
  • Lei Liu
  • Di Wu
  • Guoyin Li
  • Michael Beer
  • Wei Gao
Mechanical Systems and Signal Processing (2019) 126: 368.
Kernel-based sparse regression with the correntropy-induced loss
  • Hong Chen
  • Yulong Wang
Applied and Computational Harmonic Analysis (2018) 44 (1): 144.
Cognitive Assessment Prediction in Alzheimer’s Disease by Multi-Layer Multi-Target Regression
  • Xiaoqian Wang
  • Xiantong Zhen
  • Quanzheng Li
  • Dinggang Shen
  • Heng Huang
Neuroinformatics (2018) 16 (3-4): 285.
Robust L-norm least squares support vector regression with feature selection
  • Ya-Fen Ye
  • Yuan-Hai Shao
  • Nai-Yang Deng
  • Chun-Na Li
  • Xiang-Yu Hua
Applied Mathematics and Computation (2017) 305: 32.
Locally weighted kernel partial least squares regression based on sparse nonlinear features for virtual sensing of nonlinear time-varying processes
  • Xinmin Zhang
  • Manabu Kano
  • Yuan Li
Computers & Chemical Engineering (2017) 104: 164.
Error analysis of regularized least-square regression with Fredholm kernel
  • Yanfang Tao
  • Peipei Yuan
  • Biqin Song
Neurocomputing (2017) 249: 237.
Local Rademacher complexity bounds based on covering numbers
  • Yunwen Lei
  • Lixin Ding
  • Yingzhou Bi
Neurocomputing (2016) 218: 320.

Advertisement

  • Online ISSN 1530-888X
  • Print ISSN 0899-7667
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2025 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept