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/

You are a robot and you live in a Markov decision process (MDP) with a finite or an infinite number of transitions from state-action to next states. You got brains and so you plan before you act. Luckily, your roboparents equipped you with a generative model to do some Monte-Carlo planning. The world is waiting for you and you have no time to waste. You want your planning to be efficient.

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

Joint matrix triangularization is often used for estimating the joint eigenstructure of a set M of matrices, with applications in signal processing and machine learning. We consider the problem of approximate joint matrix triangularization when the matrices in M are jointly diagonalizable and real, but we only observe a set M' of noise perturbed versions of the matrices in M. Our main result is a first-order upper bound on the distance between any approximate joint triangularizer of the matrices in M' and any exact joint triangularizer of the matrices in M. The bound depends only on the observable matrices in M' and the noise level. In particular, it does not depend on optimization specific properties of the triangularizer, such as its proximity to critical points, that are typical of existing bounds in the literature. To our knowledge, this is the first a posteriori bound for joint matrix decomposition. We demonstrate the bound on synthetic data for which the ground truth is known.

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

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

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

We consider cooperative multi-agent consensus optimization problems over anundirected network of agents, where only those agents connected by an edgecan directly communicate. The objective is to minimize the sum of agent-specific composite convex functions over agent-specific private conic constraintsets; hence, the optimal consensus decision should lie in the intersection of theseprivate sets. We provide convergence rates in sub-optimality, infeasibility andconsensus violation; examine the effect of underlying network topology on theconvergence rates of the proposed decentralized algorithms; and show how to ex-tend these methods to handle time-varying communication networks.

Good sparse approximations are essential for practical inference in Gaussian Processes as the computational cost of exact methods is prohibitive for large datasets. The Fully Independent Training Conditional (FITC) and the Variational Free Energy (VFE) approximations are two recent popular methods. Despite superficial similarities, these approximations have surprisingly different theoretical properties and behave differently in practice. We thoroughly investigate the two methods for regression both analytically and through illustrative examples, and draw conclusions to guide practical application.