Publications associées à Graph Representations and Algorithms in Biomedicine

Publications associées (13)

Learning Self-Exciting Temporal Point Processes Under Noisy Observations

Understanding the diffusion patterns of sequences of interdependent events is a central question for a variety of disciplines. Temporal point processes are a class of elegant and powerful models of such sequences; these processes have become popular across ...

EPFL2021

Scalable Semidefinite Programming

Volkan Cevher, Alp Yurtsever

Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct algorithm for solving large SDP problems by economizing on both the storage an ...

2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

INFORMS2021

On Maintaining Linear Convergence of Distributed Learning and Optimization Under Limited Communication

Na Li

In distributed optimization and machine learning, multiple nodes coordinate to solve large problems. To do this, the nodes need to compress important algorithm information to bits so that it can be communicated over a digital channel. The communication tim ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Waste collection inventory routing with non-stationary stochastic demands

Michel Bierlaire, Mohammad Yousef Maknoon, Sacha Varone, Iliya Dimitrov Markov

We solve a rich routing problem inspired from practice, in which a heterogeneous fixed fleet is used for collecting recyclable waste from large containers over a finite planning horizon. Each container is equipped with a sensor that communicates its level ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Deep Learning for Logic Optimization Algorithms

Giovanni De Micheli, Sabine Süsstrunk, Frédéric Kaplan, Mathias Soeken, Winston Jason Haaswijk, Benoît Laurent Auguste Seguin, Edo Collins

The slowing down of Moore's law and the emergence of new technologies puts an increasing pressure on the field of EDA. There is a constant need to improve optimization algorithms. However, finding and implementing such algorithms is a difficult task, espec ...

IEEE2018

Risk Assessment of Atrial Fibrillation: a Failure Prediction Approach

David Atienza Alonso, Giovanni Ansaloni, Ruben Braojos Lopez, Daniel Camilo Rojas Quirós

We present a methodology for identifying patients who have experienced Paroxysmal Atrial Fibrillation (PAF) among a given subject population. Our work is intended as an initial step towards the design of an unobtrusive portable system for concurrent detect ...

Institute of Electrical and Electronics Engineers2014

Autonomous reinforcement learning with experience replay

Ajay Kumar Tanwani

This paper considers the issues of efficiency and autonomy that are required to make reinforcement learning suitable for real-life control tasks. A real-time reinforcement learning algorithm is presented that repeatedly adjusts the control policy with the ...

Pergamon-Elsevier Science Ltd2013

Concurrent Tries with Efficient Non-Blocking Snapshots

Martin Odersky, Aleksandar Prokopec

We describe a non-blocking concurrent hash trie based on shared-memory single-word compare-and-swap instructions. The hash trie supports standard mutable lock-free operations such as insertion, removal, lookup and their conditional variants. To ensure spac ...

Assoc Computing Machinery2012

A metric for phylogenetic trees based on matching

Bernard Moret, Yu Lin, Vaibhav Rajan

Comparing two or more phylogenetic trees is a fundamental task in computational biology. The simplest outcome of such a comparison is a pairwise measure of similarity, dissimilarity, or distance. A large number of such measures have been proposed, but so t ...

Springer Verlag2011

Incremental Global Parameter Estimation in Dynamical Systems

Benoît Chachuat

Estimating the parameters of a dynamical system based on measurements is an important task in industrial and scientific practice. Since a model's quality is directly linked to its parameter values, obtaining globally rather than locally optimal values is e ...

American Chemical Society2009

Controller complexity reduction for piecewise affine systems through safe region elimination

Colin Neil Jones, Melanie Nicole Zeilinger

We consider the class of piecewise affine optimal state feedback control laws applied to discrete-time piecewise affine systems, motivated by recent work on the computation of closed-form MPC controllers. The storage demand and complexity of these optimal ...

IEEE2007