Concept

Loi de Student

Publications associées (152)

Excess-Risk of Distributed Stochastic Learners

This paper studies the learning ability of consensus and diffusion distributed learners from continuous streams of data arising from different but related statistical distributions. Four distinctive features for diffusion learners are revealed in relation ...

IEEE2016

Adaptive learning for stochastic generalized Nash equilibrium problems

Ali H. Sayed

This work examines a stochastic formulation of the generalized Nash equilibrium problem (GNEP) where agents are subject to randomness in the environment of unknown statistical distribution. Three stochastic gradient strategies are developed by relying on a ...

IEEE2016

Squall

Aleksandar Vitorovic

Squall is a scalable online query engine that runs complex analytics in a cluster using skew-resilient, adaptive operators. Online processing implies that results are incrementally built as the input arrives, and it is ubiquitous for many applications such ...

EPFL2016

Detecting and Quantifying Changing Selection Intensities from Time-Sampled Polymorphism Data

Jeffrey David Jensen, Matthieu Foll, Sebastian Matuszewski, Stefan Jean Laurent, Hyunjin Shim

During his well-known debate with Fisher regarding the phenotypic dataset of Panaxia dominula, Wright suggested fluctuating selection as a potential explanation for the observed change in allele frequencies. This model has since been invoked in a number of ...

Genetics Society of America2016

Solving Stochastic AC Power Flow via Polynomial Chaos Expansion

Timm Faulwasser

The present contribution demonstrates the applicability of polynomial chaos expansion to stochastic (optimal) AC power flow problems that arise in the operation of power grids. For rectangular power flow, polynomial chaos expansion together with Galerkin p ...

IEEE2016

Towards Predicting Success in MOOCs: Programming Assignments

Pierre Dillenbourg, Patrick Jermann, Kshitij Sharma, Lukasz Kidzinski

Students of programming languages in massive on-line open courses (MOOCs) solve programming assignments in order to internalize the concepts. Programming assignments also constitute the assessment procedure for such courses. Depending on their motivation a ...

Books on Demand GmbH, Norderstedt2016

Probability of observable flaw initiation at high cycle fatigue

Vasileios Grigoriou

Fatigue evolution during the flaw initiation phase and under high cycle fatigue conditions is described at the level of the representative volume element by the probability that this element fails in a given period of time under given stimulus. This probab ...

Elsevier2015

Distributionally Robust Logistic Regression

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Peyman Mohajerin Esfahani

This paper proposes a distributionally robust approach to logistic regression. We use the Wasserstein distance to construct a ball in the space of probability distributions centered at the uniform distribution on the training samples. If the radius of this ...

2015

Smooth Scan: Statistics-Oblivious Access Paths

Anastasia Ailamaki, Renata Borovica-Gajic

Query optimizers depend heavily on statistics representing column distributions to create efficient query plans. In many cases, though, statistics are outdated or non-existent, and the process of refreshing statistics is very expensive, especially for ad-h ...

2015

Statistical Unfolding Of Elementary Particle Spectra: Empirical Bayes Estimation And Bias-Corrected Uncertainty Quantification

Victor Panaretos, Mikael Johan Kuusela

We consider the high energy physics unfolding problem where the goal is to estimate the spectrum of elementary particles given observations distorted by the limited resolution of a particle detector. This important statistical inverse problem arising in da ...

Inst Mathematical Statistics2015

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