Concept

Non-analytic smooth function

Related publications (85)

Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Volkan Cevher, Paul Thierry Yves Rolland, Fabian Ricardo Latorre Gomez, Shaul Nadav Hallak

We demonstrate two new important properties of the 1-path-norm of shallow neural networks. First, despite its non-smoothness and non-convexity it allows a closed form proximal operator which can be efficiently computed, allowing the use of stochastic proxi ...

2020

Log Barriers for Safe Non-convex Black-box Optimization

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

We address the problem of minimizing a smooth function f0(x) over a compact set D defined by smooth functional constraints fi(x)≤0, i=1,…,m given noisy value measurements of fi(x). This problem arises in safety-critical applications, where certain paramete ...

2019

The index of singular zeros of harmonic mappings of anti-analytic degree one

Robert Gerhard Jérôme Luce

We study harmonic mappings of the form , where h is an analytic function. In particular, we are interested in the index (a generalized multiplicity) of the zeros of such functions. Outside the critical set of f, where the Jacobian of f is non-vanishing, it ...

TAYLOR & FRANCIS LTD2019

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{M}

. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...

2019

On the Exact Gevrey Order of Formal Puiseux Series Solutions to the Third Painleve Equation

Andrey Vasilyev

In this paper, we study the third Painleve equation with parameters gamma = 0, alpha delta not equal 0. The Puiseux series formally satisfying this equation (after a certain change of variables) asymptotically approximate of Gevrey order one solutions to t ...

2019

Escaping from saddle points on Riemannian manifolds

Nicolas Henri Bernard Flammarion, Yue Sun

We consider minimizing a nonconvex, smooth function f on a Riemannian manifold M. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle points on the manif ...

2019

Sign-Changing Solutions for a Class of Zero Mass Nonlocal Schrodinger Equations

We consider the following class of fractional Schrodinger equations: (-Delta)(alpha)u + V(x)u = K(x)f(u) in R-N, where alpha is an element of (0, 1), N > 2 alpha, (-Delta)(alpha) is the fractional Laplacian, V and K are positive continuous functions which ...

2019

Fast Automatic Smoothing for Generalized Additive Models

Anthony Christopher Davison, Yousra El Bachir

Generalized additive models (GAMs) are regression models wherein parameters of probability distributions depend on input variables through a sum of smooth functions, whose degrees of smoothness are selected by L-2 regularization. Such models have become th ...

MICROTOME PUBL2019

A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan, Sulaiman A S A E Alghunaim

Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based proximal decent ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Lorenz Type Behaviors Associated To Fractal-Non-Fractal Transition In The Dynamics Of The Complex Systems

Maria-Alexandra Paun

In the framework of Fractal Theory of Motion for the Scale Relativity Theory with arbitrary and constant fractal dimensions, dynamics in complex systems associated to the fractal-non-fractal transition are analyzed. Working with the assumption that these d ...

UNIV POLITEHNICA BUCHAREST, SCI BULL2019

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{M}

. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...

2019