{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/merl","slug":"merl","name":"MeRL","full_name":"Meta Reward Learning","full_name_withheld":false,"description_markdown":"**Meta Reward Learning (MeRL)** is a meta-learning method for the problem of learning from sparse and underspecified rewards. For example, an agent receives a complex input, such as a natural language instruction, and needs to generate a complex response, such as an action sequence, while only receiving binary success-failure feedback. The key insight of MeRL in dealing with underspecified rewards is that spurious trajectories and programs that achieve accidental success are detrimental to the agent's generalization performance. For example, an agent might be able to solve a specific instance of the maze problem above. However, if it learns to perform spurious actions during training, it is likely to fail when provided with unseen instructions. To mitigate this issue, MeRL optimizes a more refined auxiliary reward function, which can differentiate between accidental and purposeful success based on features of action trajectories. The auxiliary reward is optimized by maximizing the trained agent's performance on a hold-out validation set via meta learning.","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":"https://arxiv.org/abs/1902.07198v4","title":"Learning to Generalize from Sparse and Underspecified Rewards","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/google-research/google-research/tree/master/meta_reward_learning","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Meta-Learning Algorithms","url":"/methods/category/meta-learning-algorithms","pwc_aliases":[]}],"n_papers_tagged":10,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"joint-antenna-position-and-transmit-power","title":"Joint Antenna Position and Transmit Power Optimization for Pinching Antenna-Assisted ISAC Systems","date":"2025-03-17","arxiv_id":"2503.12872","n_code_links":0,"syntology":null},{"paper":"/paper/zero-shot-ecg-classification-with-multimodal","slug":"zero-shot-ecg-classification-with-multimodal","title":"Zero-Shot ECG Classification with Multimodal Learning and Test-time Clinical Knowledge Enhancement","date":"2024-03-11","arxiv_id":"2403.06659","n_code_links":2,"syntology":{"ran":8,"of":12,"n_ran_checked":5,"n_instrument":3,"unverified":4,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","official":{"repos":["cheliu-computation/merl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"jointly-learning-representations-for-map","title":"Jointly Learning Representations for Map Entities via Heterogeneous Graph Contrastive Learning","date":"2024-02-09","arxiv_id":"2402.06135","n_code_links":0,"syntology":null},{"paper":null,"slug":"hierarchical-attention-network-for-action-1","title":"Hierarchical Attention Network for Action Segmentation","date":"2020-05-07","arxiv_id":"2005.03209","n_code_links":0,"syntology":null},{"paper":null,"slug":"high-dimensional-control-using-generalized","title":"MERL: Multi-Head Reinforcement Learning","date":"2019-09-26","arxiv_id":"1909.11939","n_code_links":0,"syntology":null},{"paper":null,"slug":"coupled-generative-adversarial-network-for","title":"Coupled Generative Adversarial Network for Continuous Fine-grained Action Segmentation","date":"2019-09-20","arxiv_id":"1909.09283","n_code_links":0,"syntology":null},{"paper":null,"slug":"fine-grained-action-segmentation-using-the","title":"Fine-grained Action Segmentation using the Semi-Supervised Action GAN","date":"2019-09-20","arxiv_id":"1909.09269","n_code_links":0,"syntology":null},{"paper":null,"slug":"evolutionary-reinforcement-learning-for","title":"Evolutionary Reinforcement Learning for Sample-Efficient Multiagent Coordination","date":"2019-06-18","arxiv_id":"1906.07315","n_code_links":0,"syntology":null},{"paper":null,"slug":"follow-the-attention-combining-partial-pose","title":"Follow the Attention: Combining Partial Pose and Object Motion for Fine-Grained Action Detection","date":"2019-05-11","arxiv_id":"1905.04430","n_code_links":0,"syntology":null},{"paper":"/paper/learning-to-generalize-from-sparse-and","slug":"learning-to-generalize-from-sparse-and","title":"Learning to Generalize from Sparse and Underspecified Rewards","date":"2019-02-19","arxiv_id":"1902.07198","n_code_links":1,"syntology":null}],"papers_shown":10,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":10,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":10,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/merl/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/merl/papers/ran/1","json":"/method/merl/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/action-segmentation","name":"Action Segmentation","papers":3},{"task":null,"name":"Generative Adversarial Network","papers":3},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":2},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/segmentation","name":"Segmentation","papers":2},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":2},{"task":"/task/action-classification","name":"Action Classification","papers":1},{"task":"/task/action-detection","name":"Action Detection","papers":1},{"task":"/task/activity-detection","name":"Activity Detection","papers":1},{"task":"/task/activity-recognition","name":"Activity Recognition","papers":1},{"task":"/task/bayesian-optimization","name":"Bayesian Optimization","papers":1},{"task":"/task/clinical-knowledge","name":"Clinical Knowledge","papers":1},{"task":"/task/continuous-control","name":"Continuous Control","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/descriptive","name":"Descriptive","papers":1},{"task":"/task/diagnostic","name":"Diagnostic","papers":1},{"task":"/task/ecg-classification","name":"ECG Classification","papers":1},{"task":"/task/fine-grained-action-detection","name":"Fine-Grained Action Detection","papers":1},{"task":"/task/isac","name":"ISAC","papers":1}],"tasks_shown":20,"n_tasks":30,"usage_by_year":[{"year":"2019","papers":6},{"year":"2020","papers":1},{"year":"2024","papers":2},{"year":"2025","papers":1}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/merl"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=MeRL","read_at":"2026-10-05T00:59:03+00:00","query":"MeRL","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":false,"bearers_found":1,"served":null,"leading_other_bearer":{"arxiv_id":"aaai_17695","title":"MERL: Multimodal Event Representation Learning in Heterogeneous Embedding Spaces","citations":null,"named_by":["title_prefix"],"bearer_name":"MERL: Multimodal Event Representation Learning in Heterogeneous Embedding Spaces","ask_with":"have('aaai_17695')"},"n_other_bearers_listed":1,"note":"Nothing resolved to 'MeRL' by name, but 1 thing(s) here DECLARE that name -- most cited: the paper 'MERL: Multimodal Event Representation Learning in Heterogeneous Embedding Spaces' (arXiv:aaai_17695, citations not recorded). None of them is a well-cited bearer of the name, so this is still a coverage gap for any better-known sense -- they are listed so you can judge, not as a substitute."},"name_competition_text":"Nothing resolved to this name, but 1 entry in Syntology's graph carry it; the most cited is the paper “MERL: Multimodal Event Representation Learning in Heterogeneous Embedding Spaces” (the paper Syntology's graph keys as aaai_17695, citations not recorded). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a0990fbc991d8ebd79eafe66a38cf4b8d633c3578696c3510d7e7c2397ab2143","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}