Harm wrought by AI tends to fall most heavily on marginalized communities. In the United States, algorithmic harm may lead to the false arrest of Black men, disproportionately reject female job candidates, or target people who identify as queer. In India, those impacts can further impact marginalized populations like Muslim minority groups or people oppressed by the caste system. And algorithmic fairness frameworks developed in the West may not transfer directly to people in India or other countries in the Global South, where algorithmic fairness requires understanding of local social structures and power dynamics and a legacy of colonialism. That's the argument behind "De-centering Algorithmic Power: Towards Algorithmic Fairness in India," a paper accepted for publication at the Fairness, Accountability, and Transparency (FAccT) conference, which begins this week. Other works that seek to move beyond a Western-centric focus include Shinto or Buddhism-based frameworks for AI design and an approach to AI governance based on the African philosophy of Ubuntu.

Farmers Edge Inc, an AI startup to help growers increase crop yields, plans to go public on Canada's largest Toronto Stock Exchange under the ticker symbol "FDGE". The company seeks to raise CAD 100 million (approximately USD 79 million). Founded in 2005, Farmers Edge uses AI technology to collect and analyze local weather, soil moisture and satellite data to help farmers improve crop efficiency and yield. Besides the Canadian Prairie, the company currently hosts offices in the United States, Australia, Russia, Brazil and Ukraine. As of the end of 2020, more than 3,000 growers have used the Farmers Edge products, covering more than 23 million acres of land in six countries.

The information presented in Lega-Tech Artificial Intelligence Market Report 2021 includes qualitative and quantitative insights. Under the qualitative analysis part, manufacturing base, raw materials data, Lega-Tech Artificial Intelligence status, trends, SWOT analysis, PESTEL Analysis, distribution channels, driving factors, and a competitive structure is presented. Under the qualitative analysis part, market value/volume, production analysis, consumption data, import-export data, or each region and country are explained. Also, industry size by Lega-Tech Artificial Intelligence type, application, demand and supply scenario, and economic status are explained. Also, comprehensive information on the latest product development, growth opportunities, industry strategies, cost structures, and recent policies are enlightened in the Lega-Tech Artificial Intelligence report.

In many real-world scenarios, the time it takes for a mobile agent, e.g., a robot, to move from one location to another may vary due to exogenous events and be difficult to predict accurately. Planning in such scenarios is challenging, especially in the context of Multi-Agent Pathfinding (MAPF), where the goal is to find paths to multiple agents and temporal coordination is necessary to avoid collisions. In this work, we consider a MAPF problem with this form of time uncertainty, where we are only given upper and lower bounds on the time it takes each agent to move. The objective is to find a safe solution, which is a solution that can be executed by all agents and is guaranteed to avoid collisions. We propose two complete and optimal algorithms for finding safe solutions based on well-known MAPF algorithms, namely, A* with Operator Decomposition (A* + OD) and Conflict-Based Search (CBS). Experimentally, we observe that on several standard MAPF grids the CBS-based algorithm performs better. We also explore the option of online replanning in this context, i.e., modifying the agents' plans during execution, to reduce the overall execution cost. We consider two online settings: (a) when an agent can sense the current time and its current location, and (b) when the agents can also communicate seamlessly during execution. For each setting, we propose a replanning algorithm and analyze its behavior theoretically and empirically. Our experimental evaluation confirms that indeed online replanning in both settings can significantly reduce solution cost.

Deep learning has been the engine powering many successes of data science. However, the deep neural network (DNN), as the basic model of deep learning, is often excessively over-parameterized, causing many difficulties in training, prediction and interpretation. We propose a frequentist-like method for learning sparse DNNs and justify its consistency under the Bayesian framework: the proposed method could learn a sparse DNN with at most $O(n/\log(n))$ connections and nice theoretical guarantees such as posterior consistency, variable selection consistency and asymptotically optimal generalization bounds. In particular, we establish posterior consistency for the sparse DNN with a mixture Gaussian prior, show that the structure of the sparse DNN can be consistently determined using a Laplace approximation-based marginal posterior inclusion probability approach, and use Bayesian evidence to elicit sparse DNNs learned by an optimization method such as stochastic gradient descent in multiple runs with different initializations. The proposed method is computationally more efficient than standard Bayesian methods for large-scale sparse DNNs. The numerical results indicate that the proposed method can perform very well for large-scale network compression and high-dimensional nonlinear variable selection, both advancing interpretable machine learning.

As the number of fatal crashes involving truck drivers increases, one company believes artificial intelligence (AI) could help. It may look like a standard mini-tanker, but a small camera in the truck's cab could be a lifesaver. The AI device scans the driver's eyes to detect signs of fatigue and distraction, and if their eye lids close for one and a half seconds, an alarm sounds and the driver's seat will vibrate. A camera also records the moment. "What this technology is about is keeping the driver focussed on the road, and alerting them for any reason if their attention is drawn away," said Charles Dawson, the chief executive of Autosense.

A few days before racing in the 36th match for the America's Cup, the covers have been lifted on the testing and development process, using Artificial Intelligence employed by Emirates Team New Zealand, and developed in conjunction with one of worlds most prestigious consulting firms McKinsey & Company. While the team's use of simulators has been widely discussed, and one is on display at the America's Cup Village. The team has been working with McKinsey subsidiary Quantum Black to develop a "digital twin" of the team's AC75 that used a process of machine learning to perform many more iterations of a sailing situation than was possible using human crew, and to come up with options that were faster than the crew was currently achieving. AI Bots work particularly well when there is large volume of data. The Bot is programmed to self-learn from its own analysis.

We present a continual learning approach for generative adversarial networks (GANs), by designing and leveraging parameter-efficient feature map transformations. Our approach is based on learning a set of global and task-specific parameters. The global parameters are fixed across tasks whereas the task specific parameters act as local adapters for each task, and help in efficiently transforming the previous task's feature map to the new task's feature map. Moreover, we propose an element-wise residual bias in the transformed feature space which highly stabilizes GAN training. In contrast to the recent approaches for continual GANs, we do not rely on memory replay, regularization towards previous tasks' parameters, or expensive weight transformations. Through extensive experiments on challenging and diverse datasets, we show that the feature-map transformation based approach outperforms state-of-the-art continual GANs methods, with substantially fewer parameters, and also generates high-quality samples that can be used in generative replay based continual learning of discriminative tasks.

There has been a growing interest in model-agnostic methods that can make deep learning models more transparent and explainable to a user. Some researchers recently argued that for a machine to achieve a certain degree of human-level explainability, this machine needs to provide human causally understandable explanations, also known as causability. A specific class of algorithms that have the potential to provide causability are counterfactuals. This paper presents an in-depth systematic review of the diverse existing body of literature on counterfactuals and causability for explainable artificial intelligence. We performed an LDA topic modelling analysis under a PRISMA framework to find the most relevant literature articles. This analysis resulted in a novel taxonomy that considers the grounding theories of the surveyed algorithms, together with their underlying properties and applications in real-world data. This research suggests that current model-agnostic counterfactual algorithms for explainable AI are not grounded on a causal theoretical formalism and, consequently, cannot promote causability to a human decision-maker. Our findings suggest that the explanations derived from major algorithms in the literature provide spurious correlations rather than cause/effects relationships, leading to sub-optimal, erroneous or even biased explanations. This paper also advances the literature with new directions and challenges on promoting causability in model-agnostic approaches for explainable artificial intelligence.

Consensus maximisation (MaxCon), which is widely used for robust fitting in computer vision, aims to find the largest subset of data that fits the model within some tolerance level. In this paper, we outline the connection between MaxCon problem and the abstract problem of finding the maximum upper zero of a Monotone Boolean Function (MBF) defined over the Boolean Cube. Then, we link the concept of influences (in a MBF) to the concept of outlier (in MaxCon) and show that influences of points belonging to the largest structure in data would generally be smaller under certain conditions. Based on this observation, we present an iterative algorithm to perform consensus maximisation. Results for both synthetic and real visual data experiments show that the MBF based algorithm is capable of generating a near optimal solution relatively quickly. This is particularly important where there are large number of outliers (gross or pseudo) in the observed data.