Oceania
The Self-Driving Car: Crossroads at the Bleeding Edge of Artificial Intelligence and Law
McLachlan, Scott, Kyrimi, Evangelia, Dube, Kudakwashe, Fenton, Norman, Schafer, Burkhard
Artificial intelligence (AI) features are increasingly being embedded in cars and are central to the operation of self-driving cars (SDC). There is little or no effort expended towards understanding and assessing the broad legal and regulatory impact of the decisions made by AI in cars. A comprehensive literature review was conducted to determine the perceived barriers, benefits and facilitating factors of SDC in order to help us understand the suitability and limitations of existing and proposed law and regulation. (1) existing and proposed laws are largely based on claimed benefits of SDV that are still mostly speculative and untested; (2) while publicly presented as issues of assigning blame and identifying who pays where the SDC is involved in an accident, the barriers broadly intersect with almost every area of society, laws and regulations; and (3) new law and regulation are most frequently identified as the primary factor for enabling SDC. Research on assessing the impact of AI in SDC needs to be broadened beyond negligence and liability to encompass barriers, benefits and facilitating factors identified in this paper. Results of this paper are significant in that they point to the need for deeper comprehension of the broad impact of all existing law and regulations on the introduction of SDC technology, with a focus on identifying only those areas truly requiring ongoing legislative attention.
Causal Inference Using Tractable Circuits
The aim of this paper is to discuss a recent result which shows that probabilistic inference in the presence of (unknown) causal mechanisms can be tractable for models that have traditionally been viewed as intractable. This result was reported recently in [15] to facilitate model-based supervised learning but it can be interpreted in a causality context as follows. One can compile a non-parametric causal graph into an arithmetic circuit that supports inference in time linear in the circuit size. The circuit is also non-parametric so it can be used to estimate parameters from data and to further reason (in linear time) about the causal graph parametrized by these estimates. Moreover, the circuit size can sometimes be bounded even when the treewidth of the causal graph is not, leading to tractable inference on models that have been deemed intractable previously. This has been enabled by a new technique that can exploit causal mechanisms computationally but without needing to know their identities (the classical setup in causal inference). Our goal is to provide a causality-oriented exposure to these new results and to speculate on how they may potentially contribute to more scalable and versatile causal inference.
SFMGNet: A Physics-based Neural Network To Predict Pedestrian Trajectories
Hossain, Sakif, Johora, Fatema T., Müller, Jörg P., Hartmann, Sven, Reinhardt, Andreas
Autonomous robots and vehicles are expected to soon become an integral part of our environment. Unsatisfactory issues regarding interaction with existing road users, performance in mixed-traffic areas and lack of interpretable behavior remain key obstacles. To address these, we present a physics-based neural network, based on a hybrid approach combining a social force model extended by group force (SFMG) with Multi-Layer Perceptron (MLP) to predict pedestrian trajectories considering its interaction with static obstacles, other pedestrians and pedestrian groups. We quantitatively and qualitatively evaluate the model with respect to realistic prediction, prediction performance and prediction "interpretability". Initial results suggest, the model even when solely trained on a synthetic dataset, can predict realistic and interpretable trajectories with better than state-of-the-art accuracy.
DIGITAL NATIVE #000001 - Digital Native Collection
Duran Duran Connects Trees to Their NFTs As Part of Initiative To Start New Micro Forests Around the World Living Trees Traceable on the Blockchain In yet another world-first, legendary British rock band, Duran Duran, has this week announced a unique project that will connect NFTs to newly-planted, native trees in New Zealand as part of an initiative to start new micro forests around the world. Duran Duran will kick-off this ambitious initiative by gifting the digital owners of the existing "INVISIBLE" NFT collection, which was released last year in support of the band's 15th studio album: FUTURE PAST. Each of the 100 people who purchased one of the "INVISIBLE" NFTs will receive a brand-new eco-friendly NFT featuring a themed artwork designed by Huxley, the AI artist with whom the band collaborated on their "INVISIBLE" music video and NFT artworks. Along with the NFT, a living tree will be planted in Jardine Park, Queenstown, New Zealand, in the person's name. Each new tree will be traceable on the blockchain via the corresponding NFT.
The state of AI ethics: The principles, the tools, the regulations
What do we talk about when we talk about AI ethics? Just like AI itself, definitions for AI ethics seem to abound. A definition that seems to have garnered some consensus is that AI ethics is a system of moral principles and techniques intended to inform the development and responsible use of artificial intelligence technologies. If this definition seems ambiguous to you, you aren't alone. There is an array of issues that people tend to associate with the term "AI ethics," ranging from bias in algorithms, to the asymmetrical or unlawful use of AI, environmental impact of AI technology and national and international policies around it.
Using Reviews to Create a Recommender System That Works
If you have ever bought a product online and marveled at the inanity and non-applicability of the'related items' that haunt the buying and after-sales process, you already understand that popular and mainstream recommender systems tend to fall short in terms of understanding the relationships between prospective purchases. If you buy a unlikely and infrequent item, such as an oven, recommendations for other ovens are likely to be superfluous, though the worst recommender systems fail to acknowledge this. In the 2000s, for example, TiVO's recommender system created an early controversy in this sector by reassigning the perceived sexuality of a user, who subsequently sought to're-masculinize' his user profile by selecting war movies – a crude approach to algorithm revision. Worse yet, you don't need to actually buy anything at (for instance) Amazon, or actually begin watching a movie whose description you're browsing at any major streaming platform, in order for information-starved recommender algorithms to start merrily down the wrong path; searches, dwells and clicks into the'details' pages are enough, and this scant (and probably incorrect) information is likely to be perpetuated across future browsing sessions at the platform. Sometimes it's possible to intervene: Netflix provides a'thumbs up/down' system which should in theory help its machine learning algorithms remove certain embedded concepts and words from your recommendations profile (though its efficacy has been questioned, and it remains much easier to evolve a personalized recommender algorithm from scratch than it is to remove undesired ontologies), while Amazon lets you remove titles from your customer history, which should downgrade any unwelcome domains that infiltrated your recommendations.
Fixed-Point Code Synthesis For Neural Networks
Benmaghnia, Hanane, Martel, Matthieu, Seladji, Yassamine
Over the last few years, neural networks have started penetrating safety critical systems to take decisions in robots, rockets, autonomous driving car, etc. A problem is that these critical systems often have limited computing resources. Often, they use the fixed-point arithmetic for its many advantages (rapidity, compatibility with small memory devices.) In this article, a new technique is introduced to tune the formats (precision) of already trained neural networks using fixed-point arithmetic, which can be implemented using integer operations only. The new optimized neural network computes the output with fixed-point numbers without modifying the accuracy up to a threshold fixed by the user. A fixed-point code is synthesized for the new optimized neural network ensuring the respect of the threshold for any input vector belonging the range [xmin, xmax] determined during the analysis. From a technical point of view, we do a preliminary analysis of our floating neural network to determine the worst cases, then we generate a system of linear constraints among integer variables that we can solve by linear programming. The solution of this system is the new fixed-point format of each neuron. The experimental results obtained show the efficiency of our method which can ensure that the new fixed-point neural network has the same behavior as the initial floating-point neural network.
Equivariant Filter Design for Inertial Navigation Systems with Input Measurement Biases
Fornasier, Alessandro, Ng, Yonhon, Mahony, Robert, Weiss, Stephan
Inertial Navigation Systems (INS) are a key technology for autonomous vehicles applications. Recent advances in estimation and filter design for the INS problem have exploited geometry and symmetry to overcome limitations of the classical Extended Kalman Filter (EKF) approach that formed the mainstay of INS systems since the mid-twentieth century. The industry standard INS filter, the Multiplicative Extended Kalman Filter (MEKF), uses a geometric construction for attitude estimation coupled with classical Euclidean construction for position, velocity and bias estimation. The recent Invariant Extended Kalman Filter (IEKF) provides a geometric framework for the full navigation states, integrating attitude, position and velocity, but still uses the classical Euclidean construction to model the bias states. In this paper, we use the recently proposed Equivariant Filter (EqF) framework to derive a novel observer for biased inertial-based navigation in a fully geometric framework. The introduction of virtual velocity inputs with associated virtual bias leads to a full equivariant symmetry on the augmented system. The resulting filter performance is evaluated with both simulated and real-world data, and demonstrates increased robustness to a wide range of erroneous initial conditions, and improved accuracy when compared with the industry standard Multiplicative EKF (MEKF) approach.
Towards Training Reproducible Deep Learning Models
Chen, Boyuan, Wen, Mingzhi, Shi, Yong, Lin, Dayi, Rajbahadur, Gopi Krishnan, Ming, Zhen, Jiang, null
Reproducibility is an increasing concern in Artificial Intelligence (AI), particularly in the area of Deep Learning (DL). Being able to reproduce DL models is crucial for AI-based systems, as it is closely tied to various tasks like training, testing, debugging, and auditing. However, DL models are challenging to be reproduced due to issues like randomness in the software (e.g., DL algorithms) and non-determinism in the hardware (e.g., GPU). There are various practices to mitigate some of the aforementioned issues. However, many of them are either too intrusive or can only work for a specific usage context. In this paper, we propose a systematic approach to training reproducible DL models. Our approach includes three main parts: (1) a set of general criteria to thoroughly evaluate the reproducibility of DL models for two different domains, (2) a unified framework which leverages a record-and-replay technique to mitigate software-related randomness and a profile-and-patch technique to control hardware-related non-determinism, and (3) a reproducibility guideline which explains the rationales and the mitigation strategies on conducting a reproducible training process for DL models. Case study results show our approach can successfully reproduce six open source and one commercial DL models.
A Conditional Perspective on the Logic of Iterated Belief Contraction
Sauerwald, Kai, Kern-Isberner, Gabriele, Beierle, Christoph
In this article, we consider iteration principles for contraction, with the goal of identifying properties for contractions that respect conditional beliefs. Therefore, we investigate and evaluate four groups of iteration principles for contraction which consider the dynamics of conditional beliefs. For all these principles, we provide semantic characterization theorems and provide formulations by postulates which highlight how the change of beliefs and of conditional beliefs is constrained, whenever that is possible. The first group is similar to the syntactic Darwiche-Pearl postulates. As a second group, we consider semantic postulates for iteration of contraction by Chopra, Ghose, Meyer and Wong, and by Konieczny and Pino P\'erez, respectively, and we provide novel syntactic counterparts. Third, we propose a contraction analogue of the independence condition by Jin and Thielscher. For the fourth group, we consider natural and moderate contraction by Nayak. Methodically, we make use of conditionals for contractions, so-called contractionals and furthermore, we propose and employ the novel notion of $ \alpha $-equivalence for formulating some of the new postulates.