{"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/url","slug":"url","name":"URL","full_name":"Umbrella Reinforcement Learning","full_name_withheld":false,"description_markdown":"A computationally efficient approach for solving hard nonlinear problems of reinforcement learning (RL). It combines umbrella sampling, from computational physics/chemistry, with optimal control methods. The approach is realized on the basis of neural networks, with the use of policy gradient. It outperforms, by computational efficiency and implementation universality, the available state-of-the-art algorithms, in application to hard RL problems with sparse reward, state traps and lack of terminal states. The proposed approach uses an ensemble of simultaneously acting agents, with a modified reward which includes the ensemble entropy, yielding an optimal exploration-exploitation balance.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems","paper":"/paper/umbrella-reinforcement-learning","first_author":"Egor E. Nuzhin","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/umbrella-reinforcement-learning"},"source":{"url":"https://arxiv.org/abs/2411.14117v1","title":"Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Offline Reinforcement Learning Methods","url":"/methods/category/offline-reinforcement-learning-methods","pwc_aliases":[]}],"n_papers_tagged":34,"archive_num_papers":35,"papers_newest_first":[{"paper":null,"slug":"phishkey-a-novel-centroid-based-approach-for","title":"PhishKey: A Novel Centroid-Based Approach for Enhanced Phishing Detection Using Adaptive HTML Component Extraction","date":"2025-06-26","arxiv_id":"2506.21106","n_code_links":0,"syntology":null},{"paper":null,"slug":"webguard-interpretable-malicious-url","title":"WebGuard++:Interpretable Malicious URL Detection via Bidirectional Fusion of HTML Subgraphs and Multi-Scale Convolutional BERT","date":"2025-06-24","arxiv_id":"2506.19356","n_code_links":0,"syntology":null},{"paper":null,"slug":"2506-10629","title":"Task Adaptation from Skills: Information Geometry, Disentanglement, and New Objectives for Unsupervised Reinforcement Learning","date":"2025-06-12","arxiv_id":"2506.10629","n_code_links":0,"syntology":null},{"paper":"/paper/open-captchaworld-a-comprehensive-web-based","slug":"open-captchaworld-a-comprehensive-web-based","title":"Open CaptchaWorld: A Comprehensive Web-based Platform for Testing and Benchmarking Multimodal LLM Agents","date":"2025-05-30","arxiv_id":"2505.24878","n_code_links":1,"syntology":null},{"paper":null,"slug":"multiphishguard-an-llm-based-multi-agent","title":"MultiPhishGuard: An LLM-based Multi-Agent System for Phishing Email Detection","date":"2025-05-26","arxiv_id":"2505.23803","n_code_links":0,"syntology":null},{"paper":null,"slug":"urls-help-topics-guide-understanding-metadata","title":"URLs Help, Topics Guide: Understanding Metadata Utility in LLM Training","date":"2025-05-22","arxiv_id":"2505.16570","n_code_links":0,"syntology":null},{"paper":"/paper/learning-better-representations-for-crowded","slug":"learning-better-representations-for-crowded","title":"Learning better representations for crowded pedestrians in offboard LiDAR-camera 3D tracking-by-detection","date":"2025-05-21","arxiv_id":"2505.16029","n_code_links":1,"syntology":null},{"paper":"/paper/streamline-without-sacrifice-squeeze-out","slug":"streamline-without-sacrifice-squeeze-out","title":"Streamline Without Sacrifice -- Squeeze out Computation Redundancy in LMM","date":"2025-05-21","arxiv_id":"2505.15816","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":1,"n_instrument":4,"unverified":4,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","official":{"repos":["penghao-wu/proxyv"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/do-not-change-me-on-transferring-entities","slug":"do-not-change-me-on-transferring-entities","title":"Do Not Change Me: On Transferring Entities Without Modification in Neural Machine Translation -- a Multilingual Perspective","date":"2025-05-09","arxiv_id":"2505.06010","n_code_links":2,"syntology":null},{"paper":"/paper/detecting-quishing-attacks-with-machine","slug":"detecting-quishing-attacks-with-machine","title":"Detecting Quishing Attacks with Machine Learning Techniques Through QR Code Analysis","date":"2025-05-06","arxiv_id":"2505.03451","n_code_links":1,"syntology":null},{"paper":null,"slug":"fill-the-gap-quantifying-and-reducing-the","title":"Fill the Gap: Quantifying and Reducing the Modality Gap in Image-Text Representation Learning","date":"2025-05-06","arxiv_id":"2505.03703","n_code_links":0,"syntology":null},{"paper":null,"slug":"helping-large-language-models-protect","title":"Helping Large Language Models Protect Themselves: An Enhanced Filtering and Summarization System","date":"2025-05-02","arxiv_id":"2505.01315","n_code_links":0,"syntology":null},{"paper":null,"slug":"phishing-url-detection-using-bi-lstm","title":"Phishing URL Detection using Bi-LSTM","date":"2025-04-29","arxiv_id":"2504.21049","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-gradient-optimized-tsk-fuzzy-framework-for","title":"A Gradient-Optimized TSK Fuzzy Framework for Explainable Phishing Detection","date":"2025-04-25","arxiv_id":"2504.18636","n_code_links":0,"syntology":null},{"paper":null,"slug":"from-past-to-present-a-survey-of-malicious","title":"From Past to Present: A Survey of Malicious URL Detection Techniques, Datasets and Code Repositories","date":"2025-04-23","arxiv_id":"2504.16449","n_code_links":0,"syntology":null},{"paper":null,"slug":"emerging-cyber-attack-risks-of-medical-ai","title":"Emerging Cyber Attack Risks of Medical AI Agents","date":"2025-04-02","arxiv_id":"2504.03759","n_code_links":0,"syntology":null},{"paper":"/paper/mooncast-high-quality-zero-shot-podcast","slug":"mooncast-high-quality-zero-shot-podcast","title":"MoonCast: High-Quality Zero-Shot Podcast Generation","date":"2025-03-18","arxiv_id":"2503.14345","n_code_links":1,"syntology":null},{"paper":"/paper/visualwebinstruct-scaling-up-multimodal","slug":"visualwebinstruct-scaling-up-multimodal","title":"VisualWebInstruct: Scaling up Multimodal Instruction Data through Web Search","date":"2025-03-13","arxiv_id":"2503.10582","n_code_links":1,"syntology":{"ran":9,"of":13,"n_ran_checked":9,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":"/paper/dongbamie-a-multimodal-information-extraction","slug":"dongbamie-a-multimodal-information-extraction","title":"DongbaMIE: A Multimodal Information Extraction Dataset for Evaluating Semantic Understanding of Dongba Pictograms","date":"2025-03-05","arxiv_id":"2503.03644","n_code_links":1,"syntology":null},{"paper":null,"slug":"phishvqc-optimizing-phishing-url-detection","title":"PhishVQC: Optimizing Phishing URL Detection with Correlation Based Feature Selection and Variational Quantum Classifier","date":"2025-03-03","arxiv_id":"2503.01799","n_code_links":0,"syntology":null},{"paper":"/paper/large-engagement-networks-for-classifying","slug":"large-engagement-networks-for-classifying","title":"Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends","date":"2025-03-01","arxiv_id":"2503.00599","n_code_links":1,"syntology":null},{"paper":"/paper/tag-pag-a-dedicated-tool-for-systematic-web","slug":"tag-pag-a-dedicated-tool-for-systematic-web","title":"Tag-Pag: A Dedicated Tool for Systematic Web Page Annotations","date":"2025-02-22","arxiv_id":"2502.16150","n_code_links":1,"syntology":null},{"paper":null,"slug":"cybersentinel-an-emergent-threat-detection","title":"CyberSentinel: An Emergent Threat Detection System for AI Security","date":"2025-02-20","arxiv_id":"2502.14966","n_code_links":0,"syntology":null},{"paper":"/paper/llm-agents-making-agent-tools","slug":"llm-agents-making-agent-tools","title":"LLM Agents Making Agent Tools","date":"2025-02-17","arxiv_id":"2502.11705","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-rising-threat-to-emerging-ai-powered","title":"Unsafe LLM-Based Search: Quantitative Analysis and Mitigation of Safety Risks in AI Web Search","date":"2025-02-07","arxiv_id":"2502.04951","n_code_links":0,"syntology":null},{"paper":"/paper/a-new-dataset-and-methodology-for-malicious","slug":"a-new-dataset-and-methodology-for-malicious","title":"A New Dataset and Methodology for Malicious URL Classification","date":"2024-12-31","arxiv_id":"2501.00356","n_code_links":1,"syntology":null},{"paper":"/paper/gdsg-graph-diffusion-based-solution","slug":"gdsg-graph-diffusion-based-solution","title":"GDSG: Graph Diffusion-based Solution Generator for Optimization Problems in MEC Networks","date":"2024-12-11","arxiv_id":"2412.08296","n_code_links":1,"syntology":null},{"paper":null,"slug":"domain-specific-question-answering-with","title":"Domain-specific Question Answering with Hybrid Search","date":"2024-12-04","arxiv_id":"2412.03736","n_code_links":0,"syntology":null},{"paper":"/paper/stain-aware-domain-alignment-for-imbalance","slug":"stain-aware-domain-alignment-for-imbalance","title":"Stain-aware Domain Alignment for Imbalance Blood Cell Classification","date":"2024-12-04","arxiv_id":"2412.02976","n_code_links":1,"syntology":null},{"paper":null,"slug":"large-multimodal-agents-for-accurate-phishing","title":"Large Multimodal Agents for Accurate Phishing Detection with Enhanced Token Optimization and Cost Reduction","date":"2024-12-03","arxiv_id":"2412.02301","n_code_links":0,"syntology":null},{"paper":"/paper/loco-low-contrast-enhanced-contrastive","slug":"loco-low-contrast-enhanced-contrastive","title":"Low-Contrast-Enhanced Contrastive Learning for Semi-Supervised Endoscopic Image Segmentation","date":"2024-12-03","arxiv_id":"2412.02314","n_code_links":1,"syntology":null},{"paper":null,"slug":"to-ensemble-or-not-assessing-majority-voting","title":"To Ensemble or Not: Assessing Majority Voting Strategies for Phishing Detection with Large Language Models","date":"2024-11-29","arxiv_id":"2412.00166","n_code_links":0,"syntology":null},{"paper":null,"slug":"face2qr-a-unified-framework-for-aesthetic","title":"Face2QR: A Unified Framework for Aesthetic, Face-Preserving, and Scannable QR Code Generation","date":"2024-11-28","arxiv_id":"2411.19246","n_code_links":0,"syntology":null},{"paper":"/paper/umbrella-reinforcement-learning","slug":"umbrella-reinforcement-learning","title":"Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems","date":"2024-11-21","arxiv_id":"2411.14117","n_code_links":1,"syntology":null}],"papers_shown":34,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":34,"with_a_code_link":16,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":34,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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":2,"papers_where_code_ran_first_page":"/method/url/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/url/papers/ran/1","json":"/method/url/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":3},{"task":"/task/benchmarking","name":"Benchmarking","papers":2},{"task":"/task/classification-1","name":"Classification","papers":2},{"task":"/task/zero-shot-learning","name":"Zero-Shot Learning","papers":2},{"task":null,"name":"zero-shot-classification","papers":2},{"task":"/task/3d-pedestrian-tracking","name":"3D Pedestrian Tracking","papers":1},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/binary-classification","name":"Binary Classification","papers":1},{"task":"/task/blocking","name":"Blocking","papers":1},{"task":"/task/code-generation","name":"Code Generation","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/disentanglement","name":"Disentanglement","papers":1},{"task":"/task/diversity","name":"Diversity","papers":1},{"task":"/task/efficient-exploration","name":"Efficient Exploration","papers":1},{"task":"/task/feature-importance","name":"Feature Importance","papers":1},{"task":"/task/graph-classification","name":"Graph Classification","papers":1},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":1},{"task":"/task/image-retrieval","name":"Image Retrieval","papers":1},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":1}],"tasks_shown":20,"n_tasks":50,"usage_by_year":[{"year":"2024","papers":9},{"year":"2025","papers":25}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/url"},"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=URL","read_at":"2026-10-05T01:03:31+00:00","query":"URL","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"URL","origin_arxiv_id":"2103.13841"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"2411.14117","repositories":{"listed":5,"in_graph":5,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2103.13841","citations":115},"leading_other_bearer":{"arxiv_id":"2307.03810","title":"URL: A Representation Learning Benchmark for Transferable Uncertainty Estimates","citations":20,"named_by":["title_prefix"],"bearer_name":"URL: A Representation Learning Benchmark for Transferable Uncertainty Estimates","ask_with":"have('2307.03810')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'URL', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"URL framework","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='URL framework')","origin_arxiv_id":"2306.05637"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2103.13841","page":"/paper/universal-representation-learning-from","syntology_url":"https://syntology.ai/paper/2103.13841","in_graph_layer":true,"samples":26,"ran":20,"n_ran_checked":9,"n_instrument":11,"unverified":6,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 11 where Syntology's instrument failed) · 6 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2103.13841: repository known, no verified implementation (declared_code; repositories: 5 listed of 5 in the graph, strongest link: official). About another paper: this answer is about arXiv:2103.13841, while the archive credits arXiv:2411.14117.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"d5f07caa3e20a8ba448b0ca111e05b33136cb0638c7b4c059788e28f1c13ca24","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}