Publications by Leello Tadesse Dadi

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.

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Leello Tadesse Dadi

Graph Chatbot

Chat with Graph Search

Efficient Continual Finite-Sum Minimization

The spectral bias of polynomial neural networks

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

Generating Sparse Stochastic Processes Using Matched Splines

Efficient Continual Finite-Sum Minimization

Generating Sparse Stochastic Processes Using Matched Splines

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

The spectral bias of polynomial neural networks