Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1008.4220
Cited By
Structured sparsity-inducing norms through submodular functions
25 August 2010
Francis R. Bach
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Structured sparsity-inducing norms through submodular functions"
29 / 29 papers shown
Title
Sparsity is All You Need: Rethinking Biological Pathway-Informed Approaches in Deep Learning
Isabella Caranzano
Corrado Pancotti
Cesare Rollo
Flavio Sartori
Pietro Liò
P. Fariselli
Tiziana Sanavia
OOD
UQCV
60
0
0
07 May 2025
Localized Distributional Robustness in Submodular Multi-Task Subset Selection
Ege C. Kaya
Abolfazl Hashemi
24
2
0
04 Apr 2024
Deletion Robust Non-Monotone Submodular Maximization over Matroids
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
Morteza Zadimoghaddam
26
3
0
16 Aug 2022
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
Tianyi Lin
Aldo Pacchiano
Yaodong Yu
Michael I. Jordan
26
0
0
15 May 2022
Deletion Robust Submodular Maximization over Matroids
Paul Dutting
Federico Fusco
Silvio Lattanzi
A. Norouzi-Fard
Morteza Zadimoghaddam
35
15
0
31 Jan 2022
Safe Screening for the Generalized Conditional Gradient Method
Yifan Sun
Francis R. Bach
27
9
0
22 Feb 2020
On the Effectiveness of Richardson Extrapolation in Machine Learning
Francis R. Bach
13
9
0
07 Feb 2020
Differentially Private Empirical Risk Minimization with Sparsity-Inducing Norms
K. S. S. Kumar
M. Deisenroth
16
6
0
13 May 2019
Human-in-the-Loop Interpretability Prior
Isaac Lage
A. Ross
Been Kim
S. Gershman
Finale Doshi-Velez
32
120
0
29 May 2018
Deep Submodular Functions
J. Bilmes
Wenruo Bai
13
45
0
31 Jan 2017
Style Imitation and Chord Invention in Polyphonic Music with Exponential Families
Gaëtan Hadjeres
Jason Sakellariou
F. Pachet
16
18
0
16 Sep 2016
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains
Yatao Bian
Baharan Mirzasoleiman
J. M. Buhmann
Andreas Krause
16
146
0
17 Jun 2016
The Lovász Hinge: A Novel Convex Surrogate for Submodular Losses
Jiaqian Yu
Matthew Blaschko
22
38
0
24 Dec 2015
New Optimisation Methods for Machine Learning
Aaron Defazio
38
6
0
09 Oct 2015
The LASSO with Non-linear Measurements is Equivalent to One With Linear Measurements
Christos Thrampoulidis
Ehsan Abbasi
B. Hassibi
33
116
0
06 Jun 2015
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation
Aaron Defazio
T. Caetano
41
40
0
10 Jul 2014
Learning Model-Based Sparsity via Projected Gradient Descent
S. Bahmani
P. Boufounos
Bhiksha Raj
34
18
0
07 Sep 2012
Convex Relaxation for Combinatorial Penalties
G. Obozinski
Francis R. Bach
56
62
0
06 May 2012
Weakly decomposable regularization penalties and structured sparsity
Sara van de Geer
80
63
0
21 Apr 2012
Learning Hierarchical and Topographic Dictionaries with Structured Sparsity
Julien Mairal
Rodolphe Jenatton
G. Obozinski
Francis R. Bach
33
18
0
20 Oct 2011
Group Lasso with Overlaps: the Latent Group Lasso approach
G. Obozinski
Laurent Jacob
Jean-Philippe Vert
85
181
0
03 Oct 2011
Structured sparsity through convex optimization
Francis R. Bach
Rodolphe Jenatton
Julien Mairal
G. Obozinski
74
323
0
12 Sep 2011
A General Framework for Structured Sparsity via Proximal Optimization
Andreas Argyriou
Luca Baldassarre
Jean Morales
Massimiliano Pontil
38
21
0
26 Jun 2011
Structured Sparsity via Alternating Direction Methods
Zhiwei Qin
D. Goldfarb
46
77
0
04 May 2011
Convex and Network Flow Optimization for Structured Sparsity
Julien Mairal
Rodolphe Jenatton
G. Obozinski
Francis R. Bach
54
108
0
11 Apr 2011
Multi-label Learning via Structured Decomposition and Group Sparsity
Dinesh Manocha
Dacheng Tao
47
2
0
01 Mar 2011
Shaping Level Sets with Submodular Functions
Francis R. Bach
72
25
0
07 Dec 2010
Convex Analysis and Optimization with Submodular Functions: a Tutorial
Francis R. Bach
56
36
0
20 Oct 2010
Network Flow Algorithms for Structured Sparsity
Julien Mairal
Rodolphe Jenatton
G. Obozinski
Francis R. Bach
39
172
0
31 Aug 2010
1