default search action
Jérémie Mary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i24]Antoine Schnepf, Karim Kassab, Jean-Yves Franceschi, Laurent Caraffa, Flavian Vasile, Jérémie Mary, Andrew Comport, Valérie Gouet-Brunet:
Exploring 3D-aware Latent Spaces for Efficiently Learning Numerous Scenes. CoRR abs/2403.11678 (2024) - [i23]Antoine Schnepf, Karim Kassab, Jean-Yves Franceschi, Laurent Caraffa, Flavian Vasile, Jérémie Mary, Andrew Comport, Valérie Gouet-Brunet:
Bringing NeRFs to the Latent Space: Inverse Graphics Autoencoder. CoRR abs/2410.22936 (2024) - [i22]Karim Kassab, Antoine Schnepf, Jean-Yves Franceschi, Laurent Caraffa, Flavian Vasile, Jérémie Mary, Andrew Comport, Valérie Gouet-Brunet:
Scaled Inverse Graphics: Efficiently Learning Large Sets of 3D Scenes. CoRR abs/2410.23742 (2024) - 2023
- [j4]Thibaut Issenhuth, Ugo Tanielian, Jérémie Mary, David Picard:
EdiBERT: a generative model for image editing. Trans. Mach. Learn. Res. 2023 (2023) - [c26]Thibaut Issenhuth, Ugo Tanielian, Jérémie Mary, David Picard:
Unveiling the Latent Space Geometry of Push-Forward Generative Models. ICML 2023: 14422-14444 - [i21]Simon Lepage, Jérémie Mary, David Picard:
Weakly-Supervised Conditional Embedding for Referred Visual Search. CoRR abs/2306.02928 (2023) - [i20]Karim Kassab, Antoine Schnepf, Jean-Yves Franceschi, Laurent Caraffa, Jérémie Mary, Valérie Gouet-Brunet:
EvE: Exploiting Generative Priors for Radiance Field Enrichment. CoRR abs/2312.00639 (2023) - 2022
- [c25]Thibaut Issenhuth, Ugo Tanielian, David Picard, Jérémie Mary:
Latent reweighting, an almost free improvement for GANs. WACV 2022: 3574-3583 - [c24]Eustache Diemert, Romain Fabre, Alexandre Gilotte, Fei Jia, Basile Leparmentier, Jérémie Mary, Zhonghua Qu, Ugo Tanielian, Hui Yang:
Lessons from the AdKDD'21 Privacy-Preserving ML Challenge. WWW 2022: 2026-2035 - [i19]Eustache Diemert, Romain Fabre, Alexandre Gilotte, Fei Jia, Basile Leparmentier, Jérémie Mary, Zhonghua Qu, Ugo Tanielian, Hui Yang:
Lessons from the AdKDD'21 Privacy-Preserving ML Challenge. CoRR abs/2201.13123 (2022) - [i18]Thibaut Issenhuth, Ugo Tanielian, Jérémie Mary, David Picard:
Optimal precision for GANs. CoRR abs/2207.10541 (2022) - 2021
- [i17]Thibaut Issenhuth, Ugo Tanielian, David Picard, Jérémie Mary:
Latent reweighting, an almost free improvement for GANs. CoRR abs/2110.09803 (2021) - [i16]Thibaut Issenhuth, Ugo Tanielian, Jérémie Mary, David Picard:
EdiBERT, a generative model for image editing. CoRR abs/2111.15264 (2021) - 2020
- [c23]Thibaut Issenhuth, Jérémie Mary, Clément Calauzènes:
Do Not Mask What You Do Not Need to Mask: A Parser-Free Virtual Try-On. ECCV (20) 2020: 619-635 - [c22]Ugo Tanielian, Thibaut Issenhuth, Elvis Dohmatob, Jérémie Mary:
Learning disconnected manifolds: a no GAN's land. ICML 2020: 9418-9427 - [i15]Ugo Tanielian, Thibaut Issenhuth, Elvis Dohmatob, Jérémie Mary:
Learning disconnected manifolds: a no GANs land. CoRR abs/2006.04596 (2020) - [i14]Thibaut Issenhuth, Jérémie Mary, Clément Calauzènes:
Do Not Mask What You Do Not Need to Mask: a Parser-Free Virtual Try-On. CoRR abs/2007.02721 (2020)
2010 – 2019
- 2019
- [c21]Jérémie Mary, Clément Calauzènes, Noureddine El Karoui:
Fairness-Aware Learning for Continuous Attributes and Treatments. ICML 2019: 4382-4391 - [c20]Romain Warlop, Jérémie Mary, Mike Gartrell:
Tensorized Determinantal Point Processes for Recommendation. KDD 2019: 1605-1615 - [i13]Elena Smirnova, Elvis Dohmatob, Jérémie Mary:
Distributionally Robust Reinforcement Learning. CoRR abs/1902.08708 (2019) - [i12]Thibaut Issenhuth, Jérémie Mary, Clément Calauzènes:
End-to-End Learning of Geometric Deformations of Feature Maps for Virtual Try-On. CoRR abs/1906.01347 (2019) - 2018
- [c19]Florian Strub, Mathieu Seurin, Ethan Perez, Harm de Vries, Jérémie Mary, Philippe Preux, Aaron C. Courville, Olivier Pietquin:
Visual Reasoning with Multi-hop Feature Modulation. ECCV (5) 2018: 808-831 - [c18]Romain Warlop, Alessandro Lazaric, Jérémie Mary:
Fighting Boredom in Recommender Systems with Linear Reinforcement Learning. NeurIPS 2018: 1764-1773 - [i11]Romain Warlop, Jérémie Mary, Mike Gartrell:
Basket Completion with Multi-task Determinantal Point Processes. CoRR abs/1805.09916 (2018) - [i10]Kiewan Villatel, Elena Smirnova, Jérémie Mary, Philippe Preux:
Recurrent Neural Networks for Long and Short-Term Sequential Recommendation. CoRR abs/1807.09142 (2018) - [i9]Florian Strub, Mathieu Seurin, Ethan Perez, Harm de Vries, Jérémie Mary, Philippe Preux, Aaron C. Courville, Olivier Pietquin:
Visual Reasoning with Multi-hop Feature Modulation. CoRR abs/1808.04446 (2018) - 2017
- [c17]Romain Warlop, Alessandro Lazaric, Jérémie Mary:
Parallel Higher Order Alternating Least Square for Tensor Recommender System. AAAI Workshops 2017 - [c16]Florian Strub, Harm de Vries, Jérémie Mary, Bilal Piot, Aaron C. Courville, Olivier Pietquin:
End-to-end optimization of goal-driven and visually grounded dialogue systems. IJCAI 2017: 2765-2771 - [c15]Harm de Vries, Florian Strub, Jérémie Mary, Hugo Larochelle, Olivier Pietquin, Aaron C. Courville:
Modulating early visual processing by language. NIPS 2017: 6594-6604 - [i8]Florian Strub, Harm de Vries, Jérémie Mary, Bilal Piot, Aaron C. Courville, Olivier Pietquin:
End-to-end optimization of goal-driven and visually grounded dialogue systems. CoRR abs/1703.05423 (2017) - [i7]Harm de Vries, Florian Strub, Jérémie Mary, Hugo Larochelle, Olivier Pietquin, Aaron C. Courville:
Modulating early visual processing by language. CoRR abs/1707.00683 (2017) - 2016
- [j3]Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux:
Consistent Algorithms for Clustering Time Series. J. Mach. Learn. Res. 17: 3:1-3:32 (2016) - [c14]Florian Strub, Romaric Gaudel, Jérémie Mary:
Hybrid Recommender System based on Autoencoders. DLRS@RecSys 2016: 11-16 - [i6]Florian Strub, Jérémie Mary, Romaric Gaudel:
Hybrid Collaborative Filtering with Neural Networks. CoRR abs/1603.00806 (2016) - [i5]Florian Strub, Jérémie Mary, Romaric Gaudel:
Hybrid Recommender System based on Autoencoders. CoRR abs/1606.07659 (2016) - 2015
- [b1]Jérémie Mary:
Data-Driven Recommender Systems: Sequences of recommendations. Charles de Gaulle University, Lille, France, 2015 - [c13]Jérémie Mary, Romaric Gaudel, Philippe Preux:
Bandits and Recommender Systems. MOD 2015: 325-336 - 2014
- [c12]Jérémie Mary, Philippe Preux, Olivier Nicol:
Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques. ICML 2014: 172-180 - [i4]Olivier Nicol, Jérémie Mary, Philippe Preux:
Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques. CoRR abs/1405.3536 (2014) - [i3]Hai Thanh Nguyen, Jérémie Mary, Philippe Preux:
Cold-start Problems in Recommendation Systems via Contextual-bandit Algorithms. CoRR abs/1405.7544 (2014) - [i2]Jérémie Mary, Romaric Gaudel, Philippe Preux:
Bandits Warm-up Cold Recommender Systems. CoRR abs/1407.2806 (2014) - 2013
- [j2]Daniil Ryabko, Jérémie Mary:
A binary-classification-based metric between time-series distributions and its use in statistical and learning problems. J. Mach. Learn. Res. 14(1): 2837-2856 (2013) - 2012
- [j1]Sertan Girgin, Jérémie Mary, Philippe Preux, Olivier Nicol:
Managing advertising campaigns - an approximate planning approach. Frontiers Comput. Sci. 6(2): 209-229 (2012) - [c11]Daniil Ryabko, Jérémie Mary:
Reducing statistical time-series problems to binary classification. NIPS 2012: 2069-2077 - [c10]Olivier Nicol, Jérémie Mary, Philippe Preux:
ICML Exploration & Exploitation Challenge: Keep it simple! ICML On-line Trading of Exploration and Exploitation 2012: 62-85 - [c9]Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux:
Online Clustering of Processes. AISTATS 2012: 601-609 - [i1]Daniil Ryabko, Jérémie Mary:
Reducing statistical time-series problems to binary classification. CoRR abs/1210.6001 (2012) - 2010
- [c8]Victor Gabillon, Jérémie Mary, Philippe Preux:
Affichage de publicités sur des portails web. EGC 2010: 67-78 - [c7]Sertan Girgin, Jérémie Mary, Philippe Preux, Olivier Nicol:
Advertising Campaigns Management: Should We Be Greedy? ICDM 2010: 821-826
2000 – 2009
- 2008
- [c6]Raphaël Maîtrepierre, Jérémie Mary, Rémi Munos:
Adaptive play in Texas Hold'em Poker. ECAI 2008: 458-462 - 2007
- [c5]Olivier Teytaud, Sylvain Gelly, Jérémie Mary:
Active learning in regression, with application to stochastic dynamic programming. ICINCO-ICSO 2007: 198-205 - 2006
- [c4]Sylvain Gelly, Jérémie Mary, Olivier Teytaud:
Learning for stochastic dynamic programming. ESANN 2006: 191-196 - [c3]Olivier Teytaud, Sylvain Gelly, Jérémie Mary:
On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy. PPSN 2006: 32-41 - 2005
- [c2]Sylvain Gelly, Jérémie Mary, Olivier Teytaud:
Taylor-based pseudo-metrics for random process fitting in dynamic programming: expected loss minimization and risk management. CAP 2005: 183-184 - 2004
- [c1]Kees Jong, Jérémie Mary, Antoine Cornuéjols, Elena Marchiori, Michèle Sebag:
Ensemble Feature Ranking. PKDD 2004: 267-278
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-12-01 00:11 CET 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: