Oceania
Australian fintech Completes Major US Acquisition
Remitter, a fintech platform that improves bill payment rates by communicating to consumers digitally, has just finalised its acquisition of US-based Mercantile Adjustment Bureau, following a successful pre-IPO USD $12m cap raise led by Canaccord Genuity. The raise was cornerstoned by Allium Capital and Casey Capital. Remitter is a white-label communications platform, founded in Australia, which uses AI to optimise customer engagement and enhance the recovery of accounts receivables. Currently many organisations face challenges in collecting bill payments on time, with 46% of customers paying late according to Aite Group research. Remitter entered the US market in 2020, following two years of development including compliance across states and territories and collaboration with clients to ensure an optimal feature set. "Entering the US market involved ensuring the Remitter platform was compliant in all 52 states, each with its own different laws and regulations around payments.
Call for nominations: ACM SIGAI Autonomous Agents Research Award 2022
Nominations are solicited for the 2022 ACM SIGAI Autonomous Agents Research Award. This award is made for excellence in research in the area of autonomous agents. It is intended to recognize researchers in autonomous agents whose current work is an important influence on the field. The award is an official ACM award, funded by an endowment created by ACM SIGAI from the proceeds of previous Autonomous Agents conferences. The recipient of the award will receive a monetary prize and a certificate, and will be invited to present a plenary talk at the AAMAS 2022 conference in Auckland, New Zealand.
Researchers Help Expand Mineral Exploration Using Machine Learning
Said Vladimir Puzyrev of Curtin Universitys Oil and Gas Innovation Centre and the School of Earth and Planetary Sciences, "This project is an important step towards adding value to existing digital geochemical datasets." Researchers at Australia's Curtin University and the Geological Survey of Western Australia are using deep learning to analyze geochemical data as part of an effort to expand mineral exploration in the region. The Western Australia Mineral Exploration (WAMEX) database contains more than 50 million samples, making manual analysis cost prohibitive and time consuming. Curtin's Vladimir Puzyrev said, "The ultimate aim of this research project is to help identify new mineral deposits in Western Australia by analyzing big geochemical data using deep learning methods."
Making machine learning more useful to high-stakes decision makers
The U.S. Centers for Disease Control and Prevention estimates that one in seven children in the United States experienced abuse or neglect in the past year. Child protective services agencies around the nation receive a high number of reports each year (about 4.4 million in 2019) of alleged neglect or abuse. With so many cases, some agencies are implementing machine learning models to help child welfare specialists screen cases and determine which to recommend for further investigation. But these models don't do any good if the humans they are intended to help don't understand or trust their outputs. Researchers at MIT and elsewhere launched a research project to identify and tackle machine learning usability challenges in child welfare screening.
Making machine learning more useful to high-stakes decision makers
The U.S. Centers for Disease Control and Prevention estimates that one in seven children in the United States experienced abuse or neglect in the past year. Child protective services agencies around the nation receive a high number of reports each year (about 4.4 million in 2019) of alleged neglect or abuse. With so many cases, some agencies are implementing machine learning models to help child welfare specialists screen cases and determine which to recommend for further investigation. But these models don't do any good if the humans they are intended to help don't understand or trust their outputs. Researchers at MIT and elsewhere launched a research project to identify and tackle machine learning usability challenges in child welfare screening.
AI-powered glaucoma screening test delivers rapid results
A new rapid screening test for glaucoma could help advance early detection of the disease, a leading cause of irreversible blindness. Developed by a research team of engineers and ophthalmologists led by RMIT University in Melbourne, Australia, the test uses infrared sensors to monitor eye movement and can produce accurate results within seconds. About 80 million people worldwide have glaucoma, with more than 111 million expected to be living with the disease by 2040. The loss of sight is usually gradual and 50% of people with glaucoma do not know they have it. Currently, glaucoma is diagnosed through a 30-minute eye pressure test delivered by an ophthalmologist.
A New Algorithm based on Extent Bit-array for Computing Formal Concepts
Zhou, Jianqin, Yang, Sichun, Wang, Xifeng, Liu, Wanquan
The emergence of Formal Concept Analysis (FCA) as a data analysis technique has increased the need for developing algorithms which can compute formal concepts quickly. The current efficient algorithms for FCA are variants of the Close-By-One (CbO) algorithm, such as In-Close2, In-Close3 and In-Close4, which are all based on horizontal storage of contexts. In this paper, based on algorithm In-Close4, a new algorithm based on the vertical storage of contexts, called In-Close5, is proposed, which can significantly reduce both the time complexity and space complexity of algorithm In-Close4. Technically, the new algorithm stores both context and extent of a concept as a vertical bit-array, while within In-Close4 algorithm the context is stored only as a horizontal bit-array, which is very slow in finding the intersection of two extent sets. Experimental results demonstrate that the proposed algorithm is much more effective than In-Close4 algorithm, and it also has a broader scope of applicability in computing formal concept in which one can solve the problems that cannot be solved by the In-Close4 algorithm.
Cycle-Balanced Representation Learning For Counterfactual Inference
Zhou, Guanglin, Yao, Lina, Xu, Xiwei, Wang, Chen, Zhu, Liming
With the widespread accumulation of observational data, researchers obtain a new direction to learn counterfactual effects in many domains (e.g., health care and computational advertising) without Randomized Controlled Trials(RCTs). However, observational data suffer from inherent missing counterfactual outcomes, and distribution discrepancy between treatment and control groups due to behaviour preference. Motivated by recent advances of representation learning in the field of domain adaptation, we propose a novel framework based on Cycle-Balanced REpresentation learning for counterfactual inference (CBRE), to solve above problems. Specifically, we realize a robust balanced representation for different groups using adversarial training, and meanwhile construct an information loop, such that preserve original data properties cyclically, which reduces information loss when transforming data into latent representation space.Experimental results on three real-world datasets demonstrate that CBRE matches/outperforms the state-of-the-art methods, and it has a great potential to be applied to counterfactual inference.
Accelerating Robotic Reinforcement Learning via Parameterized Action Primitives
Dalal, Murtaza, Pathak, Deepak, Salakhutdinov, Ruslan
Despite the potential of reinforcement learning (RL) for building general-purpose robotic systems, training RL agents to solve robotics tasks still remains challenging due to the difficulty of exploration in purely continuous action spaces. Addressing this problem is an active area of research with the majority of focus on improving RL methods via better optimization or more efficient exploration. An alternate but important component to consider improving is the interface of the RL algorithm with the robot. In this work, we manually specify a library of robot action primitives (RAPS), parameterized with arguments that are learned by an RL policy. These parameterized primitives are expressive, simple to implement, enable efficient exploration and can be transferred across robots, tasks and environments. We perform a thorough empirical study across challenging tasks in three distinct domains with image input and a sparse terminal reward. We find that our simple change to the action interface substantially improves both the learning efficiency and task performance irrespective of the underlying RL algorithm, significantly outperforming prior methods which learn skills from offline expert data.
Dynamic Visual Reasoning by Learning Differentiable Physics Models from Video and Language
Ding, Mingyu, Chen, Zhenfang, Du, Tao, Luo, Ping, Tenenbaum, Joshua B., Gan, Chuang
In this work, we propose a unified framework, called Visual Reasoning with Differ-entiable Physics (VRDP), that can jointly learn visual concepts and infer physics models of objects and their interactions from videos and language. This is achieved by seamlessly integrating three components: a visual perception module, a concept learner, and a differentiable physics engine. The visual perception module parses each video frame into object-centric trajectories and represents them as latent scene representations. The concept learner grounds visual concepts (e.g., color, shape, and material) from these object-centric representations based on the language, thus providing prior knowledge for the physics engine. The differentiable physics model, implemented as an impulse-based differentiable rigid-body simulator, performs differentiable physical simulation based on the grounded concepts to infer physical properties, such as mass, restitution, and velocity, by fitting the simulated trajectories into the video observations. Consequently, these learned concepts and physical models can explain what we have seen and imagine what is about to happen in future and counterfactual scenarios. Integrating differentiable physics into the dynamic reasoning framework offers several appealing benefits. More accurate dynamics prediction in learned physics models enables state-of-the-art performance on both synthetic and real-world benchmarks while still maintaining high transparency and interpretability; most notably, VRDP improves the accuracy of predictive and counterfactual questions by 4.5% and 11.5% compared to its best counterpart. VRDP is also highly data-efficient: physical parameters can be optimized from very few videos, and even a single video can be sufficient. Finally, with all physical parameters inferred, VRDP can quickly learn new concepts from a few examples.