London, Oct 24 (IANS) Using Artificial intelligence (AI) or machine learning technology, a team of researchers has predicted outcomes in judicial decisions at the European Court of Human Rights (EctHR) with 79 per cent accuracy. The AI method, developed by researchers from University College London (UCL), University of Sheffield and US-based University of Pennsylvania is the first to predict the outcomes of a major international court by automatically analysing case text using a machine learning algorithm. "We don't see AI replacing judges or lawyers but we think they will find it useful for rapidly identifying patterns in cases that lead to certain outcomes," said Nikolaos Aletras, who led the study at UCL's computer science department. "It could also be a valuable tool for highlighting which cases are most likely to be violations of the European Convention on Human Rights," Aletras added. In developing the method, the team found that judgements by the ECtHR are highly correlated to non-legal facts rather than directly legal arguments, suggesting that judges of the Court are'realists' rather than'formalists'.

London: A computer "judge" using artificial intelligence has correctly predicted verdicts of the European Court of Human Rights with 79 per cent accuracy. Computer scientists devised a program that was able to weigh up legal evidence and moral questions of right and wrong. The algorithm scoured English language data sets for 584 cases relating to torture and degrading treatment, fair trials and privacy. In each case, the program analysed the information and arrived at its own judicial decision. In 79 per cent of cases, the artificial intelligence (AI) verdict matched the one that was delivered by the court.

I will update this article regularly. An old version can be found here and has many interesting links. All the material presented here is not in the old version. This article is divided into 11 sections. A laptop is the ideal device.

Machine learning enables computers to learn from large amounts of data without being explicitly programmed to do so. We can already see how machine learning gives rise to new intelligent applications, from self-driving cars to intelligent assistants on our smartphones. Increasingly, businesses recognize the importance of using machine learning to transform their data assets into business value. However, many companies are unsure how machine learning can be applied to solve problems in an enterprise context. As the world's most relevant enterprise data is part of SAP's system and business network, SAP aspires to make all its enterprise solutions intelligent and help customers to leverage their data.

Machine learning techniques based on neural networks are achieving remarkable results in a wide variety of domains. Often, the training of models requires large, representative datasets, which may be crowdsourced and contain sensitive information. The models should not expose private information in these datasets. Addressing this goal, we develop new algorithmic techniques for learning and a refined analysis of privacy costs within the framework of differential privacy. Our implementation and experiments demonstrate that we can train deep neural networks with non-convex objectives, under a modest privacy budget, and at a manageable cost in software complexity, training efficiency, and model quality.

Vector representations of words have heralded a transformational approach to classical problems in NLP; the most popular example is word2vec. However, a single vector does not suffice to model the polysemous nature of many (frequent) words, i.e., words with multiple meanings. In this paper, we propose a three-fold approach for unsupervised polysemy modeling: (a) context representations, (b) sense induction and disambiguation and (c) lexeme (as a word and sense pair) representations. A key feature of our work is the finding that a sentence containing a target word is well represented by a low rank subspace, instead of a point in a vector space. We then show that the subspaces associated with a particular sense of the target word tend to intersect over a line (one-dimensional subspace), which we use to disambiguate senses using a clustering algorithm that harnesses the Grassmannian geometry of the representations. The disambiguation algorithm, which we call $K$-Grassmeans, leads to a procedure to label the different senses of the target word in the corpus -- yielding lexeme vector representations, all in an unsupervised manner starting from a large (Wikipedia) corpus in English. Apart from several prototypical target (word,sense) examples and a host of empirical studies to intuit and justify the various geometric representations, we validate our algorithms on standard sense induction and disambiguation datasets and present new state-of-the-art results.

Recidivism prediction instruments (RPI's) provide decision makers with an assessment of the likelihood that a criminal defendant will reoffend at a future point in time. While such instruments are gaining increasing popularity across the country, their use is attracting tremendous controversy. Much of the controversy concerns potential discriminatory bias in the risk assessments that are produced. This paper discusses a fairness criterion originating in the field of educational and psychological testing that has recently been applied to assess the fairness of recidivism prediction instruments. We demonstrate how adherence to the criterion may lead to considerable disparate impact when recidivism prevalence differs across groups.

We present a new algorithm, truncated variance reduction (TruVaR), that treats Bayesian optimization (BO) and level-set estimation (LSE) with Gaussian processes in a unified fashion. The algorithm greedily shrinks a sum of truncated variances within a set of potential maximizers (BO) or unclassified points (LSE), which is updated based on confidence bounds. TruVaR is effective in several important settings that are typically non-trivial to incorporate into myopic algorithms, including pointwise costs and heteroscedastic noise. We provide a general theoretical guarantee for TruVaR covering these aspects, and use it to recover and strengthen existing results on BO and LSE. Moreover, we provide a new result for a setting where one can select from a number of noise levels having associated costs. We demonstrate the effectiveness of the algorithm on both synthetic and real-world data sets.

Many statistical models can be simulated forwards but have intractable likelihoods. Approximate Bayesian Computation (ABC) methods are used to infer properties of these models from data. Traditionally these methods approximate the posterior over parameters by conditioning on data being inside an $\epsilon$-ball around the observed data, which is only correct in the limit $\epsilon\!\rightarrow\!0$. Monte Carlo methods can then draw samples from the approximate posterior to approximate predictions or error bars on parameters. These algorithms critically slow down as $\epsilon\!\rightarrow\!0$, and in practice draw samples from a broader distribution than the posterior. We propose a new approach to likelihood-free inference based on Bayesian conditional density estimation. Preliminary inferences based on limited simulation data are used to guide later simulations. In some cases, learning an accurate parametric representation of the entire true posterior distribution requires fewer model simulations than Monte Carlo ABC methods need to produce a single sample from an approximate posterior.

Most active learning theory is based on interacting with a Label oracle: An active learner observes unlabeled examples, each with a label that is initially hidden. The learner provides an unlabeled example to the oracle, and the oracle responds with the label. Using Label in an active learning algorithm is known to give (sometimes exponentially large) problem-dependent improvements in label complexity, even in the agnostic setting where no assumption is made about the underlying distribution [e.g., Balcan et al., 2006, Hanneke, 2007, Dasgupta et al., 2007, Hanneke, 2014]. A well-known deficiency of Label arises in the presence of rare classes in classification problems, frequently the case in practice [Attenberg and Provost, 2010, Simard et al., 2014]. Class imbalance may be so extreme that simply finding an example from the rare class can exhaust the labeling budget.