{"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/cosine-annealing","slug":"cosine-annealing","name":"Cosine Annealing","full_name":"Cosine Annealing","full_name_withheld":false,"description_markdown":"**Cosine Annealing** is a type of learning rate schedule that has the effect of starting with a large learning rate that is relatively rapidly decreased to a minimum value before being increased rapidly again. The resetting of the learning rate acts like a simulated restart of the learning process and the re-use of good weights as the starting point of the restart is referred to as a \"warm restart\" in contrast to a \"cold restart\" where a new set of small random numbers may be used as a starting point.\r\n\r\n$$\\eta\\_{t} = \\eta\\_{min}^{i} + \\frac{1}{2}\\left(\\eta\\_{max}^{i}-\\eta\\_{min}^{i}\\right)\\left(1+\\cos\\left(\\frac{T\\_{cur}}{T\\_{i}}\\pi\\right)\\right)\r\n$$\r\n\r\nWhere where $\\eta\\_{min}^{i}$ and $ \\eta\\_{max}^{i}$ are ranges for the learning rate, and $T\\_{cur}$ account for how many epochs have been performed since the last restart.\r\n\r\nText Source: [Jason Brownlee](https://machinelearningmastery.com/snapshot-ensemble-deep-learning-neural-network/)\r\n\r\nImage Source: [Gao Huang](https://www.researchgate.net/figure/Training-loss-of-100-layer-DenseNet-on-CIFAR10-using-standard-learning-rate-blue-and-M_fig2_315765130)","description_state":"present","introduced_year":null,"introduced_by":{"title":"SGDR: Stochastic Gradient Descent with Warm Restarts","paper":"/paper/sgdr-stochastic-gradient-descent-with-warm","first_author":"Ilya Loshchilov","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/sgdr-stochastic-gradient-descent-with-warm"},"source":{"url":"http://arxiv.org/abs/1608.03983v5","title":"SGDR: Stochastic Gradient Descent with Warm Restarts","url_on_a_paper_host":true},"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":3965,"archive_num_papers":3965,"papers_newest_first":[{"paper":"/paper/making-language-model-a-hierarchical","slug":"making-language-model-a-hierarchical","title":"Making Language Model a Hierarchical Classifier and Generator","date":"2025-07-17","arxiv_id":"2507.12930","n_code_links":1,"syntology":null},{"paper":null,"slug":"generative-click-through-rate-prediction-with","title":"Generative Click-through Rate Prediction with Applications to Search Advertising","date":"2025-07-15","arxiv_id":"2507.11246","n_code_links":0,"syntology":null},{"paper":null,"slug":"behaviour-space-analysis-of-llm-driven-meta","title":"Behaviour Space Analysis of LLM-driven Meta-heuristic Discovery","date":"2025-07-04","arxiv_id":"2507.03605","n_code_links":0,"syntology":null},{"paper":null,"slug":"agent-to-agent-theory-of-mind-testing","title":"Agent-to-Agent Theory of Mind: Testing Interlocutor Awareness among Large Language Models","date":"2025-06-28","arxiv_id":"2506.22957","n_code_links":0,"syntology":null},{"paper":null,"slug":"cat-and-mouse-can-fake-text-generation","title":"Cat and Mouse -- Can Fake Text Generation Outpace Detector Systems?","date":"2025-06-26","arxiv_id":"2506.21274","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-language-models-acing-chartered","title":"Large Language Models Acing Chartered Accountancy","date":"2025-06-26","arxiv_id":"2506.21031","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-language-model-driven-code-compliance","title":"Large Language Model-Driven Code Compliance Checking in Building Information Modeling","date":"2025-06-25","arxiv_id":"2506.20551","n_code_links":0,"syntology":null},{"paper":null,"slug":"pattern-based-phase-separation-of-tracer-and","title":"Pattern-Based Phase-Separation of Tracer and Dispersed Phase Particles in Two-Phase Defocusing Particle Tracking Velocimetry","date":"2025-06-22","arxiv_id":"2506.18157","n_code_links":0,"syntology":null},{"paper":null,"slug":"insertrank-llms-can-reason-over-bm25-scores","title":"InsertRank: LLMs can reason over BM25 scores to Improve Listwise Reranking","date":"2025-06-17","arxiv_id":"2506.14086","n_code_links":0,"syntology":null},{"paper":null,"slug":"m2beamllm-multimodal-sensing-empowered-mmwave","title":"M2BeamLLM: Multimodal Sensing-empowered mmWave Beam Prediction with Large Language Models","date":"2025-06-17","arxiv_id":"2506.14532","n_code_links":0,"syntology":null},{"paper":null,"slug":"toward-a-graph-foundation-model-pre-training","title":"Toward a Graph Foundation Model: Pre-Training Transformers With Random Walks","date":"2025-06-17","arxiv_id":"2506.14098","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/decomposing-mlp-activations-into","slug":"decomposing-mlp-activations-into","title":"Decomposing MLP Activations into Interpretable Features via Semi-Nonnegative Matrix Factorization","date":"2025-06-12","arxiv_id":"2506.10920","n_code_links":1,"syntology":null},{"paper":"/paper/neuralnexus-at-bea-2025-shared-task-retrieval","slug":"neuralnexus-at-bea-2025-shared-task-retrieval","title":"NeuralNexus at BEA 2025 Shared Task: Retrieval-Augmented Prompting for Mistake Identification in AI Tutors","date":"2025-06-12","arxiv_id":"2506.10627","n_code_links":1,"syntology":null},{"paper":"/paper/think-before-you-simulate-symbolic-reasoning-1","slug":"think-before-you-simulate-symbolic-reasoning-1","title":"Think before You Simulate: Symbolic Reasoning to Orchestrate Neural Computation for Counterfactual Question Answering","date":"2025-06-12","arxiv_id":"2506.10753","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-novel-lightweight-transformer-with-edge","title":"A Novel Lightweight Transformer with Edge-Aware Fusion for Remote Sensing Image Captioning","date":"2025-06-11","arxiv_id":"2506.09429","n_code_links":0,"syntology":null},{"paper":null,"slug":"latent-multi-head-attention-for-small","title":"Latent Multi-Head Attention for Small Language Models","date":"2025-06-11","arxiv_id":"2506.09342","n_code_links":0,"syntology":null},{"paper":null,"slug":"arareasoner-evaluating-reasoning-based-llms","title":"AraReasoner: Evaluating Reasoning-Based LLMs for Arabic NLP","date":"2025-06-10","arxiv_id":"2506.08768","n_code_links":0,"syntology":null},{"paper":"/paper/evaluating-llms-across-multi-cognitive-levels","slug":"evaluating-llms-across-multi-cognitive-levels","title":"Evaluating LLMs Across Multi-Cognitive Levels: From Medical Knowledge Mastery to Scenario-Based Problem Solving","date":"2025-06-10","arxiv_id":"2506.08349","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"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) · 0 unverified","official":{"repos":["thumlp/multicogeval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"generative-voice-bursts-during-phone-call","title":"Generative Voice Bursts during Phone Call","date":"2025-06-09","arxiv_id":"2506.07526","n_code_links":0,"syntology":null},{"paper":null,"slug":"llm-driven-indoor-scene-layout-generation-via","title":"LLM-driven Indoor Scene Layout Generation via Scaled Human-aligned Data Synthesis and Multi-Stage Preference Optimization","date":"2025-06-09","arxiv_id":"2506.07570","n_code_links":0,"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":"analyzing-breast-cancer-survival-disparities","title":"Analyzing Breast Cancer Survival Disparities by Race and Demographic Location: A Survival Analysis Approach","date":"2025-06-08","arxiv_id":"2506.07191","n_code_links":0,"syntology":null},{"paper":null,"slug":"quality-diversity-red-teaming-automated","title":"Quality-Diversity Red-Teaming: Automated Generation of High-Quality and Diverse Attackers for Large Language Models","date":"2025-06-08","arxiv_id":"2506.07121","n_code_links":0,"syntology":null},{"paper":null,"slug":"robocerebra-a-large-scale-benchmark-for-long","title":"RoboCerebra: A Large-scale Benchmark for Long-horizon Robotic Manipulation Evaluation","date":"2025-06-07","arxiv_id":"2506.06677","n_code_links":0,"syntology":null},{"paper":null,"slug":"direct-behavior-optimization-unlocking-the","title":"Direct Behavior Optimization: Unlocking the Potential of Lightweight LLMs","date":"2025-06-06","arxiv_id":"2506.06401","n_code_links":0,"syntology":null},{"paper":null,"slug":"evolutionary-perspectives-on-the-evaluation","title":"Evolutionary Perspectives on the Evaluation of LLM-Based AI Agents: A Comprehensive Survey","date":"2025-06-06","arxiv_id":"2506.11102","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-lock-in-hypothesis-stagnation-by","title":"The Lock-in Hypothesis: Stagnation by Algorithm","date":"2025-06-06","arxiv_id":"2506.06166","n_code_links":0,"syntology":null},{"paper":null,"slug":"benchmarking-large-language-models-on-3","title":"Benchmarking Large Language Models on Homework Assessment in Circuit Analysis","date":"2025-06-05","arxiv_id":"2506.06390","n_code_links":0,"syntology":null},{"paper":null,"slug":"dissecting-bias-in-llms-a-mechanistic","title":"Dissecting Bias in LLMs: A Mechanistic Interpretability Perspective","date":"2025-06-05","arxiv_id":"2506.05166","n_code_links":0,"syntology":null},{"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":null,"slug":"multiple-choice-question-generation-using","title":"Multiple-Choice Question Generation Using Large Language Models: Methodology and Educator Insights","date":"2025-06-05","arxiv_id":"2506.04851","n_code_links":0,"syntology":null},{"paper":null,"slug":"facts-are-harder-than-opinions-a-multilingual","title":"Facts are Harder Than Opinions -- A Multilingual, Comparative Analysis of LLM-Based Fact-Checking Reliability","date":"2025-06-04","arxiv_id":"2506.03655","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-and-security-threat-for-openai-gpts","title":"Privacy and Security Threat for OpenAI GPTs","date":"2025-06-04","arxiv_id":"2506.04036","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-exploratory-framework-for-future-seti","title":"An Exploratory Framework for Future SETI Applications: Detecting Generative Reactivity via Language Models","date":"2025-06-03","arxiv_id":"2506.02730","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":"/paper/how-neural-networks-organize-concepts","slug":"how-neural-networks-organize-concepts","title":"How Neural Networks Organize Concepts: Introducing Concept Trajectory Analysis for Deep Learning Interpretability","date":"2025-06-01","arxiv_id":null,"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":"power-of-two-pot-weights-in-large-language","title":"Power-of-Two (PoT) Weights in Large Language Models (LLMs)","date":"2025-05-31","arxiv_id":"2506.00315","n_code_links":0,"syntology":null},{"paper":"/paper/agent-x-evaluating-deep-multimodal-reasoning","slug":"agent-x-evaluating-deep-multimodal-reasoning","title":"Agent-X: Evaluating Deep Multimodal Reasoning in Vision-Centric Agentic Tasks","date":"2025-05-30","arxiv_id":"2505.24876","n_code_links":1,"syntology":null},{"paper":"/paper/mofgpt-generative-design-of-metal-organic","slug":"mofgpt-generative-design-of-metal-organic","title":"MOFGPT: Generative Design of Metal-Organic Frameworks using Language Models","date":"2025-05-30","arxiv_id":"2506.00198","n_code_links":1,"syntology":null},{"paper":null,"slug":"when-gpt-spills-the-tea-comprehensive","title":"When GPT Spills the Tea: Comprehensive Assessment of Knowledge File Leakage in GPTs","date":"2025-05-30","arxiv_id":"2506.00197","n_code_links":0,"syntology":null},{"paper":null,"slug":"critical-batch-size-revisited-a-simple","title":"Critical Batch Size Revisited: A Simple Empirical Approach to Large-Batch Language Model Training","date":"2025-05-29","arxiv_id":"2505.23971","n_code_links":0,"syntology":null},{"paper":null,"slug":"daunce-data-attribution-through-uncertainty","title":"Daunce: Data Attribution through Uncertainty Estimation","date":"2025-05-29","arxiv_id":"2505.23223","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-llm-based-code-generation-with","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","date":"2025-05-29","arxiv_id":"2505.23953","n_code_links":0,"syntology":null},{"paper":null,"slug":"matryoshka-model-learning-for-improved","title":"Matryoshka Model Learning for Improved Elastic Student Models","date":"2025-05-29","arxiv_id":"2505.23337","n_code_links":0,"syntology":null},{"paper":null,"slug":"reducing-latency-in-llm-based-natural","title":"Reducing Latency in LLM-Based Natural Language Commands Processing for Robot Navigation","date":"2025-05-29","arxiv_id":"2506.00075","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-mllm-knowledge-distillation-for-out-of","title":"Multi-MLLM Knowledge Distillation for Out-of-Context News Detection","date":"2025-05-28","arxiv_id":"2505.22517","n_code_links":0,"syntology":null},{"paper":null,"slug":"say-what-you-mean-natural-language-access","title":"Say What You Mean: Natural Language Access Control with Large Language Models for Internet of Things","date":"2025-05-28","arxiv_id":"2505.23835","n_code_links":0,"syntology":null},{"paper":"/paper/explainability-of-large-language-models-using","slug":"explainability-of-large-language-models-using","title":"Explainability of Large Language Models using SMILE: Statistical Model-agnostic Interpretability with Local Explanations","date":"2025-05-27","arxiv_id":"2505.21657","n_code_links":1,"syntology":null},{"paper":null,"slug":"from-prosthetic-memory-to-prosthetic-denial","title":"From prosthetic memory to prosthetic denial: Auditing whether large language models are prone to mass atrocity denialism","date":"2025-05-27","arxiv_id":"2505.21753","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-chest-x-ray-report","title":"Privacy-Preserving Chest X-ray Report Generation via Multimodal Federated Learning with ViT and GPT-2","date":"2025-05-27","arxiv_id":"2505.21715","n_code_links":0,"syntology":null},{"paper":null,"slug":"anveshana-a-new-benchmark-dataset-for-cross","title":"Anveshana: A New Benchmark Dataset for Cross-Lingual Information Retrieval On English Queries and Sanskrit Documents","date":"2025-05-26","arxiv_id":"2505.19494","n_code_links":0,"syntology":null},{"paper":null,"slug":"automated-evaluation-of-children-s-speech","title":"Automated evaluation of children's speech fluency for low-resource languages","date":"2025-05-26","arxiv_id":"2505.19671","n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-specialization-benchmarking-llms-for","title":"Beyond Specialization: Benchmarking LLMs for Transliteration of Indian Languages","date":"2025-05-26","arxiv_id":"2505.19851","n_code_links":0,"syntology":null},{"paper":null,"slug":"conversational-lexicography-querying","title":"Conversational Lexicography: Querying Lexicographic Data on Knowledge Graphs with SPARQL through Natural Language","date":"2025-05-26","arxiv_id":"2505.19971","n_code_links":0,"syntology":null},{"paper":null,"slug":"eslm-risk-averse-selective-language-modeling","title":"ESLM: Risk-Averse Selective Language Modeling for Efficient Pretraining","date":"2025-05-26","arxiv_id":"2505.19893","n_code_links":0,"syntology":null},{"paper":null,"slug":"ai4math-a-native-spanish-benchmark-for","title":"AI4Math: A Native Spanish Benchmark for University-Level Mathematical Reasoning in Large Language Models","date":"2025-05-25","arxiv_id":"2505.18978","n_code_links":0,"syntology":null},{"paper":null,"slug":"from-reddit-to-generative-ai-evaluating-large","title":"From Reddit to Generative AI: Evaluating Large Language Models for Anxiety Support Fine-tuned on Social Media Data","date":"2025-05-24","arxiv_id":"2505.18464","n_code_links":0,"syntology":null},{"paper":null,"slug":"strong-membership-inference-attacks-on","title":"Strong Membership Inference Attacks on Massive Datasets and (Moderately) Large Language Models","date":"2025-05-24","arxiv_id":"2505.18773","n_code_links":0,"syntology":null},{"paper":null,"slug":"llm-assisted-web-application-functional","title":"LLM assisted web application functional requirements generation: A case study of four popular LLMs over a Mess Management System","date":"2025-05-23","arxiv_id":"2505.18019","n_code_links":0,"syntology":null},{"paper":null,"slug":"mmmg-a-comprehensive-and-reliable-evaluation","title":"MMMG: a Comprehensive and Reliable Evaluation Suite for Multitask Multimodal Generation","date":"2025-05-23","arxiv_id":"2505.17613","n_code_links":0,"syntology":null},{"paper":"/paper/shioenv-a-cli-behavior-capturing-environment","slug":"shioenv-a-cli-behavior-capturing-environment","title":"ShIOEnv: A CLI Behavior-Capturing Environment Enabling Grammar-Guided Command Synthesis for Dataset Curation","date":"2025-05-23","arxiv_id":"2505.18374","n_code_links":1,"syntology":null},{"paper":"/paper/adams-momentum-itself-can-be-a-normalizer-for","slug":"adams-momentum-itself-can-be-a-normalizer-for","title":"AdamS: Momentum Itself Can Be A Normalizer for LLM Pretraining and Post-training","date":"2025-05-22","arxiv_id":"2505.16363","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["pku-huzhang/AdamS"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"paper":null,"slug":"data-driven-breakthroughs-and-future","title":"Data-Driven Breakthroughs and Future Directions in AI Infrastructure: A Comprehensive Review","date":"2025-05-22","arxiv_id":"2505.16771","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-federated-survival-analysis-through","title":"Enhancing Federated Survival Analysis through Peer-Driven Client Reputation in Healthcare","date":"2025-05-22","arxiv_id":"2505.16190","n_code_links":0,"syntology":null},{"paper":"/paper/generative-ai-and-creativity-a-systematic","slug":"generative-ai-and-creativity-a-systematic","title":"Generative AI and Creativity: A Systematic Literature Review and Meta-Analysis","date":"2025-05-22","arxiv_id":"2505.17241","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-polar-express-optimal-matrix-sign-methods","title":"The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithm","date":"2025-05-22","arxiv_id":"2505.16932","n_code_links":0,"syntology":null},{"paper":null,"slug":"three-minds-one-legend-jailbreak-large","title":"Three Minds, One Legend: Jailbreak Large Reasoning Model with Adaptive Stacked Ciphers","date":"2025-05-22","arxiv_id":"2505.16241","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-efficient-private-gpt-never","title":"An Efficient Private GPT Never Autoregressively Decodes","date":"2025-05-21","arxiv_id":"2505.15252","n_code_links":0,"syntology":null},{"paper":"/paper/rlbenchnet-the-right-network-for-the-right","slug":"rlbenchnet-the-right-network-for-the-right","title":"RLBenchNet: The Right Network for the Right Reinforcement Learning Task","date":"2025-05-21","arxiv_id":"2505.15040","n_code_links":1,"syntology":null},{"paper":"/paper/breaking-bad-tokens-detoxification-of-llms","slug":"breaking-bad-tokens-detoxification-of-llms","title":"Breaking Bad Tokens: Detoxification of LLMs Using Sparse Autoencoders","date":"2025-05-20","arxiv_id":"2505.14536","n_code_links":0,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"choosing-a-model-shaping-a-future-comparing","title":"Choosing a Model, Shaping a Future: Comparing LLM Perspectives on Sustainability and its Relationship with AI","date":"2025-05-20","arxiv_id":"2505.14435","n_code_links":0,"syntology":null},{"paper":"/paper/eeg-to-text-translation-a-model-for","slug":"eeg-to-text-translation-a-model-for","title":"EEG-to-Text Translation: A Model for Deciphering Human Brain Activity","date":"2025-05-20","arxiv_id":"2505.13936","n_code_links":1,"syntology":null},{"paper":null,"slug":"every-pixel-tells-a-story-end-to-end-urdu","title":"Every Pixel Tells a Story: End-to-End Urdu Newspaper OCR","date":"2025-05-20","arxiv_id":"2505.13943","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-ai-at-the-crossroads-light-bulb","title":"Generative AI at the Crossroads: Light Bulb, Dynamo, or Microscope?","date":"2025-05-20","arxiv_id":"2505.14588","n_code_links":0,"syntology":null},{"paper":null,"slug":"out-of-distribution-generalization-of-in","title":"Out-of-Distribution Generalization of In-Context Learning: A Low-Dimensional Subspace Perspective","date":"2025-05-20","arxiv_id":"2505.14808","n_code_links":0,"syntology":null},{"paper":null,"slug":"scaling-laws-for-state-dynamics-in-large","title":"Scaling Laws for State Dynamics in Large Language Models","date":"2025-05-20","arxiv_id":"2505.14892","n_code_links":0,"syntology":null},{"paper":null,"slug":"adversarial-testing-in-llms-insights-into","title":"Adversarial Testing in LLMs: Insights into Decision-Making Vulnerabilities","date":"2025-05-19","arxiv_id":"2505.13195","n_code_links":0,"syntology":null},{"paper":null,"slug":"are-large-language-models-good-at-detecting","title":"Are Large Language Models Good at Detecting Propaganda?","date":"2025-05-19","arxiv_id":"2505.13706","n_code_links":0,"syntology":null},{"paper":null,"slug":"pyramid-sparse-transformer-enhancing-multi","title":"Pyramid Sparse Transformer: Enhancing Multi-Scale Feature Fusion with Dynamic Token Selection","date":"2025-05-19","arxiv_id":"2505.12772","n_code_links":0,"syntology":null},{"paper":"/paper/vesselgpt-autoregressive-modeling-of-vascular","slug":"vesselgpt-autoregressive-modeling-of-vascular","title":"VesselGPT: Autoregressive Modeling of Vascular Geometry","date":"2025-05-19","arxiv_id":"2505.13318","n_code_links":1,"syntology":null},{"paper":null,"slug":"evaloop-assessing-llm-robustness-in","title":"EVALOOP: Assessing LLM Robustness in Programming from a Self-consistency Perspective","date":"2025-05-18","arxiv_id":"2505.12185","n_code_links":0,"syntology":null},{"paper":"/paper/video-gpt-via-next-clip-diffusion","slug":"video-gpt-via-next-clip-diffusion","title":"Video-GPT via Next Clip Diffusion","date":"2025-05-18","arxiv_id":"2505.12489","n_code_links":1,"syntology":null},{"paper":null,"slug":"2505-11421","title":"Towards Cultural Bridge by Bahnaric-Vietnamese Translation Using Transfer Learning of Sequence-To-Sequence Pre-training Language Model","date":"2025-05-16","arxiv_id":"2505.11421","n_code_links":0,"syntology":null},{"paper":"/paper/acse-eval-can-llms-threat-model-real-world","slug":"acse-eval-can-llms-threat-model-real-world","title":"ACSE-Eval: Can LLMs threat model real-world cloud infrastructure?","date":"2025-05-16","arxiv_id":"2505.11565","n_code_links":1,"syntology":null},{"paper":null,"slug":"can-an-easy-to-hard-curriculum-make-reasoning","title":"Can an Easy-to-Hard Curriculum Make Reasoning Emerge in Small Language Models? Evidence from a Four-Stage Curriculum on GPT-2","date":"2025-05-16","arxiv_id":"2505.11643","n_code_links":0,"syntology":null},{"paper":null,"slug":"let-the-trial-begin-a-mock-court-approach-to","title":"Let the Trial Begin: A Mock-Court Approach to Vulnerability Detection using LLM-Based Agents","date":"2025-05-16","arxiv_id":"2505.10961","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-control-for-transformer-architectures","title":"Optimal Control for Transformer Architectures: Enhancing Generalization, Robustness and Efficiency","date":"2025-05-16","arxiv_id":"2505.13499","n_code_links":0,"syntology":null},{"paper":"/paper/are-sparse-autoencoders-useful-for-java","slug":"are-sparse-autoencoders-useful-for-java","title":"Are Sparse Autoencoders Useful for Java Function Bug Detection?","date":"2025-05-15","arxiv_id":"2505.10375","n_code_links":1,"syntology":null},{"paper":"/paper/comparing-llm-text-annotation-skills-a-study","slug":"comparing-llm-text-annotation-skills-a-study","title":"Comparing LLM Text Annotation Skills: A Study on Human Rights Violations in Social Media Data","date":"2025-05-15","arxiv_id":"2505.10260","n_code_links":1,"syntology":null},{"paper":"/paper/atomic-consistency-preference-optimization","slug":"atomic-consistency-preference-optimization","title":"Atomic Consistency Preference Optimization for Long-Form Question Answering","date":"2025-05-14","arxiv_id":"2505.09039","n_code_links":1,"syntology":null},{"paper":null,"slug":"multilingual-machine-translation-with-quantum","title":"Multilingual Machine Translation with Quantum Encoder Decoder Attention-based Convolutional Variational Circuits","date":"2025-05-14","arxiv_id":"2505.09407","n_code_links":0,"syntology":null},{"paper":"/paper/achieving-scalable-robot-autonomy-via","slug":"achieving-scalable-robot-autonomy-via","title":"Achieving Scalable Robot Autonomy via neurosymbolic planning using lightweight local LLM","date":"2025-05-13","arxiv_id":"2505.08492","n_code_links":1,"syntology":null},{"paper":null,"slug":"evaluating-llm-metrics-through-real-world","title":"Evaluating LLM Metrics Through Real-World Capabilities","date":"2025-05-13","arxiv_id":"2505.08253","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-the-effectiveness-of-black-box","title":"Evaluating the Effectiveness of Black-Box Prompt Optimization as the Scale of LLMs Continues to Grow","date":"2025-05-13","arxiv_id":"2505.08303","n_code_links":0,"syntology":null},{"paper":"/paper/healthbench-evaluating-large-language-models","slug":"healthbench-evaluating-large-language-models","title":"HealthBench: Evaluating Large Language Models Towards Improved Human Health","date":"2025-05-13","arxiv_id":"2505.08775","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["openai/simple-evals"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"memorization-compression-cycles-improve","title":"Memorization-Compression Cycles Improve Generalization","date":"2025-05-13","arxiv_id":"2505.08727","n_code_links":0,"syntology":null},{"paper":"/paper/probability-consistency-in-large-language","slug":"probability-consistency-in-large-language","title":"Probability Consistency in Large Language Models: Theoretical Foundations Meet Empirical Discrepancies","date":"2025-05-13","arxiv_id":"2505.08739","n_code_links":1,"syntology":null},{"paper":null,"slug":"small-but-significant-on-the-promise-of-small","title":"Small but Significant: On the Promise of Small Language Models for Accessible AIED","date":"2025-05-13","arxiv_id":"2505.08588","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":3965,"with_a_code_link":1734,"where_syntology_ran_a_sample":627,"not_listed_spam_title":0,"listed":3965,"listed_where_code_ran":627,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":495,"every_run_a_failure_of_syntologys_instrument":132,"listed_with_a_run_with_no_instrument_failure":495,"listed_every_run_a_failure_of_syntologys_instrument":132,"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":627,"papers_where_code_ran_first_page":"/method/cosine-annealing/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":40,"url":"/method/cosine-annealing/papers/2","json":"/method/cosine-annealing/papers/2.json","rows":100},{"order":"archive","page":3,"of":40,"url":"/method/cosine-annealing/papers/3","json":"/method/cosine-annealing/papers/3.json","rows":100},{"order":"archive","page":4,"of":40,"url":"/method/cosine-annealing/papers/4","json":"/method/cosine-annealing/papers/4.json","rows":100},{"order":"archive","page":5,"of":40,"url":"/method/cosine-annealing/papers/5","json":"/method/cosine-annealing/papers/5.json","rows":100},{"order":"archive","page":6,"of":40,"url":"/method/cosine-annealing/papers/6","json":"/method/cosine-annealing/papers/6.json","rows":100},{"order":"archive","page":7,"of":40,"url":"/method/cosine-annealing/papers/7","json":"/method/cosine-annealing/papers/7.json","rows":100},{"order":"archive","page":8,"of":40,"url":"/method/cosine-annealing/papers/8","json":"/method/cosine-annealing/papers/8.json","rows":100},{"order":"archive","page":9,"of":40,"url":"/method/cosine-annealing/papers/9","json":"/method/cosine-annealing/papers/9.json","rows":100},{"order":"archive","page":10,"of":40,"url":"/method/cosine-annealing/papers/10","json":"/method/cosine-annealing/papers/10.json","rows":100},{"order":"archive","page":11,"of":40,"url":"/method/cosine-annealing/papers/11","json":"/method/cosine-annealing/papers/11.json","rows":100},{"order":"archive","page":12,"of":40,"url":"/method/cosine-annealing/papers/12","json":"/method/cosine-annealing/papers/12.json","rows":100},{"order":"archive","page":13,"of":40,"url":"/method/cosine-annealing/papers/13","json":"/method/cosine-annealing/papers/13.json","rows":100},{"order":"archive","page":14,"of":40,"url":"/method/cosine-annealing/papers/14","json":"/method/cosine-annealing/papers/14.json","rows":100},{"order":"archive","page":15,"of":40,"url":"/method/cosine-annealing/papers/15","json":"/method/cosine-annealing/papers/15.json","rows":100},{"order":"archive","page":16,"of":40,"url":"/method/cosine-annealing/papers/16","json":"/method/cosine-annealing/papers/16.json","rows":100},{"order":"archive","page":17,"of":40,"url":"/method/cosine-annealing/papers/17","json":"/method/cosine-annealing/papers/17.json","rows":100},{"order":"archive","page":18,"of":40,"url":"/method/cosine-annealing/papers/18","json":"/method/cosine-annealing/papers/18.json","rows":100},{"order":"archive","page":19,"of":40,"url":"/method/cosine-annealing/papers/19","json":"/method/cosine-annealing/papers/19.json","rows":100},{"order":"archive","page":20,"of":40,"url":"/method/cosine-annealing/papers/20","json":"/method/cosine-annealing/papers/20.json","rows":100},{"order":"archive","page":21,"of":40,"url":"/method/cosine-annealing/papers/21","json":"/method/cosine-annealing/papers/21.json","rows":100},{"order":"archive","page":22,"of":40,"url":"/method/cosine-annealing/papers/22","json":"/method/cosine-annealing/papers/22.json","rows":100},{"order":"archive","page":23,"of":40,"url":"/method/cosine-annealing/papers/23","json":"/method/cosine-annealing/papers/23.json","rows":100},{"order":"archive","page":24,"of":40,"url":"/method/cosine-annealing/papers/24","json":"/method/cosine-annealing/papers/24.json","rows":100},{"order":"archive","page":25,"of":40,"url":"/method/cosine-annealing/papers/25","json":"/method/cosine-annealing/papers/25.json","rows":100},{"order":"archive","page":26,"of":40,"url":"/method/cosine-annealing/papers/26","json":"/method/cosine-annealing/papers/26.json","rows":100},{"order":"archive","page":27,"of":40,"url":"/method/cosine-annealing/papers/27","json":"/method/cosine-annealing/papers/27.json","rows":100},{"order":"archive","page":28,"of":40,"url":"/method/cosine-annealing/papers/28","json":"/method/cosine-annealing/papers/28.json","rows":100},{"order":"archive","page":29,"of":40,"url":"/method/cosine-annealing/papers/29","json":"/method/cosine-annealing/papers/29.json","rows":100},{"order":"archive","page":30,"of":40,"url":"/method/cosine-annealing/papers/30","json":"/method/cosine-annealing/papers/30.json","rows":100},{"order":"archive","page":31,"of":40,"url":"/method/cosine-annealing/papers/31","json":"/method/cosine-annealing/papers/31.json","rows":100},{"order":"archive","page":32,"of":40,"url":"/method/cosine-annealing/papers/32","json":"/method/cosine-annealing/papers/32.json","rows":100},{"order":"archive","page":33,"of":40,"url":"/method/cosine-annealing/papers/33","json":"/method/cosine-annealing/papers/33.json","rows":100},{"order":"archive","page":34,"of":40,"url":"/method/cosine-annealing/papers/34","json":"/method/cosine-annealing/papers/34.json","rows":100},{"order":"archive","page":35,"of":40,"url":"/method/cosine-annealing/papers/35","json":"/method/cosine-annealing/papers/35.json","rows":100},{"order":"archive","page":36,"of":40,"url":"/method/cosine-annealing/papers/36","json":"/method/cosine-annealing/papers/36.json","rows":100},{"order":"archive","page":37,"of":40,"url":"/method/cosine-annealing/papers/37","json":"/method/cosine-annealing/papers/37.json","rows":100},{"order":"archive","page":38,"of":40,"url":"/method/cosine-annealing/papers/38","json":"/method/cosine-annealing/papers/38.json","rows":100},{"order":"archive","page":39,"of":40,"url":"/method/cosine-annealing/papers/39","json":"/method/cosine-annealing/papers/39.json","rows":100},{"order":"archive","page":40,"of":40,"url":"/method/cosine-annealing/papers/40","json":"/method/cosine-annealing/papers/40.json","rows":65},{"order":"ran","page":1,"of":7,"url":"/method/cosine-annealing/papers/ran/1","json":"/method/cosine-annealing/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":7,"url":"/method/cosine-annealing/papers/ran/2","json":"/method/cosine-annealing/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":7,"url":"/method/cosine-annealing/papers/ran/3","json":"/method/cosine-annealing/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":7,"url":"/method/cosine-annealing/papers/ran/4","json":"/method/cosine-annealing/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":7,"url":"/method/cosine-annealing/papers/ran/5","json":"/method/cosine-annealing/papers/ran/5.json","rows":100},{"order":"ran","page":6,"of":7,"url":"/method/cosine-annealing/papers/ran/6","json":"/method/cosine-annealing/papers/ran/6.json","rows":100},{"order":"ran","page":7,"of":7,"url":"/method/cosine-annealing/papers/ran/7","json":"/method/cosine-annealing/papers/ran/7.json","rows":27}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":800},{"task":"/task/language-modeling","name":"Language Modeling","papers":591},{"task":"/task/question-answering","name":"Question Answering","papers":303},{"task":"/task/large-language-model","name":"Large Language Model","papers":298},{"task":"/task/text-generation","name":"Text Generation","papers":285},{"task":"/task/retrieval","name":"Retrieval","papers":203},{"task":"/task/sentence","name":"Sentence","papers":168},{"task":"/task/in-context-learning","name":"In-Context Learning","papers":162},{"task":"/task/prompt-engineering","name":"Prompt Engineering","papers":133},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":111},{"task":"/task/decoder","name":"Decoder","papers":109},{"task":"/task/code-generation","name":"Code Generation","papers":106},{"task":"/task/decision-making","name":"Decision Making","papers":102},{"task":"/task/text-classification","name":"Text Classification","papers":91},{"task":"/task/rag","name":"RAG","papers":90},{"task":"/task/translation","name":"Translation","papers":89},{"task":null,"name":"GPU","papers":88},{"task":"/task/retrieval-augmented-generation","name":"Retrieval-augmented Generation","papers":88},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":88},{"task":"/task/math","name":"Math","papers":87}],"tasks_shown":20,"n_tasks":1053,"usage_by_year":[{"year":"2016","papers":2},{"year":"2018","papers":9},{"year":"2019","papers":95},{"year":"2020","papers":188},{"year":"2021","papers":308},{"year":"2022","papers":412},{"year":"2023","papers":1196},{"year":"2024","papers":1385},{"year":"2025","papers":370}],"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/cosine-annealing"},"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=Cosine%20Annealing","read_at":"2026-10-05T00:54:07+00:00","query":"Cosine Annealing","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":"1608.03983","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 'Cosine Annealing' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["COSINE","COSINE","p-annealing","CWGD-Cosine","Annealing Flow","data annealing","annealing approach","Logit Annealing Loss"],"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":"8bea6dbcd0b180eed5c3aae0778ab90a58c5baffadc6e1c8a795c821be1bba81","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}