Concept

Dirichlet-multinomial distribution

Publications associées (104)

Extensions of Peer Prediction Incentive Mechanisms

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

EPFL2024

Multiplicative chaos of the Brownian loop soup

Antoine Pierre François Jego, Titus Lupu

We construct a measure on the thick points of a Brownian loop soup in a bounded domain D

D

of the plane with given intensity theta>0

\theta >0

, which is formally obtained by exponentiating the square root of its occupation field. The measure is construct ...

WILEY2023

Using Gaming Footage as a Source of Internet Latency Information

Catalina Paz Alvarez Inostroza

Keeping track of Internet latency is a classic measurement problem. Open measurement platforms like RIPE Atlas are a great solution, but they also face challenges: preventing network overload that may result from uncontrolled active measurements, and maint ...

2023

VL4Pose: Active Learning Through Out-Of-Distribution Detection For Pose Estimation

Alexandre Massoud Alahi, Megh Hiren Shukla

Advances in computing have enabled widespread access to pose estimation, creating new sources of data streams. Unlike mock set-ups for data collection, tapping into these data streams through on-device active learning allows us to directly sample from the ...

BMVA Press2022

Revisiting the General Identifiability Problem

Negar Kiyavash, Ehsan Mokhtarian, Yaroslav Kivva, Seyed Jalal Etesami

We revisit the problem of general identifiability originally introduced in [Lee et al., 2019] for causal inference and note that it is necessary to add positivity assumption of observational distribution to the original definition of the problem. We show t ...

2022

RG-Flow: a hierarchical and explainable flow model based on renormalization group and sparse prior

Dian Wu

Flow-based generative models have become an important class of unsupervised learning approaches. In this work, we incorporate the key ideas of renormalization group (RG) and sparse prior distribution to design a hierarchical flow-based generative model, RG ...

IOP Publishing Ltd2022

Technology Strategy in Dynamic Environments: A Computational Analysis of the Automation of Routines, the Organization of AI, and the Evaluation of Technology Risk

Maximilian Wieland Hofer

In this dissertation, I develop theory and evidence to argue that new technologies are central to how firms organize to create and capture value. I use computational methods such as reinforcement learning and probabilistic topic modeling to investigate thr ...

EPFL2022

Exploring the foundations of tonality: statistical cognitive modeling of modes in the history of Western classical music

Martin Alois Rohrmeier, Fabian Claude Moss, Daniel Harasim

Tonality is one of the most central theoretical concepts for the analysis of Western classical music. This study presents a novel approach for the study of its historical development, exploring in particular the concept of mode. Based on a large dataset of ...

SPRINGERNATURE2021

Learning Constrained Distributions of Robot Configurations with Generative Adversarial Network

Sylvain Calinon, Julius Maximilian Jankowski, Emmanuel Pignat, Teguh Santoso Lembono

In high dimensional robotic system, the manifold of the valid configuration space often has a complex shape, especially under constraints such as end-effector orientation or static stability. We propose a generative adversarial network approach to learn th ...

IEEE2021

A Dirichlet process mixture model of discrete choice: Comparisons and a case study on preferences for shared automated vehicles

This paper i) compares parametric and semi-parametric representations of unobserved heterogeneity in hierarchical Bayesian logit models and ii) applies these methods to infer distributions of willingness to pay for features of shared automated vehicle (SAV ...

2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search