Artificial intelligence (AI) and machine learning (ML) have huge potential to drive a new generation of creative brand experiences. They are at the forefront of a powerful shift that will bring brands closer to consumer expectations, passions and emotions. Assistive and smart technologies are catching up and we're already facing a new world of possibilities. AI and ML can be applied in many ways. The use of machine learning to power business decisions and product recommendations is becoming widespread.

Five thousand robots will soon work together to create a 3D map that highlights 35 million distant worlds. Called Dark Energy Spectroscopic Instrument (DESI), this project is set to build 5,000 finger-width, 10-inch-long cylindrical robots which will gather light from galaxies, stars and quasars. This data will help experts learn about the nature of dark energy and provide a glimpse of what the universe was like 11 billion years ago. Dark Energy Spectroscopic Instrument (DESI)s set to build 5,000 finger-width, 10-inch-long cylindrical robots which will gather light from galaxies, stars and quasars. Dark Energy Spectroscopic Instrument (DESI) is set to build 5,000 finger-width, 10-inch-long cylindrical robots which will gather light from galaxies, stars and quasars.

The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications the number of clusters or communities (say, $K$) is generally unknown a-priori. Consequently, the majority of the existing methods either choose $K$ heuristically or they repeat the clustering method with different choices of $K$ and accept the best clustering result. The first option, more often, yields suboptimal result, while the second option is computationally expensive. In this work, we propose an incremental method for constructing the eigenspectrum of the graph Laplacian matrix. This method leverages the eigenstructure of graph Laplacian matrix to obtain the $K$-th eigenpairs of the Laplacian matrix given a collection of all the $K-1$ smallest eigenpairs. Our proposed method adapts the Laplacian matrix such that the batch eigenvalue decomposition problem transforms into an efficient sequential leading eigenpair computation problem. As a practical application, we consider user-guided spectral clustering. Specifically, we demonstrate that users can utilize the proposed incremental method for effective eigenpair computation and determining the desired number of clusters based on multiple clustering metrics.

Control of non-episodic, finite-horizon dynamical systems with uncertain dynamics poses a tough and elementary case of the exploration-exploitation trade-off. Bayesian reinforcement learning, reasoning about the effect of actions and future observations, offers a principled solution, but is intractable. We review, then extend an old approximate approach from control theory---where the problem is known as dual control---in the context of modern regression methods, specifically generalized linear regression. Experiments on simulated systems show that this framework offers a useful approximation to the intractable aspects of Bayesian RL, producing structured exploration strategies that differ from standard RL approaches. We provide simple examples for the use of this framework in (approximate) Gaussian process regression and feedforward neural networks for the control of exploration.

The dynamic nature of air quality chemistry and transport makes it difficult to identify the mixture of air pollutants for a region. In this study of air quality in the Houston metropolitan area we apply dynamic principal component analysis (DPCA) to a normalized multivariate time series of daily concentration measurements of five pollutants (O3, CO, NO2, SO2, PM2.5) from January 1, 2009 through December 31, 2011 for each of the 24 hours in a day. The resulting dynamic components are examined by hour across days for the 3 year period. Diurnal and seasonal patterns are revealed underlining times when DPCA performs best and two principal components (PCs) explain most variability in the multivariate series. DPCA is shown to be superior to static principal component analysis (PCA) in discovery of linear relations among transformed pollutant measurements. DPCA captures the time-dependent correlation structure of the underlying pollutants recorded at up to 34 monitoring sites in the region. In winter mornings the first principal component (PC1) (mainly CO and NO2) explains up to 70% of variability. Augmenting with the second principal component (PC2) (mainly driven by SO2) the explained variability rises to 90%. In the afternoon, O3 gains prominence in the second principal component. The seasonal profile of PCs' contribution to variance loses its distinction in the afternoon, yet cumulatively PC1 and PC2 still explain up to 65% of variability in ambient air data. DPCA provides a strategy for identifying the changing air quality profile for the region studied.

Let $ f^{\star} $ be a function on $ \mathbb{R}^d $ satisfying a spectral norm condition. For various noise settings, we show that $ \mathbb{E}\|\hat{f} - f^{\star} \|^2 \leq v_{f^{\star}}\left(\frac{\log d}{n}\right)^{1/4} $, where $ n $ is the sample size and $ \hat{f} $ is either a penalized least squares estimator or a greedily obtained version of such using linear combinations of ramp, sinusoidal, sigmoidal or other bounded Lipschitz ridge functions. Our risk bound is effective even when the dimension $ d $ is much larger than the available sample size. For settings where the dimension is larger than the square root of the sample size this quantity is seen to improve the more familiar risk bound of $ v_{f^{\star}}\left(\frac{d\log (n/d)}{n}\right)^{1/2} $, also investigated here.

LONDON: As you're choking down your latest serving of Trump Clinton Brexit Racism Terrorism Wealth Gap Climate Change Casserole, you could use some good news. Let's start with The Inevitable, the new best-seller by Kevin Kelly, the founder of Wired magazine some 20 years ago and one of our wisest technological prognosticators. "This is the moment that folks in the future will look back at and say, 'Oh to have been alive and well back then!'" Kelly writes. "There has never been a better time with more opportunities, more openings, lower barriers, higher benefit/risk ratios, better returns, greater upside than now. In the mid-2010s, we're getting the first sneak peeks at a bouquet of technologies that can vastly improve the lives of most people on the planet and solve some of our hardest problems – even climate change.

Nasa has announced that it has found evidence of flowing water on Mars. Scientists have long speculated that Recurring Slope Lineae -- or dark patches -- on Mars were made up of briny water but the new findings prove that those patches are caused by liquid water, which it has established by finding hydrated salts. Several hundred camped outside the London store in Covent Garden. The 6s will have new features like a vastly improved camera and a pressure-sensitive "3D Touch" display

The 40% energy saving on cooling helped one of Google's data centres to achieve a 15% reduction in power usage efficiency, or PUE. PUE is defined as the ratio of the total building energy usage (pumps, chillers, cooling towers) to the IT energy usage (Google's servers). The lower the PUE, the better.

Google's DeepMind has reduced its power consumption thanks to artificial intelligence Google is using the firm's artificial intelligence system to control parts of its data centers, DeepMind cofounder Demis Hassabis told Bloomberg on Tuesday. DeepMind, which Google acquired in 2014, is using its AI engine to change how data center servers and cooling systems work to reduce power consumption. The company didn't say how much it's saving Google. Hassabis tipped a 15 percent improvement in power efficiency since Google launched the program this year, which he said is a "huge savings in terms of cost." The average electricity price in the US can range from 25 to 40 per megawatt hour, according to the U.S. Energy Information Administration.