scispace - formally typeset
Search or ask a question
Institution

HEC Montréal

EducationMontreal, Quebec, Canada
About: HEC Montréal is a education organization based out in Montreal, Quebec, Canada. It is known for research contribution in the topics: Context (language use) & Vehicle routing problem. The organization has 1221 authors who have published 5708 publications receiving 196862 citations. The organization is also known as: Ecole des Hautes Etudes Commerciales de Montreal & HEC Montreal.


Papers
More filters
Ann Langley1
01 Jan 2009

178 citations

Proceedings Article
30 Apr 2020
TL;DR: This paper found that exposure bias appears to be less of an issue than the complications arising from non-differentiable, sequential GAN training, and that MLE trained models provide a better quality/diversity trade-off compared to their GAN counterparts, all while being easier to train and less computationally expensive.
Abstract: Traditional natural language generation (NLG) models are trained using maximum likelihood estimation (MLE) which differs from the sample generation inference procedure. During training the ground truth tokens are passed to the model, however, during inference, the model instead reads its previously generated samples - a phenomenon coined exposure bias. Exposure bias was hypothesized to be a root cause of poor sample quality and thus many generative adversarial networks (GANs) were proposed as a remedy since they have identical training and inference. However, many of the ensuing GAN variants validated sample quality improvements but ignored loss of sample diversity. This work reiterates the fallacy of quality-only metrics and clearly demonstrate that the well-established technique of reducing softmax temperature can outperform GANs on a quality-only metric. Further, we establish a definitive quality-diversity evaluation procedure using temperature tuning over local and global sample metrics. Under this, we find that MLE models consistently outperform the proposed GAN variants over the whole quality-diversity space. Specifically, we find that 1) exposure bias appears to be less of an issue than the complications arising from non-differentiable, sequential GAN training; 2) MLE trained models provide a better quality/diversity trade-off compared to their GAN counterparts, all while being easier to train, easier to cross-validate, and less computationally expensive.

177 citations

Journal ArticleDOI
01 Jan 2007-Networks
TL;DR: In this paper, a branch-and-cut algorithm for the pickup and delivery problem with time windows (PDPTW) and a dial-a-ride problem (DARP) is proposed.
Abstract: In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precedence constraints on pickups and deliveries. This paper introduces two new formulations for the PDPTW and the closely related dial-a-ride problem (DARP) in which a limit is imposed on the elapsed time between the pickup and the delivery of a request. Several families of valid inequalities are introduced to strengthen these two formulations. These inequalities are used within a branch-and-cut algorithm which has been tested on several sets of instances for both the PDPTW and the DARP. Instances with up to eight vehicles and 96 requests (192 nodes) have been solved to optimality.

177 citations

Posted Content
Marlei Pozzebon1
TL;DR: In this article, strategic management research using structuration theory from 1995 to 2000 is reviewed, and the authors describe and analyse the theoretical articulations adopted to make sense of strategy using a structurationist view.
Abstract: In this article, strategic management research using structuration theory from 1995 to 2000 is reviewed. I describe and analyse the theoretical articulations adopted to make sense of strategy using a structurationist view. I found that, instead of being applied as the sole theoretical foundation, Giddens' propositions have been incorporated into other perspectives, the effects of which should be known by researchers looking for theoretical frameworks that avoid dichotomist thinking. The paper draws on the effects that structurationist arguments may produce regarding classical oppositions such as micro/macro and voluntarist/determinist. Its main contribution is to show how theoretical complementarities using structuration theory are promising avenues of research in the strategic management field. It also suggests that, although other alternatives of avoiding dichotomist logic exist, making a choice among them is more a question of ontological affinity than of making the 'better choice' among competing accounts. There are several routes to advance the understanding of the possibilities of human choice.

177 citations

Journal ArticleDOI
TL;DR: A Variable Neighborhood Search (VNS) heuristic is proposed and outperforms MS, MA and GA on large instances and provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors.

177 citations


Authors

Showing all 1262 results

NameH-indexPapersCitations
Danny Miller13351271238
Gilbert Laporte12873062608
Michael Pollak11466357793
Yong Yu7852326956
Pierre Hansen7857532505
Jean-François Cordeau7120819310
Robert A. Jarrow6535624295
Jacques Desrosiers6317315926
François Soumis6129014272
Nenad Mladenović5432019182
Massimo Caccia5238916007
Guy Desaulniers512428836
Ann Langley5016115675
Jean-Charles Chebat481619062
Georges Dionne484217838
Network Information
Related Institutions (5)
Stockholm School of Economics
4.8K papers, 285.5K citations

88% related

Bocconi University
8.9K papers, 344.1K citations

88% related

Copenhagen Business School
9.6K papers, 341.8K citations

88% related

INSEAD
4.8K papers, 369.4K citations

87% related

Athens University of Economics and Business
6.9K papers, 177.8K citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202316
202267
2021443
2020378
2019326
2018313