Energy
Binary Classification as a Phase Separation Process
We propose a new binary classification model called Phase Separation Binary Classifier (PSBC). It consists of a discretization of a nonlinear reaction-diffusion equation coupled with an ODE, and is inspired by fluid behavior, namely, on how binary fluids phase separate. Hence, parameters and hyperparameters have physical meaning, whose effects are carefully studied in several different scenarios. PSBC's coefficients are trainable weights, chosen according to a minimization problem using Gradient Descent; optimization relies on a classical Backpropagation with weight sharing. The model can be seen under the framework of feedforward networks, and is endowed with a nonlinear activation function that is linear in trainable weights but polynomial in other variables, yielding a cost function that is also polynomial. In view of the model's connection with ODEs and parabolic PDEs, forward propagation amounts to an initial value problem. Thus, stability conditions are established using the concept of Invariant regions. Interesting model compression properties are thoroughly discussed. We illustrate the classifier's qualities by applying it to the subset of numbers "0" and "1" of the classical MNIST database, where we are able to discern individuals with more than 94\% accuracy, sometimes using less only about 10\% of variables.
Improving Delay Based Reservoir Computing via Eigenvalue Analysis
Kรถster, Felix, Yanchuk, Serhiy, Lรผdge, Kathy
We analyze the reservoir computation capability of the Lang-Kobayashi system by comparing the numerically computed recall capabilities and the eigenvalue spectrum. We show that these two quantities are deeply connected, and thus the reservoir computing performance is predictable by analyzing the eigenvalue spectrum. Our results suggest that any dynamical system used as a reservoir can be analyzed in this way as long as the reservoir perturbations are sufficiently small. Optimal performance is found for a system with the eigenvalues having real parts close to zero and off-resonant imaginary parts.
Transfer Learning in Deep Reinforcement Learning: A Survey
Zhu, Zhuangdi, Lin, Kaixiang, Zhou, Jiayu
This paper surveys the field of transfer learning in the problem setting of Reinforcement Learning (RL). RL has been the key solution to sequential decision-making problems. Along with the fast advance of RL in various domains. including robotics and game-playing, transfer learning arises as an important technique to assist RL by leveraging and transferring external expertise to boost the learning process. In this survey, we review the central issues of transfer learning in the RL domain, providing a systematic categorization of its state-of-the-art techniques. We analyze their goals, methodologies, applications, and the RL frameworks under which these transfer learning techniques would be approachable. We discuss the relationship between transfer learning and other relevant topics from an RL perspective and also explore the potential challenges as well as future development directions for transfer learning in RL.
Strategy Proof Mechanisms for Facility Location with Capacity Limits
An important feature of many real world facility location problems are capacity limits on the facilities. We show here how capacity constraints make it harder to design strategy proof mechanisms for facility location, but counter-intuitively can improve the guarantees on how well we can approximate the optimal solution.
Planting trees at the right places: Recommending suitable sites for growing trees using algorithm fusion
Rana, Pushpendra, Varshney, Lav R
Large-scale planting of trees has been proposed as a low-cost natural solution for carbon mitigation, but is hampered by poor selection of plantation sites, especially in developing countries. To aid in site selection, we develop the ePSA (e-Plantation Site Assistant) recommendation system based on algorithm fusion that combines physics-based/traditional forestry science knowledge with machine learning. ePSA assists forest range officers by identifying blank patches inside forest areas and ranking each such patch based on their tree growth potential. Experiments, user studies, and deployment results characterize the utility of the recommender system in shaping the long-term success of tree plantations as a nature climate solution for carbon mitigation in northern India and beyond.
Exploring Bayesian Surprise to Prevent Overfitting and to Predict Model Performance in Non-Intrusive Load Monitoring
Jones, Richard, Klemenjak, Christoph, Makonin, Stephen, Bajic, Ivan V.
Non-Intrusive Load Monitoring (NILM) is a field of research focused on segregating constituent electrical loads in a system based only on their aggregated signal. Significant computational resources and research time are spent training models, often using as much data as possible, perhaps driven by the preconception that more data equates to more accurate models and better performing algorithms. When has enough prior training been done? When has a NILM algorithm encountered new, unseen data? This work applies the notion of Bayesian surprise to answer these questions which are important for both supervised and unsupervised algorithms. We quantify the degree of surprise between the predictive distribution (termed postdictive surprise), as well as the transitional probabilities (termed transitional surprise), before and after a window of observations. We compare the performance of several benchmark NILM algorithms supported by NILMTK, in order to establish a useful threshold on the two combined measures of surprise. We validate the use of transitional surprise by exploring the performance of a popular Hidden Markov Model as a function of surprise threshold. Finally, we explore the use of a surprise threshold as a regularization technique to avoid overfitting in cross-dataset performance. Although the generality of the specific surprise threshold discussed herein may be suspect without further testing, this work provides clear evidence that a point of diminishing returns of model performance with respect to dataset size exists. This has implications for future model development, dataset acquisition, as well as aiding in model flexibility during deployment.
Data-Driven Topology Optimization with Multiclass Microstructures using Latent Variable Gaussian Process
Wang, Liwei, Tao, Siyu, Zhu, Ping, Chen, Wei
The data-driven approach is emerging as a promising method for the topological design of multiscale structures with greater efficiency. However, existing data-driven methods mostly focus on a single class of microstructures without considering multiple classes to accommodate spatially varying desired properties. The key challenge is the lack of an inherent ordering or distance measure between different classes of microstructures in meeting a range of properties. To overcome this hurdle, we extend the newly developed latent-variable Gaussian process (LVGP) models to create multi-response LVGP (MR-LVGP) models for the microstructure libraries of metamaterials, taking both qualitative microstructure concepts and quantitative microstructure design variables as mixed-variable inputs. The MR-LVGP model embeds the mixed variables into a continuous design space based on their collective effects on the responses, providing substantial insights into the interplay between different geometrical classes and material parameters of microstructures. With this model, we can easily obtain a continuous and differentiable transition between different microstructure concepts that can render gradient information for multiscale topology optimization. We demonstrate its benefits through multiscale topology optimization with aperiodic microstructures. Design examples reveal that considering multiclass microstructures can lead to improved performance due to the consistent load-transfer paths for micro- and macro-structures.
Five things businesses need to think about when implementing AI
With the growth of Artificial Intelligence (AI) applications in businesses comes the responsibility to apply these AI solutions in a smart, ethical and economically friendly way. Every new application of the technology brings its own unique challenges, so the need to constantly monitor AI use in business is vital. In light of this, here are five key things to consider when implementing, or even thinking about implementing, AI into your company. Return on investment (ROI) is important, but speed, however, is critical. One common mistake that many organisations make when selecting the first business challenge to solve with AI, is choosing the one that will create the biggest ROI.
'Fortnite' will add ray tracing and DLSS on September 17th
As promised, Fortnite is about to look a whole lot better. At NVIDIA's RTX 3000 GPU event last week, NVIDIA and Epic revealed that ray-tracing and DLSS tech were on their way to Fortnite and would arrive "soon." Today, Epic and NVIDIA announced that the patch to add RTX will go live on September 17th. Fornite's Save the World, Creative and Battle Royale modes will get support for ray-traced reflections, shadows, global illumination and ambient occlusions. That means you'll see detailed, realistic reflections in bodies of water, windows, face shields and more.
10 Predictions On Software Development Trends Of 2022
What are the trends in software development over the second half of 2020? This is like no other year. The prevailing issue has turned the world upside down, pushing companies to take on new technology's challenges and analyze their digital strategies. Digital has become the principal (and, in some cases, only) channel of customer interaction and engagement. Enterprises with the digital projects designed to be implemented within the next one to three years need to speed up their initiatives.