亚洲男人的天堂2018av,欧美草比,久久久久久免费视频精选,国色天香在线看免费,久久久久亚洲av成人片仓井空

We propose some extensions to semi-parametric models based on Bayesian additive regression trees (BART). In the semi-parametric BART paradigm, the response variable is approximated by a linear predictor and a BART model, where the linear component is responsible for estimating the main effects and BART accounts for non-specified interactions and non-linearities. Previous semi-parametric models based on BART have assumed that the set of covariates in the linear predictor and the BART model are mutually exclusive in an attempt to avoid bias and poor coverage properties. The main novelty in our approach lies in the way we change the tree-generation moves in BART to deal with bias/confounding between the parametric and non-parametric components, even when they have covariates in common. This allows us to model complex interactions involving the covariates of primary interest, both among themselves and with those in the BART component. Through synthetic and real-world examples, we demonstrate that the performance of our novel semi-parametric BART is competitive when compared to regression models, alternative formulations of semi-parametric BART, and other tree-based methods. The implementation of the proposed method is available at //github.com/ebprado/CSP-BART.

We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains. Previous studies apply a two step approach to this problem, where first the discriminant variety of the system is computed via a Groebner Basis (GB), and then a Cylindrical Algebraic Decomposition (CAD) of this is produced to give the desired computation. However, even on some reasonably small applied examples this process is too expensive, with computation of the discriminant variety alone infeasible. In this paper we develop new approaches to build the discriminant variety using resultant methods (the Dixon resultant and a new method using iterated univariate resultants). This reduces the complexity compared to GB and allows for a previous infeasible example to be tackled. We demonstrate the benefit by giving a symbolic solution to a problem from population dynamics -- the analysis of the steady states of three connected populations which exhibit Allee effects - which previously could only be tackled numerically.

This paper applies a discontinuous Galerkin finite element method to the Kelvin-Voigt viscoelastic fluid motion equations when the forcing function is in $L^\infty({\bf L}^2)$-space. Optimal a priori error estimates in $L^\infty({\bf L}^2)$-norm for the velocity and in $L^\infty(L^2)$-norm for the pressure approximations for the semi-discrete discontinuous Galerkin method are derived here. The main ingredients for establishing the error estimates are the standard elliptic duality argument and a modified version of the Sobolev-Stokes operator defined on appropriate broken Sobolev spaces. Further, under the smallness assumption on the data, it has been proved that these estimates are valid uniformly in time. Then, a first-order accurate backward Euler method is employed to discretize the semi-discrete discontinuous Galerkin Kelvin-Voigt formulation completely. The fully discrete optimal error estimates for the velocity and pressure are established. Finally, using the numerical experiments, theoretical results are verified. It is worth highlighting here that the error results in this article for the discontinuous Galerkin method applied to the Kelvin-Voigt model using finite element analysis are the first attempt in this direction.

We demonstrate from first principles a core fallacy employed by a coterie of authors who claim that data from the Vaccine Adverse Reporting System (VAERS) show that hundreds of thousands of U.S. deaths are attributable to COVID vaccination.

Reliable probability estimation is of crucial importance in many real-world applications where there is inherent uncertainty, such as weather forecasting, medical prognosis, or collision avoidance in autonomous vehicles. Probability-estimation models are trained on observed outcomes (e.g. whether it has rained or not, or whether a patient has died or not), because the ground-truth probabilities of the events of interest are typically unknown. The problem is therefore analogous to binary classification, with the important difference that the objective is to estimate probabilities rather than predicting the specific outcome. The goal of this work is to investigate probability estimation from high-dimensional data using deep neural networks. There exist several methods to improve the probabilities generated by these models but they mostly focus on classification problems where the probabilities are related to model uncertainty. In the case of problems with inherent uncertainty, it is challenging to evaluate performance without access to ground-truth probabilities. To address this, we build a synthetic dataset to study and compare different computable metrics. We evaluate existing methods on the synthetic data as well as on three real-world probability estimation tasks, all of which involve inherent uncertainty. We also give a theoretical analysis of a model for high-dimensional probability estimation which reproduces several of the phenomena evinced in our experiments. Finally, we propose a new method for probability estimation using neural networks, which modifies the training process to promote output probabilities that are consistent with empirical probabilities computed from the data. The method outperforms existing approaches on most metrics on the simulated as well as real-world data.

In the presence of prognostic covariates, inference about the treatment effect with time-to-event endpoints is mostly conducted via the stratified log-rank test or the score test based on the Cox proportional hazards model. In their ground-breaking work Ye and Shao (2020) have demonstrated theoretically that when the model is misspecified, the robust score test (Wei and Lin, 1989) as well as the unstratified log-rank test are conservative in trials with stratified randomization. This fact, however, was not established for the Pocock and Simon covariate-adaptive allocation other than through simulations. In this paper, we expand the results of Ye and Shao to a more general class of randomization procedures and show, in part theoretically, in part through simulations, that the Pocock and Simon covariate-adaptive allocation belongs to this class. We also advance the search for the correlation structure of the normalized within-stratum imbalances with minimization by describing the asymptotic correlation matrix for the case of equal prevalence of all strata. We expand the robust tests proposed by Ye and Shao for stratified randomization to minimization and examine their performance trough simulations.

Experimental aeroacoustics is concerned with the estimation of acoustic source power distributions, which are for instance caused by fluid structure interactions on scaled aircraft models inside a wind tunnel, from microphone array measurements of associated sound pressure fluctuations. In the frequency domain aeroacoustic sound propagation can be modelled as a random source problem for a convected Helmholtz equation. This article is concerned with the inverse random source problem to recover the support of an uncorrelated aeroacoustic source from correlations of observed pressure signals. We show a variant of the factorization method from inverse scattering theory can be used for this purpose. We also discuss a surprising relation between the factorization method and a commonly used beamforming algorithm from experimental aeroacoustics, which is known as Capon's method or as the minimum variance method. Numerical examples illustrate our theoretical findings.

Statistical wisdom suggests that very complex models, interpolating training data, will be poor at prediction on unseen examples. Yet, this aphorism has been recently challenged by the identification of benign overfitting regimes, specially studied in the case of parametric models: generalization capabilities may be preserved despite model high complexity. While it is widely known that fully-grown decision trees interpolate and, in turn, have bad predictive performances, the same behavior is yet to be analyzed for random forests. In this paper, we study the trade-off between interpolation and consistency for several types of random forest algorithms. Theoretically, we prove that interpolation regimes and consistency cannot be achieved for non-adaptive random forests. Since adaptivity seems to be the cornerstone to bring together interpolation and consistency, we introduce and study interpolating Adaptive Centered Forests, which are proved to be consistent in a noiseless scenario. Numerical experiments show that Breiman's random forests are consistent while exactly interpolating, when no bootstrap step is involved. We theoretically control the size of the interpolation area, which converges fast enough to zero, so that exact interpolation and consistency occur in conjunction.

The future robots are expected to work in a shared physical space with humans [1], however, the presence of humans leads to a dynamic environment that is challenging for mobile robots to navigate. The path planning algorithms designed to navigate a collision free path in complex human environments are often tested in real environments due to the lack of simulation frameworks. This paper identifies key requirements for an ideal simulator for this task, evaluates existing simulation frameworks and most importantly, it identifies the challenges and limitations of the existing simulation techniques. First and foremost, we recognize that the simulators needed for the purpose of testing mobile robots designed for human environments are unique as they must model realistic pedestrian behavior in addition to the modelling of mobile robots. Our study finds that Pedsim_ros [2] and a more recent SocNavBench framework [3] are the only two 3D simulation frameworks that meet most of the key requirements defined in our paper. In summary, we identify the need for developing more simulators that offer an ability to create realistic 3D pedestrian rich virtual environments along with the flexibility of designing complex robots and their sensor models from scratch.

This paper proposes a recommender system to alleviate the cold-start problem that can estimate user preferences based on only a small number of items. To identify a user's preference in the cold state, existing recommender systems, such as Netflix, initially provide items to a user; we call those items evidence candidates. Recommendations are then made based on the items selected by the user. Previous recommendation studies have two limitations: (1) the users who consumed a few items have poor recommendations and (2) inadequate evidence candidates are used to identify user preferences. We propose a meta-learning-based recommender system called MeLU to overcome these two limitations. From meta-learning, which can rapidly adopt new task with a few examples, MeLU can estimate new user's preferences with a few consumed items. In addition, we provide an evidence candidate selection strategy that determines distinguishing items for customized preference estimation. We validate MeLU with two benchmark datasets, and the proposed model reduces at least 5.92% mean absolute error than two comparative models on the datasets. We also conduct a user study experiment to verify the evidence selection strategy.