276 research outputs found
Estimating Mixture of Gaussian Processes by Kernel Smoothing
When functional data are not homogenous, for example, when there are multiple classes of functional curves in the dataset, traditional estimation methods may fail. In this article, we propose a new estimation procedure for the mixture of Gaussian processes, to incorporate both functional and inhomogenous properties of the data. Our method can be viewed as a natural extension of high-dimensional normal mixtures. However, the key difference is that smoothed structures are imposed for both the mean and covariance functions. The model is shown to be identifiable, and can be estimated efficiently by a combination of the ideas from expectation-maximization (EM) algorithm, kernel regression, and functional principal component analysis. Our methodology is empirically justified by Monte Carlo simulations and illustrated by an analysis of a supermarket dataset
IVF Development and Analysis of Neonatal Conditions
This paper rst discusses the developmental origin of IVF (In vitro fertilization) and analyzes the four generations of IVF technology in detail. Then, combined with its own work experience, it discusses the neonatal situation of IVF, in order to improve reference for other medical staff
A Generic Multi-Player Transformation Algorithm for Solving Large-Scale Zero-Sum Extensive-Form Adversarial Team Games
Many recent practical and theoretical breakthroughs focus on adversarial team
multi-player games (ATMGs) in ex ante correlation scenarios. In this setting,
team members are allowed to coordinate their strategies only before the game
starts. Although there existing algorithms for solving extensive-form ATMGs,
the size of the game tree generated by the previous algorithms grows
exponentially with the number of players. Therefore, how to deal with
large-scale zero-sum extensive-form ATMGs problems close to the real world is
still a significant challenge. In this paper, we propose a generic multi-player
transformation algorithm, which can transform any multi-player game tree
satisfying the definition of AMTGs into a 2-player game tree, such that finding
a team-maxmin equilibrium with correlation (TMECor) in large-scale ATMGs can be
transformed into solving NE in 2-player games. To achieve this goal, we first
introduce a new structure named private information pre-branch, which consists
of a temporary chance node and coordinator nodes and aims to make decisions for
all potential private information on behalf of the team members. We also show
theoretically that NE in the transformed 2-player game is equivalent TMECor in
the original multi-player game. This work significantly reduces the growth of
action space and nodes from exponential to constant level. This enables our
work to outperform all the previous state-of-the-art algorithms in finding a
TMECor, with 182.89, 168.47, 694.44, and 233.98 significant improvements in the
different Kuhn Poker and Leduc Poker cases (21K3, 21K4, 21K6 and 21L33). In
addition, this work first practically solves the ATMGs in a 5-player case which
cannot be conducted by existing algorithms.Comment: 9 pages, 5 figures, NIPS 202
Influence of MDR1 methylation on the curative effect of interventional embolism chemotherapy for cervical cancer
Synthesis and characterization of copper-specific tetradendate ligands as potential treatment for Alzheimer's disease
- …