How do you search a high dimensional for the global maxima using as few samples as possible?
$begingroup$
Suppose the value at any point in the space is defined by Y = f(x1, x2 .. xk). For simplicity, we can assume that x takes only binary values. Which means that we have a total of 2^k possible values. I want to find the point in this k-dimensional space such that Y at this point is the highest.
The constraint lies in the cost of calculating Y. Because it is very 'expensive' to calculate Y, I want to do it as infrequently as possible. That being said, I have the ability to measure Y for any point in this k-dimensional space. I'm looking for a way to use only a small subset of values n, where n << 2^k and use it build a prediction model that extrapolates to the entire space
I've been able to do this by starting off with a set of randomly selected n points and using them to construct a regression tree. The prediction error is acceptable. But the size of n is still quite high.
Is there a more intelligent way to choose my n samples? What are some alternative approaches to extrapolate n measurements into the entire feature space?
If I'm willing to settle for the local maxima, how can I find it? Seems like a straight forward problem in linear algebra. But it's been ages and I could really use some help. TIA!
regression grid-search
asked 6 mins ago
user69058user69058
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Suppose the value at any point in the space is defined by Y = f(x1, x2 .. xk). For simplicity, we can assume that x takes only binary values. Which means that we have a total of 2^k possible values. I want to find the point in this k-dimensional space such that Y at this point is the highest.
The constraint lies in the cost of calculating Y. Because it is very 'expensive' to calculate Y, I want to do it as infrequently as possible. That being said, I have the ability to measure Y for any point in this k-dimensional space. I'm looking for a way to use only a small subset of values n, where n << 2^k and use it build a prediction model that extrapolates to the entire space
I've been able to do this by starting off with a set of randomly selected n points and using them to construct a regression tree. The prediction error is acceptable. But the size of n is still quite high.
Is there a more intelligent way to choose my n samples? What are some alternative approaches to extrapolate n measurements into the entire feature space?
If I'm willing to settle for the local maxima, how can I find it? Seems like a straight forward problem in linear algebra. But it's been ages and I could really use some help. TIA!
regression grid-search
asked 6 mins ago
user69058user69058
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
Suppose the value at any point in the space is defined by Y = f(x1, x2 .. xk). For simplicity, we can assume that x takes only binary values. Which means that we have a total of 2^k possible values. I want to find the point in this k-dimensional space such that Y at this point is the highest.
The constraint lies in the cost of calculating Y. Because it is very 'expensive' to calculate Y, I want to do it as infrequently as possible. That being said, I have the ability to measure Y for any point in this k-dimensional space. I'm looking for a way to use only a small subset of values n, where n << 2^k and use it build a prediction model that extrapolates to the entire space
I've been able to do this by starting off with a set of randomly selected n points and using them to construct a regression tree. The prediction error is acceptable. But the size of n is still quite high.
Is there a more intelligent way to choose my n samples? What are some alternative approaches to extrapolate n measurements into the entire feature space?
If I'm willing to settle for the local maxima, how can I find it? Seems like a straight forward problem in linear algebra. But it's been ages and I could really use some help. TIA!
regression grid-search
asked 6 mins ago
user69058user69058
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
Suppose the value at any point in the space is defined by Y = f(x1, x2 .. xk). For simplicity, we can assume that x takes only binary values. Which means that we have a total of 2^k possible values. I want to find the point in this k-dimensional space such that Y at this point is the highest.
The constraint lies in the cost of calculating Y. Because it is very 'expensive' to calculate Y, I want to do it as infrequently as possible. That being said, I have the ability to measure Y for any point in this k-dimensional space. I'm looking for a way to use only a small subset of values n, where n << 2^k and use it build a prediction model that extrapolates to the entire space
I've been able to do this by starting off with a set of randomly selected n points and using them to construct a regression tree. The prediction error is acceptable. But the size of n is still quite high.
Is there a more intelligent way to choose my n samples? What are some alternative approaches to extrapolate n measurements into the entire feature space?
If I'm willing to settle for the local maxima, how can I find it? Seems like a straight forward problem in linear algebra. But it's been ages and I could really use some help. TIA!
regression grid-search
regression grid-search
asked 6 mins ago
user69058user69058
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 6 mins ago
user69058user69058
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 6 mins ago
user69058user69058
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 6 mins ago
user69058user69058
1
asked 6 mins ago
user69058user69058
1
1
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
user69058 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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
});
}
});
user69058 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f46830%2fhow-do-you-search-a-high-dimensional-for-the-global-maxima-using-as-few-samples%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
user69058 is a new contributor. Be nice, and check out our Code of Conduct.
user69058 is a new contributor. Be nice, and check out our Code of Conduct.
user69058 is a new contributor. Be nice, and check out our Code of Conduct.
user69058 is a new contributor. Be nice, and check out our Code of Conduct.
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%2f46830%2fhow-do-you-search-a-high-dimensional-for-the-global-maxima-using-as-few-samples%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
