default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarie-Liesse Cauwet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c13]Marie-Liesse Cauwet, Olivier Teytaud:
Population control meets doob's martingale theorems: the noise-free multimodal case. GECCO Companion 2020: 321-322- [c12]Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud, Nicolas Usunier:
Fully Parallel Hyperparameter Search: Reshaped Space-Filling. ICML 2020: 1338-1348 - [i4]Marie-Liesse Cauwet, Olivier Teytaud:
Population Control meets Doob's Martingale Theorems: the Noise-free Multimodal Case. CoRR abs/2005.13970 (2020)
2010 – 2019
- 2019
- [c11]Jérémy Rapin, Pauline Dorval, Jules Pondard, Nicolas Vasilache, Marie-Liesse Cauwet, Camille Couprie, Olivier Teytaud:
Openly revisiting derivative-free optimization. GECCO (Companion) 2019: 267-268 - [i3]Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud:
Fully Parallel Hyperparameter Search: Reshaped Space-Filling. CoRR abs/1910.08406 (2019) - 2018
- [c10]Marie-Liesse Cauwet, Olivier Teytaud:
Surprising Strategies Obtained by Stochastic Optimization in Partially Observable Games. CEC 2018: 1-8 - [i2]Marie-Liesse Cauwet, Olivier Teytaud:
Surprising strategies obtained by stochastic optimization in partially observable games. CoRR abs/1807.01877 (2018) - 2016
- [j2]Marie-Liesse Cauwet, Jialin Liu
, Baptiste Rozière, Olivier Teytaud:
Algorithm portfolios for noisy optimization. Ann. Math. Artif. Intell. 76(1-2): 143-172 (2016) - [j1]Sandra Astete Morales, Marie-Liesse Cauwet, Jialin Liu, Olivier Teytaud:
Simple and cumulative regret for continuous noisy optimization. Theor. Comput. Sci. 617: 12-27 (2016) - [c9]Sandra Astete Morales, Marie-Liesse Cauwet, Olivier Teytaud:
Analysis of Different Types of Regret in Continuous Noisy Optimization. GECCO 2016: 205-212 - [c8]Marie-Liesse Cauwet, Olivier Teytaud:
Noisy Optimization: Fast Convergence Rates with Comparison-Based Algorithms. GECCO 2016: 1101-1106 - [c7]Marie-Liesse Cauwet, Olivier Teytaud:
Multivariate bias reduction in capacity expansion planning. PSCC 2016: 1-8 - 2015
- [c6]Marie-Liesse Cauwet, Olivier Teytaud, Tristan Cazenave, Abdallah Saffidine, Hua-Min Liang, Shi-Jim Yen, Hung-Hsuan Lin, I-Chen Wu:
Depth, balancing, and limits of the Elo model. CIG 2015: 376-382 - [c5]Sandra Astete Morales, Marie-Liesse Cauwet, Olivier Teytaud:
Evolution Strategies with Additive Noise: A Convergence Rate Lower Bound. FOGA 2015: 76-84 - [c4]Marie-Liesse Cauwet, Olivier Teytaud, Shih-Yuan Chiu, Kuo-Min Lin, Shi-Jim Yen, David Lupien St-Pierre, Fabien Teytaud:
Parallel Evolutionary Algorithms Performing Pairwise Comparisons. FOGA 2015: 99-113 - [c3]Sandra Astete Morales, Marie-Liesse Cauwet, Olivier Teytaud:
Criteria and Convergence Rates in Noisy Optimization. GECCO (Companion) 2015: 1347-1348 - [i1]Marie-Liesse Cauwet, Olivier Teytaud, Hua-Min Liang, Shi-Jim Yen, Hung-Hsuan Lin, I-Chen Wu, Tristan Cazenave, Abdallah Saffidine:
Depth, balancing, and limits of the Elo model. CoRR abs/1511.02006 (2015) - 2014
- [c2]Marie-Liesse Cauwet:
Noisy Optimization: Convergence with a Fixed Number of Resamplings. EvoApplications 2014: 603-614 - [c1]Marie-Liesse Cauwet, Jialin Liu, Olivier Teytaud:
Algorithm Portfolios for Noisy Optimization: Compare Solvers Early. LION 2014: 1-15
Coauthor Index
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:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
