Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

Related publications (27)

About
Privacy
Disclaimer

Graph Chatbot

TIC-TAC: A Framework for Improved Covariance Estimation in Deep Heteroscedastic Regression

Mathieu Salzmann, Alexandre Massoud Alahi, Megh Hiren Shukla

Deep heteroscedastic regression involves jointly optimizing the mean and covariance of the predicted distribution using the negative log-likelihood. However, recent works show that this may result in sub-optimal convergence due to the challenges associated ...

2024

The inductive bias of deep learning: Connecting weights and functions

Guillermo Ortiz Jimenez

Years of a fierce competition have naturally selected the fittest deep learning algorithms. Yet, although these models work well in practice, we still lack a proper characterization of why they do so. This poses serious questions about the robustness, trus ...

EPFL2023

Stability of Image-Reconstruction Algorithms

Michaël Unser, Sebastian Jonas Neumayer, Pol del Aguila Pla

Robustness and stability of image-reconstruction algorithms have recently come under scrutiny. Their importance to medical imaging cannot be overstated. We review the known results for the topical variational regularization strategies ( ℓ2 and ℓ1 regulariz ...

2023

Understanding Deep Neural Function Approximation in Reinforcement Learning via ϵ-Greedy Exploration

Volkan Cevher, Fanghui Liu, Luca Viano

This paper provides a theoretical study of deep neural function approximation in reinforcement learning (RL) with the ϵ-greedy exploration under the online setting. This problem setting is motivated by the successful deep Q-networks (DQN) framework that fa ...

2022

Localization errors of the stochastic heat equation

David Jean-Michel Candil

In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space

\R^d.

We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...

EPFL2022

Strong Subconvexity for Self-Dual GL(3) L-Functions

Yongxiao Lin, Ramon Moreira Nunes, Zhi Qi

In this paper, we prove strong subconvexity bounds for self-dual GL(3) L-functions in the t-aspect and for GL(3) x GL(2) L-functions in the GL(2)-spectral aspect. The bounds are strong in the sense that they are the natural limit of the moment method pione ...

OXFORD UNIV PRESS2022

A Structured Dictionary Perspective on Implicit Neural Representations

Pascal Frossard, Guillermo Ortiz Jimenez, Beril Besbinar, Gizem Yüce

Implicit neural representations (INRs) have recently emerged as a promising alternative to classical discretized representations of signals. Nevertheless, despite their practical success, we still do not understand how INRs represent signals. We propose a ...

IEEE COMPUTER SOC2022

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Interlacing families III: Sharper restricted invertibility estimates

Adam Wade Marcus

We use the method of interlacing families of polynomials to derive a simple proof of Bourgain and Tzafriri's Restricted Invertibility Principle, and then to sharpen the result in two ways. We show that the stable rank can be replaced by the Schatten 4-norm ...

HEBREW UNIV MAGNES PRESS2022

Dictionary Learning for Two-Dimensional Kendall Shapes

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann, Anna You-Lai Song

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...

SIAM PUBLICATIONS2020

Page 1 of 3