Will larger inputs in one-hot encoding make more balance within weights?
$begingroup$
I was thinking if I have an input which has 36 possible values, and I make it as 36 inputs where exactly one of them is non 0, what is optimal value for each of the non 0 inputs?
It may be:
[1, 0, 0,....,0]
[0, 1, 0,....,0]
[0, 0, 1,....,0]
Or:
[36, 0, 0,....,0]
[0, 36, 0,....,0]
[0, 0, 36,....,0]
Or even:
[6, 0, 0,....,0]
[0, 6, 0,....,0]
[0, 0, 6,....,0]
In order this feature to have same impact on the network as any other feature with N(0,1) distribution by keeping in mind I will use L1 or L2 regularization
So for each weight on a normal input I will have 36 weights on those one-hot inputs, so regarding L1 those weights should be 36 times smaller in order to have same impact? Don't they?
But then their total impact in affecting result is small since only one of them is being multiplied by 1 and included in calculation...
So if you would be kind to explain this and convince me to use 1s instead 6s or 36s, please
neural-network feature-scaling
$endgroup$
add a comment |
$begingroup$
I was thinking if I have an input which has 36 possible values, and I make it as 36 inputs where exactly one of them is non 0, what is optimal value for each of the non 0 inputs?
It may be:
[1, 0, 0,....,0]
[0, 1, 0,....,0]
[0, 0, 1,....,0]
Or:
[36, 0, 0,....,0]
[0, 36, 0,....,0]
[0, 0, 36,....,0]
Or even:
[6, 0, 0,....,0]
[0, 6, 0,....,0]
[0, 0, 6,....,0]
In order this feature to have same impact on the network as any other feature with N(0,1) distribution by keeping in mind I will use L1 or L2 regularization
So for each weight on a normal input I will have 36 weights on those one-hot inputs, so regarding L1 those weights should be 36 times smaller in order to have same impact? Don't they?
But then their total impact in affecting result is small since only one of them is being multiplied by 1 and included in calculation...
So if you would be kind to explain this and convince me to use 1s instead 6s or 36s, please
neural-network feature-scaling
$endgroup$
add a comment |
$begingroup$
I was thinking if I have an input which has 36 possible values, and I make it as 36 inputs where exactly one of them is non 0, what is optimal value for each of the non 0 inputs?
It may be:
[1, 0, 0,....,0]
[0, 1, 0,....,0]
[0, 0, 1,....,0]
Or:
[36, 0, 0,....,0]
[0, 36, 0,....,0]
[0, 0, 36,....,0]
Or even:
[6, 0, 0,....,0]
[0, 6, 0,....,0]
[0, 0, 6,....,0]
In order this feature to have same impact on the network as any other feature with N(0,1) distribution by keeping in mind I will use L1 or L2 regularization
So for each weight on a normal input I will have 36 weights on those one-hot inputs, so regarding L1 those weights should be 36 times smaller in order to have same impact? Don't they?
But then their total impact in affecting result is small since only one of them is being multiplied by 1 and included in calculation...
So if you would be kind to explain this and convince me to use 1s instead 6s or 36s, please
neural-network feature-scaling
$endgroup$
I was thinking if I have an input which has 36 possible values, and I make it as 36 inputs where exactly one of them is non 0, what is optimal value for each of the non 0 inputs?
It may be:
[1, 0, 0,....,0]
[0, 1, 0,....,0]
[0, 0, 1,....,0]
Or:
[36, 0, 0,....,0]
[0, 36, 0,....,0]
[0, 0, 36,....,0]
Or even:
[6, 0, 0,....,0]
[0, 6, 0,....,0]
[0, 0, 6,....,0]
In order this feature to have same impact on the network as any other feature with N(0,1) distribution by keeping in mind I will use L1 or L2 regularization
So for each weight on a normal input I will have 36 weights on those one-hot inputs, so regarding L1 those weights should be 36 times smaller in order to have same impact? Don't they?
But then their total impact in affecting result is small since only one of them is being multiplied by 1 and included in calculation...
So if you would be kind to explain this and convince me to use 1s instead 6s or 36s, please
neural-network feature-scaling
neural-network feature-scaling
asked yesterday
Djura MarinkovDjura Marinkov
1064
1064
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "557"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f46272%2fwill-larger-inputs-in-one-hot-encoding-make-more-balance-within-weights%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Data Science Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdatascience.stackexchange.com%2fquestions%2f46272%2fwill-larger-inputs-in-one-hot-encoding-make-more-balance-within-weights%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown