no code implementations • 12 Dec 2023 • Roberto Savona, Cristina Maria Alberini, Lucia Alessi, Iacopo Baussano, Petros Dellaportas, Ranieri Guerra, Sean Khozin, Andrea Modena, Sergio Pecorelli, Guido Rasi, Paolo Daniele Siviero, Roger M. Stein
A major gap exists between the conceptual suggestion of how much a nation should invest in science, innovation, and technology, and the practical implementation of what is done.
1 code implementation • 26 Aug 2023 • Marcel Hirt, Vasileios Kreouzis, Petros Dellaportas
Variational autoencoders (VAEs) are popular likelihood-based generative models which can be efficiently trained by maximizing an Evidence Lower Bound (ELBO).
1 code implementation • 1 Nov 2022 • Giovanni Ballarin, Petros Dellaportas, Lyudmila Grigoryeva, Marcel Hirt, Sophie van Huellen, Juan-Pablo Ortega
Macroeconomic forecasting has recently started embracing techniques that can deal with large-scale datasets and series with unequal release periods.
1 code implementation • 13 Dec 2021 • Constantinos Daskalakis, Petros Dellaportas, Aristeidis Panos
In particular, we bound the Kullback-Leibler divergence between an exact GP and one resulting from one of the afore-described low-rank approximations to its kernel, as well as between their corresponding predictive densities, and we also bound the error between predictive mean vectors and between predictive covariance matrices computed using the exact versus using the approximate GP.
1 code implementation • NeurIPS 2021 • Marcel Hirt, Michalis K. Titsias, Petros Dellaportas
Hamiltonian Monte Carlo (HMC) is a popular Markov Chain Monte Carlo (MCMC) algorithm to sample from an unnormalized probability distribution.
1 code implementation • 30 May 2021 • Aristeidis Panos, Ioannis Kosmidis, Petros Dellaportas
We adopt the interpretability offered by a parametric, Hawkes-process-inspired conditional probability mass function for the marks and apply variational inference techniques to derive a general and scalable inferential framework for marked point processes.
3 code implementations • 3 Apr 2020 • Constantinos Daskalakis, Petros Dellaportas, Aristeidis Panos
In particular, we bound the Kullback-Leibler divergence between an exact GP and one resulting from one of the afore-described low-rank approximations to its kernel, as well as between their corresponding predictive densities, and we also bound the error between predictive mean vectors and between predictive covariance matrices computed using the exact versus using the approximate GP.
1 code implementation • NeurIPS 2019 • Michalis K. Titsias, Petros Dellaportas
We introduce a gradient-based learning method to automatically adapt Markov chain Monte Carlo (MCMC) proposal distributions to intractable targets.
1 code implementation • NeurIPS 2019 • Marcel Hirt, Petros Dellaportas, Alain Durmus
This family is based on new copula-like densities on the hypercube with non-uniform marginals which can be sampled efficiently, i. e. with a complexity linear in the dimension of state space.
no code implementations • 28 Mar 2019 • Angelos Alexopoulos, Petros Dellaportas, Omiros Papaspiliopoulos
We take a new look at the problem of disentangling the volatility and jumps processes of daily stock returns.
no code implementations • 6 Jul 2018 • Aristeidis Panos, Petros Dellaportas, Michalis K. Titsias
We introduce fully scalable Gaussian processes, an implementation scheme that tackles the problem of treating a high number of training instances together with high dimensional input data.
no code implementations • 23 May 2018 • Marcel Hirt, Petros Dellaportas
We present a scalable approach to performing approximate fully Bayesian inference in generic state space models.