Concept

Smoothness

Related publications (140)

Efficient Greedy Coordinate Descent for Composite Problems

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova, Sai Praneeth Reddy Karimireddy

Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth problems can yield convergence rates independent of the dimension ...

2019

Efficient Greedy Coordinate Descent for Composite Problems

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova, Sai Praneeth Reddy Karimireddy

MICROTOME PUBLISHING2019

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

A reduced basis approach to large-scale pseudospectra computation

Petar Sirkovic

For studying spectral properties of a nonnormal matrix A is an element of Cnxn, information about its spectrum sigma(A) alone is usually not enough. Effects of perturbations on sigma(A) can be studied by computing epsilon-pseudospectra, i.e. the level sets ...

WILEY2019

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

Are Foreigners Treated Equally under the Trade-Related Aspects of Intellectual Property Rights Agreement?

Gaétan Jean A de Rassenfosse

The Trade-Related Aspects of Intellectual Property Rights Agreement, administered by the World Trade Organization, ensures the smooth functioning of the international patent system. It promises among other things that local and foreign firms are treated in ...

UNIV CHICAGO PRESS2019

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

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Aris Filos Ratsikas

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two thieves share the ...

ACM2019

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.