Search · four archives
Search · four archives
20 papers · ranked by Valyu relevance
Xiaoquan Wen, Yeji Lee
With the increasing availability of functional genomic data (4, 7, 1), incorporating genomic annotations into QTL mapping has become a standard analytical procedure. However, the existing analysis methods often lack rigor and/or computational efficiency. We present a novel algorithm to perform integrative multi-SNP QTL…
Anindya De, Ilias Diakonikolas, Rocco A. Servedio
to within an additive ±ǫ in time poly(n, 2 poly(1/ǫ) ). Note that it is NP-hard to determine whether the above probability is nonzero, so any sort of multiplicative approximation is almost certainly impossible even for efficient randomized algorithms. This is the first deterministic algorithm for this counting problem…
Tom Van Wouwe, Lena H. Ting, Friedl De Groote
Optimal control simulations have shown that both musculoskeletal dynamics and physiological noise are important determinants of movement. However, due to the limited efficiency of available computational tools, deterministic simulations of movement focus on accurately modelling the musculoskeletal system while…
Guillaume Martin, Lionel Roques
Various models describe asexual evolution by mutation, selection and drift. Some focus directly on fitness, typically modelling drift but ignoring or simplifying both epistasis and the distribution of mutation effects (travelling wave models). Others follow the dynamics of quantitative traits determining fitness…
Dieyan Liang, Hong Shen, Lin Chen
We formulate and analyze a generic coverage optimization problem arising in wireless sensor networks with sensors of limited mobility. Given a set of targets to be covered and a set of mobile sensors, we seek a sensor dispatch algorithm maximizing the covered targets under the constraint that the maximal moving…
Michal Dory, Mohsen Ghaffari, Saeed Ilchi
We describe a simple deterministic $O \varepsilon ^{-1}\log \Delta $ round distributed algorithm for $2\alpha +11 + \varepsilon $ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$ denotes the maximum degree. We also show a lower bound proving that this round…
Yann Garniron, Thomas Applencourt, Kevin Gasperich, Anouar Benali + 15 more
Quantum Package is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multi-reference second-order perturbation theory (PT2). The determinant-driven…
Loïc Marrec, Claudia Bank, Thibault Bertrand
Population growth is a fundamental process in ecology, evolution, and epidemiology. The population size dynamics during growth are often described by deterministic equations derived from kinetic models. Here, we simulate several population growth models and compare the size averaged over many stochastic realizations…
In‐Su Han, Prabhanjan Kambadur, Kyoungsoo Park, Jinwoo Shin
Determinantal point processes (DPPs) are popular probabilistic models that arise in many machine learning tasks, where distributions of diverse sets are characterized by matrix determinants. In this paper, we develop fast algorithms to find the most likely configuration (MAP) of large-scale DPPs, which is NP-hard in…
Elias Ventre, Thibault Espinasse, Charles-Edouard Bréhier, Vincent Calvez + 2 more
Differentiation is the process whereby a cell acquires a specific phenotype, by differential gene expression as a function of time. This is thought to result from the dynamical functioning of an underlying Gene Regulatory Network (GRN). The precise path from the stochastic GRN behavior to the resulting cell state is…
Authors not listed
Strong coupling and environmental memory render many open quantum systems intractable to classical computation. To overcome this barrier, we present a variational quantum algorithm capable of solving generalized form time-local quantum master equations directly on Noisy Intermediate-Scale Quantum (NISQ) processors. Our…
Daniel Dadush, Akshay Ramachandran
The frame scaling problem is: given vectors U := {u1, ..., un} ⊆ R d , marginals c ∈ R n ++, and precision ε > 0, find left and right scalings L ∈ R d×d , r ∈ R n such that (v1, . . . , vn) := (Lu1r1, . . . , Lunrn) simultaneously satisfies Pn i=1 viv T i = Id and kvjk 2 2 = cj , ∀j ∈ [n], up to error ε. This problem…
Mahdi Belbasi, Antonio Blanca, Robert S. Harris, David Koslicki + 1 more
Sketching is now widely used in bioinformatics to reduce data size and increase data processing speed. Sketching approaches entice with improved scalability but also carry the danger of decreased accuracy and added bias. In this paper, we investigate the minimizer sketch and its use to estimate the Jaccard similarity…
K. J. Dzahini, Stefan M. Wild
zeroth-, first-, and second-order convergence and expected complexity Authors: ['K. J. Dzahini' 'Stefan M. Wild'] Abstract: Stochastic directional direct-search (SDDS) algorithms were recently introduced as an extension to stochastically noisy objectives of a broad class of algorithms including the well-known mesh…
Attila Nagy, Goitom Simret Kidane, Tamás Turányi, János Tóth
A novel stochastic optimization method called MAC was suggested. The method is based on the calculation of the objective function at several random points and then an empirical expected value and an empirical covariance matrix are calculated. The empirical expected value is proven to converge to the optimum value of…
Siavash Ameli, Shawn C. Shadden
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textbf{A} + t\textbf{B}$$\end{document} A + t B Authors: ['Siavash Ameli' 'Shawn C. Shadden'] We develop heuristic…
Bruno Ordozgoiti, Ananth Mahadevan, Antonis Matakos, Aristides Gionis
When searching for information in a data collection, we are often interested not only in finding relevant items, but also in assembling a diverse set, so as to explore different concepts that are present in the data. This problem has been researched extensively. However, finding a set of items with minimal pairwise…
Lorenzo Finesso, Peter Spreij
Given a positive definite covariance matrix $\widehat{\Sigma}$ of dimension n, we approximate it with a covariance of the form $HH^\top +D$, where H has a prescribed number $k 0$ is diagonal. The quality of the approximation is gauged by the I-divergence between the zero mean normal laws with covariances…
Authors not listed
We present a vector-based method to balance chemical reactions. The algorithm builds candidates in a deterministic way, removes duplicates, and always prints coefficients in the lowest whole-number form. For redox cases, electrons and protons/hydroxide are treated explicitly, so both mass and charge are balanced. We…
Xiaopeng Luo, Xin Xu
We propose and analyze asymptotic proximal point (APP) methods to find the global minimizer for a class of nonconvex, nonsmooth, or even discontinuous multiple minima functions. The method is based on an asymptotic representation of nonconvex proximal points so that it can find the global minimizer without being…