ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1205.1240
  4. Cited By
Convex Relaxation for Combinatorial Penalties

Convex Relaxation for Combinatorial Penalties

6 May 2012
G. Obozinski
Francis R. Bach
ArXivPDFHTML

Papers citing "Convex Relaxation for Combinatorial Penalties"

7 / 7 papers shown
Title
Differentially Private Empirical Risk Minimization with
  Sparsity-Inducing Norms
Differentially Private Empirical Risk Minimization with Sparsity-Inducing Norms
K. S. S. Kumar
M. Deisenroth
16
6
0
13 May 2019
New Perspectives on k-Support and Cluster Norms
New Perspectives on k-Support and Cluster Norms
Andrew M. McDonald
Massimiliano Pontil
Dimitris Stamos
61
58
0
06 Mar 2014
Weakly decomposable regularization penalties and structured sparsity
Weakly decomposable regularization penalties and structured sparsity
Sara van de Geer
80
63
0
21 Apr 2012
Supervised Feature Selection in Graphs with Path Coding Penalties and
  Network Flows
Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows
Julien Mairal
Bin Yu
48
44
0
20 Apr 2012
Group Lasso with Overlaps: the Latent Group Lasso approach
Group Lasso with Overlaps: the Latent Group Lasso approach
G. Obozinski
Laurent Jacob
Jean-Philippe Vert
82
181
0
03 Oct 2011
Structured sparsity through convex optimization
Structured sparsity through convex optimization
Francis R. Bach
Rodolphe Jenatton
Julien Mairal
G. Obozinski
74
323
0
12 Sep 2011
Structured sparsity-inducing norms through submodular functions
Structured sparsity-inducing norms through submodular functions
Francis R. Bach
55
194
0
25 Aug 2010
1