What is a Meta algorithm?Card-buying algorithmFast algorithm for matrix chain multiplication in special caseHow does the Vertex Cover algorithm by Chen et al find its tuples?What makes a metaheuristic meta?Order of growth definition from Reynolds & TymannSearching the best trading route - algorithmAlgorithm for weighted elliptic curve fitLongest-path in a graph, where the path should be 'straight'
On the meaning of 'anyways' in "What Exactly Is a Quartz Crystal, Anyways?"
Can a broken/split chain be reassembled?
Is it more effective to add yeast before or after kneading?
Worms crawling under skin
Is it right to extend flaps only in the white arc?
What is the need of methods like GET and POST in the HTTP protocol?
Writing a letter of recommendation for a mediocre student
Magneto 2 How to call Helper function in observer file
How to deal with my team leader who keeps calling me about project updates even though I am on leave for personal reasons?
What exactly did this mechanic sabotage on the American Airlines 737, and how dangerous was it?
How do you use the interjection for snorting?
What's the story to "WotC gave up on fixing Polymorph"?
Could Apollo astronauts see city lights from the moon?
Is this Portent-like spell balanced?
How use custom order in folder on Windows 7 and 10
Can the U.S. president make military decisions without consulting anyone?
How can I repair this gas leak on my new range? Teflon tape isn't working
Designing a time thief proof safe
What benefits does the Power Word Kill spell have?
Social leper versus social leopard
Is there any iPhone SE out there with 3D Touch?
Meaning of 小せェサル in the following sentence
Why weren't the Death Star plans transmitted electronically?
Does wetting a beer glass change the foam characteristics?
What is a Meta algorithm?
Card-buying algorithmFast algorithm for matrix chain multiplication in special caseHow does the Vertex Cover algorithm by Chen et al find its tuples?What makes a metaheuristic meta?Order of growth definition from Reynolds & TymannSearching the best trading route - algorithmAlgorithm for weighted elliptic curve fitLongest-path in a graph, where the path should be 'straight'
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
I am currently reading a survey paper on the multiplicative weight update meta-algorithm. I am not quite sure what they mean by "meta-algorithm". Is it simply a general algorithm that can be used for different purposes?
I couldn't find any exact definition for this term, though I have found examples of meta-algorithms such as Boosting in machine learning.
algorithms
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
$endgroup$
add a comment
|
$begingroup$
I am currently reading a survey paper on the multiplicative weight update meta-algorithm. I am not quite sure what they mean by "meta-algorithm". Is it simply a general algorithm that can be used for different purposes?
I couldn't find any exact definition for this term, though I have found examples of meta-algorithms such as Boosting in machine learning.
algorithms
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
$endgroup$
add a comment
|
$begingroup$
I am currently reading a survey paper on the multiplicative weight update meta-algorithm. I am not quite sure what they mean by "meta-algorithm". Is it simply a general algorithm that can be used for different purposes?
I couldn't find any exact definition for this term, though I have found examples of meta-algorithms such as Boosting in machine learning.
algorithms
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
$endgroup$
I am currently reading a survey paper on the multiplicative weight update meta-algorithm. I am not quite sure what they mean by "meta-algorithm". Is it simply a general algorithm that can be used for different purposes?
I couldn't find any exact definition for this term, though I have found examples of meta-algorithms such as Boosting in machine learning.
algorithms
algorithms
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
asked Apr 15 at 19:15
monadoboimonadoboi
1607 bronze badges
1607 bronze badges
add a comment
|
add a comment
|
2 Answers
2
active
oldest
votes
$begingroup$
I interpret it as meaning "algorithmic technique". It's a general framework that can be used to solve a number of problems.
Don't worry too much about the meaning of that phrase. It's not something with an accepted definition, and you don't need to understand it to gain the value from that survey paper; it's just a passing phrase. Instead, focus on understanding the ideas and technical results in the survey paper.
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
$endgroup$
4
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
1
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
add a comment
|
$begingroup$
The term "meta-algorithm" has a fairly well-accepted meaning in the context of learning theory, which is the field of research from which multiplicative weights originates.
Specifically, a meta-algorithm, in the context of learning theory, is an algorithm that decides how to take a set of other (typically, though not necessarily non-meta) "algorithms" (which might be as dumb as a constant output, for example), and constructs a new algorithm out of those, often by combining or weighting the outputs of the component algorithms. (Don't take this to be a canonical definition though.) Typically those component algorithms are viewed as black-boxes taking input and producing their output, with the inner workings hidden/irrelevant.
There are a number of examples of meta-algorithms. The referenced Multiplicative Weighting algorithm is one example. A particularly simple example is majority voting for an ensemble of binary classifiers: Suppose you have a bunch of binary classification algorithms, and you don't know how to pick a good one. You can just compute them all, and let them vote. Voting in this case is the meta-algorithm. Of course, this may not work very well, and you might want to do something like weighted voting, where the weight somehow scales with observed performance.
Just a few examples of meta-algorithms that I can think of at the moment:
- multiplicative weights
- weighted majority
- boosting
- bagging
- ensemble averaging, voting
- "Follow the Leader"
As always, you can find examples that blur the line between meta and not meta. For example, K-nearest neighbors could be considered a weighted voting/averaging of component algorithms, where every potential neighbor (i.e. the labeled points in the dataset) is its own component algorithm, having a constant output, and the weighting is a function of distance from the algorithm input.
answered May 22 at 2:37
beanbean
1211 bronze badge
$endgroup$
add a comment
|
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "419"
;
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/4.0/"u003ecc by-sa 4.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%2fcs.stackexchange.com%2fquestions%2f107003%2fwhat-is-a-meta-algorithm%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I interpret it as meaning "algorithmic technique". It's a general framework that can be used to solve a number of problems.
Don't worry too much about the meaning of that phrase. It's not something with an accepted definition, and you don't need to understand it to gain the value from that survey paper; it's just a passing phrase. Instead, focus on understanding the ideas and technical results in the survey paper.
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
$endgroup$
4
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
1
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
add a comment
|
$begingroup$
I interpret it as meaning "algorithmic technique". It's a general framework that can be used to solve a number of problems.
Don't worry too much about the meaning of that phrase. It's not something with an accepted definition, and you don't need to understand it to gain the value from that survey paper; it's just a passing phrase. Instead, focus on understanding the ideas and technical results in the survey paper.
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
$endgroup$
4
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
1
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
add a comment
|
$begingroup$
I interpret it as meaning "algorithmic technique". It's a general framework that can be used to solve a number of problems.
Don't worry too much about the meaning of that phrase. It's not something with an accepted definition, and you don't need to understand it to gain the value from that survey paper; it's just a passing phrase. Instead, focus on understanding the ideas and technical results in the survey paper.
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
$endgroup$
I interpret it as meaning "algorithmic technique". It's a general framework that can be used to solve a number of problems.
Don't worry too much about the meaning of that phrase. It's not something with an accepted definition, and you don't need to understand it to gain the value from that survey paper; it's just a passing phrase. Instead, focus on understanding the ideas and technical results in the survey paper.
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
answered Apr 15 at 20:10
D.W.♦D.W.
106k14 gold badges134 silver badges314 bronze badges
106k14 gold badges134 silver badges314 bronze badges
4
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
1
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
add a comment
|
4
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
1
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
4
4
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
$begingroup$
You know, for a field built on the ruthless exactness demanded by the machines we code, when it comes to communicating with fellow humans we're really, really bad at it.
$endgroup$
– corsiKa
Apr 16 at 4:13
1
1
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
$begingroup$
@corsiKa The implementer of humans followed Postel's principle (well half of it...) which makes it hard to tell when ambiguous or erroneous input is processed incorrectly. If communication with humans demanded ruthless exactness and had clear feedback of failure, I'm sure communication would be much more precise. However, Postel's principle leads to a need to maintain bug-compatibility so we can't expect it to be fixed in a future version. More seriously, I don't think computer scientists are particularly worse than average on this front.
$endgroup$
– Derek Elkins
Apr 16 at 6:15
add a comment
|
$begingroup$
The term "meta-algorithm" has a fairly well-accepted meaning in the context of learning theory, which is the field of research from which multiplicative weights originates.
Specifically, a meta-algorithm, in the context of learning theory, is an algorithm that decides how to take a set of other (typically, though not necessarily non-meta) "algorithms" (which might be as dumb as a constant output, for example), and constructs a new algorithm out of those, often by combining or weighting the outputs of the component algorithms. (Don't take this to be a canonical definition though.) Typically those component algorithms are viewed as black-boxes taking input and producing their output, with the inner workings hidden/irrelevant.
There are a number of examples of meta-algorithms. The referenced Multiplicative Weighting algorithm is one example. A particularly simple example is majority voting for an ensemble of binary classifiers: Suppose you have a bunch of binary classification algorithms, and you don't know how to pick a good one. You can just compute them all, and let them vote. Voting in this case is the meta-algorithm. Of course, this may not work very well, and you might want to do something like weighted voting, where the weight somehow scales with observed performance.
Just a few examples of meta-algorithms that I can think of at the moment:
- multiplicative weights
- weighted majority
- boosting
- bagging
- ensemble averaging, voting
- "Follow the Leader"
As always, you can find examples that blur the line between meta and not meta. For example, K-nearest neighbors could be considered a weighted voting/averaging of component algorithms, where every potential neighbor (i.e. the labeled points in the dataset) is its own component algorithm, having a constant output, and the weighting is a function of distance from the algorithm input.
answered May 22 at 2:37
beanbean
1211 bronze badge
$endgroup$
add a comment
|
$begingroup$
The term "meta-algorithm" has a fairly well-accepted meaning in the context of learning theory, which is the field of research from which multiplicative weights originates.
Specifically, a meta-algorithm, in the context of learning theory, is an algorithm that decides how to take a set of other (typically, though not necessarily non-meta) "algorithms" (which might be as dumb as a constant output, for example), and constructs a new algorithm out of those, often by combining or weighting the outputs of the component algorithms. (Don't take this to be a canonical definition though.) Typically those component algorithms are viewed as black-boxes taking input and producing their output, with the inner workings hidden/irrelevant.
There are a number of examples of meta-algorithms. The referenced Multiplicative Weighting algorithm is one example. A particularly simple example is majority voting for an ensemble of binary classifiers: Suppose you have a bunch of binary classification algorithms, and you don't know how to pick a good one. You can just compute them all, and let them vote. Voting in this case is the meta-algorithm. Of course, this may not work very well, and you might want to do something like weighted voting, where the weight somehow scales with observed performance.
Just a few examples of meta-algorithms that I can think of at the moment:
- multiplicative weights
- weighted majority
- boosting
- bagging
- ensemble averaging, voting
- "Follow the Leader"
As always, you can find examples that blur the line between meta and not meta. For example, K-nearest neighbors could be considered a weighted voting/averaging of component algorithms, where every potential neighbor (i.e. the labeled points in the dataset) is its own component algorithm, having a constant output, and the weighting is a function of distance from the algorithm input.
answered May 22 at 2:37
beanbean
1211 bronze badge
$endgroup$
add a comment
|
$begingroup$
The term "meta-algorithm" has a fairly well-accepted meaning in the context of learning theory, which is the field of research from which multiplicative weights originates.
Specifically, a meta-algorithm, in the context of learning theory, is an algorithm that decides how to take a set of other (typically, though not necessarily non-meta) "algorithms" (which might be as dumb as a constant output, for example), and constructs a new algorithm out of those, often by combining or weighting the outputs of the component algorithms. (Don't take this to be a canonical definition though.) Typically those component algorithms are viewed as black-boxes taking input and producing their output, with the inner workings hidden/irrelevant.
There are a number of examples of meta-algorithms. The referenced Multiplicative Weighting algorithm is one example. A particularly simple example is majority voting for an ensemble of binary classifiers: Suppose you have a bunch of binary classification algorithms, and you don't know how to pick a good one. You can just compute them all, and let them vote. Voting in this case is the meta-algorithm. Of course, this may not work very well, and you might want to do something like weighted voting, where the weight somehow scales with observed performance.
Just a few examples of meta-algorithms that I can think of at the moment:
- multiplicative weights
- weighted majority
- boosting
- bagging
- ensemble averaging, voting
- "Follow the Leader"
As always, you can find examples that blur the line between meta and not meta. For example, K-nearest neighbors could be considered a weighted voting/averaging of component algorithms, where every potential neighbor (i.e. the labeled points in the dataset) is its own component algorithm, having a constant output, and the weighting is a function of distance from the algorithm input.
answered May 22 at 2:37
beanbean
1211 bronze badge
$endgroup$
The term "meta-algorithm" has a fairly well-accepted meaning in the context of learning theory, which is the field of research from which multiplicative weights originates.
Specifically, a meta-algorithm, in the context of learning theory, is an algorithm that decides how to take a set of other (typically, though not necessarily non-meta) "algorithms" (which might be as dumb as a constant output, for example), and constructs a new algorithm out of those, often by combining or weighting the outputs of the component algorithms. (Don't take this to be a canonical definition though.) Typically those component algorithms are viewed as black-boxes taking input and producing their output, with the inner workings hidden/irrelevant.
There are a number of examples of meta-algorithms. The referenced Multiplicative Weighting algorithm is one example. A particularly simple example is majority voting for an ensemble of binary classifiers: Suppose you have a bunch of binary classification algorithms, and you don't know how to pick a good one. You can just compute them all, and let them vote. Voting in this case is the meta-algorithm. Of course, this may not work very well, and you might want to do something like weighted voting, where the weight somehow scales with observed performance.
Just a few examples of meta-algorithms that I can think of at the moment:
- multiplicative weights
- weighted majority
- boosting
- bagging
- ensemble averaging, voting
- "Follow the Leader"
As always, you can find examples that blur the line between meta and not meta. For example, K-nearest neighbors could be considered a weighted voting/averaging of component algorithms, where every potential neighbor (i.e. the labeled points in the dataset) is its own component algorithm, having a constant output, and the weighting is a function of distance from the algorithm input.
answered May 22 at 2:37
beanbean
1211 bronze badge
answered May 22 at 2:37
beanbean
1211 bronze badge
answered May 22 at 2:37
beanbean
1211 bronze badge
answered May 22 at 2:37
beanbean
1211 bronze badge
1211 bronze badge
add a comment
|
add a comment
|
Thanks for contributing an answer to Computer 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%2fcs.stackexchange.com%2fquestions%2f107003%2fwhat-is-a-meta-algorithm%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
