Forward-Backward Greedy Algorithms for General Convex Smooth Functions
over A Cardinality Constraint

v1v2 (latest)

Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint

31 December 2013

ArXiv (abs)PDF HTML

Papers citing "Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint"

9 / 9 papers shown

Title
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families Goutham Rajendran Bohdan Kivva Ming Gao Bryon Aragam 81 17 0 10 Oct 2021
Discrimination-aware Network Pruning for Deep Model Compression Jing Liu Bohan Zhuang Zhuangwei Zhuang Yong Guo Junzhou Huang Jin-Hui Zhu Mingkui Tan CVBM 76 121 0 04 Jan 2020
Discrimination-aware Channel Pruning for Deep Neural Networks Zhuangwei Zhuang Mingkui Tan Bohan Zhuang Jing Liu Yong Guo Qingyao Wu Junzhou Huang Jin-Hui Zhu 162 601 0 28 Oct 2018
A Robust AUC Maximization Framework with Simultaneous Outlier Detection and Feature Selection for Positive-Unlabeled Classification Ke Ren Haichuan Yang Yu Zhao Mingshan Xue Hongyu Miao Shuai Huang Ji Liu AI4TS 43 30 0 18 Mar 2018
Distributed Bayesian Piecewise Sparse Linear Models M. Asahara R. Fujimaki 38 0 0 07 Nov 2017
An Interactive Greedy Approach to Group Sparsity in High Dimensions Wei Qian Wending Li Yasuhiro Sogawa R. Fujimaki Xitong Yang Ji Liu 80 7 0 10 Jul 2017
Restricted Strong Convexity Implies Weak Submodularity Ethan R. Elenberg Rajiv Khanna A. Dimakis S. Negahban 96 159 0 02 Dec 2016
On Iterative Hard Thresholding Methods for High-dimensional M-Estimation Prateek Jain Ambuj Tewari Purushottam Kar 195 232 0 20 Oct 2014
Forward - Backward Greedy Algorithms for Atomic Norm Regularization Nikhil S. Rao P. Shah Stephen J. Wright 97 91 0 23 Apr 2014

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.