![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jean-Francis Roy
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i4]Jacopo Tagliabue, Ciro Greco, Jean-Francis Roy, Bingqing Yu, Patrick John Chia, Federico Bianchi, Giovanni Cassani:
SIGIR 2021 E-Commerce Workshop Data Challenge. CoRR abs/2104.09423 (2021) - 2020
- [j3]Baptiste Bauvin
, Cécile Capponi, Jean-Francis Roy, François Laviolette:
Fast greedy C-bound minimization with guarantees. Mach. Learn. 109(9-10): 1945-1986 (2020)
2010 – 2019
- 2017
- [j2]François Laviolette, Emilie Morvant
, Liva Ralaivola
, Jean-Francis Roy
:
Risk upper bounds for general ensemble methods with an application to multiclass classification. Neurocomputing 219: 15-25 (2017) - 2016
- [c5]Luc Bégin, Pascal Germain, François Laviolette, Jean-Francis Roy:
PAC-Bayesian Bounds based on the Rényi Divergence. AISTATS 2016: 435-444 - [c4]Jean-Francis Roy, Mario Marchand, François Laviolette:
A Column Generation Bound Minimization Approach with PAC-Bayesian Generalization Guarantees. AISTATS 2016: 1241-1249 - 2015
- [j1]Pascal Germain, Alexandre Lacasse, François Laviolette, Mario Marchand, Jean-Francis Roy:
Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm. J. Mach. Learn. Res. 16: 787-860 (2015) - [i3]François Laviolette, Emilie Morvant, Liva Ralaivola, Jean-Francis Roy:
On Generalizing the C-Bound to the Multiclass and Multi-label Settings. CoRR abs/1501.03001 (2015) - [i2]Pascal Germain, Alexandre Lacasse, François Laviolette, Mario Marchand, Jean-Francis Roy:
Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm. CoRR abs/1503.08329 (2015) - [i1]Louis Fortier-Dubois, François Laviolette, Mario Marchand, Louis-Émile Robitaille, Jean-Francis Roy:
Efficient Learning of Ensembles with QuadBoost. CoRR abs/1506.02535 (2015) - 2014
- [c3]Luc Bégin, Pascal Germain, François Laviolette, Jean-Francis Roy:
PAC-Bayesian Theory for Transductive Learning. AISTATS 2014: 105-113 - 2012
- [c2]Pascal Germain
, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza, François Laviolette, Claude-Guy Quimper
:
A Pseudo-Boolean Set Covering Machine. CP 2012: 916-924 - 2011
- [c1]Jean-Francis Roy, François Laviolette, Mario Marchand:
From PAC-Bayes Bounds to Quadratic Programs for Majority Votes. ICML 2011: 649-656
Coauthor Index
![](https://dblp1.uni-trier.de/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-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint