Zobrazeno 1 - 10
of 183
pro vyhledávání: '"Quinn, Christopher J."'
In neuroscience, researchers typically conduct experiments under multiple conditions to acquire neural responses in the form of high-dimensional spike train datasets. Analysing high-dimensional spike data is a challenging statistical problem. To this
Externí odkaz:
http://arxiv.org/abs/2410.19153
Gaussian process factor analysis (GPFA) is a latent variable modeling technique commonly used to identify smooth, low-dimensional latent trajectories underlying high-dimensional neural recordings. Specifically, researchers model spiking rates as Gaus
Externí odkaz:
http://arxiv.org/abs/2405.11683
This paper introduces unified projection-free Frank-Wolfe type algorithms for adversarial continuous DR-submodular optimization, spanning scenarios such as full information and (semi-)bandit feedback, monotone and non-monotone functions, different co
Externí odkaz:
http://arxiv.org/abs/2403.10063
We consider the problem of Influence Maximization (IM), the task of selecting $k$ seed nodes in a social network such that the expected number of nodes influenced is maximized. We propose a community-aware divide-and-conquer framework that involves (
Externí odkaz:
http://arxiv.org/abs/2207.08937
Publikováno v:
AAAI 2021
We consider the bandit problem of selecting $K$ out of $N$ arms at each time step. The reward can be a non-linear function of the rewards of the selected individual arms. The direct use of a multi-armed bandit algorithm requires choosing among $\bino
Externí odkaz:
http://arxiv.org/abs/2011.07687
Autor:
Tang, Yu, Gervais, Catherine, Moffitt, Rylann, Nareddula, Sanghamitra, Zimmermann, Michael, Nadew, Yididiya Y., Quinn, Christopher J., Saldarriaga, Violeta, Edens, Paige, Chubykin, Alexander A.
Publikováno v:
In Cell Reports 26 December 2023 42(12)
Many real-world problems like Social Influence Maximization face the dilemma of choosing the best $K$ out of $N$ options at a given time instant. This setup can be modeled as a combinatorial bandit which chooses $K$ out of $N$ arms at each time, with
Externí odkaz:
http://arxiv.org/abs/1811.11925
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and n
Externí odkaz:
http://arxiv.org/abs/1506.04767
We propose a graphical model for representing networks of stochastic processes, the minimal generative model graph. It is based on reduced factorizations of the joint distribution over time. We show that under appropriate conditions, it is unique and
Externí odkaz:
http://arxiv.org/abs/1204.2003
Digital fingerprinting is a framework for marking media files, such as images, music, or movies, with user-specific signatures to deter illegal distribution. Multiple users can collude to produce a forgery that can potentially overcome a fingerprinti
Externí odkaz:
http://arxiv.org/abs/1111.3376