Arising from many applications at the intersection of decision-making and machine learning, Marginal Maximum A Posteriori (Marginal MAP) problems unify the two main classes of inference, namely maximization (optimization) and marginal inference (counting), and are believed to have higher complexity than both of them. We propose XOR MMAP provides a constant factor approximation to the Marginal MAP problem, by encoding it as a single optimization in a polynomial size of the original problem. We evaluate our approach in several machine learning and decision-making applications, and show that our approach outperforms several state-of-the-art Marginal MAP solvers.

This material may not be published, broadcast, rewritten, or redistributed. Quotes displayed in real-time or delayed by at least 15 minutes. Market data provided by Factset . Powered and implemented by FactSet Digital Solutions . Mutual Fund and ETF data provided by LSEG .

Game theory provides a powerful framework for the design and analysis of multiagent systems that involve strategic interactions [see, e.g.,16].

Several recent works have shown that state-of-the-art classifiers are vulnerable to worst-case (i.e., adversarial) perturbations of the datapoints. On the other hand, it has been empirically observed that these same classifiers are relatively robust to random noise. In this paper, we propose to study a semi-random noise regime that generalizes both the random and worst-case noise regimes. We propose the first quantitative analysis of the robustness of nonlinear classifiers in this general noise regime. We establish precise theoretical bounds on the robustness of classifiers in this general regime, which depend on the curvature of the classifier's decision boundary. Our bounds confirm and quantify the empirical observations that classifiers satisfying curvature constraints are robust to random noise. Moreover, we quantify the robustness of classifiers in terms of the subspace dimension in the semi-random noise regime, and show that our bounds remarkably interpolate between the worst-case and random noise regimes. We perform experiments and show that the derived bounds provide very accurate estimates when applied to various state-of-the-art deep neural networks and datasets. This result suggests bounds on the curvature of the classifiers' decision boundaries that we support experimentally, and more generally offers important insights onto the geometry of high dimensional classification problems.

Services such as Google TV and Amazon's Fire TV have recommendation systems, as well as search functions, that may prioritise some content over others. Services such as Google TV and Amazon's Fire TV have recommendation systems, as well as search functions, that may prioritise some content over others. World's broadcasters urge EU to tighten rules for big tech in smart TV battle The world's largest broadcasters have pushed for the EU to enforce its toughest regulations against virtual TVs and smart assistants built by Google, Amazon, Apple and Samsung . The call came in a letter from the Association of Commercial Television and Video on Demand Services in Europe (ACT), whose members include Canal+, RTL, Mediaset, ITV, Paramount+, NBCUniversal, Walt Disney, Warner Bros Discovery, Sky and TF1 Groupe. The letter argues that big tech companies have growing control over the operating systems of smart TVs and voice assistants, allowing them to act as "gatekeepers" funnelling users towards some content and away from others.

Neural Information Processing Systems http://nips.cc/

Unfortunately, the notion is seriously flawed on two counts [8]. First, it doesn't ensure fairness.

Air strikes have targeted the headquarters of the Iran-aligned Popular Mobilisation Forces (PMF) in Iraq's capital, Baghdad, as the country becomes a two-way battlefield between armed factions and the United States during its war with Iran . The US carried out strikes against the Shia paramilitary umbrella group, also known locally as Hashed al-Shaabi, late on Sunday after attacks on a US diplomatic and logistics centre at Baghdad International Airport. The attack was carried out after Iraqi security officials said four explosions were heard near Camp Victory, a US logistics centre at the capital's main airport. Al Jazeera's Assed Baig, reporting from Baghdad, said some drones "breached air defences and caused damage, more symbolic damage than anything else". "At the same time, Iraqi security forces have set up checkpoints around Baghdad to try and stop these drone strikes because some of these factions are launching drones from the vicinity of Baghdad," he said.

We consider the problem of finding the best arm in a stochastic Mutli-armed Bandit (MAB) game and propose a general framework based on verification that applies to multiple well-motivated generalizations of the classic MAB problem. In these generalizations, additional structure is known in advance, causing the task of verifying the optimality of a candidate to be easier than discovering the best arm. Our results are focused on the scenario where the failure probability $\delta$ must be very low; we essentially show that in this high confidence regime, identifying the best arm is as easy as the task of verification. We demonstrate the effectiveness of our framework by applying it, and improving the state-of-the art results in the problems of: Linear bandits, Dueling bandits with the Condorcet assumption, Copeland dueling bandits, Unimodal bandits and Graphical bandits.

Due to health and energy concerns, the California Legislature is considering bills to prohibit data centers from being exempted from the state's stringent environmental law and impose new tariffs on new major energy users that strain power supplies.