364 views
2 2 votes
Let $M=I_n-\frac{1}{n}\mathbf{1}\mathbf{1}^T$, where $\mathbf{1}=(1,1,\dots,1)^T\in\mathbb{R}^n$.

Consider the optimization problem $\max_{x} (x^T A x)$ subject to $x^T x=1$.

The maximum value is $\_\_\_\_\_\_\_$.

2 Answers

0 0 votes

From PCA formulation, we know that

\[ \max_{x^T x=1} x^T M x = \lambda_{\max}(M) \]

So the problem reduces to finding the largest eigenvalue of \(M\).

Important property: Non-zero eigenvalues of \(AB\) and \(BA\) are the same.

Hence, non-zero eigenvalues of \(\mathbf{1}\mathbf{1}^T\) will be the same as \(\mathbf{1}^T\mathbf{1}\).


Notice that,  $ \mathbf{1}\mathbf{1}^T = \begin{bmatrix} 1 \\ 1 \\ \vdots \\ 1 \end{bmatrix} \begin{bmatrix} 1 & 1 & \dots & 1 \end{bmatrix} $, $ \mathbf{1}\mathbf{1}^T$ is a matrix of $n \times n $. 

And $ \mathbf{1}^T\mathbf{1} = \begin{bmatrix} 1 & 1 & \dots & 1 \end{bmatrix} \begin{bmatrix} 1 \\ 1 \\ \vdots \\ 1 \end{bmatrix} $, is scalar ( or think like a matrix of $1 \times 1$).

\[ \mathbf{1}^T\mathbf{1} = 1+1+\dots+1 = n \]

$ \mathbf{1}^T\mathbf{1} $ is a \(1\times1\) matrix (a scalar). Its only eigenvalue is \(n\).

Therefore, \(\mathbf{1}\mathbf{1}^T\) has exactly one non-zero eigenvalue: $ n $

All remaining eigenvalues of \(\mathbf{1}\mathbf{1}^T\) are \(0\).


Now consider $ M = I_n - \frac{1}{n}\mathbf{1}\mathbf{1}^T $

Scaling by \( \frac{1}{n} \) scales eigenvalues, so $ \frac{1}{n}\mathbf{1}\mathbf{1}^T $ has eigenvalues $ 1, 0, 0, \dots, 0 $

 

So eigenvalues of \(M\) are $1 \text{ (multiplicity } n-1), \quad 0 $

Hence the highest eigenvalue of \(M\) is $ \boxed{1} $.

Answer:
Position:
Show:

Related questions

0 0 votes
1 1 answer
339
339 views
GO Classes asked Feb 17
339 views
Consider a linear model $$y_{\text{pred}} = w^T x$$with Mean Absolute Error (MAE) loss and $L_2$ regularization..Given:\[\lambda = 0.20, \quad w = \begin{bmatrix} -3 \\ 4...
1 1 vote
1 1 answer
331
331 views
GO Classes asked Feb 16
331 views
Let $x_1,x_2,\dots,x_{100}$ be real-valued observations with sample mean$$\bar{x}=\frac{1}{100}\sum_{i=1}^{100}x_i$$The pairwise squared distance summation is $$S=\sum_{i...
1 1 vote
0 0 answers
256
256 views
GO Classes asked Feb 16
256 views
Consider a linear model $f(x)=wx$. Using stochastic gradient descent with learning rate $\lambda=0.10$, if at iteration $i$, $w_i=10.00$, then $w_{i+1}= \_\_\_\_\_$
3 3 votes
1 1 answer
287
287 views
GO Classes asked Feb 16
287 views
Consider a fully connected feedforward neural network with $30$ input neurons, a first hidden layer with $4$ neurons, a second hidden layer with $3$ neurons, and an outpu...