default search action
Lê-Nguyên Hoang
Person information
- affiliation: EPFL, IC School, Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Martin Gibert
, Lê-Nguyên Hoang
Should YouTube make recommendations for the climate? Ethics Inf. Technol. 26(3): 53 (2024) - [c8]Julien Fageot, Sadegh Farhadkhani, Lê-Nguyên Hoang, Oscar Villemaud:
Generalized Bradley-Terry Models for Score Estimation from Paired Comparisons. AAAI 2024: 20379-20386 - [c7]Youssef Allouah, Rachid Guerraoui, Lê-Nguyên Hoang, Oscar Villemaud:
Robust Sparse Voting. AISTATS 2024: 991-999 - [i14]Lê-Nguyên Hoang:
The poison of dimensionality. CoRR abs/2409.17328 (2024) - 2023
- [c6]El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui, Lê-Nguyên Hoang:
On the Strategyproofness of the Geometric Median. AISTATS 2023: 2603-2640 - [c5]Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Lê-Nguyên Hoang, Rafael Pinot, John Stephan:
Robust Collaborative Learning with Linear Gradient Overhead. ICML 2023: 9761-9813 - 2022
- [j5]El-Mahdi El-Mhamdi, Rachid Guerraoui
Genuinely distributed Byzantine machine learning. Distributed Comput. 35(4): 305-331 (2022) - [j4]El-Mahdi El-Mhamdi, Rachid Guerraoui
Removing algorithmic discrimination (with minimal individual error). Theor. Comput. Sci. 923: 47-55 (2022) - [c4]Sadegh Farhadkhani, Rachid Guerraoui
An Equivalence Between Data Poisoning and Byzantine Gradient Attacks. ICML 2022: 6284-6323 - [i13]Sadegh Farhadkhani, Rachid Guerraoui, Lê-Nguyên Hoang, Oscar Villemaud:
An Equivalence Between Data Poisoning and Byzantine Gradient Attacks. CoRR abs/2202.08578 (2022) - [i12]Youssef Allouah, Rachid Guerraoui, Lê-Nguyên Hoang, Oscar Villemaud:
Robust Sparse Voting. CoRR abs/2202.08656 (2022) - [i11]Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Lê Nguyên Hoang, Rafael Pinot, John Stephan:
Making Byzantine Decentralized Learning Efficient. CoRR abs/2209.10931 (2022) - [i10]El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui, Nirupam Gupta, Lê-Nguyên Hoang, Rafael Pinot, John Stephan:
On the Impossible Safety of Large AI Models. CoRR abs/2209.15259 (2022) - [i9]Romain Beylerian, Bérangère Colbois, Louis Faucon, Lê Nguyên Hoang, Aidan Jungo, Alain Le Noac'h, Adrien Matissart:
Tournesol: Permissionless Collaborative Algorithmic Governance with Security Guarantees. CoRR abs/2211.01179 (2022) - 2021
- [c3]El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui
Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning). NeurIPS 2021: 25044-25057 - [i8]El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui, Lê-Nguyên Hoang:
On the Strategyproofness of the Geometric Median. CoRR abs/2106.02394 (2021) - [i7]Sadegh Farhadkhani, Rachid Guerraoui, Lê-Nguyên Hoang:
Strategyproof Learning: Building Trustworthy User-Generated Datasets. CoRR abs/2106.02398 (2021) - [i6]Lê-Nguyên Hoang, Louis Faucon, Aidan Jungo, Sergei Volodin, Dalia Papuc, Orfeas Liossatos, Ben Crulis, Mariame Tighanimine, Isabela Constantin, Anastasiia Kucherenko, Alexandre Maurer, Felix Grimberg, Vlad Nitu, Chris Vossen, Sébastien Rouault, El-Mahdi El-Mhamdi:
Tournesol: A quest for a large, secure and trustworthy database of reliable human judgments. CoRR abs/2107.07334 (2021) - 2020
- [c2]El-Mahdi El-Mhamdi
Genuinely Distributed Byzantine Machine Learning. PODC 2020: 355-364 - [i5]El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui, Arsany Guirguis, Lê Nguyên Hoang, Sébastien Rouault:
Collaborative Learning as an Agreement Problem. CoRR abs/2008.00742 (2020) - [i4]Lê Nguyên Hoang:
Purely Bayesian counterfactuals versus Newcomb's paradox. CoRR abs/2008.04256 (2020)
2010 – 2019
- 2019
- [j3]Lê Nguyên Hoang
The return function: A new computable perspective on Bayesian-Nash equilibria. Eur. J. Oper. Res. 279(2): 471-485 (2019) - [c1]Lê Nguyên Hoang:
Towards Robust End-to-End Alignment. SafeAI@AAAI 2019 - 2018
- [i3]Lê Nguyên Hoang, Rachid Guerraoui:
Deep Learning Works in Practice. But Does it Work in Theory? CoRR abs/1801.10437 (2018) - [i2]El Mahdi El Mhamdi
Removing Algorithmic Discrimination (With Minimal Individual Error). CoRR abs/1806.02510 (2018) - [i1]Lê Nguyên Hoang:
A Roadmap for the Value-Loading Problem. CoRR abs/1809.01036 (2018) - 2017
- [j2]Lê Nguyên Hoang:
Strategy-proofness of the randomized Condorcet voting system. Soc. Choice Welf. 48(3): 679-701 (2017) - 2016
- [j1]Lê Nguyên Hoang, François Soumis, Georges Zaccour
A heuristic optimization of Bayesian incentive-compatible cake-cutting. Comput. Oper. Res. 75: 76-82 (2016)
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-18 19:33 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: