Finding optimal region of a continuous search space
$begingroup$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
New contributor
Jed 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$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
New contributor
Jed 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$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
New contributor
Jed is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm working on a problem in which I've got large table of data with two features and three target columns and I need to find the optimal filter parameters which theoretically would give me:
1) most preferable target distribution, i.e. highest mean & smallest std on positive target columns and the lowest mean and smallest std on negative target columns
2) largest subset possible
the filtering is done on 2 columns only, so four possible parameters, i.e. min/max of each column and there are three columns which determine the 'character' of the target distribution
since the data is already tabular and continuous, I've just set up a grid search and then I scan for the global max, but as I'm doing this in 2D I can only evaluate on one of the three columns which determine actual character of the target distribution. evaluation of the results that this generates are less than optimal.
I have a sense that there is a much better way to formulate the problem, e.g. with decision trees or a probabilistic model perhaps, but I'm at a loss as to how to go about it. and as I'm new to this, I'm not sure even how to research the issue.
Anybody have direction or suggestions about how to better approach this?
decision-trees optimization probabilistic-programming
decision-trees optimization probabilistic-programming
New contributor
Jed is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Jed is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Jed is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked yesterday
JedJed
62
62
New contributor
Jed is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Jed is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Jed 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
});
}
});
Jed 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%2f48945%2ffinding-optimal-region-of-a-continuous-search-space%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
Jed is a new contributor. Be nice, and check out our Code of Conduct.
Jed is a new contributor. Be nice, and check out our Code of Conduct.
Jed is a new contributor. Be nice, and check out our Code of Conduct.
Jed 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%2f48945%2ffinding-optimal-region-of-a-continuous-search-space%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