Government
Newton-type Methods for Minimax Optimization
Zhang, Guojun, Wu, Kaiwen, Poupart, Pascal, Yu, Yaoliang
To account for the sequential and nonconvex nature, new solution concepts and algorithms have been developed. In this work, we provide a detailed analysis of existing algorithms and relate them to two novel Newton-type algorithms. We argue that our Newton-type algorithms nicely complement existing ones in that (a) they converge faster to (strict) local minimax points; (b) they are much more effective when the problem is ill-conditioned; (c) their computational complexity remains similar. We verify our theoretical results by conducting experiments on training GANs.
A New Modal Autoencoder for Functionally Independent Feature Extraction
Guo, Yuzhu, Pan, Kang, Li, Simeng, Han, Zongchang, Wang, Kexin, Li, Li
Autoencoders have been widely used for dimensional reduction and feature extraction. Various types of autoencoders have been proposed by introducing regularization terms. Most of these regularizations improve representation learning by constraining the weights in the encoder part, which maps input into hidden nodes and affects the generation of features. In this study, we show that a constraint to the decoder can also significantly improve its performance because the decoder determines how the latent variables contribute to the reconstruction of input. Inspired by the structural modal analysis method in mechanical engineering, a new modal autoencoder (MAE) is proposed by othogonalising the columns of the readout weight matrix. The new regularization helps to disentangle explanatory factors of variation and forces the MAE to extract fundamental modes in data. The learned representations are functionally independent in the reconstruction of input and perform better in consecutive classification tasks. The results were validated on the MNIST variations and USPS classification benchmark suite. Comparative experiments clearly show that the new algorithm has a surprising advantage. The new MAE introduces a very simple training principle for autoencoders and could be promising for the pre-training of deep neural networks.
US Army develops new drone that can TRANSFORM mid-flight
Army researchers have designed a new drone that can transform mid-flight, making it capable of both high-speed flight and hovering in place at a target destination. The drone was a joint effort from the US Army Research Laboratory and engineers Texas A&M, who presented their research at the American Institute of Aeronautics and Astronautics Aviation Forum and Exposition. The drone transforms by either bending its wings upward or fully extending them depending on the needs of the mission and the types of maneuvers it needs to execute. For'dash' segments of missions, which require travel to and from a target, the wings will be folded inward to allow for faster and more efficient travel, while'loiter' phases of a mission will see the wings fully extended for increased stability. 'During dash segments, short wings are desirable in order to go fast and be more maneuverable, but for loiter segments, long wings are desirable in order to enable low power, high endurance flight.'
What a machine learning tool that turns Obama white can (and can't) tell us about AI bias
It's a startling image that illustrates the deep-rooted biases of AI research. Input a low-resolution picture of Barack Obama, the first black president of the United States, into an algorithm designed to generate depixelated faces, and the output is a white man. Get the same algorithm to generate high-resolution images of actress Lucy Liu or congresswoman Alexandria Ocasio-Cortez from low-resolution inputs, and the resulting faces look distinctly white. As one popular tweet quoting the Obama example put it: "This image speaks volumes about the dangers of bias in AI." But what's causing these outputs and what do they really tell us about AI bias?
NASA invites you to take a virtual spin in its Curiosity rover and label rocks
NASA is asking people to explore Mars using images taken of the Red Planet by its Curiosity Rover and help to label rocks and other surface features. The project, known as AI4Mars, is designed to improve an artificial intelligence algorithm that will help future Martian rovers move across the planet's surface. The simulation was designed by a team from NASAs Jet Propulsion Laboratory as a way to help future rovers spot potential obstacles and avoid getting stuck. The projected is hosted on the citizen science site Zooniverse and involves volunteers labelling terrain features in thousands of pictures of the Red Planet. NASA hopes that having a more effective algorithm - similar to the ones used in self driving cars - will prevent future rovers suffering the same fate as Spirit which got stuck in a sand pit that ended its mission after seven years.
On Fair Selection in the Presence of Implicit Variance
Emelianov, Vitalii, Gast, Nicolas, Gummadi, Krishna P., Loiseau, Patrick
Quota-based fairness mechanisms like the so-called Rooney rule or four-fifths rule are used in selection problems such as hiring or college admission to reduce inequalities based on sensitive demographic attributes. These mechanisms are often viewed as introducing a trade-off between selection fairness and utility. In recent work, however, Kleinberg and Raghavan showed that, in the presence of implicit bias in estimating candidates' quality, the Rooney rule can increase the utility of the selection process. We argue that even in the absence of implicit bias, the estimates of candidates' quality from different groups may differ in another fundamental way, namely, in their variance. We term this phenomenon implicit variance and we ask: can fairness mechanisms be beneficial to the utility of a selection process in the presence of implicit variance (even in the absence of implicit bias)? To answer this question, we propose a simple model in which candidates have a true latent quality that is drawn from a group-independent normal distribution. To make the selection, a decision maker receives an unbiased estimate of the quality of each candidate, with normal noise, but whose variance depends on the candidate's group. We then compare the utility obtained by imposing a fairness mechanism that we term $\gamma$-rule (it includes demographic parity and the four-fifths rule as special cases), to that of a group-oblivious selection algorithm that picks the candidates with the highest estimated quality independently of their group. Our main result shows that the demographic parity mechanism always increases the selection utility, while any $\gamma$-rule weakly increases it. We extend our model to a two-stage selection process where the true quality is observed at the second stage. We discuss multiple extensions of our results, in particular to different distributions of the true latent quality.
Crop Yield Prediction Integrating Genotype and Weather Variables Using Deep Learning
Shook, Johnathon, Gangopadhyay, Tryambak, Wu, Linjiang, Ganapathysubramanian, Baskar, Sarkar, Soumik, Singh, Asheesh K.
Accurate prediction of crop yield supported by scientific and domain-relevant insights, can help improve agricultural breeding, provide monitoring across diverse climatic conditions and thereby protect against climatic challenges to crop production including erratic rainfall and temperature variations. We used historical performance records from Uniform Soybean Tests (UST) in North America spanning 13 years of data to build a Long Short Term Memory - Recurrent Neural Network based model to dissect and predict genotype response in multiple-environments by leveraging pedigree relatedness measures along with weekly weather parameters. Additionally, for providing explainability of the important time-windows in the growing season, we developed a model based on temporal attention mechanism. The combination of these two models outperformed random forest (RF), LASSO regression and the data-driven USDA model for yield prediction. We deployed this deep learning framework as a 'hypotheses generation tool' to unravel GxExM relationships. Attention-based time series models provide a significant advancement in interpretability of yield prediction models. The insights provided by explainable models are applicable in understanding how plant breeding programs can adapt their approaches for global climate change, for example identification of superior varieties for commercial release, intelligent sampling of testing environments in variety development, and integrating weather parameters for a targeted breeding approach. Using DL models as hypothesis generation tools will enable development of varieties with plasticity response in variable climatic conditions. We envision broad applicability of this approach (via conducting sensitivity analysis and "what-if" scenarios) for soybean and other crop species under different climatic conditions.
Preferences Single-Peaked on a Circle
Peters, Dominik | Lackner, Martin (TU Wien)
We introduce the domain of preferences that are single-peaked on a circle, which is a generalization of the well-studied single-peaked domain. This preference restriction is useful, e.g., for scheduling decisions, certain facility location problems, and for one-dimensional decisions in the presence of extremist preferences. We give a fast recognition algorithm of this domain, provide a characterisation by finitely many forbidden subprofiles, and show that many popular single- and multi-winner voting rules are polynomial-time computable on this domain. In particular, we prove that Proportional Approval Voting can be computed in polynomial time for profiles that are single-peaked on a circle. In contrast, Kemeny's rule remains hard to evaluate, and several impossibility results from social choice theory can be proved using only profiles in this domain.
Sub-Seasonal Climate Forecasting via Machine Learning: Challenges, Analysis, and Advances
He, Sijie, Li, Xinyan, DelSole, Timothy, Ravikumar, Pradeep, Banerjee, Arindam
Sub-seasonal climate forecasting (SSF) focuses on predicting key climate variables such as temperature and precipitation in the 2-week to 2-month time scales. Skillful SSF would have immense societal value, in areas such as agricultural productivity, water resource management, transportation and aviation systems, and emergency planning for extreme weather events. However, SSF is considered more challenging than either weather prediction or even seasonal prediction. In this paper, we carefully study a variety of machine learning (ML) approaches for SSF over the US mainland. While atmosphere-land-ocean couplings and the limited amount of good quality data makes it hard to apply black-box ML naively, we show that with carefully constructed feature representations, even linear regression models, e.g., Lasso, can be made to perform well. Among a broad suite of 10 ML approaches considered, gradient boosting performs the best, and deep learning (DL) methods show some promise with careful architecture choices. Overall, suitable ML methods are able to outperform the climatological baseline, i.e., predictions based on the 30-year average at a given location and time. Further, based on studying feature importance, ocean (especially indices based on climatic oscillations such as El Nino) and land (soil moisture) covariates are found to be predictive, whereas atmospheric covariates are not considered helpful.
NASA simulator creates stunning sunsets from alien planets across the solar system
A simulation created stunning sunsets from alien worlds across the solar system. The animation transports viewers to the surface of Venus, Mars, Uranus and Saturn's largest moon Titan, allowing them to witness the sun dip into the horizon. As a planet rotates away from the sun's light, photons scattered in different directions that produce an array of colors. The sunset on Uranus is a light shade of blue that fades into a royal blue with hints of turquoise, while Titan's starts as a vibrant yellow then shifts into a fiery red. The animation transports viewers to the surface of Venus, Mars, Uranus and Saturn's largest moon Titan, allowing them to witness the sun dip into the horizon.