Concept

Dimensional regularization

Publications associées (32)

Solving Continuous-Domain Problems Exactly with Multiresolution B-Splines

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta, Thomas Jean Debarre

We propose a discretization method for continuous-domain linear inverse problems with multiple-order total-variation (TV) regularization. It is based on a recent result that proves that such inverse problems have sparse polynomial-spline solutions. Our met ...

2019

The epsilon expansion meets semiclassics

Riccardo Rattazzi, Alexander Monin, Gil Badel, Gabriel Francisco Cuomo

We study the scaling dimension Delta(phi n) of the operator phi(n) where phi is the fundamental complex field of the U(1) model at the Wilson-Fisher fixed point in d = 4 - epsilon. Even for a perturbatively small fixed point coupling lambda*, standard pert ...

Springer2019

Partition function on spheres: How to use zeta function regularization

Alexander Monin

It is known that not all summation methods are linear and stable. Zeta function regularization is in general nonlinear. However, in some cases formal manipulations with zeta function regularization (assuming linearity of sums) lead to correct results. We c ...

Amer Physical Soc2016

Diffusion Estimation Over Cooperative Multi-Agent Networks With Missing Data

Ali H. Sayed

In many fields, and especially in the medical and social sciences and in recommender systems, data are gathered through clinical studies or targeted surveys. Participants are generally reluctant to respond to all questions in a survey or they may lack info ...

IEEE2016

Sparsistency of $\ell_1$-Regularized $M$-Estimators

Volkan Cevher, Jonathan Mark Scarlett, Yen-Huan Li

We consider the model selection consistency or sparsistency of a broad set of

\ell_1

-regularized

M

-estimators for linear and non-linear statistical models in a unified fashion. For this purpose, we propose the local structured smoothness condition (LSS ...

2015

A Modulated Closed Form solution for Quantitative Susceptibility Mapping - A thorough evaluation and comparison to iterative methods based on edge prior knowledge

Rolf Gruetter, Yves Wiaux, José Pedro Rebelo Ferreira Marques, Diana Khabipova

The aim of this study is to perform a thorough comparison of quantitative susceptibility mapping (QSM) techniques and their dependence on the assumptions made. The compared methodologies were: two iterative single orientation methodologies minimizing the l ...

Elsevier2015

The dilaton Wess-Zumino action in higher dimensions

Boaz Keren Zur, Florent Baume

We present a general formula for the Wess-Zumino action associated with the Weyl anomaly, given in a curved background for any even number of dimensions. The result is obtained by considering a finite Weyl transformation of counterterms in dimensional regu ...

Springer2013

An alternate point-wise scheme for Electric Field Integral Equations

Juan Ramon Mosig, Gabriele Rosati

A point-wise approach that can be used efficiently in the numerical solution of Electric Field Integral Equations is introduced. The algorithm is based on the so-called magic distance concept, which defines exactly the point-to-point equivalent of a four-d ...

Wiley-Blackwell2013

3D Poisson Microscopy Deconvolution With Hessian Schatten-Norm Regularization

Michaël Unser, Stamatios Lefkimmiatis

Inverse problems with shot noise arise in many modern biomedical imaging applications. The main challenge is to obtain an estimate of the underlying specimen from measurements corrupted by Poisson noise. In this work, we propose an efficient framework for ...

IEEE2013

Sparse Distributed Learning Based on Diffusion Adaptation

Ali H. Sayed

This article proposes diffusion LMS strategies for distributed estimation over adaptive networks that are able to exploit sparsity in the underlying system model. The approach relies on convex regularization, common in compressive sensing, to enhance the d ...

IEEE2013

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