Zobrazení zdroje stránky Michaelsenbjerrum5158

Multiobjective multitasking optimization (MTO), which is an emerging research topic in the field of evolutionary computation, was recently proposed. MTO aims to solve related multiobjective optimization problems at the same time via evolutionary algorithms. The key to MTO is the knowledge transfer based on sharing solutions across tasks. Notably, positive knowledge transfer has been shown to facilitate superior performance characteristics. However, how to find more valuable transferred solutions for the positive transfer has been scarcely explored. Keeping this in mind, we propose a new algorithm to solve MTO problems. In this article, if a transferred solution is nondominated in its target task, the transfer is positive transfer. Furthermore, neighbors of this positive-transfer solution will be selected as the transferred solutions in the next generation, since they are more likely to achieve the positive transfer. Numerical studies have been conducted on benchmark problems of MTO to verify the effectiveness of the proposed approach. Experimental results indicate that our proposed framework achieves competitive results compared with the state-of-the-art MTO frameworks.The medical and machine learning communities are relying on the promise of artificial intelligence (AI) to transform medicine through enabling more accurate decisions and personalized treatment. However, progress is slow. Legal and ethical issues around unconsented patient data and privacy is one of the limiting factors in data sharing, resulting in a significant barrier in accessing routinely collected electronic health records (EHR) by the machine learning community. We propose a novel framework for generating synthetic data that closely approximates the joint distribution of variables in an original EHR dataset, providing a readily accessible, legally and ethically appropriate solution to support more open data sharing, enabling the development of AI solutions. In order to address issues around lack of clarity in defining sufficient anonymization, we created a quantifiable, mathematical definition for "identifiability". We used a conditional generative adversarial networks (GAN) framework to generate synthetic data while minimize patient identifiability that is defined based on the probability of re-identification given the combination of all data on any individual patient. We compared models fitted to our synthetically generated data to those fitted to the real data across four independent datasets to evaluate similarity in model performance, while assessing the extent to which original observations can be identified from the synthetic data. Our model, ADS-GAN, consistently outperformed state-of-the-art methods, and demonstrated reliability in the joint distributions. We propose that this method could be used to develop datasets that can be made publicly available while considerably lowering the risk of breaching patient confidentiality.There has been increasing interest in modelling survival data using deep learning methods in medical research. Current approaches have focused on designing special cost functions to handle censored survival data. We propose a very different method with two simple steps. In the first step, we transform each subject's survival time into a series of jackknife pseudo conditional survival probabilities and then use these pseudo probabilities as a quantitative response variable in the deep neural network model. [https://www.selleckchem.com/products/actinomycin-d.html Actinomycin D Antineoplastic and I activator] By using the pseudo values, we reduce a complex survival analysis to a standard regression problem, which greatly simplifies the neural network construction. Our two-step approach is simple, yet very flexible in making risk predictions for survival data, which is very appealing from the practice point of view. The source code is freely available at http//github.com/lilizhaoUM/DNNSurv.Resting-state brain networks represent the intrinsic state of the brain during the majority of cognitive and sensorimotor tasks. However, no study has yet presented concise predictors of task-induced vigilance variability from spectro-spatial features of the resting-state electroencephalograms (EEG). In this study, ten healthy volunteers have participated in fixed-sequence, varying-duration sessions of sustained attention to response task (SART) for over 100 minutes. A novel and adaptive cumulative vigilance scoring (CVS) scheme is proposed based on tonic performance and response time. Multiple linear regression (MLR) using feature relevance analysis has shown that average CVS, average response time, and variabilities of these scores can be predicted (p less then 0.05) from the resting-state band-power ratios of EEG signals. Cross-validated neural networks also captured different associations for narrow-band beta and wide-band gamma and differences between the high- and low-attention networks in temporal regions. The proposed framework and these first findings on stable and significant attention predictors from the power ratios of resting-state EEG can be useful in brain-computer interfacing and vigilance monitoring applications.Despite their accuracy, neural network-based classifiers are still prone to manipulation through adversarial perturbations. These perturbations are designed to be misclassified by the neural network while being perceptually identical to some valid inputs. The vast majority of such attack methods rely on white-box conditions, where the attacker has full knowledge of the attacked network's parameters. This allows the attacker to calculate the network's loss gradient with respect to some valid inputs and use this gradient in order to create an adversarial example. The task of blocking white-box attacks has proved difficult to address. While many defense methods have been suggested, they have had limited success. In this article, we examine this difficulty and try to understand it. We systematically explore the capabilities and limitations of defensive distillation, one of the most promising defense mechanisms against adversarial perturbations suggested so far, in order to understand this defense challenge. We show that contrary to commonly held belief, the ability to bypass defensive distillation is not dependent on an attack's level of sophistication. In fact, simple approaches, such as the targeted gradient sign method, are capable of effectively bypassing defensive distillation. We prove that defensive distillation is highly effective against nontargeted attacks but is unsuitable for targeted attacks. This discovery led to our realization that targeted attacks leverage the same input gradient that allows a network to be trained. This implies that blocking them comes at the cost of losing the network's ability to learn, presenting an impossible tradeoff to the research community.