![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Emile Richard
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j4]Trong Phong Nguyen
, Edouard Pauwels, Emile Richard, Bruce W. Suter:
Extragradient Method in Optimization: Convergence and Complexity. J. Optim. Theory Appl. 176(1): 137-162 (2018) - 2016
- [j3]Andrea Montanari, Emile Richard:
Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics. IEEE Trans. Inf. Theory 62(3): 1458-1484 (2016) - 2015
- [c9]Emile Richard, Georges Goetz, E. J. Chichilnisky:
Recognizing retinal ganglion cells in the dark. NIPS 2015: 2476-2484 - 2014
- [j2]Emile Richard, Stéphane Gaïffas, Nicolas Vayatis:
Link prediction in graphs with autoregressive features. J. Mach. Learn. Res. 15(1): 565-593 (2014) - [c8]Yash Deshpande, Andrea Montanari, Emile Richard:
Cone-Constrained Principal Component Analysis. NIPS 2014: 2717-2725 - [c7]Emile Richard, Andrea Montanari:
A statistical model for tensor PCA. NIPS 2014: 2897-2905 - [c6]Emile Richard, Guillaume Obozinski, Jean-Philippe Vert:
Tight convex relaxations for sparse matrix factorization. NIPS 2014: 3284-3292 - [i4]Andrea Montanari, Emile Richard:
Non-negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics. CoRR abs/1406.4775 (2014) - [i3]Emile Richard, Guillaume Obozinski, Jean-Philippe Vert:
Tight convex relaxations for sparse matrix factorization. CoRR abs/1407.5158 (2014) - [i2]Andrea Montanari, Emile Richard:
A statistical model for tensor PCA. CoRR abs/1411.1076 (2014) - 2013
- [c5]Emile Richard, Francis R. Bach, Jean-Philippe Vert:
Intersecting singularities for multi-structured estimation. ICML (3) 2013: 1157-1165 - 2012
- [j1]Kaifu Zhang, Theodoros Evgeniou, Vineet Padmanabhan
, Emile Richard:
Content Contributor Management and Network Effects in a UGC Environment. Mark. Sci. 31(3): 433-447 (2012) - [c4]Pierre-André Savalle, Emile Richard, Nicolas Vayatis:
Estimation of Simultaneously Sparse and Low Rank Matrices. ICML 2012 - [c3]Emile Richard, Adrian D. C. Chan:
Non-obtrusive electrocardiogram system for the Smart Rollator. MeMeA 2012: 1-5 - [c2]Emile Richard, Stéphane Gaïffas, Nicolas Vayatis:
Link Prediction in Graphs with Autoregressive Features. NIPS 2012: 2843-2851 - [i1]Emile Richard, Andreas Argyriou, Theodoros Evgeniou, Nicolas Vayatis:
A Regularization Approach for Prediction of Edges and Node Features in Dynamic Graphs. CoRR abs/1203.5438 (2012) - 2010
- [c1]Emile Richard, Nicolas Baskiotis, Theodoros Evgeniou, Nicolas Vayatis:
Link Discovery using Graph Feature Tracking. NIPS 2010: 1966-1974
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint