Hfrxdjt

What makes Graph invariants so useful/important?

Do airline pilots ever risk not hearing communication directed to them specifically, from traffic controllers?

What is the command to reset a PC without deleting any files

How old can references or sources in a thesis be?

Why don't electron-positron collisions release infinite energy?

Why does not dark matter gather and form celestial bodies?

How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?

How do we improve the relationship with a client software team that performs poorly and is becoming less collaborative?

What is the logic behind how bash tests for true/false?

Why doesn't Newton's third law mean a person bounces back to where they started when they hit the ground?

Can I interfere when another PC is about to be attacked?

Are tax years 2016 & 2017 back taxes deductible for tax year 2018?

Is there a minimum number of transactions in a block?

Why CLRS example on residual networks does not follows its formula?

Is it legal to have the "// (c) 2019 John Smith" header in all files when there are hundreds of contributors?

How to determine if window is maximised or minimised from bash script

What does "enim et" mean?

Example of a relative pronoun

Is there really no realistic way for a skeleton monster to move around without magic?

Prevent a directory in /tmp from being deleted

Infinite past with a beginning?

"which" command doesn't work / path of Safari?

Can a German sentence have two subjects?

Calculus Optimization - Point on graph closest to given point

How does on test regression for a subspace or matrix factorization?

0

$begingroup$

I've recently been reading a lot of papers and watching a lot of videos on both subspace learning, and matrix factorization. One thing is particularly eluding me though - how does any of this get tested?

Let's take, straight from Wikipedia, Matrix Factorization Non-Negative.

$$V = WH$$

So, you have a data matrix $V$. Your goal is to learn components $W$ and $H$, which when multiplied together, give a good approximation of $V$. This can be done by minimizing over $W$, $H$

$$| V - WH |$$

That seems fine so far. My problem, theoretically, is understanding when we want to apply this to a problem, like say Regression.

If you wanted to minimize:

$$Y - WH*B$$

How do you do this with a test point? I get confused here, because if we had, say a 100-user test set with 10 features. Then we do a 90/10 split, we get a size of $W*H$ that is different than the size of our test data.

Do people just plug the test data in directly when testing, in place of $W*H$, and just rely on those learned weights $B$?

regression linear-regression matrix-factorisation matrix

share|improve this question

edited 5 hours ago

Stephen Rauch

1,52551330

asked 6 hours ago

JibrilJibril

1111

$endgroup$

add a comment | 

0

$begingroup$

I've recently been reading a lot of papers and watching a lot of videos on both subspace learning, and matrix factorization. One thing is particularly eluding me though - how does any of this get tested?

Let's take, straight from Wikipedia, Matrix Factorization Non-Negative.

$$V = WH$$

So, you have a data matrix $V$. Your goal is to learn components $W$ and $H$, which when multiplied together, give a good approximation of $V$. This can be done by minimizing over $W$, $H$

$$| V - WH |$$

That seems fine so far. My problem, theoretically, is understanding when we want to apply this to a problem, like say Regression.

If you wanted to minimize:

$$Y - WH*B$$

How do you do this with a test point? I get confused here, because if we had, say a 100-user test set with 10 features. Then we do a 90/10 split, we get a size of $W*H$ that is different than the size of our test data.

Do people just plug the test data in directly when testing, in place of $W*H$, and just rely on those learned weights $B$?

regression linear-regression matrix-factorisation matrix

share|improve this question

edited 5 hours ago

Stephen Rauch

1,52551330

asked 6 hours ago

JibrilJibril

1111

$endgroup$

add a comment | 

$begingroup$

I've recently been reading a lot of papers and watching a lot of videos on both subspace learning, and matrix factorization. One thing is particularly eluding me though - how does any of this get tested?

Let's take, straight from Wikipedia, Matrix Factorization Non-Negative.

$$V = WH$$

So, you have a data matrix $V$. Your goal is to learn components $W$ and $H$, which when multiplied together, give a good approximation of $V$. This can be done by minimizing over $W$, $H$

$$| V - WH |$$

That seems fine so far. My problem, theoretically, is understanding when we want to apply this to a problem, like say Regression.

If you wanted to minimize:

$$Y - WH*B$$

How do you do this with a test point? I get confused here, because if we had, say a 100-user test set with 10 features. Then we do a 90/10 split, we get a size of $W*H$ that is different than the size of our test data.

Do people just plug the test data in directly when testing, in place of $W*H$, and just rely on those learned weights $B$?

regression linear-regression matrix-factorisation matrix

share|improve this question

edited 5 hours ago

Stephen Rauch

1,52551330

asked 6 hours ago

JibrilJibril

1111

$endgroup$

share|improve this question

edited 5 hours ago

Stephen Rauch

1,52551330

asked 6 hours ago

JibrilJibril

1111

share|improve this question

edited 5 hours ago

Stephen Rauch

1,52551330

asked 6 hours ago

JibrilJibril

1111

edited 5 hours ago

Stephen Rauch

1,52551330

edited 5 hours ago

Stephen Rauch

1,52551330

asked 6 hours ago

JibrilJibril

1111

asked 6 hours ago

JibrilJibril

1111