Stochastic proximal methods for non-smooth non-convex constrained sparse optimization

被引：0
|
作者：
Metel, Michael R. [1 ]
Takeda, Akiko [1 ,2 ]
机构：
[1] Center for Artificial Intelligence Project, RIKEN, Tokyo,103-0027, Japan
[2] Graduate School of Information Science and Technology, The University of Tokyo, Tokyo,103-0027, Japan
来源：
Journal of Machine Learning Research | 2021年 / 22卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Constrained optimization - Convex optimization - Stochastic systems
引用
收藏
相关论文
共 50 条
  • [1] Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization
    Metel, Michael R.
    Takeda, Akiko
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [2] Inertial Block Proximal Methods For Non-Convex Non-Smooth Optimization
    Le Thi Khanh Hien
    Gillis, Nicolas
    Patrinos, Panagiotis
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [3] Inexact Proximal Gradient Methods for Non-Convex and Non-Smooth Optimization
    Gu, Bin
    Wang, De
    Huo, Zhouyuan
    Huang, Heng
    [J]. THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3093 - 3100
  • [4] Simple Stochastic Gradient Methods for Non-Smooth Non-Convex Regularized Optimization
    Metel, Michael R.
    Takeda, Akiko
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [5] Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization
    Lin, Zhenwei
    Xia, Jingfan
    Deng, Qi
    Luo, Luo
    [J]. THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 16, 2024, : 17477 - 17486
  • [6] Effective Proximal Methods for Non-convex Non-smooth Regularized Learning
    Liang, Guannan
    Tong, Qianqian
    Ding, Jiahao
    Pan, Miao
    Bi, Jinbo
    [J]. 20TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2020), 2020, : 342 - 351
  • [7] A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
    Bian, Fengmiao
    Liang, Jingwei
    Zhang, Xiaoqun
    [J]. INVERSE PROBLEMS, 2021, 37 (07)
  • [8] Optimal, Stochastic, Non-smooth, Non-convex Optimization through Online-to-Non-convex Conversion
    Cutkosky, Ashok
    Mehta, Harsh
    Orabona, Francesco
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
  • [9] Fast Proximal Gradient Descent for A Class of Non-convex and Non-smooth Sparse Learning Problems
    Yang, Yingzhen
    Yu, Jiahui
    [J]. 35TH UNCERTAINTY IN ARTIFICIAL INTELLIGENCE CONFERENCE (UAI 2019), 2020, 115 : 1253 - 1262
  • [10] Generalized non-convex non-smooth sparse and low rank minimization using proximal average
    Lin, Xiaofan
    Wei, Gang
    [J]. NEUROCOMPUTING, 2016, 174 : 1116 - 1124
12345