Concept

Fiducial inference

Publications associées (24)

Anthony C Davison and Igor Rodionov's contribution to the Discussion of 'Estimating means of bounded random variables by betting' by Waudby-Smith and Ramdas

Anthony Christopher Davison, Igor Rodionov

We derive confidence intervals (CIs) and confidence sequences (CSs) for the classical problem of estimating a bounded mean. Our approach generalizes and improves on the celebrated Chernoff method, yielding the best closed-form "empirical-Bernstein" CSs and ...

Oxford2024

CURLING - I. The influence of point-like image approximation on the outcomes of cluster strong lens modelling

Jean-Paul Richard Kneib, Huanyuan Shan, Nan Li

Cluster-scale strong lensing is a powerful tool for exploring the properties of dark matter and constraining cosmological models. However, due to the complex parameter space, pixelized strong lens modelling in galaxy clusters is computationally expensive, ...

Oxford Univ Press2024

Maximum likelihood bolometry for ASDEX upgrade experiments

Riccardo Rossi

Bolometry is an essential diagnostic for calculating the power balances and for the understanding of different physical aspects of tokamak experiments. The reconstruction method based on the Maximum Likelihood (ML) principle, developed initially for JET, h ...

Bristol2023

Attractive and repulsive serial dependence: The role of task relevance, the passage of time, and the number of stimuli

David Pascucci, Gizay Ceylan

Visual decisions are attracted toward features of previous stimuli. This phenomenon, termed serial dependence, has been related to a mechanism that integrates present visual input with stimuli seen up to 10 to 15 s in the past. It is believed that this mec ...

2023

Confidence Matters: Applications to Semantic Segmentation

Prabhu Teja Sivaprasad

The successes of deep learning for semantic segmentation can in be, in part, attributed to its scale: a notion that encapsulates the largeness of these computational architectures and the labeled datasets they are trained on. These resource requirements hi ...

EPFL2023

Perturbation theory models for LSST-era galaxy clustering: Tests with subpercent mock catalog measurements in Fourier and configuration space

Jonathan Andrew Blazek

We analyze the clustering of galaxies using the z = 1.006 snapshot of the CosmoDC2 simulation, a high-fidelity synthetic galaxy catalog designed to validate analysis methods for the Vera C. Rubin Observatory Legacy Survey of Space and Time (LSST). We prese ...

AMER PHYSICAL SOC2022

The impact of the fiducial cosmology assumption on BAO distance scale measurements

Cheng Zhao, Paul Carter

Standard analysis pipelines for measurements of Baryon Acoustic Oscillations (BAO) in galaxy surveys make use of a fiducial cosmological model to guide the data compression required to transform from observed redshifts and angles to the measured angular an ...

OXFORD UNIV PRESS2020

Perturbation-based inference for diffusion processes: Obtaining effective models from multiscale data

Sebastian Krumscheid

We consider the inference problem for parameters in stochastic differential equation models from discrete time observations (e.g. experimental or simulation data). Specifically, we study the case where one does not have access to observations of the model ...

2018

Experimental repetitions and blockage of large stems at ogee crested spillways with piers

Anton Schleiss, Michael Pfister, José Pedro Gamito de Saldanha Calado Matos, Paloma Furlan

Large wood is often transported by rivers into reservoirs during heavy rainfall events. When a critical section like a spillway is blocked and discharge capacity reduced, an uncontrolled increase of the reservoir water level may occur. This study aims to s ...

2018

A modular low-complexity ECG delineation algorithm for real-time embedded systems

David Atienza Alonso, Francisco Javier Rincon Vallejos, Roman Hermida Correa

This work presents a new modular and lowcomplexity algorithm for the delineation of the different ECG waves (QRS, P and T peaks, onsets and end). Involving a reduced number of operations per second and having a small memory footprint, this algorithm is int ...

2018

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