Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jean-Christophe Souplet

dblp:74/519 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 77% Optimization for machine learning · 23%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
preference learning
0.212014
Programming by Feedback · ICML 2014
Program synthesis and code generation
programming by example
0.212014
Programming by Feedback · ICML 2014

Methods — techniques the papers use, named apart from their topics

utility function estimation · 0.4preference judgments · 0.4
YearPublicationVenuePosition
2014 Programming by Feedback
abstract
This paper advocates a new ML-based programming framework, called Programming by Feedback (PF), which involves a sequence of interactions between the active computer and the user. The latter only provides preference judgments on pairs of solutions supplied by the active computer. The active computer involves two components: the learning component estimates the user’s utility function and accounts for the user’s (possibly limited) competence; the optimization component explores the search space and returns the most appropriate candidate solution. A proof of principle of the approach is proposed, showing that PF requires a handful of interactions in order to solve some discrete and continuous benchmark problems.
Marc Schoenauer, Riad Akrour, Michèle Sebag, Jean-Christophe Souplet
ICML4