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

Charles Dugas

dblp:28/4263 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 4 first-author

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Artificial intelligence
3 papers
Deep learning architectures and training · 47% Probabilistic and Bayesian machine learning · 41% Learning theory · 12%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational finance and economics · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
classifier evaluation
0.112008
Pointwise exact bootstrap distributions of cost curves · ICML 2008
Performance modeling and evaluation › statistical analysis
ROC analysis
0.112008
Pointwise exact bootstrap distributions of cost curves · ICML 2008
Machine learning › Deep learning architectures and training
mixture of experts
0.012001
Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference · NIPS 2001
Computational finance and economics
option pricing
0.012000
Incorporating Second-Order Functional Knowledge for Better Option Pricing · NIPS 2000
Machine learning › Learning theory › approximation theory › neural network approximation
universal approximation
0.012000
Incorporating Second-Order Functional Knowledge for Better Option Pricing · NIPS 2000

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

neural network · 0.1exact bootstrap distribution · 0.1bootstrap resampling · 0.1support vector machine regression · 0.1generalized linear model · 0.1decision tree · 0.1monotonicity constraints · 0.1convexity constraints · 0.1multi-layer neural networks · 0.0multi-layer neural network · 0.0
YearPublicationVenuePosition
2010 Pointwise exact bootstrap distributions of ROC curves
Charles Dugas, David Gadoury
Mach. Learn.1
2009 Incorporating Functional Knowledge in Neural Networks
Charles Dugas, Yoshua Bengio, François Bélisle, Claude Nadeau, René Garcia
J. Mach. Learn. Res.1
2008 Pointwise exact bootstrap distributions of cost curves
abstract
Cost curves have recently been introduced as an alternative or complement to ROC curves in order to visualize binary classifiers performance. Of importance to both cost and ROC curves is the computation of confidence intervals along with the curves themselves so that the reliability of a classifier's performance can be assessed. Computing confidence intervals for the difference in performance between two classifiers allows the determination of whether one classifier performs significantly better than another. A simple procedure to obtain confidence intervals for costs or the difference between two costs, under various operating conditions, is to perform bootstrap resampling of the test set. In this paper, we derive exact bootstrap distributions for these values and use these dstributions to obtain confidence intervals, under various operating conditions. Performances of these confidence intervals are measured in terms of coverage accuracies. Simulations show excellent results.
Charles Dugas, David Gadoury
ICML1
2001 Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference
abstract
Estimating insurance premia from data is a difficult regression problem for several reasons: the large number of variables, many of which are .discrete, and the very peculiar shape of the noise distri(cid:173) bution, asymmetric with fat tails, with a large majority zeros and a few unreliable and very large values. We compare several machine learning methods for estimating insurance premia, and test them on a large data base of car insurance policies. We find that func(cid:173) tion approximation methods that do not optimize a squared loss, like Support Vector Machines regression, do not work well in this context. Compared methods include decision trees and generalized linear models. The best results are obtained with a mixture of experts, which better identifies the least and most risky contracts, and allows to reduce the median premium by charging more to the most risky customers.
Nicolas Chapados, Yoshua Bengio, Pascal Vincent, Joumana Ghosn, Charles Dugas, Ichiro Takeuchi, Linyan Meng
NIPS5
2000 Incorporating Second-Order Functional Knowledge for Better Option Pricing
abstract
Incorporating prior knowledge of a particular task into the architecture of a learning algorithm can greatly improve generalization performance. We study here a case where we know that the function to be learned is non-decreasing in two of its arguments and convex in one of them. For this purpose we propose a class of functions similar to multi-layer neural networks but (1) that has those properties, (2) is a universal approximator of continuous functions with these and other properties. We apply this new class of functions to the task of modeling the price of call options. Experiments show improvements on regressing the price of call options using the new types of function classes that incorporate the a priori con(cid:173) straints.
Charles Dugas, Yoshua Bengio, François Bélisle, Claude Nadeau, René Garcia
NIPS1