The study of architectures and methods for artificial neural networks so that they can learn and perform tasks from the realm of logic-based knowledge representation and reasoning has a long-standing tradition Besold et al. [2017]. This research area is sometimes referred to as "neuro-symbolic integration" (or "neural-symbolic integration") and there are at least two primary rationales that can be found in the literature on the subject. The first is the desire to arrive at systems that combine the robustness and trainability of artificial neural networks with the transparency and interpretability of knowledge-based systems, while at the same time making use of structured background knowledge. The second rationale is more prevalent in cognitive science and lies in addressing the fundamental gap between symbolic and subsymbolic representation and processing, based on the observation that humans perceive much of their own thinking, introspectively, as symbolic, while the physical structure of the brain gives rise to artificial neural networks as a mathematical and computational abstraction. Many of the earlier lines of research on neuro-symbolic integration, discussed primarily from a cognitive science perspective, can be found in Besold et al. [2017]. Of particular interest is the integration of deep learning with logics that are not propositional in nature, since propositional logic is of limited applicability to knowledge representation and reasoning tasks. In the wake of deep learning breakthroughs, fundamental issues around neuro-symbolic integration have recently received increased attention with some progress being made as new approaches emerge. In particular, there has been progress in developing neural networks that can learn to reason.

We study learning algorithms for the classical Markovian bandit problem with discount. We explain how to adapt PSRL [24] and UCRL2 [2] to exploit the problem structure. These variants are called MB-PSRL and MB-UCRL2. While the regret bound and runtime of vanilla implementations of PSRL and UCRL2 are exponential in the number of bandits, we show that the episodic regret of MB-PSRL and MB-UCRL2 is $\tilde O(S\sqrt{nK})$ where $K$ is the number of episodes, n is the number of bandits and S is the number of states of each bandit (the exact bound in $S$, $n$ and $K$ is given in the paper). Up to a factor $\sqrt S$, this matches the lower bound of $\Omega(\sqrt{SnK}$) that we also derive in the paper. MB-PSRL is also computationally efficient: its runtime is linear in the number of bandits. We further show that this linear runtime cannot be achieved by adapting classical non-Bayesian algorithms such as UCRL2 or UCBVI to Markovian bandit problems. Finally, we perform numerical experiments that confirm that MB-PSRL outperforms other existing algorithms in practice, both in terms of regret and of computation time.

Ensemble classifiers have been investigated by many in the artificial intelligence and machine learning community. Majority voting and weighted majority voting are two commonly used combination schemes in ensemble learning. However, understanding of them is incomplete at best, with some properties even misunderstood. In this paper, we present a group of properties of these two schemes formally under a dataset-level geometric framework. Two key factors, every component base classifier's performance and dissimilarity between each pair of component classifiers are evaluated by the same metric - the Euclidean distance. Consequently, ensembling becomes a deterministic problem and the performance of an ensemble can be calculated directly by a formula. We prove several theorems of interest and explain their implications for ensembles. In particular, we compare and contrast the effect of the number of component classifiers on these two types of ensemble schemes. Empirical investigation is also conducted to verify the theoretical results when other metrics such as accuracy are used. We believe that the results from this paper are very useful for us to understand the fundamental properties of these two combination schemes and the principles of ensemble classifiers in general. The results are also helpful for us to investigate some issues in ensemble classifiers, such as ensemble performance prediction, selecting a small number of base classifiers to obtain efficient and effective ensembles.

Summarizing conversations via neural approaches has been gaining research traction lately, yet it is still challenging to obtain practical solutions. Examples of such challenges include unstructured information exchange in dialogues, informal interactions between speakers, and dynamic role changes of speakers as the dialogue evolves. Many of such challenges result in complex coreference links. Therefore, in this work, we investigate different approaches to explicitly incorporate coreference information in neural abstractive dialogue summarization models to tackle the aforementioned challenges. Experimental results show that the proposed approaches achieve state-of-the-art performance, implying it is useful to utilize coreference information in dialogue summarization. Evaluation results on factual correctness suggest such coreferenceaware models are better at tracing the information Figure 1: An example of dialogue summarization: The flow among interlocutors and associating original conversation (in grey) is abbreviated; the summary accurate status/actions with the corresponding generated by a baseline model is in blue; the interlocutors and person mentions.

Proposal of large-scale datasets has facilitated research on deep neural models for news summarization. Deep learning can also be potentially useful for spoken dialogue summarization, which can benefit a range of real-life scenarios including customer service management and medication tracking. To this end, we propose DialogSum, a large-scale labeled dialogue summarization dataset. We conduct empirical analysis on DialogSum using state-of-the-art neural summarizers. Experimental results show unique challenges in dialogue summarization, such as spoken terms, special discourse structures, coreferences and ellipsis, pragmatics and social common sense, which require specific representation learning technologies to better deal with.

Random features are a central technique for scalable learning algorithms based on kernel methods. A recent work has shown that an algorithm for machine learning by quantum computer, quantum machine learning (QML), can exponentially speed up sampling of optimized random features, even without imposing restrictive assumptions on sparsity and low-rankness of matrices that had limited applicability of conventional QML algorithms; this QML algorithm makes it possible to significantly reduce and provably minimize the required number of features for regression tasks. However, a major interest in the field of QML is how widely the advantages of quantum computation can be exploited, not only in the regression tasks. We here construct a QML algorithm for a classification task accelerated by the optimized random features. We prove that the QML algorithm for sampling optimized random features, combined with stochastic gradient descent (SGD), can achieve state-of-the-art exponential convergence speed of reducing classification error in a classification task under a low-noise condition; at the same time, our algorithm with optimized random features can take advantage of the significant reduction of the required number of features so as to accelerate each iteration in the SGD and evaluation of the classifier obtained from our algorithm. These results discover a promising application of QML to significant acceleration of the leading classification algorithm based on kernel methods, without ruining its applicability to a practical class of data sets and the exponential error-convergence speed.

A variety of dimensionality reduction techniques have been applied for computations involving large matrices. The underlying matrix is randomly compressed into a smaller one, while approximately retaining many of its original properties. As a result, much of the expensive computation can be performed on the small matrix. The sketching of positive semidefinite (PSD) matrices is well understood, but there are many applications where the related matrices are not PSD, including Hessian matrices in non-convex optimization and covariance matrices in regression applications involving complex numbers. In this paper, we present novel dimensionality reduction methods for non-PSD matrices, as well as their ``square-roots", which involve matrices with complex entries. We show how these techniques can be used for multiple downstream tasks. In particular, we show how to use the proposed matrix sketching techniques for both convex and non-convex optimization, $\ell_p$-regression for every $1 \leq p \leq \infty$, and vector-matrix-vector queries.

Bengaluru: Global professional services company Accenture will acquire umlaut, an engineering consulting and services firm headquartered in Aachen, Germany for an undisclosed amount. The acquisition will scale Accenture's deep engineering capabilities to help companies use digital technologies like cloud, artificial intelligence, and 5G to transform how they design, engineer and manufacture their products as well as embed sustainability. The acquisition of umlaut will add more than 4,200 industry-leading engineers and consultants across 17 countries to Accenture's Industry X services, and expand the company's capabilities across a range of industries, including automotive, aerospace & defense, telecommunications, energy and utilities, Accenture said in a statement. Industry X combines Accenture's powerful data and digital capabilities with deep engineering expertise to offer clients the broadest suite of services for digitizing their engineering functions, factory floors and plant operations, improving productivity, speeding up the transformation of hardware into software-enabled products, and allowing for faster and more flexible product development. "We predicted that digital would ultimately be applied at scale to the core of a company's business - the design, engineering and manufacturing of their products. And, for nearly a decade Accenture has been building the unique capabilities and ecosystem partnerships to combine the power of digital with traditional engineering services," said Julie Sweet, chief executive officer, Accenture.

Last week, Google dropped a set of updates coming to Pixel phones and it's following up that news today with features heading to the broader Android ecosystem. This lot of new features will arrive mostly today or this week, and they span things like Messages, Emoji, Assistant, Android Auto and Voice Access. Of these, the one that will probably be the most useful in our day-to-day interactions with our phones is the new ability to star content in the Messages app. This is like pinning a message in Slack or Telegram -- after you tap and hold a message and star it, you can easily find it later by going to the Starred section in the app. Google said starred messages "will start to roll out more broadly over the coming weeks."

The demand for data science professionals was huge in 2020, and it is only growing in 2021. While industry giants have embraced the capabilities of data science, small and medium-sized businesses have started to leverage the power of data science to improve their business processes. Owing to digital transformation, data science practices help businesses make intelligent and data-backed smart decisions, formulate strategies to make better products and solutions, manage large amounts of data efficiently to get valuable insights and predict outcomes. To utilize most of these features to increase ROI, organizations are rapidly hiring data science professionals. If you are a data scientist or analyst, check out these hottest job openings from companies around the globe and look for your next challenge.