Publications related to Pseudoconvex function

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smalle ...

Ieee2014

To Convexify or Not? Regression with Clustering Penalties on Graphs

Volkan Cevher, Luca Baldassarre, Marwa El Halabi

We consider minimization problems that are compositions of convex functions of a vector

\x \in\reals^N

with submodular set functions of its support (i.e., indices of the non-zero coefficients of

\x

). Such problems are in general difficult for large

N

...

IEEE2013

Exploiting Local Quasiconvexity for Gradient Estimation in Modifier-Adaptation Schemes

Dominique Bonvin, Grégory François, Gene Bunin

A new approach for gradient estimation in the context of real-time optimization under uncertainty is proposed in this paper. While this estimation problem is often a difficult one, it is shown that it can be simplified significantly if an assumption on the ...

Ieee Computer Soc2012

Regularized Bundle Methods for Convex and Non-Convex Risks

Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with nice guarantees such as no local optima. Yet, non-convexity is very frequent in practice and it may ...

2012

Optimal open-loop control of the recirculation length in the wake of a cylinder

François Gallaire, Edouard Boujo

We consider steady equilibrium solution of the 2-D Navier-Stokes equations describing the flow around a circular cylinder. It is well known that, for moderate Reynolds numbers, the recirculation length is an increasing function of the Reynolds number. We f ...

2012

Optimal image alignment with random projections of manifolds: algorithm and geometric analysis

Pascal Frossard, Daniel Kressner, Effrosyni Kokiopoulou

This paper addresses the problem of image alignment based on random measurements. Image alignment consists of estimating the relative transformation between a query image and a reference image. We consider the specific problem where the query image is prov ...

2011

Continuity Properties of Law-Invariant (Quasi-)Convex Risk Functions on L∞

Gregor Svindland

We study continuity properties of law-invariant (quasi-)convex functions f : L1(Ω,F, P) to ( ∞,∞] over a non-atomic probability space (Ω,F, P) .This is a supplementary note to [12] ...

Springer Verlag2010

An Optimal Algorithm for Reconstructing Images from Binary Measurements

Martin Vetterli, Luciano Sbaiz, Yue Lu, Feng Yang

We have studied a camera with a very large number of binary pixels referred to as the gigavision camera or the gigapixel digital film camera. Potential advantages of this new camera design include improved dynamic range, thanks to its logarithmic sensor re ...

2010

Derivatives with respect to metrics and applications: subgradient marching algorithm

This paper introduces a subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances. The heart of the method is the Subgradient Marching Algorithm to compute the derivative of the geodesic distance wit ...

Springer-Verlag2010

Minimum distance between pattern transformation manifolds: Algorithm and Applications

Pascal Frossard, Effrosyni Kokiopoulou

Transformation invariance is an important property in pattern recognition, where different observations of the same object typically receive the same label. This paper focuses on a transformation invariant distance measure that represents the minimum dista ...

2009

Pseudoconvex function

Graph Chatbot

Chat with Graph Search

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

To Convexify or Not? Regression with Clustering Penalties on Graphs

Exploiting Local Quasiconvexity for Gradient Estimation in Modifier-Adaptation Schemes

Regularized Bundle Methods for Convex and Non-Convex Risks

Optimal open-loop control of the recirculation length in the wake of a cylinder

Optimal image alignment with random projections of manifolds: algorithm and geometric analysis

Continuity Properties of Law-Invariant (Quasi-)Convex Risk Functions on L∞

An Optimal Algorithm for Reconstructing Images from Binary Measurements

Derivatives with respect to metrics and applications: subgradient marching algorithm

Minimum distance between pattern transformation manifolds: Algorithm and Applications

To Convexify or Not? Regression with Clustering Penalties on Graphs

Regularized Bundle Methods for Convex and Non-Convex Risks

Derivatives with respect to metrics and applications: subgradient marching algorithm

Continuity Properties of Law-Invariant (Quasi-)Convex Risk Functions on L∞

Optimal image alignment with random projections of manifolds: algorithm and geometric analysis

From Polar to Reed-Muller Codes: a Technique to Improve the Finite-Length Performance

An Optimal Algorithm for Reconstructing Images from Binary Measurements

Exploiting Local Quasiconvexity for Gradient Estimation in Modifier-Adaptation Schemes

Optimal open-loop control of the recirculation length in the wake of a cylinder

Minimum distance between pattern transformation manifolds: Algorithm and Applications