default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Abeille
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Lorenzo Croissant, Marc Abeille, Bruno Bouchard:
Near-continuous time Reinforcement Learning for continuous state-action spaces. ALT 2024: 444-498- 2023
- [j1]Marc Abeille, Bruno Bouchard
, Lorenzo Croissant:
Diffusive Limit Approximation of Pure-Jump Optimal Stochastic Control Problems. J. Optim. Theory Appl. 196(1): 147-176 (2023) - [i11]Lorenzo Croissant, Marc Abeille, Bruno Bouchard:
Near-continuous time Reinforcement Learning for continuous state-action spaces. CoRR abs/2309.02815 (2023) - 2022
- [c9]Louis Faury, Marc Abeille, Kwang-Sung Jun, Clément Calauzènes:
Jointly Efficient and Optimal Algorithms for Logistic Bandits. AISTATS 2022: 546-580 - [i10]Louis Faury, Marc Abeille, Kwang-Sung Jun, Clément Calauzènes:
Jointly Efficient and Optimal Algorithms for Logistic Bandits. CoRR abs/2201.01985 (2022) - 2021
- [c8]Marc Abeille, Louis Faury, Clément Calauzènes:
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. AISTATS 2021: 3691-3699 - [c7]Louis Faury, Yoan Russac, Marc Abeille, Clément Calauzènes:
A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions. ALT 2021: 619-626 - [i9]Louis Faury, Yoan Russac, Marc Abeille, Clément Calauzènes:
Regret Bounds for Generalized Linear Bandits under Parameter Drift. CoRR abs/2103.05750 (2021) - 2020
- [c6]Marc Abeille, Alessandro Lazaric:
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation. ICML 2020: 23-31 - [c5]Lorenzo Croissant, Marc Abeille, Clément Calauzènes:
Real-Time Optimisation for Online Learning in Auctions. ICML 2020: 2217-2226 - [c4]Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq:
Improved Optimistic Algorithms for Logistic Bandits. ICML 2020: 3052-3060 - [i8]Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq:
Improved Optimistic Algorithms for Logistic Bandits. CoRR abs/2002.07530 (2020) - [i7]Marc Abeille, Alessandro Lazaric:
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation. CoRR abs/2007.06482 (2020) - [i6]Lorenzo Croissant, Marc Abeille, Clément Calauzènes:
Real-Time Optimisation for Online Learning in Auctions. CoRR abs/2010.10070 (2020) - [i5]Marc Abeille, Louis Faury, Clément Calauzènes:
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. CoRR abs/2010.12642 (2020)
2010 – 2019
- 2019
- [i4]Young Hun Jung, Marc Abeille, Ambuj Tewari:
Thompson Sampling in Non-Episodic Restless Bandits. CoRR abs/1910.05654 (2019) - 2018
- [c3]Marc Abeille, Alessandro Lazaric:
Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems. ICML 2018: 1-9 - [i3]Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Thomas Nedelec, Vianney Perchet:
Explicit shading strategies for repeated truthful auctions. CoRR abs/1805.00256 (2018) - [i2]Thomas Nedelec, Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Benjamin Heymann, Vianney Perchet:
Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems. CoRR abs/1808.06979 (2018) - 2017
- [c2]Marc Abeille, Alessandro Lazaric:
Linear Thompson Sampling Revisited. AISTATS 2017: 176-184 - [c1]Marc Abeille, Alessandro Lazaric:
Thompson Sampling for Linear-Quadratic Control Problems. AISTATS 2017: 1246-1254 - 2016
- [i1]Marc Abeille, Alessandro Lazaric:
Linear Thompson Sampling Revisited. CoRR abs/1611.06534 (2016)
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-05-14 20:29 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:
