default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugène Ndiaye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Matthew Lau, Ismaïla Seck, Athanasios P. Meliopoulos, Wenke Lee, Eugène Ndiaye:
Revisiting Non-separable Binary Classification and its Applications in Anomaly Detection. Trans. Mach. Learn. Res. 2024 (2024)- [c8]Etash Kumar Guha, Shlok Natarajan, Thomas Möllenhoff, Mohammad Emtiyaz Khan, Eugène Ndiaye:
Conformal Prediction via Regression-as-Classification. ICLR 2024 - [c7]Yu-Guan Hsieh, James Thornton, Eugène Ndiaye, Michal Klein, Marco Cuturi, Pierre Ablin:
Careful with that Scalpel: Improving Gradient Surgery with an EMA. ICML 2024 - [i20]Charles Guille-Escuret, Eugène Ndiaye:
Finite Sample Confidence Regions for Linear Regression Parameters Using Arbitrary Predictors. CoRR abs/2401.15254 (2024) - [i19]Yu-Guan Hsieh, James Thornton, Eugène Ndiaye, Michal Klein, Marco Cuturi, Pierre Ablin:
Careful with that Scalpel: Improving Gradient Surgery with an EMA. CoRR abs/2402.02998 (2024) - [i18]Etash Kumar Guha, Shlok Natarajan, Thomas Möllenhoff, Mohammad Emtiyaz Khan, Eugène Ndiaye:
Conformal Prediction via Regression-as-Classification. CoRR abs/2404.08168 (2024) - [i17]Charles Guille-Escuret, Eugène Ndiaye:
From Conformal Predictions to Confidence Regions. CoRR abs/2405.18601 (2024) - [i16]Michael Kirchhof, James Thornton, Pierre Ablin, Louis Béthune, Eugène Ndiaye, Marco Cuturi:
Sparse Repellency for Shielded Generation in Text-to-image Diffusion Models. CoRR abs/2410.06025 (2024) - 2023
- [j2]Eugène Ndiaye
, Ichiro Takeuchi:
Root-finding approaches for computing conformal prediction set. Mach. Learn. 112(1): 151-176 (2023) - [c6]Etash Kumar Guha, Eugène Ndiaye, Xiaoming Huo:
Conformalization of Sparse Generalized Linear Models. ICML 2023: 11871-11887 - [i15]Michal Klein, Aram-Alexandre Pooladian, Pierre Ablin, Eugène Ndiaye, Jonathan Niles-Weed, Marco Cuturi:
Learning Costs for Structured Monge Displacements. CoRR abs/2306.11895 (2023) - [i14]Etash Kumar Guha, Eugène Ndiaye, Xiaoming Huo:
Conformalization of Sparse Generalized Linear Models. CoRR abs/2307.05109 (2023) - [i13]Matthew Lau, Ismaïla Seck, Athanasios P. Meliopoulos, Wenke Lee, Eugène Ndiaye:
Revisiting Non-separable Binary Classification and its Applications in Anomaly Detection. CoRR abs/2312.01541 (2023) - 2022
- [c5]Eugène Ndiaye:
Stable Conformal Prediction Sets. ICML 2022: 16462-16479 - [i12]Diptesh Das, Eugène Ndiaye, Ichiro Takeuchi:
A Confidence Machine for Sparse High-Order Interaction Model. CoRR abs/2205.14317 (2022) - [i11]Chancellor Johnstone, Eugène Ndiaye:
Exact and Approximate Conformal Inference in Multiple Dimensions. CoRR abs/2210.17405 (2022) - 2021
- [i10]Eugène Ndiaye, Ichiro Takeuchi:
Root-finding Approaches for Computing Conformal Prediction Set. CoRR abs/2104.06648 (2021) - [i9]Eugène Ndiaye, Ichiro Takeuchi:
Continuation Path with Linear Convergence Rate. CoRR abs/2112.05104 (2021) - [i8]Eugène Ndiaye:
Stable Conformal Prediction Sets. CoRR abs/2112.10224 (2021) - 2020
- [i7]Eugène Ndiaye, Olivier Fercoq, Joseph Salmon:
Screening Rules and its Complexity for Active Set Identification. CoRR abs/2009.02709 (2020)
2010 – 2019
- 2019
- [c4]Eugène Ndiaye, Tam Le, Olivier Fercoq, Joseph Salmon, Ichiro Takeuchi:
Safe Grid Search with Optimal Complexity. ICML 2019: 4771-4780 - [c3]Eugène Ndiaye, Ichiro Takeuchi:
Computing Full Conformal Prediction Set with Approximate Homotopy. NeurIPS 2019: 1384-1393 - [i6]Eugène Ndiaye, Ichiro Takeuchi:
Computing Full Conformal Prediction Set with Approximate Homotopy. CoRR abs/1909.09365 (2019) - 2018
- [i5]Eugène Ndiaye, Tam Le, Olivier Fercoq, Joseph Salmon, Ichiro Takeuchi:
Safe Grid Search with Optimal Complexity. CoRR abs/1810.05471 (2018) - 2017
- [j1]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Gap Safe Screening Rules for Sparsity Enforcing Penalties. J. Mach. Learn. Res. 18: 128:1-128:33 (2017) - 2016
- [c2]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe Screening Rules for Sparse-Group Lasso. NIPS 2016: 388-396 - [i4]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe Screening Rules for Sparse-Group-Lasso. CoRR abs/1602.06225 (2016) - [i3]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Vincent Leclère, Joseph Salmon:
Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression. CoRR abs/1606.02702 (2016) - [i2]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
Gap Safe screening rules for sparsity enforcing penalties. CoRR abs/1611.05780 (2016) - 2015
- [c1]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe screening rules for sparse multi-task and multi-class models. NIPS 2015: 811-819 - [i1]Eugène Ndiaye, Olivier Fercoq, Alexandre Gramfort, Joseph Salmon:
GAP Safe screening rules for sparse multi-task and multi-class models. CoRR abs/1506.03736 (2015)
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-11-19 21:47 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:
