Search results for "Computation"
showing 10 items of 7362 documents
Robust dynamic cooperative games
2009
Classical cooperative game theory is no longer a suitable tool for those situations where the values of coalitions are not known with certainty. Recent works address situations where the values of coalitions are modelled by random variables. In this work we still consider the values of coalitions as uncertain, but model them as unknown but bounded disturbances. We do not focus on solving a specific game, but rather consider a family of games described by a polyhedron: each point in the polyhedron is a vector of coalitions’ values and corresponds to a specific game. We consider a dynamic context where while we know with certainty the average value of each coalition on the long run, at each t…
Cluster-Localized Sparse Logistic Regression for SNP Data
2012
The task of analyzing high-dimensional single nucleotide polymorphism (SNP) data in a case-control design using multivariable techniques has only recently been tackled. While many available approaches investigate only main effects in a high-dimensional setting, we propose a more flexible technique, cluster-localized regression (CLR), based on localized logistic regression models, that allows different SNPs to have an effect for different groups of individuals. Separate multivariable regression models are fitted for the different groups of individuals by incorporating weights into componentwise boosting, which provides simultaneous variable selection, hence sparse fits. For model fitting, th…
Multiple testing in candidate gene situations: a comparison of classical, discrete, and resampling-based procedures.
2011
In candidate gene association studies, usually several elementary hypotheses are tested simultaneously using one particular set of data. The data normally consist of partly correlated SNP information. Every SNP can be tested for association with the disease, e.g., using the Cochran-Armitage test for trend. To account for the multiplicity of the test situation, different types of multiple testing procedures have been proposed. The question arises whether procedures taking into account the discreteness of the situation show a benefit especially in case of correlated data. We empirically evaluate several different multiple testing procedures via simulation studies using simulated correlated SN…
TiFoSi: an efficient tool for mechanobiology simulations of epithelia
2020
[Motivation]: Emerging phenomena in developmental biology and tissue engineering are the result of feedbacks between gene expression and cell biomechanics. In that context, in silico experiments are a powerful tool to understand fundamental mechanisms and to formulate and test hypotheses.
A fast and recursive algorithm for clustering large datasets with k-medians
2012
Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a sequential version of the $k$-means algorithm, a new class of recursive stochastic gradient algorithms designed for the $k$-medians loss criterion is proposed. By their recursive nature, these algorithms are very fast and are well adapted to deal with large samples of data that are allowed to arrive sequentially. It is proved that the stochastic gradient algorithm converges almost surely to the set of stationary points of the underlying loss criterion. A particular attention is paid to the averaged versions, which…
The Role of a Second Reservoir in an Open BCS Model
2005
In this paper we use the stochastic limit approach (SLA) in order to analyze some generalized versions of the open BCS model first introduced by Buffet and Martin and recently analyzed by the author using the SLA. In particular, considering different models, we discuss the role of a second reservoir interacting with the first one (but not with the system) in the computation of the critical temperature corresponding to the transition from a normal to a superconducting phase.
Robust estimation and regression with parametric quantile functions
2022
A new, broad family of quantile-based estimators is described, and theoretical and empirical evidence is provided for their robustness to outliers in the response. The proposed method can be used to estimate all types of parameters, including location, scale, rate and shape parameters, extremes, regression coefficients and hazard ratios, and can be extended to censored and truncated data. The described estimator can be utilized to construct robust versions of common parametric and semiparametric methods, such as linear (Normal) regression, generalized linear models, and proportional hazards models. A variety of significant results and applications is presented to show the flexibility of the…
Fast and universal estimation of latent variable models using extended variational approximations
2022
AbstractGeneralized linear latent variable models (GLLVMs) are a class of methods for analyzing multi-response data which has gained considerable popularity in recent years, e.g., in the analysis of multivariate abundance data in ecology. One of the main features of GLLVMs is their capacity to handle a variety of responses types, such as (overdispersed) counts, binomial and (semi-)continuous responses, and proportions data. On the other hand, the inclusion of unobserved latent variables poses a major computational challenge, as the resulting marginal likelihood function involves an intractable integral for non-normally distributed responses. This has spurred research into a number of approx…
Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?
2017
Summary Principal component analysis (PCA) is a method of choice for dimension reduction. In the current context of data explosion, online techniques that do not require storing all data in memory are indispensable to perform the PCA of streaming data and/or massive data. Despite the wide availability of recursive algorithms that can efficiently update the PCA when new data are observed, the literature offers little guidance on how to select a suitable algorithm for a given application. This paper reviews the main approaches to online PCA, namely, perturbation techniques, incremental methods and stochastic optimisation, and compares the most widely employed techniques in terms statistical a…
Pathway analysis of high-throughput biological data within a Bayesian network framework
2011
Abstract Motivation: Most current approaches to high-throughput biological data (HTBD) analysis either perform individual gene/protein analysis or, gene/protein set enrichment analysis for a list of biologically relevant molecules. Bayesian Networks (BNs) capture linear and non-linear interactions, handle stochastic events accounting for noise, and focus on local interactions, which can be related to causal inference. Here, we describe for the first time an algorithm that models biological pathways as BNs and identifies pathways that best explain given HTBD by scoring fitness of each network. Results: Proposed method takes into account the connectivity and relatedness between nodes of the p…