Concept

Bias–variance tradeoff

Related publications (126)

Semantic Perturbations with Normalizing Flows for Improved Generalization

Martin Jaggi, Sebastian Urban Stich, Tatjana Chavdarova

Data augmentation is a widely adopted technique for avoiding overfitting when training deep neural networks. However, this approach requires domain-specific knowledge and is often limited to a fixed set of hard-coded transformations. Recently, several work ...

IEEE2021

Structure of multicorrelation sequences with integer part polynomial iterates along primes

Florian Karl Richter

Let T be a measure-preserving Zℓ-action on the probability space (X,B,μ), let q1,…,qm:R→Rℓ be vector polynomials, and let f0,…,fm∈L∞⁡(X). For any ϵ>0 and multicorrelation sequences of the form α⁡(n)=∫Xf0⋅T⌊q1⁡(n)⌋⁢f1⋯T⌊qm⁡(n)⌋⁢fmd⁢μ we show that there exis ...

2021

Towards a pragmatist dealing with algorithmic bias in medical machine learning

Machine Learning (ML) is on the rise in medicine, promising improved diagnostic, therapeutic and prognostic clinical tools. While these technological innovations are bound to transform health care, they also bring new ethical concerns to the forefront. One ...

2021

Forward-reflected-backward method with variance reduction

Volkan Cevher, Ahmet Alacaoglu

We propose a variance reduced algorithm for solving monotone variational inequalities. Without assuming strong monotonicity, cocoercivity, or boundedness of the domain, we prove almost sure convergence of the iterates generated by the algorithm to a soluti ...

2021

Multilevel ensemble Kalman filtering for spatio-temporal processes

Fabio Nobile, Hakon Andreas Hoel

We design and analyse the performance of a multilevel ensemble Kalman filter method (MLEnKF) for filtering settings where the underlying state-space model is an infinite-dimensional spatio-temporal process. We consider underlying models that needs to be si ...

2021

Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach

Volkan Cevher, Shaul Nadav Hallak

This paper develops a methodology for regret minimization with stochastic first-order oracle feedback in online, constrained, non-smooth, non-convex problems. In this setting, the minimization of external regret is beyond reach for first-order methods, and ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Advances in Bias-aware Recommendation on the Web

Mirko Marras

The goal of this tutorial is to provide the WSDM community with recent advances on the assessment and mitigation of data and algorithmic bias in recommender systems. We first introduce conceptual foundations, by presenting the state of the art and describi ...

ASSOC COMPUTING MACHINERY2021

Adaptive phase correction of diffusion-weighted images

Jean-Philippe Thiran, Marco Pizzolato, Maxime Descoteaux

Phase correction (PC) is a preprocessing technique that exploits the phase of images acquired in Magnetic Resonance Imaging (MRI) to obtain real-valued images containing tissue contrast with additive Gaussian noise, as opposed to magnitude images which fol ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

Continual Learning for Natural Language Generation in Task-oriented Dialog Systems

Boi Faltings, Mengjie Zhao, Fei Mi, Liangwei Chen

Natural language generation (NLG) is an essential component of task-oriented dialog systems. Despite the recent success of neural approaches for NLG, they are typically developed in an offline manner for particular domains. To better fit real-life applicat ...

2020

Frequency domain theory for functional time series: Variance decomposition and an invariance principle

Neda Mohammadi Jouzdani

This paper is concerned with frequency domain theory for functional time series, which are temporally dependent sequences of functions in a Hilbert space. We consider a variance decomposition, which is more suitable for such a data structure than the varia ...

INT STATISTICAL INST2020

Graph Chatbot

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.