






Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
This document from the opim 913 linear optimization course covers regression analysis, including the concepts of means and medians, least squares regression, least absolute deviation regression, and their connections with optimization. It also introduces a regression model for algorithm efficiency and discusses solving least absolute deviation regression via linear programming.
Typology: Study notes
1 / 12
This page cannot be seen from the preview
Don't miss anything!







Linear Optimization
Lecture 10
Regression
1
Means and Medians
Consider 1995 Adjusted Gross Incomes on Individual Tax Returns:
b 1 b 2 b 3... b (^) m − 1 b (^) m
$25,462 $45,110 $15,505... $33,265 $75,
Median:
x ˆ = b 1 + m 2
Mean:
x ¯ =
m
m ∑
i = 1
bi = $4,189,353,615,000/118,218,327 = $35,437.
Median’s Connection with Optimization
x ˆ = argmin x
m ∑
i = 1
| x − bi |.
Proof:
f ( x ) =
m ∑
i = 1
| x − bi |
f
′ ( x ) =
m ∑
i = 1
sgn (^) ( x − bi ) where sgn( x ) =
1 x > 0
0 x = 0
− 1 x < 0
= (# of b (^) i ’s smaller than x ) − (# of b (^) i ’s larger than x ).
If m is odd:
1
3
5
−
−
−
A Regression Model for Algorithm Efficiency
t = # of iterations
m = # of constraints
n = # of variables
Model:
t ≈ 2
α ( m + n )
β
Linearization: Take logs:
log t = α log 2 + β log( m + n ) +
↑
error (difference w/ model prediction)
Solve several (k) instances:
log t 1
log t 2 .. .
log t (^) k
log 2 log( m 1 + n 1 )
log 2 log( m 2 + n 2 ) .. .
log 2 log( m (^) k + n (^) k )
α
β
k
In matrix notation:
b = Ax +
Goal: find x that “minimizes” .
Least Absolute Deviation Regression
Definition: Manhattan Distance
‖ x ‖ 1 =
i
| x (^) i |
Least Absolute Deviation Regression:
x ˆ = argmin x ‖ b − Ax ‖ 1
Calculus (no explicit formula this time but iterative scheme):
f ( x ) = ‖ b − Ax ‖ 1 =
i
bi −
j
ai j x (^) j
∂ f
∂ x (^) k
( x ˆ) =
i
bi −
j ai j x ˆ (^) j ∣ ∣ ∣ bi −^
j ai j x ˆ (^) j
(− aik ) = 0 , k = 1 , 2 ,... , n
Rearranging,
i
aik bi
i ( x ˆ)
i
j
aik ai j x ˆ (^) j
( x ˆ)
, k = 1 , 2 ,... , n
In matrix notation,
T E ( x ˆ) b = A
T E ( x ˆ) A x ˆ
where
E ( x ˆ) = Diag(( x ˆ))
− 1
Assuming A
T E ( x ˆ) A is invertible,
x ˆ =
T E ( x ˆ ) A
T E ( x ˆ ) b, where E depends on ˆx
Least Absolute Deviation Regression—Continued
An implicit equation.
Can be solved using successive approximations:
x
0 = 0
x
T E ( x
0 ) A
T E ( x
0 ) b
x
T E ( x
1 ) A
T E ( x
1 ) b
.. .
x
T E ( x
k ) A
T E ( x
k ) b
.. .
x ˆ = lim k →∞
x
k
Primal–Dual Simplex Method
Thought experiment:
Least Squares Regression:
[ α¯
β^ ¯
⇒ T ≈ 0. 488 ( m + n )
Least Absolute Deviation Regression:
[ αˆ
β^ ˆ
⇒ T ≈ 0. 517 ( m + n )