CAp

Conférence sur l’Apprentissage Automatique
(affiliated to PFIA 2023)
3-5 July 2023, Strasbourg, France

Presentation

In Short

In Details

CAp (from July 3 to July 5) is an interdisciplinary gathering of researchers at the intersection of machine learning, applied mathematics, and related areas.

The submission website can be found here. Submitted papers can be either in English or in French and we encourage two types of submissions:

We also encourage the submission of recent (2022 or 2023) papers accepted to high level conferences and journals in machine learning. These papers will also be reviewed (lightly) by the program committee. If accepted, they will be presented at the conference but will not appear in any (online) proceedings. Note that, in this particular case, the paper can be submitted in the original conference format (length and style) and the reviews given by the conference/ML journal where it was accepted should be included as the first pages of the submission in addition to a link to the corresponding conference/ML journal web page. The submission of the reviews and the original paper should be merged and submitted into a single PDF file on the easychair website.

Some accepted papers will be presented in a long (20 minutes) oral presentation and all the accepted papers will be given the opportunity to be presented as a spotlight (3 minutes) and as a poster at the conference. These presentations are an opportunity to have constructive and rigorous feedbacks, as well as to establish contacts with members of the french machine learning community. PhD Students are particularly welcome and encouraged to submit papers. Contributions will be freely distributed on the conference website, subject to approval by the authors.

TOPICS

The conference and program chairs of CAp 2023 invite those working in areas related to any aspect of machine learning to submit original papers for review. Solicited topics include, but are not limited to:

Learning theory, models and paradigms:

Optimization et related problems:

Applications: