Oceania
Dynamic Simplex: Balancing Safety and Performance in Autonomous Cyber Physical Systems
Luo, Baiting, Ramakrishna, Shreyas, Pettet, Ava, Kuhn, Christopher, Karsai, Gabor, Mukhopadhyay, Ayan
Learning Enabled Components (LEC) have greatly assisted cyber-physical systems in achieving higher levels of autonomy. However, LEC's susceptibility to dynamic and uncertain operating conditions is a critical challenge for the safety of these systems. Redundant controller architectures have been widely adopted for safety assurance in such contexts. These architectures augment LEC "performant" controllers that are difficult to verify with "safety" controllers and the decision logic to switch between them. While these architectures ensure safety, we point out two limitations. First, they are trained offline to learn a conservative policy of always selecting a controller that maintains the system's safety, which limits the system's adaptability to dynamic and non-stationary environments. Second, they do not support reverse switching from the safety controller to the performant controller, even when the threat to safety is no longer present. To address these limitations, we propose a dynamic simplex strategy with an online controller switching logic that allows two-way switching. We consider switching as a sequential decision-making problem and model it as a semi-Markov decision process. We leverage a combination of a myopic selector using surrogate models (for the forward switch) and a non-myopic planner (for the reverse switch) to balance safety and performance. We evaluate this approach using an autonomous vehicle case study in the CARLA simulator using different driving conditions, locations, and component failures. We show that the proposed approach results in fewer collisions and higher performance than state-of-the-art alternatives.
From retail to transport: how AI is changing every corner of the economy
The high profile race to enhance their search products has underscored the importance of artificial intelligence to Google and Microsoft – and the rest of the economy, too. Two of the world's largest tech companies announced plans for AI-enhanced search this month, ratcheting up a tussle for supremacy in the artificial intelligence space. However, the debut of Google's new chatbot, Bard, was scuppered when an error appeared, knocking $163bn (£137bn) off the parent company Alphabet's share price. The stock's plunge showed how crucial investors think AI could be to Google's future. However, the increasing prominence of AI has implications for every corner of the economy.
ChatGPT (Feb 13 Version) is a Chinese Room
ChatGPT has gained both positive and negative publicity after reports suggesting that it is able to pass various professional and licensing examinations. This suggests that ChatGPT may pass Turing Test in the near future. However, a computer program that passing Turing Test can either mean that it is a Chinese Room or artificially conscious. Hence, the question of whether the current state of ChatGPT is more of a Chinese Room or approaching artificial consciousness remains. Here, I demonstrate that the current version of ChatGPT (Feb 13 version) is a Chinese Room. Despite potential evidence of cognitive connections, ChatGPT exhibits critical errors in causal reasoning. At the same time, I demonstrate that ChatGPT can generate all possible categorical responses to the same question and response with erroneous examples; thus, questioning its utility as a learning tool. I also show that ChatGPT is capable of artificial hallucination, which is defined as generating confidently wrong replies. It is likely that errors in causal reasoning leads to hallucinations. More critically, ChatGPT generates false references to mimic real publications. Therefore, its utility is cautioned.
Distributed Planning with Asynchronous Execution with Local Navigation for Multi-agent Pickup and Delivery Problem
Miyashita, Yuki, Yamauchi, Tomoki, Sugawara, Toshiharu
We propose a distributed planning method with asynchronous execution for multi-agent pickup and delivery (MAPD) problems for environments with occasional delays in agents' activities and flexible endpoints. MAPD is a crucial problem framework with many applications; however, most existing studies assume ideal agent behaviors and environments, such as a fixed speed of agents, synchronized movements, and a well-designed environment with many short detours for multiple agents to perform tasks easily. However, such an environment is often infeasible; for example, the moving speed of agents may be affected by weather and floor conditions and is often prone to delays. The proposed method can relax some infeasible conditions to apply MAPD in more realistic environments by allowing fluctuated speed in agents' actions and flexible working locations (endpoints). Our experiments showed that our method enables agents to perform MAPD in such an environment efficiently, compared to the baseline methods. We also analyzed the behaviors of agents using our method and discuss the limitations.
La veille de la cybersécurité
Artificial intelligence (AI) offers a new way to track the insect pollinators essential to farming. In a new study, we installed miniature digital cameras and computers inside a greenhouse at a strawberry farm in Victoria, Australia, to track bees and other insects as they flew from plant to plant pollinating flowers. Using custom AI software, we analysed several days' video footage from our system to build a picture of pollination behaviour over a wide area. In the same way that monitoring roads can help traffic run smoothly, our system promises to make pollination more efficient. This will enable better use of resources and increased food production.
Lebanon, Slovenia, UAE lead interest in AI Crypto
Lebanon, Slovenia, and the United Arab Emirates (UAE) are the top three countries that are most interested in Artificial Intelligence (AI) crypto, according to CoinGecko's recent report. Countries with major economic problems, like Nigeria, Sri Lanka, and Pakistan, have also ranked higher in the charts -- while the U.S. was placed 33rd, the CoinGecko report stated. The report measured the search popularity of 14 English search terms related to AI crypto between Nov. 30, 2022, and Feb. 16. A 100 indicates maximum popularity, while 50 indicates half -- zero would mean there was not enough data to examine. Lebanon scored 100 on almost all 14 search terms -- collecting 1,200 points and ranking first on the list.
Can 'we the people' keep AI in check? • TechCrunch
Technologist and researcher Aviv Ovadya isn't sure that generative AI can be governed, but he thinks the most plausible means of keeping it in check might just be entrusting those who will be impacted by AI to collectively decide on the ways to curb it. That means you; it means me. It's the power of large networks of individuals to problem solve faster and more equitably than a small group of individuals might do alone (including, say, in Washington). In Taiwan, for example, civic-minded hackers in 2015 formed a platform -- "virtual Taiwan" -- that "brings together representatives from the public, private and social sectors to debate policy solutions to problems primarily related to the digital economy," as explained in 2019 by Taiwan's digital minister, Audrey Tang in the New York Times. Since then, vTaiwan, as it's known, has tackled dozens of issues by "relying on a mix of online debate and face-to-face discussions with stakeholders," Tang wrote at the time.
Scaling Dimension
Ganter, Bernhard, Hanika, Tom, Hirth, Johannes
Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic definitions are in flux. Our contribution was triggered by the study of concept lattices for tree classifiers and the scaling methods used there. We extend some basic notions, give precise mathematical definitions for them and introduce the concept of scaling dimension. In addition to a detailed discussion of its properties, including an example, we show theoretical bounds related to the order dimension of concept lattices. We also study special subclasses, such as the ordinal and the interordinal scaling dimensions, and show for them first results and examples.
Wizard of Errors: Introducing and Evaluating Machine Learning Errors in Wizard of Oz Studies
When designing Machine Learning (ML) enabled solutions, designers often need to simulate ML behavior through the Wizard of Oz (WoZ) approach to test the user experience before the ML model is available. Although reproducing ML errors is essential for having a good representation, they are rarely considered. We introduce Wizard of Errors (WoE), a tool for conducting WoZ studies on ML-enabled solutions that allows simulating ML errors during user experience assessment. We explored how this system can be used to simulate the behavior of a computer vision model. We tested WoE with design students to determine the importance of considering ML errors in design, the relevance of using descriptive error types instead of confusion matrix, and the suitability of manual error control in WoZ studies. Our work identifies several challenges, which prevent realistic error representation by designers in such studies. We discuss the implications of these findings for design.
On the Sparse DAG Structure Learning Based on Adaptive Lasso
Xu, Danru, Gao, Erdun, Huang, Wei, Wang, Menghan, Song, Andy, Gong, Mingming
Learning the underlying Bayesian Networks (BNs), represented by directed acyclic graphs (DAGs), of the concerned events from purely-observational data is a crucial part of evidential reasoning. This task remains challenging due to the large and discrete search space. A recent flurry of developments followed NOTEARS[1] recast this combinatorial problem into a continuous optimization problem by leveraging an algebraic equality characterization of acyclicity. However, the continuous optimization methods suffer from obtaining non-spare graphs after the numerical optimization, which leads to the inflexibility to rule out the potentially cycle-inducing edges or false discovery edges with small values. To address this issue, in this paper, we develop a completely data-driven DAG structure learning method without a predefined value to post-threshold small values. We name our method NOTEARS with adaptive Lasso (NOTEARS-AL), which is achieved by applying the adaptive penalty method to ensure the sparsity of the estimated DAG. Moreover, we show that NOTEARS-AL also inherits the oracle properties under some specific conditions. Extensive experiments on both synthetic and a real-world dataset demonstrate that our method consistently outperforms NOTEARS.