Strongly Convex Divergences

09/22/2020
by   James Melbourne, et al.
0

We consider a sub-class of the f-divergences satisfying a stronger convexity property, which we refer to as strongly convex, or κ-convex divergences. We derive new and old relationships, based on convexity arguments, between popular f-divergences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2021

An extension of the proximal point algorithm beyond convexity

We introduce and investigate a new generalized convexity notion for func...
research
02/20/2020

Cutting Corners

We define and study a class of subshifts of finite type (SFTs) defined b...
research
05/22/2018

M-convexity of the minimum-cost packings of arborescences

In this paper, we first prove that the minimum-cost packings of disjoint...
research
10/03/2019

A Grid-based Approach for Convexity Analysis of a Density-based Cluster

This paper presents a novel geometrical approach to investigate the conv...
research
05/08/2019

SAdam: A Variant of Adam for Strongly Convex Functions

The Adam algorithm has become extremely popular for large-scale machine ...
research
01/26/2017

Linear convergence of SDCA in statistical estimation

In this paper, we consider stochastic dual coordinate (SDCA) without st...
research
02/15/2023

Two-sided convexity testing with certificates

We revisit the problem of property testing for convex position for point...

Please sign up or login with your details

Forgot password? Click here to reset