We consider the weakly supervised binary classification problem where the labels are randomly flipped with probability $1- {\alpha}$. Although there exist numerous algorithms for this problem, it remains theoretically unexplored how the statistical accuracies and computational efficiency of these algorithms depend on the degree of supervision, which is quantified by ${\alpha}$. In this paper, we characterize the effect of ${\alpha}$ by establishing the information-theoretic and computational boundaries, namely, the minimax-optimal statistical accuracy that can be achieved by all algorithms, and polynomial-time algorithms under an oracle computational model. For small ${\alpha}$, our result shows a gap between these two boundaries, which represents the computational price of achieving the information-theoretic boundary due to the lack of supervision. Interestingly, we also show that this gap narrows as ${\alpha}$ increases. In other words, having more supervision, i.e., more correct labels, not only improves the optimal statistical accuracy as expected, but also enhances the computational efficiency for achieving such accuracy.

In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is $O(\log(n) \log^2(\log k))$ adaptive, and uses a total of $O(n \log\log(k))$ queries. Recent algorithms have comparable guarantees in terms of asymptotic worst case analysis, but their actual number of rounds and query complexity depend on very large constants and polynomials in terms of precision and confidence, making them impractical for large data sets. Our main contribution is a design that is extremely efficient both in terms of its non-asymptotic worst case query complexity and number of rounds, and in terms of its practical runtime. We show that this algorithm outperforms any algorithm for submodular maximization we are aware of, including hyper-optimized parallel versions of state-of-the-art serial algorithms, by running experiments on large data sets. These experiments show FAST is orders of magnitude faster than the state-of-the-art.

A standard way to tackle the challenging task of learning from high-dimensional data is to exploit its underlying low-dimensional structure. Union of Subspaces (UoS) is a popular and powerful model to describe such structure which assumes that the data lies in the union of a collection of low-dimensional subspaces. Extracting useful information from UoS structure of data has become the task of the newly-emerged field of subspace learning. In this paper, we investigate how random projection, an efficient and commonly-used method for dimensionality reduction, distorts the UoS structure of data. Here the fine details of UoS structure are described in terms of canonical angles (also known as principal angles) between subspaces, which is a well-known characterization for relative subspace positions by a sequence of angles. It is proved that random projection with the so-called Johnson-Lindenstrauss (JL) property approximately preserves canonical angles between subspaces. As canonical angles completely determine the relative position of subspaces, our result indicates that random projection approximately preserves structure of a union of subspaces. Inspired by this result, we propose in this paper the framework of Compressed Subspace Learning (CSL), which enables to extract useful information from the UoS structure of data in a greatly reduced dimension and has the advantage of lower computational cost and memory requirements. We demonstrate the effectiveness of CSL in various subspace-related tasks such as subspace visualization, active subspace detection, and subspace clustering.

We study two time-scale linear stochastic approximation algorithms, which can be used to model well-known reinforcement learning algorithms such as GTD, GTD2, and TDC. We present finite-time performance bounds for the case where the learning rate is fixed. The key idea in obtaining these bounds is to use a Lyapunov function motivated by singular perturbation theory for linear differential equations. We use the bound to design an adaptive learning rate scheme which significantly improves the convergence rate over the known optimal polynomial decay rule in our experiments, and can be used to potentially improve the performance of any other schedule where the learning rate is changed at pre-determined time instants.

We present some results concerning the dialogue behavior and inferred sentiment of a group of older adults interacting with a computer-based avatar. Our avatar is unique in its ability to hold natural dialogues on a wide range of everyday topics---27 topics in three groups, developed with the help of gerontologists. The three groups vary in ``degrees of intimacy", and as such in degrees of difficulty for the user. Each participant interacted with the avatar for 7-9 sessions over a period of 3-4 weeks; analysis of the dialogues reveals correlations such as greater verbosity for more difficult topics, increasing verbosity with successive sessions, especially for more difficult topics, stronger sentiment on topics concerned with life goals rather than routine activities, and stronger self-disclosure for more intimate topics. In addition to their intrinsic interest, these results also reflect positively on the sophistication of our dialogue system.

We present new techniques for automatically constructing probabilistic programs for data analysis, interpretation, and prediction. These techniques work with probabilistic domain-specific data modeling languages that capture key properties of a broad class of data generating processes, using Bayesian inference to synthesize probabilistic programs in these modeling languages given observed data. We provide a precise formulation of Bayesian synthesis for automatic data modeling that identifies sufficient conditions for the resulting synthesis procedure to be sound. We also derive a general class of synthesis algorithms for domain-specific languages specified by probabilistic context-free grammars and establish the soundness of our approach for these languages. We apply the techniques to automatically synthesize probabilistic programs for time series data and multivariate tabular data. We show how to analyze the structure of the synthesized programs to compute, for key qualitative properties of interest, the probability that the underlying data generating process exhibits each of these properties. Second, we translate probabilistic programs in the domain-specific language into probabilistic programs in Venture, a general-purpose probabilistic programming system. The translated Venture programs are then executed to obtain predictions of new time series data and new multivariate data records. Experimental results show that our techniques can accurately infer qualitative structure in multiple real-world data sets and outperform standard data analysis methods in forecasting and predicting new data.

Program comprehension is a dominant process in software development and maintenance. Experts are considered to comprehend the source code efficiently by directing their gaze, or attention, to important components in it. However, reflecting importance of components is still a remaining issue in gaze behavior analysis for source code comprehension. Here we show a conceptual framework to compare the quantified importance of source code components with gaze behavior of programmers. We use "attention" in attention models (e.g., code2vec) as the importance indices for source code components and evaluate programmers' gaze locations based on the quantified importance. In this report, we introduce the idea of our gaze behavior analysis using the attention map, and the results of a preliminary experiment.

The tests, set to take place at Edwards Air Force Base in Kern County, California, are expected to be conducted on a "small, but representative high-speed surrogate aircraft," Cara Bousie, the service's spokesperson, told Aviation Week. Although Bousie steered clear of offering any additional details regarding the looming tests, she did indicate that the move is part of a two-year campaign for the department to determine just how the technology will perform in a controlled setting. Will Roper, assistant secretary of the Air Force for acquisition, previously revealed in a March interview that aircraft candidates that may be used during the summer trials include the Kratos XQ-58A Valkyrie, Composite Engineering BQM-167 Skeeter and Boeing QF-16. Disclosed to the public just in March, the Skyborg program's objective is to deliver a combat-ready, autonomous, unmanned aerial vehicle prototype by the end of 2023. The aircraft is expected to act as a robotic wingman for service members, using its AI tech to manage combat mission tasks on its own when the need arises.

Even casual music fans can distinguish songs by category without great difficulty, but that's not the case for computers. Most audio-based music classification and tagging systems use categorical supervised learning -- in other words, learning a function that maps songs to genres based on example pairs -- with a fixed set of labels that intrinsically can't handle unseen labels, such as newly added genres. That's why a team of scientists at Naver Corp, an internet content service company headquartered in South Korea, investigated a zero-shot alternative in a paper ("Zero-Shot Learning for Audio-based Music Classification and Tagging") published on the preprint server Arxiv.org. Their AI classification system learns how to recognize songs without any labeled training data by taking into account side information about musical instruments, words in descriptions about songs, and more. The researchers settled on two types of side information at the outset of the study: human-labeled attribute information and general word semantic information.

Megvii, a Chinese AI startup that supplies facial recognition software for the Chinese government's surveillance program, is expanding its technology beyond humans to recognize different faces of pets. As reported by Abacus News, Megvii's new program is trained to recognize dogs by their nose prints -- much like how humans have unique fingerprints. Using the Megvii app, the company says it can register your dog simply by scanning the snout through your phone's camera. Just like how a phone registers your fingerprint for biometric unlocks, the app asks you to take photos of your dog's nose from multiple angles. Megvii says it has an accuracy rate of 95 percent and has reunited 15,000 pets with their owners through the app.