![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2024
- Vasco Lopes, Fabio Maria Carlucci
, Pedro M. Esperança, Marco Singh, Antoine Yang, Victor Gabillon, Hang Xu, Zewei Chen, Jun Wang:
Manas: multi-agent neural architecture search. Mach. Learn. 113(1): 73-96 (2024) - 2020
- Haitham Ammar, Victor Gabillon, Rasul Tutunov, Michal Valko:
Derivative-Free & Order-Robust Optimisation. AISTATS 2020: 2293-2303 - Côme Fiegel, Victor Gabillon, Michal Valko:
Adaptive multi-fidelity optimization with fast learning rates. AISTATS 2020: 3493-3502 - 2019
- Peter L. Bartlett, Victor Gabillon, Michal Valko:
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption. ALT 2019: 184-206 - Peter L. Bartlett, Victor Gabillon, Jennifer Healey, Michal Valko:
Scale-free adaptive planning for deterministic dynamics & discounted rewards. ICML 2019: 495-504 - Fabio Maria Carlucci, Pedro M. Esperança, Marco Singh, Victor Gabillon, Antoine Yang, Hang Xu, Zewei Chen, Jun Wang:
MANAS: Multi-Agent Neural Architecture Search. CoRR abs/1909.01051 (2019) - Victor Gabillon, Rasul Tutunov, Michal Valko, Haitham Bou-Ammar:
Derivative-Free & Order-Robust Optimisation. CoRR abs/1910.04034 (2019) - 2018
- Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek, Michal Valko:
Best of both worlds: Stochastic & adversarial best-arm identification. COLT 2018: 918-949 - Peter L. Bartlett, Victor Gabillon, Michal Valko:
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption. CoRR abs/1810.00997 (2018) - 2017
- Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek:
Hit-and-Run for Sampling and Planning in Non-Convex Spaces. AISTATS 2017: 888-895 - Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon:
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem. NIPS 2017: 3033-3042 - 2016
- Victor Gabillon, Alessandro Lazaric, Mohammad Ghavamzadeh, Ronald Ortner, Peter L. Bartlett:
Improved Learning Complexity in Combinatorial Pure Exploration Bandits. AISTATS 2016: 1004-1012 - Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek:
Hit-and-Run for Sampling and Planning in Non-Convex Spaces. CoRR abs/1610.08865 (2016) - 2015
- Bruno Scherrer, Mohammad Ghavamzadeh, Victor Gabillon, Boris Lesner, Matthieu Geist:
Approximate modified policy iteration and its application to the game of Tetris. J. Mach. Learn. Res. 16: 1629-1676 (2015) - 2014
- Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, S. Muthukrishnan:
Large-Scale Optimistic Adaptive Submodularity. AAAI 2014: 1816-1823 - 2013
- Victor Gabillon, Mohammad Ghavamzadeh, Bruno Scherrer:
Approximate Dynamic Programming Finally Performs Well in the Game of Tetris. NIPS 2013: 1754-1762 - Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, S. Muthukrishnan:
Adaptive Submodular Maximization in Bandit Setting. NIPS 2013: 2697-2705 - 2012
- Bruno Scherrer, Victor Gabillon, Mohammad Ghavamzadeh, Matthieu Geist:
Approximate Modified Policy Iteration. ICML 2012 - Victor Gabillon, Mohammad Ghavamzadeh, Alessandro Lazaric:
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence. NIPS 2012: 3221-3229 - Bruno Scherrer, Victor Gabillon, Mohammad Ghavamzadeh, Matthieu Geist:
Approximate Modified Policy Iteration. CoRR abs/1205.3054 (2012) - 2011
- Victor Gabillon, Alessandro Lazaric, Mohammad Ghavamzadeh, Bruno Scherrer:
Classification-based Policy Iteration with a Critic. ICML 2011: 1049-1056 - Victor Gabillon, Mohammad Ghavamzadeh, Alessandro Lazaric, Sébastien Bubeck:
Multi-Bandit Best Arm Identification. NIPS 2011: 2222-2230 - 2010
- Victor Gabillon, Jérémie Mary, Philippe Preux:
Affichage de publicités sur des portails web. EGC 2010: 67-78 - 2009
- Jean Pierre Delmas, Victor Gabillon:
Asymptotic performance analysis of PCA algorithms based on the weighted subspace criterion. ICASSP 2009: 3237-3240
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-06-10 17:32 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint