Publications related to Regularized Diffusion Adaptation via Conjugate Smoothing

Regularization via Mass Transportation

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Peyman Mohajerin Esfahani

The goal of regression and classification methods in supervised learning is to minimize the empirical risk, that is, the expectation of some loss function quantifying the prediction error under the empirical distribution. When facing scarce training data, ...

2019

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

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

Diffusion stochastic optimization with non-smooth regularizers

Ali H. Sayed, Stefan Vlaski

We develop an effective distributed strategy for seeking the Pareto solution of an aggregate cost consisting of regularized risks. The focus is on stochastic optimization problems where each risk function is expressed as the expectation of some loss functi ...

IEEE2016

Dimensionality Reduction in Dynamic Optimization under Uncertainty

Napat Rujeerapaiboon

Dynamic optimization problems affected by uncertainty are ubiquitous in many application domains. Decision makers typically model the uncertainty through random variables governed by a probability distribution. If the distribution is precisely known, then ...

EPFL2016

Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost

Volkan Cevher

This paper proposes a tradeoff between computational time, sample complexity, and statistical accuracy that applies to statistical estimators based on convex optimization. When we have a large amount of data, we can exploit excess samples to decrease stati ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Sparsistency of $\ell_1$-Regularized $M$-Estimators

Volkan Cevher, Jonathan Mark Scarlett, Yen-Huan Li

We consider the model selection consistency or sparsistency of a broad set of

\ell_1

-regularized

M

-estimators for linear and non-linear statistical models in a unified fashion. For this purpose, we propose the local structured smoothness condition (LSS ...

2015

PURIFY: a new approach to radio-interferometric imaging

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Jason Douglas McEwen

In a recent article series, the authors have promoted convex optimization algorithms for radio-interferometric imaging in the framework of compressed sensing, which leverages sparsity regularization priors for the associated inverse problem and defines a m ...

Wiley-Blackwell2014

Large global solutions for energy supercritical nonlinear wave equations on $\R^{3+1}$

Joachim Krieger

For the radial energy-supercritical nonlinear wave equation

\Box u = -u_{tt} + \triangle u = \pm u^7

on

\R^{3+1}

, we prove the existence of a class of global in forward time

C^\infty

-smooth solutions with infinite critical Sobolev norm $\dot{H}^{\f ...

Springer Verlag2014

Stability and Hypothesis Transfer Learning

Ilja Kuzborskij

We consider the transfer learning scenario, where the learner does not have access to the source domain directly, but rather operates on the basis of hypotheses induced from it - the Hypothesis Transfer Learning (HTL) problem. Particularly, we conduct a th ...

2013

Regularized Diffusion Adaptation via Conjugate Smoothing

Graph Chatbot

Chat with Graph Search

Regularization via Mass Transportation

A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

Fast Automatic Smoothing for Generalized Additive Models

Diffusion stochastic optimization with non-smooth regularizers

Dimensionality Reduction in Dynamic Optimization under Uncertainty

Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost

Sparsistency of $\ell_1$-Regularized $M$-Estimators

PURIFY: a new approach to radio-interferometric imaging

Large global solutions for energy supercritical nonlinear wave equations on $\R^{3+1}$

Stability and Hypothesis Transfer Learning

Regularization via Mass Transportation

A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization

PURIFY: a new approach to radio-interferometric imaging

Sparsistency of $\ell_1$-Regularized $M$-Estimators

Fast Automatic Smoothing for Generalized Additive Models

Dimensionality Reduction in Dynamic Optimization under Uncertainty

Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost

Diffusion stochastic optimization with non-smooth regularizers

Stability and Hypothesis Transfer Learning

Large global solutions for energy supercritical nonlinear wave equations on $\R^{3+1}$