Fast and Accurate Inference of Plackett-Luce Models

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Image noise can often be accurately fitted to a Poisson-Gaussian distribution. However, estimating the distribution parameters from a noisy image only is a challenging task. Here, we study the case when paired noisy and noise-free samples are accessible. N ...

Many scientific systems are studied using computer codes that simulate the phenomena of interest. Computer simulation enables scientists to study a broad range of possible conditions, generating large quantities of data at a faster rate than the laboratory ...

In this work, we explore the use of an iterative Bayesian Monte Carlo (iBMC) method for nuclear data evaluation within a TALYS Evaluated Nuclear Data Library (TENDL) framework. The goal is to probe the model and parameter space of the TALYS code system to ...

In communication systems, there are many tasks, like modulation classification, for which Deep Neural Networks (DNNs) have obtained promising performance. However, these models have been shown to be susceptible to adversarial perturbations, namely impercep ...

Local modifications of a computational domain are often performed in order to simplify the meshing process and to reduce computational costs and memory requirements. However, removing geometrical features of a domain often introduces a non-negligible error ...

Spatial count data models are used to explain and predict the frequency of phenomena such as traffic accidents in geographically distinct entities such as census tracts or road segments. These models are typically estimated using Bayesian Markov chain Mont ...

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples generated by an unknown Markov chain with d states. We propose a data-driven d ...

Car-sharing systems are an attractive alternative to private vehicles due to their benefits in terms of mobility and sustainability. However, the distribution of vehicles throughout the network in one-way systems is disturbed due to asymmetry and stochasti ...

Adaptability and ease of programming are key features necessary for a wider spread of robotics in factories and everyday assistance. Learning from demonstration (LfD) is an approach to address this problem. It aims to develop algorithms and interfaces such ...

The increasing integration of intermittent renewable generation, especially at the distribution level, necessitates advanced planning and optimisation methodologies contingent on the knowledge of the admittance matrix, capturing the topology and line param ...

Aims. We investigate the contribution of shot-noise and sample variance to uncertainties in the cosmological parameter constraints inferred from cluster number counts, in the context of the Euclid survey. ...

Fast and Accurate Inference of Plackett-Luce Models

Chat with Graph Search

PoGaIN: Poisson-Gaussian Image Noise Modeling From Paired Samples

Statistical Emulation of Neural Simulators: Application to Neocortical L2/3 Large Basket Cells

Iterative Bayesian Monte Carlo for nuclear data evaluation

SafeAMC: Adversarial training for robust modulation classification models

Analysis-aware defeaturing of complex geometries

Fast Bayesian estimation of spatial count data models

Distributionally Robust Optimization with Markovian Data

Predictive user-based relocation through incentives in one-way car-sharing systems

Product of experts for robot learning from demonstration

Bayesian Methods for the Identification of Distribution Networks

Euclid : Effects of sample covariance on the number counts of galaxy clusters