Publication

An approximately minimum variance jackknife

Publications associées (65)

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

Does jackknife scale really matter for accurate large-scale structure covariances?

Ginevra Favole

The jackknife method gives an internal covariance estimate for large-scale structure surveys and allows model-independent errors on cosmological parameters. Using the SDSS-III BOSS CMASS sample, we study how the jackknife size and number of resamplings imp ...

OXFORD UNIV PRESS2021

Distributed Momentum for Byzantine-resilient Stochastic Gradient Descent

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault

Byzantine-resilient Stochastic Gradient Descent (SGD) aims at shielding model training from Byzantine faults, be they ill-labeled training datapoints, exploited software/hardware vulnerabilities, or malicious worker nodes in a distributed setting. Two rece ...

2021

Iterative Unbiasing of Quasi-Equilibrium Sampling

Michele Ceriotti, Bingqing Cheng, Gareth Aneurin Tribello, Federico Giberti

Atomistic modeling of phase transitions, chemical reactions, or other rare events that involve overcoming high free energy barriers usually entails prohibitively long simulation times. Introducing a bias potential as a function of an appropriately chosen s ...

AMER CHEMICAL SOC2020

Generalized interpretation and identification of separable effects in competing event settings

Mats Julius Stensrud

In competing event settings, a counterfactual contrast of cause-specific cumulative incidences quantifies the total causal effect of a treatment on the event of interest. However, effects of treatment on the competing event may indirectly contribute to thi ...

2020

We study a general class of repeated auctions, such as the ones found in electricity markets, as multi-agent games between the bidders. In such a repeated setting, bidders can adapt their strategies online using no-regret algorithms based on the data obser ...

2020

Central limit theorems for multilevel Monte Carlo methods

Sebastian Krumscheid, Hakon Andreas Hoel

In this work, we show that uniform integrability is not a necessary condition for central limit theorems (CLT) to hold for normalized multilevel Monte Carlo (MLMC) estimators and we provide near optimal weaker conditions under which the CLT is achieved. In ...

2019

We consider the problem of estimating the slope function in a functional regression with a scalar response and a functional covariate. This central problem of functional data analysis is well known to be ill-posed, thus requiring a regularised estimation p ...

2019

Comment: Models Are Approximations!

Anthony Christopher Davison, Erwan Fabrice Koch, Jonathan Koh Boon Han

This discussion focuses on areas of disagreement with the papers, particularly the target of inference and the case for using the robust 'sandwich' variance estimator in the presence of moderate mis-specification. We also suggest that existing procedures m ...

INST MATHEMATICAL STATISTICS2019

Angular Accuracy of Steerable Feature Detectors

Michaël Unser, Julien René Pierre Fageot, Arash Amini, Zsuzsanna Püspöki, John Paul Ward

The detection of landmarks or patterns is of interest for extracting features in biological images. Hence, algorithms for finding these keypoints have been extensively investigated in the literature, and their localization and detection properties are well ...

SIAM PUBLICATIONS2019

Cover: A Cluster-Based Variance Reduced Method For Online Learning

Ali H. Sayed, Bicheng Ying, Kun Yuan

In this paper, we develop a stochastic-gradient learning algorithm for situations involving streaming data that arise from an underlying clustered structure. In such settings, the variance of gradient noise can be decomposed into the in-cluster variance si ...

IEEE2019