{"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/linear-warmup-with-linear-decay","slug":"linear-warmup-with-linear-decay","name":"Linear Warmup With Linear Decay","full_name":"Linear Warmup With Linear Decay","full_name_withheld":false,"description_markdown":"**Linear Warmup With Linear Decay** is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.","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":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Learning Rate Schedules","url":"/methods/category/learning-rate-schedules","pwc_aliases":[]}],"n_papers_tagged":7076,"archive_num_papers":7076,"papers_newest_first":[{"paper":null,"slug":"sara-selective-and-adaptive-retrieval","title":"SARA: Selective and Adaptive Retrieval-augmented Generation with Context Compression","date":"2025-07-08","arxiv_id":"2507.05633","n_code_links":0,"syntology":null},{"paper":null,"slug":"ai-generated-text-detection-using-instruction","title":"AI Generated Text Detection Using Instruction Fine-tuned Large Language and Transformer-Based Models","date":"2025-07-07","arxiv_id":"2507.05157","n_code_links":0,"syntology":null},{"paper":null,"slug":"cyberrag-an-agentic-rag-cyber-attack","title":"CyberRAG: An agentic RAG cyber attack classification and reporting tool","date":"2025-07-03","arxiv_id":"2507.02424","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-protocol-engineering-a-new-paradigm","title":"Knowledge Protocol Engineering: A New Paradigm for AI in Domain-Specific Knowledge Work","date":"2025-07-03","arxiv_id":"2507.02760","n_code_links":0,"syntology":null},{"paper":"/paper/robustness-of-misinformation-classification","slug":"robustness-of-misinformation-classification","title":"Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttack","date":"2025-06-30","arxiv_id":"2506.23661","n_code_links":1,"syntology":null},{"paper":"/paper/erarag-efficient-and-incremental-retrieval","slug":"erarag-efficient-and-incremental-retrieval","title":"EraRAG: Efficient and Incremental Retrieval Augmented Generation for Growing Corpora","date":"2025-06-26","arxiv_id":"2506.20963","n_code_links":1,"syntology":null},{"paper":null,"slug":"leveraging-llm-assisted-query-understanding","title":"Leveraging LLM-Assisted Query Understanding for Live Retrieval-Augmented Generation","date":"2025-06-26","arxiv_id":"2506.21384","n_code_links":0,"syntology":null},{"paper":"/paper/psylite-technical-report","slug":"psylite-technical-report","title":"PsyLite Technical Report","date":"2025-06-26","arxiv_id":"2506.21536","n_code_links":1,"syntology":null},{"paper":"/paper/response-quality-assessment-for-retrieval","slug":"response-quality-assessment-for-retrieval","title":"Response Quality Assessment for Retrieval-Augmented Generation via Conditional Conformal Factuality","date":"2025-06-26","arxiv_id":"2506.20978","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["n4feng/ResponseQualityAssessment"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"ai-assistants-to-enhance-and-exploit-the","title":"AI Assistants to Enhance and Exploit the PETSc Knowledge Base","date":"2025-06-25","arxiv_id":"2506.20608","n_code_links":0,"syntology":null},{"paper":null,"slug":"ccrs-a-zero-shot-llm-as-a-judge-framework-for","title":"CCRS: A Zero-Shot LLM-as-a-Judge Framework for Comprehensive RAG Evaluation","date":"2025-06-25","arxiv_id":"2506.20128","n_code_links":0,"syntology":null},{"paper":null,"slug":"engineering-rag-systems-for-real-world","title":"Engineering RAG Systems for Real-World Applications: Design, Development, and Evaluation","date":"2025-06-25","arxiv_id":"2506.20869","n_code_links":0,"syntology":null},{"paper":null,"slug":"knowledge-aware-diverse-reranking-for-cross","title":"Knowledge-Aware Diverse Reranking for Cross-Source Question Answering","date":"2025-06-25","arxiv_id":"2506.20476","n_code_links":0,"syntology":null},{"paper":null,"slug":"memento-note-taking-for-your-future-self","title":"Memento: Note-Taking for Your Future Self","date":"2025-06-25","arxiv_id":"2506.20642","n_code_links":0,"syntology":null},{"paper":null,"slug":"accurate-and-energy-efficient-local-retrieval","title":"Accurate and Energy Efficient: Local Retrieval-Augmented Generation Models Outperform Commercial Large Language Models in Medical Tasks","date":"2025-06-24","arxiv_id":"2506.20009","n_code_links":0,"syntology":null},{"paper":null,"slug":"controlled-retrieval-augmented-context","title":"Controlled Retrieval-augmented Context Evaluation for Long-form RAG","date":"2025-06-24","arxiv_id":"2506.20051","n_code_links":0,"syntology":null},{"paper":null,"slug":"inference-scaled-graphrag-improving-multi-hop","title":"Inference Scaled GraphRAG: Improving Multi Hop Question Answering on Knowledge Graphs","date":"2025-06-24","arxiv_id":"2506.19967","n_code_links":0,"syntology":null},{"paper":null,"slug":"kunlunbaizerag-reinforcement-learning-driven","title":"KunLunBaizeRAG: Reinforcement Learning Driven Inference Performance Leap for Large Language Models","date":"2025-06-24","arxiv_id":"2506.19466","n_code_links":0,"syntology":null},{"paper":null,"slug":"unlocking-insights-addressing-alcohol","title":"Unlocking Insights Addressing Alcohol Inference Mismatch through Database-Narrative Alignment","date":"2025-06-24","arxiv_id":"2506.19342","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-audio-centric-multi-task-learning","title":"An Audio-centric Multi-task Learning Framework for Streaming Ads Targeting on Spotify","date":"2025-06-23","arxiv_id":"2506.18735","n_code_links":0,"syntology":null},{"paper":null,"slug":"semantic-similarity-estimation-for-domain","title":"Semantic similarity estimation for domain specific data using BERT and other techniques","date":"2025-06-23","arxiv_id":"2506.18602","n_code_links":0,"syntology":null},{"paper":null,"slug":"t-cpdl-a-temporal-causal-probabilistic","title":"T-CPDL: A Temporal Causal Probabilistic Description Logic for Developing Logic-RAG Agent","date":"2025-06-23","arxiv_id":"2506.18559","n_code_links":0,"syntology":null},{"paper":null,"slug":"multimodal-political-bias-identification-and","title":"Multimodal Political Bias Identification and Neutralization","date":"2025-06-20","arxiv_id":"2506.17372","n_code_links":0,"syntology":null},{"paper":null,"slug":"do-we-talk-to-robots-like-therapists-and-do","title":"Do We Talk to Robots Like Therapists, and Do They Respond Accordingly? Language Alignment in AI Emotional Support","date":"2025-06-19","arxiv_id":"2506.16473","n_code_links":0,"syntology":null},{"paper":null,"slug":"reis-a-high-performance-and-energy-efficient","title":"REIS: A High-Performance and Energy-Efficient Retrieval System with In-Storage Processing","date":"2025-06-19","arxiv_id":"2506.16444","n_code_links":0,"syntology":null},{"paper":"/paper/cast-enhancing-code-retrieval-augmented","slug":"cast-enhancing-code-retrieval-augmented","title":"cAST: Enhancing Code Retrieval-Augmented Generation with Structural Chunking via Abstract Syntax Tree","date":"2025-06-18","arxiv_id":"2506.15655","n_code_links":1,"syntology":null},{"paper":null,"slug":"i-know-which-llm-wrote-your-code-last-summer","title":"I Know Which LLM Wrote Your Code Last Summer: LLM generated Code Stylometry for Authorship Attribution","date":"2025-06-18","arxiv_id":"2506.17323","n_code_links":0,"syntology":null},{"paper":null,"slug":"identifying-economic-narratives-in-large-text","title":"Identifying economic narratives in large text corpora -- An integrated approach using Large Language Models","date":"2025-06-18","arxiv_id":"2506.15041","n_code_links":0,"syntology":null},{"paper":null,"slug":"aviationllm-an-llm-based-knowledge-system-for","title":"AviationLLM: An LLM-based Knowledge System for Aviation Training","date":"2025-06-17","arxiv_id":"2506.14336","n_code_links":0,"syntology":null},{"paper":"/paper/lightweight-relevance-grader-in-rag","slug":"lightweight-relevance-grader-in-rag","title":"Lightweight Relevance Grader in RAG","date":"2025-06-17","arxiv_id":"2506.14084","n_code_links":1,"syntology":null},{"paper":null,"slug":"ragtifier-evaluating-rag-generation","title":"RAGtifier: Evaluating RAG Generation Approaches of State-of-the-Art RAG Systems for the SIGIR LiveRAG Competition","date":"2025-06-17","arxiv_id":"2506.14412","n_code_links":0,"syntology":null},{"paper":"/paper/scissor-mitigating-semantic-bias-through","slug":"scissor-mitigating-semantic-bias-through","title":"SCISSOR: Mitigating Semantic Bias through Cluster-Aware Siamese Networks for Robust Classification","date":"2025-06-17","arxiv_id":"2506.14587","n_code_links":1,"syntology":{"ran":0,"of":3,"n_ran_checked":0,"n_instrument":0,"unverified":3,"pointer_only":3,"phrase":"0 ran · 3 unverified","official":{"repos":["shuoyangtum/scissor"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"paper":"/paper/arctic-long-sequence-training-scalable-and","slug":"arctic-long-sequence-training-scalable-and","title":"Arctic Long Sequence Training: Scalable And Efficient Training For Multi-Million Token Sequences","date":"2025-06-16","arxiv_id":"2506.13996","n_code_links":2,"syntology":null},{"paper":"/paper/evaluating-large-language-models-for-phishing","slug":"evaluating-large-language-models-for-phishing","title":"Evaluating Large Language Models for Phishing Detection, Self-Consistency, Faithfulness, and Explainability","date":"2025-06-16","arxiv_id":"2506.13746","n_code_links":1,"syntology":null},{"paper":"/paper/ltrr-learning-to-rank-retrievers-for-llms","slug":"ltrr-learning-to-rank-retrievers-for-llms","title":"LTRR: Learning To Rank Retrievers for LLMs","date":"2025-06-16","arxiv_id":"2506.13743","n_code_links":1,"syntology":null},{"paper":"/paper/tree-based-text-retrieval-via-hierarchical","slug":"tree-based-text-retrieval-via-hierarchical","title":"Tree-Based Text Retrieval via Hierarchical Clustering in RAGFrameworks: Application on Taiwanese Regulations","date":"2025-06-16","arxiv_id":"2506.13607","n_code_links":1,"syntology":null},{"paper":null,"slug":"rethinking-hate-speech-detection-on-social","title":"Rethinking Hate Speech Detection on Social Media: Can LLMs Replace Traditional Models?","date":"2025-06-15","arxiv_id":"2506.12744","n_code_links":0,"syntology":null},{"paper":"/paper/flexrag-a-flexible-and-comprehensive","slug":"flexrag-a-flexible-and-comprehensive","title":"FlexRAG: A Flexible and Comprehensive Framework for Retrieval-Augmented Generation","date":"2025-06-14","arxiv_id":"2506.12494","n_code_links":1,"syntology":null},{"paper":null,"slug":"bias-amplification-in-rag-poisoning-knowledge","title":"Bias Amplification in RAG: Poisoning Knowledge Retrieval to Steer LLMs","date":"2025-06-13","arxiv_id":"2506.11415","n_code_links":0,"syntology":null},{"paper":null,"slug":"chunk-twice-embed-once-a-systematic-study-of","title":"Chunk Twice, Embed Once: A Systematic Study of Segmentation and Representation Trade-offs in Chemistry-Aware Retrieval-Augmented Generation","date":"2025-06-13","arxiv_id":"2506.17277","n_code_links":0,"syntology":null},{"paper":null,"slug":"dr-gpt-will-see-you-now-but-should-it","title":"Dr. GPT Will See You Now, but Should It? Exploring the Benefits and Harms of Large Language Models in Medical Diagnosis using Crowdsourced Clinical Cases","date":"2025-06-13","arxiv_id":"2506.13805","n_code_links":0,"syntology":null},{"paper":null,"slug":"2506-10330","title":"Augmenting Large Language Models with Static Code Analysis for Automated Code Quality Improvements","date":"2025-06-12","arxiv_id":"2506.10330","n_code_links":0,"syntology":null},{"paper":"/paper/ciir-liverag-2025-optimizing-multi-agent","slug":"ciir-liverag-2025-optimizing-multi-agent","title":"CIIR@LiveRAG 2025: Optimizing Multi-Agent Retrieval Augmented Generation through Self-Training","date":"2025-06-12","arxiv_id":"2506.10844","n_code_links":1,"syntology":null},{"paper":"/paper/constructing-and-evaluating-declarative-rag","slug":"constructing-and-evaluating-declarative-rag","title":"Constructing and Evaluating Declarative RAG Pipelines in PyTerrier","date":"2025-06-12","arxiv_id":"2506.10802","n_code_links":1,"syntology":null},{"paper":null,"slug":"reasoning-rag-via-system-1-or-system-2-a","title":"Reasoning RAG via System 1 or System 2: A Survey on Reasoning Agentic Retrieval-Augmented Generation for Industry Challenges","date":"2025-06-12","arxiv_id":"2506.10408","n_code_links":0,"syntology":null},{"paper":"/paper/tablerag-a-retrieval-augmented-generation","slug":"tablerag-a-retrieval-augmented-generation","title":"TableRAG: A Retrieval Augmented Generation Framework for Heterogeneous Document Reasoning","date":"2025-06-12","arxiv_id":"2506.10380","n_code_links":1,"syntology":null},{"paper":null,"slug":"auto-compressing-networks","title":"Auto-Compressing Networks","date":"2025-06-11","arxiv_id":"2506.09714","n_code_links":0,"syntology":null},{"paper":"/paper/learning-efficient-and-generalizable-graph","slug":"learning-efficient-and-generalizable-graph","title":"Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering","date":"2025-06-11","arxiv_id":"2506.09645","n_code_links":1,"syntology":null},{"paper":"/paper/llm-powered-cpi-prediction-inference-with","slug":"llm-powered-cpi-prediction-inference-with","title":"LLM-Powered CPI Prediction Inference with Online Text Time Series","date":"2025-06-11","arxiv_id":"2506.09516","n_code_links":1,"syntology":null},{"paper":null,"slug":"measuring-corporate-human-capital-disclosures","title":"Measuring Corporate Human Capital Disclosures: Lexicon, Data, Code, and Research Opportunities","date":"2025-06-11","arxiv_id":"2506.10155","n_code_links":0,"syntology":null},{"paper":null,"slug":"you-are-what-you-say-exploiting-linguistic","title":"You Are What You Say: Exploiting Linguistic Content for VoicePrivacy Attacks","date":"2025-06-11","arxiv_id":"2506.09521","n_code_links":0,"syntology":null},{"paper":"/paper/2506-10030","slug":"2506-10030","title":"Safeguarding Multimodal Knowledge Copyright in the RAG-as-a-Service Environment","date":"2025-06-10","arxiv_id":"2506.10030","n_code_links":1,"syntology":null},{"paper":null,"slug":"cc-rag-structured-multi-hop-reasoning-via","title":"CC-RAG: Structured Multi-Hop Reasoning via Theme-Based Causal Graphs","date":"2025-06-10","arxiv_id":"2506.08364","n_code_links":0,"syntology":null},{"paper":"/paper/dragged-into-conflicts-detecting-and","slug":"dragged-into-conflicts-detecting-and","title":"DRAGged into Conflicts: Detecting and Addressing Conflicting Sources in Search-Augmented LLMs","date":"2025-06-10","arxiv_id":"2506.08500","n_code_links":1,"syntology":null},{"paper":"/paper/faithfulrag-fact-level-conflict-modeling-for","slug":"faithfulrag-fact-level-conflict-modeling-for","title":"FaithfulRAG: Fact-Level Conflict Modeling for Context-Faithful Retrieval-Augmented Generation","date":"2025-06-10","arxiv_id":"2506.08938","n_code_links":1,"syntology":null},{"paper":"/paper/fedrag-a-framework-for-fine-tuning-retrieval","slug":"fedrag-a-framework-for-fine-tuning-retrieval","title":"FedRAG: A Framework for Fine-Tuning Retrieval-Augmented Generation Systems","date":"2025-06-10","arxiv_id":"2506.09200","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-predictive-brain-neural-correlates-of","title":"The Predictive Brain: Neural Correlates of Word Expectancy Align with Large Language Model Prediction Probabilities","date":"2025-06-10","arxiv_id":"2506.08511","n_code_links":0,"syntology":null},{"paper":"/paper/xgraphrag-interactive-visual-analysis-for","slug":"xgraphrag-interactive-visual-analysis-for","title":"XGraphRAG: Interactive Visual Analysis for Graph-based Retrieval-Augmented Generation","date":"2025-06-10","arxiv_id":"2506.13782","n_code_links":1,"syntology":null},{"paper":null,"slug":"benchmarking-foundation-speech-and-language","title":"Benchmarking Foundation Speech and Language Models for Alzheimer's Disease and Related Dementia Detection from Spontaneous Speech","date":"2025-06-09","arxiv_id":"2506.11119","n_code_links":0,"syntology":null},{"paper":"/paper/hierarchical-lexical-graph-for-enhanced-multi","slug":"hierarchical-lexical-graph-for-enhanced-multi","title":"Hierarchical Lexical Graph for Enhanced Multi-Hop Retrieval","date":"2025-06-09","arxiv_id":"2506.08074","n_code_links":1,"syntology":null},{"paper":null,"slug":"knowledge-compression-via-question-generation","title":"Knowledge Compression via Question Generation: Enhancing Multihop Document Retrieval without Fine-tuning","date":"2025-06-09","arxiv_id":"2506.13778","n_code_links":0,"syntology":null},{"paper":"/paper/llamarec-lkg-rag-a-single-pass-learnable","slug":"llamarec-lkg-rag-a-single-pass-learnable","title":"LlamaRec-LKG-RAG: A Single-Pass, Learnable Knowledge Graph-RAG Framework for LLM-Based Ranking","date":"2025-06-09","arxiv_id":"2506.07449","n_code_links":1,"syntology":null},{"paper":null,"slug":"multilingual-hate-speech-detection-in-social","title":"Multilingual Hate Speech Detection in Social Media Using Translation-Based Approaches with Large Language Models","date":"2025-06-09","arxiv_id":"2506.08147","n_code_links":0,"syntology":null},{"paper":null,"slug":"scenerag-scene-level-retrieval-augmented","title":"SceneRAG: Scene-level Retrieval-Augmented Generation for Video Understanding","date":"2025-06-09","arxiv_id":"2506.07600","n_code_links":0,"syntology":null},{"paper":"/paper/joint-gcg-unified-gradient-based-poisoning","slug":"joint-gcg-unified-gradient-based-poisoning","title":"Joint-GCG: Unified Gradient-Based Poisoning Attacks on Retrieval-Augmented Generation Systems","date":"2025-06-06","arxiv_id":"2506.06151","n_code_links":1,"syntology":null},{"paper":"/paper/when-to-use-graphs-in-rag-a-comprehensive","slug":"when-to-use-graphs-in-rag-a-comprehensive","title":"When to use Graphs in RAG: A Comprehensive Analysis for Graph Retrieval-Augmented Generation","date":"2025-06-06","arxiv_id":"2506.05690","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["graphrag-bench/graphrag-benchmark"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"design-of-intelligent-proofreading-system-for","title":"Design of intelligent proofreading system for English translation based on CNN and BERT","date":"2025-06-05","arxiv_id":"2506.04811","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-context-tuning-for-retrieval","title":"Dynamic Context Tuning for Retrieval-Augmented Generation: Enhancing Multi-Turn Planning and Tool Adaptation","date":"2025-06-05","arxiv_id":"2506.11092","n_code_links":0,"syntology":null},{"paper":"/paper/ecorag-evidentiality-guided-compression-for","slug":"ecorag-evidentiality-guided-compression-for","title":"ECoRAG: Evidentiality-guided Compression for Long Context RAG","date":"2025-06-05","arxiv_id":"2506.05167","n_code_links":1,"syntology":null},{"paper":null,"slug":"grapheme-coherent-phonemic-and-prosodic","title":"Grapheme-Coherent Phonemic and Prosodic Annotation of Speech by Implicit and Explicit Grapheme Conditioning","date":"2025-06-05","arxiv_id":"2506.04527","n_code_links":0,"syntology":null},{"paper":"/paper/knowledgeable-r1-policy-optimization-for","slug":"knowledgeable-r1-policy-optimization-for","title":"Knowledgeable-r1: Policy Optimization for Knowledge Exploration in Retrieval-Augmented Generation","date":"2025-06-05","arxiv_id":"2506.05154","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":0,"n_instrument":3,"unverified":2,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","official":{"repos":["lcy80366872/knowledgeable-r1"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/lotusfilter-fast-diverse-nearest-neighbor-1","slug":"lotusfilter-fast-diverse-nearest-neighbor-1","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","date":"2025-06-05","arxiv_id":"2506.04790","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":0,"n_instrument":3,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["matsui528/lotf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/mathematical-reasoning-for-unmanned-aerial","slug":"mathematical-reasoning-for-unmanned-aerial","title":"Mathematical Reasoning for Unmanned Aerial Vehicles: A RAG-Based Approach for Complex Arithmetic Reasoning","date":"2025-06-05","arxiv_id":"2506.04998","n_code_links":1,"syntology":null},{"paper":"/paper/micro-act-mitigate-knowledge-conflict-in","slug":"micro-act-mitigate-knowledge-conflict-in","title":"Micro-Act: Mitigate Knowledge Conflict in Question Answering via Actionable Self-Reasoning","date":"2025-06-05","arxiv_id":"2506.05278","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-automating-security-policies-with","title":"On Automating Security Policies with Contemporary LLMs","date":"2025-06-05","arxiv_id":"2506.04838","n_code_links":0,"syntology":null},{"paper":"/paper/predicting-icu-in-hospital-mortality-using","slug":"predicting-icu-in-hospital-mortality-using","title":"Predicting ICU In-Hospital Mortality Using Adaptive Transformer Layer Fusion","date":"2025-06-05","arxiv_id":"2506.04924","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-ntnu-system-at-the-s-i-challenge-2025-sla","title":"The NTNU System at the S&I Challenge 2025 SLA Open Track","date":"2025-06-05","arxiv_id":"2506.05121","n_code_links":0,"syntology":null},{"paper":null,"slug":"magic-mushroom-a-customizable-benchmark-for","title":"Magic Mushroom: A Customizable Benchmark for Fine-grained Analysis of Retrieval Noise Erosion in RAG Systems","date":"2025-06-04","arxiv_id":"2506.03901","n_code_links":0,"syntology":null},{"paper":"/paper/r-search-empowering-llm-reasoning-with-search","slug":"r-search-empowering-llm-reasoning-with-search","title":"R-Search: Empowering LLM Reasoning with Search via Multi-Reward Reinforcement Learning","date":"2025-06-04","arxiv_id":"2506.04185","n_code_links":1,"syntology":null},{"paper":"/paper/tracllm-a-generic-framework-for-attributing","slug":"tracllm-a-generic-framework-for-attributing","title":"TracLLM: A Generic Framework for Attributing Long Context LLMs","date":"2025-06-04","arxiv_id":"2506.04202","n_code_links":1,"syntology":null},{"paper":null,"slug":"2506-03100","title":"Retrieval-Augmented Generation as Noisy In-Context Learning: A Unified Theory and Risk Bounds","date":"2025-06-03","arxiv_id":"2506.03100","n_code_links":0,"syntology":null},{"paper":null,"slug":"core-mmrag-cross-source-knowledge","title":"CoRe-MMRAG: Cross-Source Knowledge Reconciliation for Multimodal RAG","date":"2025-06-03","arxiv_id":"2506.02544","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-automatic-pt-tagging-for-medline","title":"Enhancing Automatic PT Tagging for MEDLINE Citations Using Transformer-Based Models","date":"2025-06-03","arxiv_id":"2506.03321","n_code_links":0,"syntology":null},{"paper":null,"slug":"rethinking-the-effects-of-data-contamination","title":"Rethinking the effects of data contamination in Code Intelligence","date":"2025-06-03","arxiv_id":"2506.02791","n_code_links":0,"syntology":null},{"paper":null,"slug":"hybrid-ai-for-responsive-multi-turn-online","title":"Hybrid AI for Responsive Multi-Turn Online Conversations with Novel Dynamic Routing and Feedback Adaptation","date":"2025-06-02","arxiv_id":"2506.02097","n_code_links":0,"syntology":null},{"paper":null,"slug":"llms-as-world-models-data-driven-and-human","title":"LLMs as World Models: Data-Driven and Human-Centered Pre-Event Simulation for Disaster Impact Assessment","date":"2025-06-02","arxiv_id":"2506.06355","n_code_links":0,"syntology":null},{"paper":null,"slug":"retrieval-augmented-generation-of-ontologies","title":"Retrieval-Augmented Generation of Ontologies from Relational Databases","date":"2025-06-02","arxiv_id":"2506.01232","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-graph-retrieval-augmented-generation","title":"A Graph-Retrieval-Augmented Generation Framework Enhances Decision-Making in the Circular Economy","date":"2025-06-01","arxiv_id":"2506.04252","n_code_links":0,"syntology":null},{"paper":"/paper/rare-retrieval-aware-robustness-evaluation","slug":"rare-retrieval-aware-robustness-evaluation","title":"RARE: Retrieval-Aware Robustness Evaluation for Retrieval-Augmented Generation Systems","date":"2025-06-01","arxiv_id":"2506.00789","n_code_links":1,"syntology":null},{"paper":null,"slug":"finbert2-a-specialized-bidirectional-encoder","title":"FinBERT2: A Specialized Bidirectional Encoder for Bridging the Gap in Finance-Specific Deployment of Large Language Models","date":"2025-05-31","arxiv_id":"2506.06335","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversarial-threat-vectors-and-risk","title":"Adversarial Threat Vectors and Risk Mitigation for Retrieval-Augmented Generation Systems","date":"2025-05-30","arxiv_id":"2506.00281","n_code_links":0,"syntology":null},{"paper":"/paper/clueanchor-clue-anchored-knowledge-reasoning","slug":"clueanchor-clue-anchored-knowledge-reasoning","title":"ClueAnchor: Clue-Anchored Knowledge Reasoning Exploration and Optimization for Retrieval-Augmented Generation","date":"2025-05-30","arxiv_id":"2505.24388","n_code_links":1,"syntology":null},{"paper":null,"slug":"e-2graphrag-streamlining-graph-based-rag-for","title":"E^2GraphRAG: Streamlining Graph-based RAG for High Efficiency and Effectiveness","date":"2025-05-30","arxiv_id":"2505.24226","n_code_links":0,"syntology":null},{"paper":null,"slug":"interpretable-phenotyping-of-heart-failure","title":"Interpretable phenotyping of Heart Failure patients with Dutch discharge letters","date":"2025-05-30","arxiv_id":"2505.24619","n_code_links":0,"syntology":null},{"paper":null,"slug":"lpass-linear-probes-as-stepping-stones-for","title":"LPASS: Linear Probes as Stepping Stones for vulnerability detection using compressed LLMs","date":"2025-05-30","arxiv_id":"2505.24451","n_code_links":0,"syntology":null},{"paper":null,"slug":"realdrive-retrieval-augmented-driving-with","title":"RealDrive: Retrieval-Augmented Driving with Diffusion Models","date":"2025-05-30","arxiv_id":"2505.24808","n_code_links":0,"syntology":null},{"paper":null,"slug":"bridging-the-gap-between-semantic-and-user","title":"Bridging the Gap Between Semantic and User Preference Spaces for Multi-modal Music Representation Learning","date":"2025-05-29","arxiv_id":"2505.23298","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-efficient-meta-models-for-evaluation-of","title":"Data-efficient Meta-models for Evaluation of Context-based Questions and Answers in LLMs","date":"2025-05-29","arxiv_id":"2505.23299","n_code_links":0,"syntology":null},{"paper":"/paper/evaluating-ai-capabilities-in-detecting","slug":"evaluating-ai-capabilities-in-detecting","title":"Evaluating AI capabilities in detecting conspiracy theories on YouTube","date":"2025-05-29","arxiv_id":"2505.23570","n_code_links":1,"syntology":null},{"paper":null,"slug":"mcp-safety-training-learning-to-refuse","title":"MCP Safety Training: Learning to Refuse Falsely Benign MCP Exploits using Improved Preference Alignment","date":"2025-05-29","arxiv_id":"2505.23634","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":7076,"with_a_code_link":2913,"where_syntology_ran_a_sample":650,"not_listed_spam_title":0,"listed":7076,"listed_where_code_ran":650,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":515,"every_run_a_failure_of_syntologys_instrument":135,"listed_with_a_run_with_no_instrument_failure":515,"listed_every_run_a_failure_of_syntologys_instrument":135,"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":650,"papers_where_code_ran_first_page":"/method/linear-warmup-with-linear-decay/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":"archive","page":2,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/2","json":"/method/linear-warmup-with-linear-decay/papers/2.json","rows":100},{"order":"archive","page":3,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/3","json":"/method/linear-warmup-with-linear-decay/papers/3.json","rows":100},{"order":"archive","page":4,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/4","json":"/method/linear-warmup-with-linear-decay/papers/4.json","rows":100},{"order":"archive","page":5,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/5","json":"/method/linear-warmup-with-linear-decay/papers/5.json","rows":100},{"order":"archive","page":6,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/6","json":"/method/linear-warmup-with-linear-decay/papers/6.json","rows":100},{"order":"archive","page":7,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/7","json":"/method/linear-warmup-with-linear-decay/papers/7.json","rows":100},{"order":"archive","page":8,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/8","json":"/method/linear-warmup-with-linear-decay/papers/8.json","rows":100},{"order":"archive","page":9,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/9","json":"/method/linear-warmup-with-linear-decay/papers/9.json","rows":100},{"order":"archive","page":10,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/10","json":"/method/linear-warmup-with-linear-decay/papers/10.json","rows":100},{"order":"archive","page":11,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/11","json":"/method/linear-warmup-with-linear-decay/papers/11.json","rows":100},{"order":"archive","page":12,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/12","json":"/method/linear-warmup-with-linear-decay/papers/12.json","rows":100},{"order":"archive","page":13,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/13","json":"/method/linear-warmup-with-linear-decay/papers/13.json","rows":100},{"order":"archive","page":14,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/14","json":"/method/linear-warmup-with-linear-decay/papers/14.json","rows":100},{"order":"archive","page":15,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/15","json":"/method/linear-warmup-with-linear-decay/papers/15.json","rows":100},{"order":"archive","page":16,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/16","json":"/method/linear-warmup-with-linear-decay/papers/16.json","rows":100},{"order":"archive","page":17,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/17","json":"/method/linear-warmup-with-linear-decay/papers/17.json","rows":100},{"order":"archive","page":18,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/18","json":"/method/linear-warmup-with-linear-decay/papers/18.json","rows":100},{"order":"archive","page":19,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/19","json":"/method/linear-warmup-with-linear-decay/papers/19.json","rows":100},{"order":"archive","page":20,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/20","json":"/method/linear-warmup-with-linear-decay/papers/20.json","rows":100},{"order":"archive","page":21,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/21","json":"/method/linear-warmup-with-linear-decay/papers/21.json","rows":100},{"order":"archive","page":22,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/22","json":"/method/linear-warmup-with-linear-decay/papers/22.json","rows":100},{"order":"archive","page":23,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/23","json":"/method/linear-warmup-with-linear-decay/papers/23.json","rows":100},{"order":"archive","page":24,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/24","json":"/method/linear-warmup-with-linear-decay/papers/24.json","rows":100},{"order":"archive","page":25,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/25","json":"/method/linear-warmup-with-linear-decay/papers/25.json","rows":100},{"order":"archive","page":26,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/26","json":"/method/linear-warmup-with-linear-decay/papers/26.json","rows":100},{"order":"archive","page":27,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/27","json":"/method/linear-warmup-with-linear-decay/papers/27.json","rows":100},{"order":"archive","page":28,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/28","json":"/method/linear-warmup-with-linear-decay/papers/28.json","rows":100},{"order":"archive","page":29,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/29","json":"/method/linear-warmup-with-linear-decay/papers/29.json","rows":100},{"order":"archive","page":30,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/30","json":"/method/linear-warmup-with-linear-decay/papers/30.json","rows":100},{"order":"archive","page":31,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/31","json":"/method/linear-warmup-with-linear-decay/papers/31.json","rows":100},{"order":"archive","page":32,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/32","json":"/method/linear-warmup-with-linear-decay/papers/32.json","rows":100},{"order":"archive","page":33,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/33","json":"/method/linear-warmup-with-linear-decay/papers/33.json","rows":100},{"order":"archive","page":34,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/34","json":"/method/linear-warmup-with-linear-decay/papers/34.json","rows":100},{"order":"archive","page":35,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/35","json":"/method/linear-warmup-with-linear-decay/papers/35.json","rows":100},{"order":"archive","page":36,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/36","json":"/method/linear-warmup-with-linear-decay/papers/36.json","rows":100},{"order":"archive","page":37,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/37","json":"/method/linear-warmup-with-linear-decay/papers/37.json","rows":100},{"order":"archive","page":38,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/38","json":"/method/linear-warmup-with-linear-decay/papers/38.json","rows":100},{"order":"archive","page":39,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/39","json":"/method/linear-warmup-with-linear-decay/papers/39.json","rows":100},{"order":"archive","page":40,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/40","json":"/method/linear-warmup-with-linear-decay/papers/40.json","rows":100},{"order":"archive","page":41,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/41","json":"/method/linear-warmup-with-linear-decay/papers/41.json","rows":100},{"order":"archive","page":42,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/42","json":"/method/linear-warmup-with-linear-decay/papers/42.json","rows":100},{"order":"archive","page":43,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/43","json":"/method/linear-warmup-with-linear-decay/papers/43.json","rows":100},{"order":"archive","page":44,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/44","json":"/method/linear-warmup-with-linear-decay/papers/44.json","rows":100},{"order":"archive","page":45,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/45","json":"/method/linear-warmup-with-linear-decay/papers/45.json","rows":100},{"order":"archive","page":46,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/46","json":"/method/linear-warmup-with-linear-decay/papers/46.json","rows":100},{"order":"archive","page":47,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/47","json":"/method/linear-warmup-with-linear-decay/papers/47.json","rows":100},{"order":"archive","page":48,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/48","json":"/method/linear-warmup-with-linear-decay/papers/48.json","rows":100},{"order":"archive","page":49,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/49","json":"/method/linear-warmup-with-linear-decay/papers/49.json","rows":100},{"order":"archive","page":50,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/50","json":"/method/linear-warmup-with-linear-decay/papers/50.json","rows":100},{"order":"archive","page":51,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/51","json":"/method/linear-warmup-with-linear-decay/papers/51.json","rows":100},{"order":"archive","page":52,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/52","json":"/method/linear-warmup-with-linear-decay/papers/52.json","rows":100},{"order":"archive","page":53,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/53","json":"/method/linear-warmup-with-linear-decay/papers/53.json","rows":100},{"order":"archive","page":54,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/54","json":"/method/linear-warmup-with-linear-decay/papers/54.json","rows":100},{"order":"archive","page":55,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/55","json":"/method/linear-warmup-with-linear-decay/papers/55.json","rows":100},{"order":"archive","page":56,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/56","json":"/method/linear-warmup-with-linear-decay/papers/56.json","rows":100},{"order":"archive","page":57,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/57","json":"/method/linear-warmup-with-linear-decay/papers/57.json","rows":100},{"order":"archive","page":58,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/58","json":"/method/linear-warmup-with-linear-decay/papers/58.json","rows":100},{"order":"archive","page":59,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/59","json":"/method/linear-warmup-with-linear-decay/papers/59.json","rows":100},{"order":"archive","page":60,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/60","json":"/method/linear-warmup-with-linear-decay/papers/60.json","rows":100},{"order":"archive","page":61,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/61","json":"/method/linear-warmup-with-linear-decay/papers/61.json","rows":100},{"order":"archive","page":62,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/62","json":"/method/linear-warmup-with-linear-decay/papers/62.json","rows":100},{"order":"archive","page":63,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/63","json":"/method/linear-warmup-with-linear-decay/papers/63.json","rows":100},{"order":"archive","page":64,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/64","json":"/method/linear-warmup-with-linear-decay/papers/64.json","rows":100},{"order":"archive","page":65,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/65","json":"/method/linear-warmup-with-linear-decay/papers/65.json","rows":100},{"order":"archive","page":66,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/66","json":"/method/linear-warmup-with-linear-decay/papers/66.json","rows":100},{"order":"archive","page":67,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/67","json":"/method/linear-warmup-with-linear-decay/papers/67.json","rows":100},{"order":"archive","page":68,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/68","json":"/method/linear-warmup-with-linear-decay/papers/68.json","rows":100},{"order":"archive","page":69,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/69","json":"/method/linear-warmup-with-linear-decay/papers/69.json","rows":100},{"order":"archive","page":70,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/70","json":"/method/linear-warmup-with-linear-decay/papers/70.json","rows":100},{"order":"archive","page":71,"of":71,"url":"/method/linear-warmup-with-linear-decay/papers/71","json":"/method/linear-warmup-with-linear-decay/papers/71.json","rows":76},{"order":"ran","page":1,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/1","json":"/method/linear-warmup-with-linear-decay/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/2","json":"/method/linear-warmup-with-linear-decay/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/3","json":"/method/linear-warmup-with-linear-decay/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/4","json":"/method/linear-warmup-with-linear-decay/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/5","json":"/method/linear-warmup-with-linear-decay/papers/ran/5.json","rows":100},{"order":"ran","page":6,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/6","json":"/method/linear-warmup-with-linear-decay/papers/ran/6.json","rows":100},{"order":"ran","page":7,"of":7,"url":"/method/linear-warmup-with-linear-decay/papers/ran/7","json":"/method/linear-warmup-with-linear-decay/papers/ran/7.json","rows":50}],"tasks":[{"task":"/task/rag","name":"RAG","papers":1279},{"task":"/task/retrieval","name":"Retrieval","papers":1261},{"task":"/task/language-modelling","name":"Language Modelling","papers":1149},{"task":"/task/retrieval-augmented-generation","name":"Retrieval-augmented Generation","papers":1086},{"task":"/task/language-modeling","name":"Language Modeling","papers":929},{"task":"/task/question-answering","name":"Question Answering","papers":765},{"task":"/task/sentence","name":"Sentence","papers":745},{"task":"/task/sentiment-analysis","name":"Sentiment Analysis","papers":412},{"task":"/task/text-classification","name":"Text Classification","papers":393},{"task":"/task/text-classification-1","name":"text-classification","papers":347},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":313},{"task":"/task/classification-1","name":"Classification","papers":266},{"task":"/task/word-embeddings","name":"Word Embeddings","papers":258},{"task":"/task/information-retrieval","name":"Information Retrieval","papers":244},{"task":"/task/named-entity-recognition-1","name":"Named Entity Recognition","papers":244},{"task":"/task/natural-language-understanding","name":"Natural Language Understanding","papers":235},{"task":"/task/named-entity-recognition","name":"named-entity-recognition","papers":234},{"task":"/task/named-entity-recognition-ner","name":"Named Entity Recognition (NER)","papers":231},{"task":"/task/large-language-model","name":"Large Language Model","papers":218},{"task":"/task/articles","name":"Articles","papers":197}],"tasks_shown":20,"n_tasks":1195,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":7},{"year":"2019","papers":580},{"year":"2020","papers":1248},{"year":"2021","papers":1334},{"year":"2022","papers":842},{"year":"2023","papers":859},{"year":"2024","papers":1390},{"year":"2025","papers":815}],"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/linear-warmup-with-linear-decay"},"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=Linear%20Warmup%20With%20Linear%20Decay","read_at":"2026-10-05T00:58:35+00:00","query":"Linear Warmup With Linear Decay","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":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Linear Warmup With Linear Decay' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["linear decay-to-zero (D2Z)","Time-Surface with Linear Time Decay (TSLTD)","Adaptive Memory Decay for Log-Linear Attention","Decay RNN","CGL-Linear","Linear-DPO","LT2-linear","LTSF-Linear"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"2e4e54147ea77f967eeb3fd09121388dcc2c6eec9377552874673aa1297b1d24","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}