Author name: admin

AI e Advertising

BLOG AAI e Advertising: tra presente e futuro Introduzione “The Best Minds of My Generation Are Thinking About How To Make People Click Ads” Nel lontano 2011, con questa osservazione provocatoria, Jeff Hammerbacher, ex data-scientist di Facebook e fondatore di Cloudera, metteva in luce la grande quantità di talento e risorse investite nel campo dell’advertising …

AI e Advertising Read More »

Optimize​

Squeeze out the best from each channel via optimization. AD cube MMM optimizes the budget over channels and weeks. Find out how to optimally allocate the budget for each week of the following year.

What if scenarios

Simulate new allocation scenarios without spending money and time. If you want to experiment with new ideas, you can go directly from questions to predicted output effortless. Just ask and the MMM will answer!

Measure impact of past strategies

Analyze how you performed in the past. AD cube MMM can tell you exactly how much each channel contributed to the achievement of your goals. You will also get a full breakdown of previous allocations and outcomes strategies.

Safe online bid optimization with return-on-investment and budget constraints subject to uncertainty

PUBLICATION Safe online bid optimization with return-on-investment and budget constraints subject to uncertainty. Download View publication Abstract In online marketing, the advertisers’ goal is usually a tradeoff between achieving high volumes and high profitability. The companies’ business units customarily address this tradeoff by maximizing the volumes while guaranteeing a lower bound to the Return On …

Safe online bid optimization with return-on-investment and budget constraints subject to uncertainty Read More »

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 »