Concept

Dérivée logarithmique

Publications associées (86)

IMPROVED REGULARITY OF SECOND DERIVATIVES FOR SUBHARMONIC FUNCTIONS

Xavier Fernandez-Real Girona, Riccardo Tione

In this note, we prove that if a subharmonic function Delta u >= 0 has pure second derivatives partial derivative(ii)u that are signed measures, then their negative part (partial derivative(ii)u)- belongs to L-1 (in particular, it is not singular). We then ...

Providence2023

Stochastic derivative estimation for max-stable random fields

Erwan Fabrice Koch

We consider expected performances based on max-stable random fields and we are interested in their derivatives with respect to the spatial dependence parameters of those fields. Max-stable fields, such as the Brown-Resnick and Smith fields, are very popula ...

ELSEVIER2022

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

Volkan Cevher, Kimon Antonakopoulos, Efstratios Panteleimon Skoulakis, Leello Tadesse Dadi, Ali Kavis

We propose an adaptive variance-reduction method, called AdaSpider, for minimization of L-smooth, non-convex functions with a finite-sum structure. In essence, AdaSpider combines an AdaGrad-inspired [Duchi et al., 2011, McMahan & Streeter, 2010], but a fai ...

2022

Unambiguous DNFs and Alon-Saks-Seymour

Mika Tapani Göös, Siddhartha Jain

We exhibit an unambiguous k-DNF formula that requires CNF width (Omega) over tilde (k(2)), which is optimal up to logarithmic factors. As a consequence, we get a near-optimal solution to the Alon-Saks-Seymour problem in graph theory (posed in 1991), which ...

IEEE COMPUTER SOC2022

Differentiable Signed Distance Function Rendering

Wenzel Alban Jakob, Delio Aleardo Vicini, Sébastien Nicolas Speierer

Physically-based differentiable rendering has recently emerged as an attractive new technique for solving inverse problems that recover complete 3D scene representations from images. The inversion of shape parameters is of particular interest but also pose ...

ASSOC COMPUTING MACHINERY2022

A computational workflow for the expansion of heterologous biosynthetic pathways to natural product derivatives

Vassily Hatzimanikatis, Jasmin Maria Hafner

Plant natural products (PNPs) and their derivatives are important but underexplored sources of pharmaceutical molecules. To access this untapped potential, the reconstitution of heterologous PNP biosynthesis pathways in engineered microbes provides a valua ...

NATURE RESEARCH2021

Local Non-Rigid Structure-from-Motion from Diffeomorphic Mappings

Pascal Fua, Mathieu Salzmann, Shaifali Parashar

We propose a new formulation to non-rigid structure-from-motion that only requires the deforming surface to preserve its differential structure. This is a much weaker assumption than the traditional ones of isometry or conformality. We show that it is neve ...

IEEE2020

Local Non-Rigid Structure-from-Motion from Locally Diffeomorphic Mappings

Pascal Fua, Mathieu Salzmann, Shaifali Parashar

We propose a new formulation to the non-rigid structure-from-motion problem that only requires the deforming surface to meaning that its differential structure is preserved. This is a much weaker assumption than the traditional ones of isometry or conforma ...

2020

On design strategies for binary dielectric metasurfaces based on the Fourier modal method

Kévin Müller

Binary dielectric metasurfaces are arrays of sub-wavelength structures that act as a thin layer of artificial material. They are generally lossless and relatively simple to fabricate since only a single structuring step is required. By carefully designing ...

EPFL2020

Convergences of Regularized Algorithms and Stochastic Gradient Methods with Random Projections

Volkan Cevher, Junhong Lin

We study the least-squares regression problem over a Hilbert space, covering nonparametric regression over a reproducing kernel Hilbert space as a special case. We rst investigate regularized algorithms adapted to a projection operator on a closed subspace ...

2020

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