Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Calauz A"'
Publikováno v:
Buletin Stiintific, seria A, Fascicula Filologie / Scientific Bulletin, A Series, Philology Fascicle. XXVIII(1):317-330
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=822312
Autor:
Belea, Maria, Calauz, Adriana
Publikováno v:
Revista de Cercetare şi Intervenţie Socială / Review of Research and Social Intervention. (67):52-66
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=819419
Publikováno v:
In Procedia - Social and Behavioral Sciences 9 July 2013 84:1500-1503
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentially. We prove that it is possible to leverage a rank-1 assumption on t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba81353f1cad2b6cf891489acbda5d6f
http://arxiv.org/abs/2108.00230
http://arxiv.org/abs/2108.00230
Autor:
Maria Belea, Adriana Calauz
Publikováno v:
Revista de Cercetare si Interventie Sociala. 67:52-66
The present study focused on the relationship between the adolescent’s perception of minor stress in different domains (school, relationship with parents, managing free time, romantic relationships, work and future) and the social support received
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44b71e2042a533bce3d048d464980dc3
https://doi.org/10.33788/rcis.67.4
https://doi.org/10.33788/rcis.67.4
Generalized Linear Bandits (GLBs) are powerful extensions to the Linear Bandit (LB) setting, broadening the benefits of reward parametrization beyond linearity. In this paper we study GLBs in non-stationary environments, characterized by a general me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffa22fa71f47dbe400e165b7a3b62019
http://arxiv.org/abs/2103.05750
http://arxiv.org/abs/2103.05750
Autor:
Nedelec, Thomas, Abeille, Marc, Calauz��nes, Cl��ment, Heymann, Benjamin, Perchet, Vianney, Karoui, Noureddine El
We address the problem of improving bidders' strategies in prior-dependent revenue-maximizing auctions. We introduce a simple and generic method to design novel bidding strategies if the seller uses past bids to optimize her mechanism. This strategy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e72213ed4e3601f02bdda0a4258561cd
https://hal.archives-ouvertes.fr/hal-03089546
https://hal.archives-ouvertes.fr/hal-03089546
Publikováno v:
AISTATS
AISTATS, Apr 2021, Virtual Conference, France
AISTATS, Apr 2021, Virtual Conference, France
Logistic Bandits have recently attracted substantial attention, by providing an uncluttered yet challenging framework for understanding the impact of non-linearity in parametrized bandits. It was shown by Faury et al. (2020) that the learning-theoret
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfed02ededb84404e959bb080e355cb8
http://arxiv.org/abs/2010.12642
http://arxiv.org/abs/2010.12642
The 2D virtual try-on task has recently attracted a great interest from the research community, for its direct potential applications in online shopping as well as for its inherent and non-addressed scientific challenges. This task requires fitting a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17e02301247dfa8b1fb26e71c134e913
Publikováno v:
dInternational Conference on Artificial Intelligence and Statistics
dInternational Conference on Artificial Intelligence and Statistics, 2020, virtual, France
dInternational Conference on Artificial Intelligence and Statistics, 2020, virtual, France
We consider the practical and classical setting where the seller is using an exploration stage to learn the value distributions of the bidders before running a revenue-maximizing auction in a exploitation phase. In this two-stage process, we exhibit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16be4cae98ce5003976a5cb21add0b9f
https://hal.archives-ouvertes.fr/hal-03089777
https://hal.archives-ouvertes.fr/hal-03089777