default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Obozinski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i19]Nathanaël Perraudin, Adrien Teutrie, Cécile Hébert
, Guillaume Obozinski:
Efficient algorithms for regularized Poisson Non-negative Matrix Factorization. CoRR abs/2404.16505 (2024)- 2023
- [i18]Paola Malsot, Filipe Martins, Didier Trono, Guillaume Obozinski:
Optirank: classification for RNA-Seq data with optimal ranking reference genes. CoRR abs/2301.04653 (2023) - [i17]Stefania Russo, Nathanaël Perraudin, Steven Stalder, Fernando Pérez-Cruz, João Paulo Leitão, Guillaume Obozinski, Jan Dirk Wegner:
An evaluation of deep learning models for predicting water depth evolution in urban floods. CoRR abs/2302.10062 (2023) - 2022
- [i16]Enikö Székely, Sebastian Sippel, Nicolai Meinshausen, Guillaume Obozinski, Reto Knutti:
Robust detection and attribution of climate change under interventions. CoRR abs/2212.04905 (2022) - 2020
- [j8]Axel Parmentier, Victor Cohen, Vincent Leclère, Guillaume Obozinski, Joseph Salmon:
Integer Programming on the Junction Tree Polytope for Influence Diagrams. INFORMS J. Optim. 2(3): 209-228 (2020) - [c25]Shell Xu Hu, Pablo Garcia Moreno, Yang Xiao, Xi Shen, Guillaume Obozinski, Neil D. Lawrence, Andreas C. Damianou:
Empirical Bayes Transductive Meta-Learning with Synthetic Gradients. ICLR 2020 - [c24]Timothée Lacroix, Guillaume Obozinski, Nicolas Usunier:
Tensor Decompositions for Temporal Knowledge Base Completion. ICLR 2020 - [i15]Timothée Lacroix, Guillaume Obozinski, Nicolas Usunier:
Tensor Decompositions for temporal knowledge base completion. CoRR abs/2004.04926 (2020) - [i14]Shell Xu Hu, Pablo Garcia Moreno, Yang Xiao, Xi Shen, Guillaume Obozinski, Neil D. Lawrence, Andreas C. Damianou:
Empirical Bayes Transductive Meta-Learning with Synthetic Gradients. CoRR abs/2004.12696 (2020)
2010 – 2019
- 2019
- [c23]Benjamin Dubois, Jean-François Delmas, Guillaume Obozinski:
Fast Algorithms for Sparse Reduced-Rank Regression. AISTATS 2019: 2415-2424 - 2018
- [c22]Xu Hu, Guillaume Obozinski:
SDCA-Powered Inexact Dual Augmented Lagrangian Method for Fast CRF Learning. AISTATS 2018: 988-997 - [c21]Timothée Lacroix, Nicolas Usunier, Guillaume Obozinski:
Canonical Tensor Decomposition for Knowledge Base Completion. ICML 2018: 2869-2878 - [i13]Timothée Lacroix, Nicolas Usunier, Guillaume Obozinski:
Canonical Tensor Decomposition for Knowledge Base Completion. CoRR abs/1806.07297 (2018) - [i12]Marina Vinyes, Guillaume Obozinski:
Learning the effect of latent variables in Gaussian Graphical models with unobserved variables. CoRR abs/1807.07754 (2018) - 2017
- [j7]Loïc Landrieu, Guillaume Obozinski:
Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs. SIAM J. Imaging Sci. 10(4): 1724-1766 (2017) - [c20]Marina Vinyes, Guillaume Obozinski:
Fast column generation for atomic norm regularization. AISTATS 2017: 547-556 - 2016
- [j6]Petr Gronát, Josef Sivic, Guillaume Obozinski, Tomás Pajdla:
Learning and Calibrating Per-Location Classifiers for Visual Place Recognition. Int. J. Comput. Vis. 118(3): 319-336 (2016) - [c19]Loïc Landrieu, Guillaume Obozinski:
Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions. AISTATS 2016: 1384-1393 - 2015
- [c18]Mateusz Kozinski, Raghudeep Gadde, Sergey Zagoruyko, Guillaume Obozinski, Renaud Marlet:
A MRF shape prior for facade parsing with occlusions. CVPR 2015: 2820-2828 - 2014
- [c17]Mateusz Kozinski, Guillaume Obozinski, Renaud Marlet:
Beyond Procedural Facade Parsing: Bidirectional Alignment via Linear Programming. ACCV (4) 2014: 79-94 - [c16]Edouard Grave, Guillaume Obozinski, Francis R. Bach:
A Markovian approach to distributional semantics with application to semantic compositionality. COLING 2014: 1447-1456 - [c15]Emile Richard, Guillaume Obozinski, Jean-Philippe Vert:
Tight convex relaxations for sparse matrix factorization. NIPS 2014: 3284-3292 - [c14]Loïc Landrieu, Guillaume Obozinski:
Continuously indexed Potts models on unoriented graphs. UAI 2014: 459-468 - [i11]Emile Richard, Guillaume Obozinski, Jean-Philippe Vert:
Tight convex relaxations for sparse matrix factorization. CoRR abs/1407.5158 (2014) - 2013
- [c13]Edouard Grave, Guillaume Obozinski, Francis R. Bach:
Hidden Markov tree models for semantic class induction. CoNLL 2013: 94-103 - [c12]Petr Gronát, Guillaume Obozinski, Josef Sivic, Tomás Pajdla:
Learning and Calibrating Per-Location Classifiers for Visual Place Recognition. CVPR 2013: 907-914 - [i10]Edouard Grave, Guillaume Obozinski, Francis R. Bach:
Domain adaptation for sequence labeling using hidden Markov models. CoRR abs/1312.4092 (2013) - 2012
- [j5]Francis R. Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski:
Optimization with Sparsity-Inducing Penalties. Found. Trends Mach. Learn. 4(1): 1-106 (2012) - [j4]Rodolphe Jenatton, Alexandre Gramfort, Vincent Michel, Guillaume Obozinski, Evelyn Eger, Francis R. Bach, Bertrand Thirion:
Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity. SIAM J. Imaging Sci. 5(3): 835-856 (2012) - [c11]Francis R. Bach, Simon Lacoste-Julien, Guillaume Obozinski:
On the Equivalence between Herding and Conditional Gradient Algorithms. ICML 2012 - [c10]Rodolphe Jenatton, Nicolas Le Roux, Antoine Bordes, Guillaume Obozinski:
A latent factor model for highly multi-relational data. NIPS 2012: 3176-3184 - [i9]Francis R. Bach, Simon Lacoste-Julien, Guillaume Obozinski:
On the Equivalence between Herding and Conditional Gradient Algorithms. CoRR abs/1203.4523 (2012) - [i8]Guillaume Obozinski, Francis R. Bach:
Convex Relaxation for Combinatorial Penalties. CoRR abs/1205.1240 (2012) - 2011
- [j3]Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, Francis R. Bach:
Proximal Methods for Hierarchical Sparse Coding. J. Mach. Learn. Res. 12: 2297-2334 (2011) - [j2]Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis R. Bach:
Convex and Network Flow Optimization for Structured Sparsity. J. Mach. Learn. Res. 12: 2681-2720 (2011) - [c9]Edouard Grave, Guillaume Obozinski, Francis R. Bach:
Trace Lasso: a trace norm regularization for correlated designs. NIPS 2011: 2187-2195 - [c8]Rodolphe Jenatton, Alexandre Gramfort, Vincent Michel, Guillaume Obozinski, Francis R. Bach, Bertrand Thirion:
Multi-scale Mining of fMRI Data with Hierarchical Structured Sparsity. PRNI 2011: 69-72 - [i7]Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis R. Bach:
Convex and Network Flow Optimization for Structured Sparsity. CoRR abs/1104.1872 (2011) - [i6]Francis R. Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski:
Optimization with Sparsity-Inducing Penalties. CoRR abs/1108.0775 (2011) - [i5]Edouard Grave, Guillaume Obozinski, Francis R. Bach:
Trace Lasso: a trace norm regularization for correlated designs. CoRR abs/1109.1990 (2011) - [i4]Francis R. Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski:
Structured sparsity through convex optimization. CoRR abs/1109.2397 (2011) - [i3]Guillaume Obozinski, Laurent Jacob, Jean-Philippe Vert:
Group Lasso with Overlaps: the Latent Group Lasso approach. CoRR abs/1110.0413 (2011) - [i2]Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis R. Bach:
Learning Hierarchical and Topographic Dictionaries with Structured Sparsity. CoRR abs/1110.4481 (2011) - 2010
- [j1]Guillaume Obozinski, Ben Taskar, Michael I. Jordan:
Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput. 20(2): 231-252 (2010) - [c7]Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, Francis R. Bach:
Proximal Methods for Sparse Hierarchical Dictionary Learning. ICML 2010: 487-494 - [c6]Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis R. Bach:
Network Flow Algorithms for Structured Sparsity. NIPS 2010: 1558-1566 - [c5]Rodolphe Jenatton, Guillaume Obozinski, Francis R. Bach:
Structured Sparse Principal Component Analysis. AISTATS 2010: 366-373 - [i1]Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski, Francis R. Bach:
Network Flow Algorithms for Structured Sparsity. CoRR abs/1008.5209 (2010)
2000 – 2009
- 2009
- [c4]Laurent Jacob, Guillaume Obozinski, Jean-Philippe Vert:
Group lasso with overlap and graph lasso. ICML 2009: 433-440 - 2008
- [c3]Guillaume Obozinski, Martin J. Wainwright, Michael I. Jordan:
Union support recovery in high-dimensional multivariate regression. Allerton 2008: 21-26 - [c2]Guillaume Obozinski, Martin J. Wainwright, Michael I. Jordan:
High-dimensional support union recovery in multivariate regression. NIPS 2008: 1217-1224 - 2007
- [c1]Julien Lefèvre, Guillaume Obozinski, Sylvain Baillet:
Imaging Brain Activation Streams from Optical Flow Computation on 2-Riemannian Manifolds. IPMI 2007: 470-481
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
