Author name: admin

When Gaussian processes meet combinatorial bandits: GCB

PUBLICATION When Gaussian processes meet combinatorial bandits: GCB Download View publication Abstract Combinatorial bandits (CMAB) are a generalization of the well-known Multi-Armed Bandit framework, in which the learner chooses, at each round, a subset of the available arms that satisfies some known constraints. The learner observes the payoffs of each chosen arm and aims at …

When Gaussian processes meet combinatorial bandits: GCB Read More »

Driving exploration by maximum distribution in gaussian process bandits

PUBLICATION Driving exploration by maximum distribution in gaussian process bandits. Download View publication Abstract The problem of finding optimal solutions of stochastic functions over continuous domains is common in several real-world applications, such as, e.g., advertisement allocation, dynamic pricing, and power control in wireless networks. The optimization process is customarily performed by selecting input points …

Driving exploration by maximum distribution in gaussian process bandits Read More »

Internet advertising for non-stationary environments

PUBLICATION Internet advertising for non-stationary environments. Download View publication Abstract La presente simulazione è stata realizzata sulla base delle regole riportate nel DM 598/2018 e allegata Tabella A. Cineca non si assume alcuna responsabilità in merito all’uso che il diretto interessato o terzi faranno della simulazione. Si specifica inoltre che la simulazione contiene calcoli effettuati …

Internet advertising for non-stationary environments Read More »

Online joint bid/daily budget optimization of internet advertising campaigns

PUBLICATION Online joint bid/daily budget optimization of internet advertising campaigns. Download View publication Abstract Pay-per-click advertising includes various formats (e.g., search, contextual, social) with a total investment of more than 200 billion USD per year worldwide. An advertiser is given a daily budget to allocate over several, even thousands, campaigns, mainly distinguishing for the ad, …

Online joint bid/daily budget optimization of internet advertising campaigns Read More »

Dealing with interdependencies and uncertainty in multi-channel advertising campaigns optimization

PUBLICATION Dealing with interdependencies and uncertainty in multi-channel advertising campaigns optimization. Download View publication Abstract In 2017, Internet ad spending reached 209 billion USD worldwide, while, e.g., TV ads brought in 178 billion USD. An Internet advertising campaign includes up to thousands of sub-campaigns on multiple channels, e.g., search, social, display, whose parameters (bid and …

Dealing with interdependencies and uncertainty in multi-channel advertising campaigns optimization Read More »

Targeting optimization for internet advertising by learning from logged bandit feedback

PUBLICATION Targeting optimization for internet advertising by learning from logged bandit feedback. Download View publication Abstract Pay-per-click advertising includes various formats (eg, search, contextual, and social) with a total investment of more than 140 billion USD per year. An advertising campaign is composed of some subcampaigns-each with a different ad-and a cumulative daily budget. The …

Targeting optimization for internet advertising by learning from logged bandit feedback Read More »

A combinatorial-bandit algorithm for the online joint bid/budget optimization of pay-per-click advertising campaigns

PUBLICATION A combinatorial-bandit algorithm for the online joint bid/budget optimization of pay-per-click advertising campaigns. Download View publication Abstract In the last two decades, online advertising has become the most effective way to sponsor a product or an event. The success of this advertising format is mainly due to the capability of the Internet channels to …

A combinatorial-bandit algorithm for the online joint bid/budget optimization of pay-per-click advertising campaigns Read More »