Publications associées à Courbe convexe

In the problem of coded caching for media delivery, two separate coding opportunities have been identified. The first opportunity is a multi-user advantage and crucially hinges on a public broadcast link in the delivery phase. This has been explored in a p ...

IEEE2019

Optical Tomography Based On A Nonlinear Model That Handles Multiple Scattering

Michaël Unser, Demetri Psaltis, Ulugbek Kamilov, Alexandre Goy, Joowon Lim

Learning Tomography (LT) is a nonlinear optimization algorithm for computationally imaging three-dimensional (3D) distribution of the refractive index in semi-transparent samples. Since the energy function in LT is generally non-convex, the solution it obt ...

Ieee2017

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Stochastic Three-Composite Convex Minimization

Volkan Cevher, Alp Yurtsever, Cong Bang Vu

We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where it is computati ...

2016

On the influence of momentum acceleration on online learning

Ali H. Sayed, Bicheng Ying, Kun Yuan

The article examines in some detail the convergence rate and mean-square-error performance of momentum stochastic gradient methods in the constant step-size and slow adaptation regime. The results establish that momentum methods are equivalent to the stand ...

2016

Scalable Convex Methods for Phase Retrieval

Volkan Cevher, Alp Yurtsever, Ya-Ping Hsieh

This paper describes scalable convex optimization methods for phase retrieval. The main characteristics of these methods are the cheap per-iteration complexity and the low-memory footprint. With a variant of the original PhaseLift formulation, we first ill ...

2015

The number of distinct distances from a vertex of a convex polygon

János Pach, Rom Pinchasi, Gabriel Nivasch

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). I ...

2013

Plenoptic Spherical Sampling

Pascal Frossard, Pierre Vandergheynst, Luigi Bagnato

We present a novel plenoptic sampling scheme that permits an efficient representation of the full light ray field in a space limited by a convex closed surface. We show that a convenient way to sample the light ray field around an observer consists in usin ...

2012

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.

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Courbe convexe

Relaxed Wyner's Common Information

Stochastic Three-Composite Convex Minimization with a Linear Operator

Optical Tomography Based On A Nonlinear Model That Handles Multiple Scattering

On some algebraic and extremal problems in discrete geometry

Stochastic Three-Composite Convex Minimization

On the influence of momentum acceleration on online learning

An Improved Upper Bound for the ErdAs-Szekeres Conjecture

Scalable Convex Methods for Phase Retrieval

The number of distinct distances from a vertex of a convex polygon

Plenoptic Spherical Sampling

Graph Chatbot

Chattez avec Graph Search

An Improved Upper Bound for the ErdAs-Szekeres Conjecture

Scalable Convex Methods for Phase Retrieval

On some algebraic and extremal problems in discrete geometry

The number of distinct distances from a vertex of a convex polygon

Stochastic Three-Composite Convex Minimization with a Linear Operator

Relaxed Wyner's Common Information

Stochastic Three-Composite Convex Minimization

On the influence of momentum acceleration on online learning

Plenoptic Spherical Sampling

Optical Tomography Based On A Nonlinear Model That Handles Multiple Scattering