Search

As one of the major causes of antimicrobial resistance, beta-lactamase develops rapidly among bacteria. Detection of beta-lactamase in an efficient and low-cost point-of-care testing (POCT) way is urgently needed. However, due to the volatile environmental factors, the quantitative measurement of current POCT is often inaccurate. Herein, we demonstrate an artificial intelligence (AI)-assisted mobile health system that consists of a paper-based beta-lactamase fluorogenic probe analytical device and a smartphone-based AI cloud. An ultrafast broad-spectrum fluorogenic probe (B1) that could respond to beta-lactamase within 20 s was first synthesized, and the detection limit was determined to be 0.13 nmol/L. Meanwhile, a three-dimensional microfluidic paper-based analytical device was fabricated for integration of B1. Also, a smartphone-based AI cloud was developed to correct errors automatically and output results intelligently. This smart system could calibrate the temperature and pH in the beta-lactamase level detection in complex samples and mice infected with various bacteria, which shows the problem-solving ability in interdisciplinary research, and demonstrates potential clinical benefits., Funding Agencies|National Key R&D Program of China [2020YFA0709900]; National Natural Science Foundation of China [62288102, 22077101, 52073230]; Joint Research Funds of Department of Science & Technology of Shaanxi Province; Northwestern~Polytechnical University [2020GXLH-Z-008, 2020GXLH-Z-013]; Shaanxi Provincial Science Fund for Distinguished Young Scholars [2023-JC-JQ-32]; Key Research and Development Program of Shaanxi [2020ZDLGY13-04]; Fundamental Research Funds for the Central Universities and Innovation Foundation for Doctorate Dissertation of Northwestern Polytechnical University [CX2021121]

As one of the major causes of antimicrobial resistance, beta-lactamase develops rapidly among bacteria. Detection of beta-lactamase in an efficient and low-cost point-of-care testing (POCT) way is urgently needed. However, due to the volatile environmental factors, the quantitative measurement of current POCT is often inaccurate. Herein, we demonstrate an artificial intelligence (AI)-assisted mobile health system that consists of a paper-based beta-lactamase fluorogenic probe analytical device and a smartphone-based AI cloud. An ultrafast broad-spectrum fluorogenic probe (B1) that could respond to beta-lactamase within 20 s was first synthesized, and the detection limit was determined to be 0.13 nmol/L. Meanwhile, a three-dimensional microfluidic paper-based analytical device was fabricated for integration of B1. Also, a smartphone-based AI cloud was developed to correct errors automatically and output results intelligently. This smart system could calibrate the temperature and pH in the beta-lactamase level detection in complex samples and mice infected with various bacteria, which shows the problem-solving ability in interdisciplinary research, and demonstrates potential clinical benefits., Funding Agencies|National Key R&D Program of China [2020YFA0709900]; National Natural Science Foundation of China [62288102, 22077101, 52073230]; Joint Research Funds of Department of Science & Technology of Shaanxi Province; Northwestern~Polytechnical University [2020GXLH-Z-008, 2020GXLH-Z-013]; Shaanxi Provincial Science Fund for Distinguished Young Scholars [2023-JC-JQ-32]; Key Research and Development Program of Shaanxi [2020ZDLGY13-04]; Fundamental Research Funds for the Central Universities and Innovation Foundation for Doctorate Dissertation of Northwestern Polytechnical University [CX2021121]

As one of the major causes of antimicrobial resistance, beta-lactamase develops rapidly among bacteria. Detection of beta-lactamase in an efficient and low-cost point-of-care testing (POCT) way is urgently needed. However, due to the volatile environmental factors, the quantitative measurement of current POCT is often inaccurate. Herein, we demonstrate an artificial intelligence (AI)-assisted mobile health system that consists of a paper-based beta-lactamase fluorogenic probe analytical device and a smartphone-based AI cloud. An ultrafast broad-spectrum fluorogenic probe (B1) that could respond to beta-lactamase within 20 s was first synthesized, and the detection limit was determined to be 0.13 nmol/L. Meanwhile, a three-dimensional microfluidic paper-based analytical device was fabricated for integration of B1. Also, a smartphone-based AI cloud was developed to correct errors automatically and output results intelligently. This smart system could calibrate the temperature and pH in the beta-lactamase level detection in complex samples and mice infected with various bacteria, which shows the problem-solving ability in interdisciplinary research, and demonstrates potential clinical benefits., Funding Agencies|National Key R&D Program of China [2020YFA0709900]; National Natural Science Foundation of China [62288102, 22077101, 52073230]; Joint Research Funds of Department of Science & Technology of Shaanxi Province; Northwestern~Polytechnical University [2020GXLH-Z-008, 2020GXLH-Z-013]; Shaanxi Provincial Science Fund for Distinguished Young Scholars [2023-JC-JQ-32]; Key Research and Development Program of Shaanxi [2020ZDLGY13-04]; Fundamental Research Funds for the Central Universities and Innovation Foundation for Doctorate Dissertation of Northwestern Polytechnical University [CX2021121]

As one of the major causes of antimicrobial resistance, beta-lactamase develops rapidly among bacteria. Detection of beta-lactamase in an efficient and low-cost point-of-care testing (POCT) way is urgently needed. However, due to the volatile environmental factors, the quantitative measurement of current POCT is often inaccurate. Herein, we demonstrate an artificial intelligence (AI)-assisted mobile health system that consists of a paper-based beta-lactamase fluorogenic probe analytical device and a smartphone-based AI cloud. An ultrafast broad-spectrum fluorogenic probe (B1) that could respond to beta-lactamase within 20 s was first synthesized, and the detection limit was determined to be 0.13 nmol/L. Meanwhile, a three-dimensional microfluidic paper-based analytical device was fabricated for integration of B1. Also, a smartphone-based AI cloud was developed to correct errors automatically and output results intelligently. This smart system could calibrate the temperature and pH in the beta-lactamase level detection in complex samples and mice infected with various bacteria, which shows the problem-solving ability in interdisciplinary research, and demonstrates potential clinical benefits., Funding Agencies|National Key R&D Program of China [2020YFA0709900]; National Natural Science Foundation of China [62288102, 22077101, 52073230]; Joint Research Funds of Department of Science & Technology of Shaanxi Province; Northwestern~Polytechnical University [2020GXLH-Z-008, 2020GXLH-Z-013]; Shaanxi Provincial Science Fund for Distinguished Young Scholars [2023-JC-JQ-32]; Key Research and Development Program of Shaanxi [2020ZDLGY13-04]; Fundamental Research Funds for the Central Universities and Innovation Foundation for Doctorate Dissertation of Northwestern Polytechnical University [CX2021121]

As one of the major causes of antimicrobial resistance, beta-lactamase develops rapidly among bacteria. Detection of beta-lactamase in an efficient and low-cost point-of-care testing (POCT) way is urgently needed. However, due to the volatile environmental factors, the quantitative measurement of current POCT is often inaccurate. Herein, we demonstrate an artificial intelligence (AI)-assisted mobile health system that consists of a paper-based beta-lactamase fluorogenic probe analytical device and a smartphone-based AI cloud. An ultrafast broad-spectrum fluorogenic probe (B1) that could respond to beta-lactamase within 20 s was first synthesized, and the detection limit was determined to be 0.13 nmol/L. Meanwhile, a three-dimensional microfluidic paper-based analytical device was fabricated for integration of B1. Also, a smartphone-based AI cloud was developed to correct errors automatically and output results intelligently. This smart system could calibrate the temperature and pH in the beta-lactamase level detection in complex samples and mice infected with various bacteria, which shows the problem-solving ability in interdisciplinary research, and demonstrates potential clinical benefits., Funding Agencies|National Key R&D Program of China [2020YFA0709900]; National Natural Science Foundation of China [62288102, 22077101, 52073230]; Joint Research Funds of Department of Science & Technology of Shaanxi Province; Northwestern~Polytechnical University [2020GXLH-Z-008, 2020GXLH-Z-013]; Shaanxi Provincial Science Fund for Distinguished Young Scholars [2023-JC-JQ-32]; Key Research and Development Program of Shaanxi [2020ZDLGY13-04]; Fundamental Research Funds for the Central Universities and Innovation Foundation for Doctorate Dissertation of Northwestern Polytechnical University [CX2021121]

Exploration is essential in reinforcement learning, particularly in environments where external rewards are sparse. Here we focus on exploration with intrinsic rewards, where the agent transiently augments the external rewards with self-generated intrinsic rewards. Although the study of intrinsic rewards has a long history, existing methods focus on composing the intrinsic reward based on measures of future prospects of states, ignoring the information contained in the retrospective structure of transition sequences. Here we argue that the agent can utilise retrospective information to generate explorative behaviour with structure-awareness, facilitating efficient exploration based on global instead of local information. We propose Successor-Predecessor Intrinsic Exploration (SPIE), an exploration algorithm based on a novel intrinsic reward combining prospective and retrospective information. We show that SPIE yields more efficient and ethologically plausible exploratory behaviour in environments with sparse rewards and bottleneck states than competing methods. We also implement SPIE in deep reinforcement learning agents, and show that the resulting agent achieves stronger empirical performance than existing methods on sparse-reward Atari games.

We introduce a new approach to probabilistic unsupervised learning based on the recognition-parametrised model (RPM): a normalised semi-parametric hypothesis class for joint distributions over observed and latent variables. Under the key assumption that observations are conditionally independent given latents, the RPM combines parametric prior and observation-conditioned latent distributions with non-parametric observation marginals. This approach leads to a flexible learnt recognition model capturing latent dependence between observations, without the need for an explicit, parametric generative model. The RPM admits exact maximum-likelihood learning for discrete latents, even for powerful neural-network-based recognition. We develop effective approximations applicable in the continuous-latent case. Experiments demonstrate the effectiveness of the RPM on high-dimensional data, learning image classification from weak indirect supervision; direct image-level latent Dirichlet allocation; and recognition-parametrised Gaussian process factor analysis (RP-GPFA) applied to multi-factorial spatiotemporal datasets. The RPM provides a powerful framework to discover meaningful latent structure underlying observational data, a function critical to both animal and artificial intelligence.

A key goal of unsupervised learning is to go beyond density estimation and sample generation to reveal the structure inherent within observed data. Such structure can be expressed in the pattern of interactions between explanatory latent variables captured through a probabilistic graphical model. Although the learning of structured graphical models has a long history, much recent work in unsupervised modelling has instead emphasised flexible deep-network-based generation, either transforming independent latent generators to model complex data or assuming that distinct observed variables are derived from different latent nodes. Here, we extend amortised variational inference to incorporate structured factors over multiple variables, able to capture the observation-induced posterior dependence between latents that results from ``explaining away'' and thus allow complex observations to depend on multiple nodes of a structured graph. We show that appropriately parametrised factors can be combined efficiently with variational message passing in rich graphical structures. We instantiate the framework in nonlinear Gaussian Process Factor Analysis, evaluating the structured recognition framework using synthetic data from known generative processes. We fit the GPFA model to high-dimensional neural spike data from the hippocampus of freely moving rodents, where the model successfully identifies latent signals that correlate with behavioural covariates.

Efficient reinforcement learning (RL) involves a trade-off between "exploitative" actions that maximise expected reward and "explorative'" ones that sample unvisited states. To encourage exploration, recent approaches proposed adding stochasticity to actions, separating exploration and exploitation phases, or equating reduction in uncertainty with reward. However, these techniques do not necessarily offer entirely systematic approaches making this trade-off. Here we introduce SElective Reinforcement Exploration Network (SEREN) that poses the exploration-exploitation trade-off as a game between an RL agent -- \exploiter, which purely exploits known rewards, and another RL agent -- \switcher, which chooses at which states to activate a pure exploration policy that is trained to minimise system uncertainty and override Exploiter. Using a form of policies known as impulse control, \switcher is able to determine the best set of states to switch to the exploration policy while Exploiter is free to execute its actions everywhere else. We prove that SEREN converges quickly and induces a natural schedule towards pure exploitation. Through extensive empirical studies in both discrete (MiniGrid) and continuous (MuJoCo) control benchmarks, we show that SEREN can be readily combined with existing RL algorithms to yield significant improvement in performance relative to state-of-the-art algorithms., Comment: arXiv admin note: text overlap with arXiv:2112.02618, arXiv:2103.09159, arXiv:2110.14468

We propose learning via retracing, a novel self-supervised approach for learning the state representation (and the associated dynamics model) for reinforcement learning tasks. In addition to the predictive (reconstruction) supervision in the forward direction, we propose to include "retraced" transitions for representation / model learning, by enforcing the cycle-consistency constraint between the original and retraced states, hence improve upon the sample efficiency of learning. Moreover, learning via retracing explicitly propagates information about future transitions backward for inferring previous states, thus facilitates stronger representation learning for the downstream reinforcement learning tasks. We introduce Cycle-Consistency World Model (CCWM), a concrete model-based instantiation of learning via retracing. Additionally we propose a novel adaptive "truncation" mechanism for counteracting the negative impacts brought by "irreversible" transitions such that learning via retracing can be maximally effective. Through extensive empirical studies on visual-based continuous control benchmarks, we demonstrate that CCWM achieves state-of-the-art performance in terms of sample efficiency and asymptotic performance, whilst exhibiting behaviours that are indicative of stronger representation learning.

Reinforcement learning (RL) involves performing exploratory actions in an unknown system. This can place a learning agent in dangerous and potentially catastrophic system states. Current approaches for tackling safe learning in RL simultaneously trade-off safe exploration and task fulfillment. In this paper, we introduce a new generation of RL solvers that learn to minimise safety violations while maximising the task reward to the extent that can be tolerated by the safe policy. Our approach introduces a novel two-player framework for safe RL called Distributive Exploration Safety Training Algorithm (DESTA). The core of DESTA is a game between two adaptive agents: Safety Agent that is delegated the task of minimising safety violations and Task Agent whose goal is to maximise the environment reward. Specifically, Safety Agent can selectively take control of the system at any given point to prevent safety violations while Task Agent is free to execute its policy at any other states. This framework enables Safety Agent to learn to take actions at certain states that minimise future safety violations, both during training and testing time, while Task Agent performs actions that maximise the task performance everywhere else. Theoretically, we prove that DESTA converges to stable points enabling safety violations of pretrained policies to be minimised. Empirically, we show DESTA's ability to augment the safety of existing policies and secondly, construct safe RL policies when the Task Agent and Safety Agent are trained concurrently. We demonstrate DESTA's superior performance against leading RL methods in Lunar Lander and Frozen Lake from OpenAI gym., Comment: arXiv admin note: text overlap with arXiv:2103.09159

Knowing how the effects of directed actions generalise to new situations (e.g. moving North, South, East and West, or turning left, right, etc.) is key to rapid generalisation across new situations. Markovian tasks can be characterised by a state space and a transition matrix and recent work has proposed that neural grid codes provide an efficient representation of the state space, as eigenvectors of a transition matrix reflecting diffusion across states, that allows efficient prediction of future state distributions. Here we extend the eigenbasis prediction model, utilising tools from Fourier analysis, to prediction over arbitrary translation-invariant directed transition structures (i.e. displacement and diffusion), showing that a single set of eigenvectors can support predictions over arbitrary directed actions via action-specific eigenvalues. We show how to define a "sense of direction" to combine actions to reach a target state (ignoring task-specific deviations from translation-invariance), and demonstrate that adding the Fourier representations to a deep Q network aids policy learning in continuous control tasks. We show the equivalence between the generalised prediction framework and traditional models of grid cell firing driven by self-motion to perform path integration, either using oscillatory interference (via Fourier components as velocity-controlled oscillators) or continuous attractor networks (via analysis of the update dynamics). We thus provide a unifying framework for the role of the grid system in predictive planning, sense of direction and path integration: supporting generalisable inference over directed actions across different tasks., Comment: In Proceedings of ICLR 2021

We study Policy-extended Value Function Approximator (PeVFA) in Reinforcement Learning (RL), which extends conventional value function approximator (VFA) to take as input not only the state (and action) but also an explicit policy representation. Such an extension enables PeVFA to preserve values of multiple policies at the same time and brings an appealing characteristic, i.e., \emph{value generalization among policies}. We formally analyze the value generalization under Generalized Policy Iteration (GPI). From theoretical and empirical lens, we show that generalized value estimates offered by PeVFA may have lower initial approximation error to true values of successive policies, which is expected to improve consecutive value approximation during GPI. Based on above clues, we introduce a new form of GPI with PeVFA which leverages the value generalization along policy improvement path. Moreover, we propose a representation learning framework for RL policy, providing several approaches to learn effective policy embeddings from policy network parameters or state-action pairs. In our experiments, we evaluate the efficacy of value generalization offered by PeVFA and policy representation learning in several OpenAI Gym continuous control tasks. For a representative instance of algorithm implementation, Proximal Policy Optimization (PPO) re-implemented under the paradigm of GPI with PeVFA achieves about 40\% performance improvement on its vanilla counterpart in most environments., Comment: Accepted as a conference paper on AAAI 2022