Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to
Non-smooth Concave Maximization

v1v2 (latest)

Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization

1 March 2017

Bo Liu

Dimitris N. Metaxas

ArXiv (abs)PDF HTML

Papers citing "Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization"

7 / 7 papers shown

Title
Dynamic Incremental Optimization for Best Subset Selection Shaogang Ren Xiaoning Qian 77 0 0 04 Feb 2024
Convergence of the mini-batch SIHT algorithm S. Damadi Jinglai Shen 49 2 0 29 Sep 2022
Best Subset Selection with Efficient Primal-Dual Algorithm Shaogang Ren Guanhua Fang P. Li 40 0 0 05 Jul 2022
Stochastic Hard Thresholding Algorithms for AUC Maximization Zhenhuan Yang Baojian Zhou Yunwen Lei Yiming Ying 64 3 0 04 Nov 2020
Factorization Machines with Regularization for Sparse Feature Interactions Kyohei Atarashi S. Oyama M. Kurihara 56 6 0 19 Oct 2020
Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization Baojian Zhou F. Chen Yiming Ying 80 7 0 09 May 2019
Compressive Sensing Using Iterative Hard Thresholding with Low Precision Data Representation: Theory and Applications Nezihe Merve Gürel Kaan Kara A. Stojanov T. Smith Thomas Lemmin Dan Alistarh Markus Püschel Ce Zhang 15 2 0 14 Feb 2018