Variational Optimization

12/18/2012
by   Joe Staines, et al.
0

We discuss a general technique that can be used to form a differentiable bound on the optima of non-differentiable or discrete objective functions. We form a unified description of these methods and consider under which circumstances the bound is concave. In particular we consider two concrete applications of the method, namely sparse learning and support vector classification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2018

Direct Optimization through for Discrete Variational Auto-Encoder

Reparameterization of variational auto-encoders with continuous latent s...
research
03/20/2021

Efficient Global Optimization of Non-differentiable, Symmetric Objectives for Multi Camera Placement

We propose a novel iterative method for optimally placing and orienting ...
research
02/16/2018

Online Continuous Submodular Maximization

In this paper, we consider an online optimization process, where the obj...
research
09/13/2018

Stochastic Variational Optimization

Variational Optimization forms a differentiable upper bound on an object...
research
06/01/2018

Reparameterization Gradient for Non-differentiable Models

We present a new algorithm for stochastic variational inference that tar...
research
02/24/2023

Linearization Algorithms for Fully Composite Optimization

In this paper, we study first-order algorithms for solving fully composi...
research
04/29/2022

GenDR: A Generalized Differentiable Renderer

In this work, we present and study a generalized family of differentiabl...

Please sign up or login with your details

Forgot password? Click here to reset