On Convergence Rate of Concave-Convex Procedure

Similar documents
MEAN SHIFT ALGORITHM AND ITS APPLICATION IN TRACKING OF OBJECTS

On Convergence Rate of Concave-Convex Procedure

Normal Random Variable and its discriminant functions

Advanced Machine Learning & Perception

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

The Comparison of Spline Estimators in the Smoothing Spline Nonparametric Regression Model Based on Weighted...

FLIGHT TRAJECTORIES OPTIMIZATION

Relative controllability of nonlinear systems with delays in control

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4

Variants of Pegasos. December 11, 2009

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany

OP = OO' + Ut + Vn + Wb. Material We Will Cover Today. Computer Vision Lecture 3. Multi-view Geometry I. Amnon Shashua

Optimization. Nuno Vasconcelos ECE Department, UCSD

Fuzzy derivations KU-ideals on KU-algebras BY

F-Tests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction

Periodic motions of a class of forced infinite lattices with nearest neighbor interaction

CHAPTER 5: MULTIVARIATE METHODS

First-order piecewise-linear dynamic circuits

Online Learning with Partial Feedback. 1 Online Mirror Descent with Estimated Gradient

Let s treat the problem of the response of a system to an applied external force. Again,

GMM parameter estimation. Xiaoye Lu CMPS290c Final Project

Chiral Dynamics and Peripheral Transverse Densities

A capacitor consists of two conducting plates, separated by an insulator. Conduction plates: e.g., Aluminum foil Insulator: air, mica, ceramic, etc

Notes on the stability of dynamic systems and the use of Eigen Values.

A DECOMPOSITION METHOD FOR SOLVING DIFFUSION EQUATIONS VIA LOCAL FRACTIONAL TIME DERIVATIVE

Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance

( ) [ ] MAP Decision Rule

Gravitational Search Algorithm for Optimal Economic Dispatch R.K.Swain a*, N.C.Sahu b, P.K.Hota c

Chapter 6: AC Circuits

Fall 2010 Graduate Course on Dynamic Learning

A New Generalisation of Sam-Solai s Multivariate symmetric Arcsine Distribution of Kind-1*

Diode rectifier with capacitive DC link

Lecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,

CH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC

Outline. Energy-Efficient Target Coverage in Wireless Sensor Networks. Sensor Node. Introduction. Characteristics of WSN

Dynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005

Machine Learning Linear Regression

US Monetary Policy and the G7 House Business Cycle: FIML Markov Switching Approach

PHYS 1443 Section 001 Lecture #4

Lecture 11 SVM cont

Structural Optimization Using Metamodels

Advanced time-series analysis (University of Lund, Economic History Department)

Response of MDOF systems

Data Collection Definitions of Variables - Conceptualize vs Operationalize Sample Selection Criteria Source of Data Consistency of Data

Chapter Lagrangian Interpolation

Existence and Uniqueness Results for Random Impulsive Integro-Differential Equation

Mechanics Physics 151

On One Analytic Method of. Constructing Program Controls

Sklar: Sections (4.4.2 is not covered).

Mechanics Physics 151

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL

The Shapley value for fuzzy games on vague sets

Online Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading

Volatility Interpolation

Lecture 12: HEMT AC Properties

Survival Analysis and Reliability. A Note on the Mean Residual Life Function of a Parallel System

Machine Learning. What is a good Decision Boundary? Support Vector Machines

( ) () we define the interaction representation by the unitary transformation () = ()

Track Properities of Normal Chain

A TWO-LEVEL LOAN PORTFOLIO OPTIMIZATION PROBLEM

A Principled Approach to MILP Modeling

Is it necessary to seasonally adjust business and consumer surveys. Emmanuelle Guidetti

Sensor Scheduling for Multiple Parameters Estimation Under Energy Constraint

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.

MIP Reformulation for Max-min Problems in Two-stage Robust SCUC

Single-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method

2/20/2013. EE 101 Midterm 2 Review

Lecture 18: The Laplace Transform (See Sections and 14.7 in Boas)

Chapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are

13.3 Term structure models

Epistemic Game Theory: Online Appendix

Density Matrix Description of NMR BCMB/CHEM 8190

On Construction of Odd-fractional Factorial Designs

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS

The Finite Element Method for the Analysis of Non-Linear and Dynamic Systems

Chapter Three Systems of Linear Differential Equations

STATE OF NORTH CAROLINA DIVISION OF HIGHWAYS BLADEN COUNTY LOCATION: NC 87 AT US 701 INTERSECTION WETLAND AND SURFACE WATER IMPACTS PERMIT TO NC 41

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model

Robustness Experiments with Two Variance Components

Opening Shock and Shape of the Drag-vs-Time Curve

Bandlimited channel. Intersymbol interference (ISI) This non-ideal communication channel is also called dispersive channel

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS

Discrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition

From the Hamilton s Variational Principle to the Hamilton Jacobi Equation

Dual Approximate Dynamic Programming for Large Scale Hydro Valleys

TSS = SST + SSE An orthogonal partition of the total SS

Department of Economics University of Toronto

Introduction to Boosting

Testing a new idea to solve the P = NP problem with mathematical induction

Suyash Narayan Mishra, Piyush Kumar Tripathi & Alok Agrawal

GORDON AND NEWELL QUEUEING NETWORKS AND COPULAS

Name of the Student:

Changeovers. Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, USA

, t 1. Transitions - this one was easy, but in general the hardest part is choosing the which variables are state and control variables

APPM 2360 Homework Solutions, Due June 10

Support Vector Machines. Vibhav Gogate The University of Texas at dallas

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s

Generative and Discriminative Models. Jie Tang Department of Computer Science & Technology Tsinghua University 2012

Graduate Macroeconomics 2 Problem set 5. - Solutions

A L A BA M A L A W R E V IE W

Transcription:

On Converence Rae o Concave-Conve Proceure Ian E.H. Yen Nanun Pen Po-We Wan an Shou-De Ln Naonal awan Unvers OP 202

Oulne Derence o Conve Funcons.c. Prora Applcaons n SVM leraure Concave-Conve Proceure CCCP Majorzaon-Mnzaon MM alorh Block Coornae Descen BCD Converence Analss Alernave BCD Forulaon Converence heore

D.C. Prora Le u v be conve uncon ene on R n j be ane uncon on R n. A Derence o Conve Funcon D.C. Prora s ene as: n s.. u v 0... p j 0 j... q

D.C. Prora Le u v be conve uncon ene on R n j be ane uncon on R n. A Derence o Conve Funcon D.C. Prora s ene as: n s.. u v 0... p j 0 j... q E. Srucural SVM wh hen varables: [C.N.J. Yu an. Joachs 2009]

D.C. Prora Le u v be conve uncon ene on R n j be ane uncon on R n. A Derence o Conve Funcon D.C. Prora s ene as: n s.. u v 0... p j 0 j... q E. Srucural SVM wh hen varables: [C.N.J. Yu an. Joachs 2009] E. Srucural SVM wh non-conve her boun: [C. B. Do e al. 2009] n w where 2 w 2 C N l w l w sup[ ' w ' ] sup ' ' ' w ' l w ' 0 sup ' w '

D.C. Prora Le u v be conve uncon ene on R n j be ane uncon on R n. A Derence o Conve Funcon D.C. Prora s ene as: n s.. u v 0... p j 0 j... q Converence rae s har o analze n non-sooh proble. In hs work we hanle he specal case when he sooh par o u s srcl conve quarac an v s pecewse-lnear. n w where 2 w 2 C N l w l w sup[ ' w ' ] sup ' ' ' w ' l w ' 0 sup ' w '

Concave-Conve Proceure Suppose we can copue he sub-raen o v he Concave-Conve Proceure CCCP solves a D.C. Prora b a seres o conve proble: [Yulle an Ranarajan 2003]: s.. ar n j u v 0... p 0 j... q [Yulle an Ranarajan 2003] shows uaranees escen o he D.C. Prora. [B. Srperubuur e al. 2009] prove Global Converence o va Zanwll s hoer. However he pone ou he Local Converence Rae o s an open proble. Goal: Show ha has a leas Lnear Converence Rae va he connecon o ore eneral Block Coornae Descen BCD alorh.

CCCP as Majorzaon Mnzaon MM CCCP s a specal case o Majorzaon Mnzaon MM where we consruc a ajorzaon uncon o objecve uncon =u-v: where Ω s he easble oan. hen he MM alorh solves: ar n 2

CCCP as Majorzaon Mnzaon MM CCCP s a specal case o Majorzaon Mnzaon MM where we consruc a ajorzaon uncon o objecve uncon =u-v: where Ω s he easble oan. hen he MM alorh solves: ar n In CCCP s consruce b s orer alor Approaon o v a pon : v v u v u or or 2 v u ar n ar n hereore

CCCP as Majorzaon Mnzaon MM CCCP s a specal case o Majorzaon Mnzaon MM where we consruc a ajorzaon uncon o objecve uncon =u-v: where Ω s he easble oan. hen he MM alorh solves: ar n 2 [R. Salakhunov 2003] analze local converence rae o eneral MM alorh b akn 2 as a erenable ap + = ψ. However ψ s no erenable when here are consrans or non-sooh uncon. Here we ook anoher vew o 2 o analze converence.

MM as Block Coornae Descen Snce he nu o occurs a = we can vew MM alorh as Block Coornae Descen over an : ar n ar n However when v s pecewse-lnear he aser proble n s sconnuous an har o analze. u v v

MM as Block Coornae Descen Snce he nu o occurs a = we can vew MM alorh as Block Coornae Descen over an : ar n ar n We can ake an alernave orulaon b observn: b a ar n where a v b a a k k v Block Coornae Descen over an on he alernave orulaon:... 0 an.. n s b a u R els he sae CCCP alorh.

Lea Block Coornae Descen or Non-conve Non-sooh Proble Conser he proble: n F cp where s sooh an P s nonsooh conve lower se-connuous an separable or an. he Block Coornae Descen 3 ar n ar n F F 4 5 Converes o a saonar pon o 3 wh a leas lnear rae he sooh par o 4 5 are srcl conve quarac s quarac an P s polheral. Proo. Snce 4 5 are srcl conve quarac he BCD correspon o Coornae Graen Descen CGD n [Paul sen eal. 2009] wh eac Hessan ar an lne search. he resul hols b heore 2 4 o her paper.

Converence heore o CCCP... 0 an.. n s b a u R heore he CCCP converes o saonar pon o D.C. Prora wh a leas lnear rae he non-sooh par o u an v are pecewse-lnear he sooh par o u s srcl conve quarac an he oan Ω s polheral. Proo. P P P n u b a u R R n he CCCP can be nerpree as BCD over an o Whch can be also wren as Where sooh par s quarac an P s polheral separable. Mnzn over he proble srcl conve quarac. Mnzn over here s equvalen srcl conve quarac proble Lea 2 n paper.

Reerence [] Paul sen an Sanwoon Yun. 2009 A coornae raen escen eho or nonsooh separable nzaon. Maheacal Proran. [2] A. L. Yulle an A. Ranarajan. he concave-conve proceure. Neural Copuaon 5:95V936 2003 [3] L. Wan X. Shen an W. Pan. On ransucve suppor vecor achnes. In J. Verucc X. Shen an J. Laer eors Precon an Dscover. Aercan Maheacal Soce 2007. [4] B. K. Srperubuur D. A. orres an G. R. G. Lanckre. Sparse een ehos b.c. proran. In Proc. o he 24h Annual Inernaonal Conerence on Machne Learnn 2007. [5] J. Neuann C. Schnorr an G. Sel. Cobne SVM-base eaure selecon an classcaon. Machne Learnn 6:29V50 2005. [6] X.-L. Men. Dscusson on opzaon ranser usn surroae objecve uncons. Journal o Copuaonal an Graphcal Sascs 9:35V43 2000. [7] R. Salakhunov S. Rowes an Z. Ghahraan. On he converence o boun opzaon alorhs. In Proc. 9h Conerence n Unceran n Arcal Inellence paes 509V56 2003. [8] D. D. Lee an H. S. Seun. Alorhs or non-neave ar acorzaon. In.K. Leen.G. Deerch an V. resp eors Avances n Neural Inoraon Processn Sses 3 paes 556V562. MI Press Cabre 200. [9] C. B. Do Q. V. Le C. H. eo O. Chapelle an A. J. Sola. her bouns or srucure esaon. In Avances n Neural Inoraon Processn Sses 2 2009. o appear. [0]. Pha Dnh an L.. Hoa An. Conve analss approach o.c. proran: heor alorhs an applcaons. Aca Maheaca Venaca 22:289V355 997. [] R. Collober F. Snz J. Weson an L. Boou. Lare scale ransucve SVMs. Journal o Machne Learnn Research 7:687V72 2006. [2] Collober R. Weson J. Boou L. 2006. ran conve or scalabl. ICML06 23r Inernaonal Conerence on Machne Learnn. Psburh USA. [3] C.-N. J. Yu an. Joachs. Learnn srucural svs wh laen varables. In Inernaonal Conerence on Machne Learnn ICML 2009 [4] B. Srperubuur an G. Lanckre On he converence o he concave-conve proceure n Neural Inoraon Processn Sses 2009.