{"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/discriminative-fine-tuning","slug":"discriminative-fine-tuning","name":"Discriminative Fine-Tuning","full_name":"Discriminative Fine-Tuning","full_name_withheld":false,"description_markdown":"**Discriminative Fine-Tuning** is a fine-tuning strategy that is used for [ULMFiT](https://paperswithcode.com/method/ulmfit) type models. Instead of using the same learning rate for all layers of the model, discriminative fine-tuning allows us to tune each layer with different learning rates. For context, the regular stochastic gradient descent ([SGD](https://paperswithcode.com/method/sgd)) update of a model’s parameters $\\theta$ at time step $t$ looks like the following (Ruder, 2016):\r\n\r\n$$ \\theta\\_{t} = \\theta\\_{t-1} − \\eta\\cdot\\nabla\\_{\\theta}J\\left(\\theta\\right)$$\r\n\r\nwhere $\\eta$ is the learning rate and $\\nabla\\_{\\theta}J\\left(\\theta\\right)$ is the gradient with regard to the model’s objective function. For discriminative fine-tuning, we split the parameters $\\theta$ into {$\\theta\\_{1}, \\ldots, \\theta\\_{L}$} where $\\theta\\_{l}$ contains the parameters of the model at the $l$-th layer and $L$ is the number of layers of the model. Similarly, we obtain {$\\eta\\_{1}, \\ldots, \\eta\\_{L}$} where $\\theta\\_{l}$ where $\\eta\\_{l}$ is the learning rate of the $l$-th layer. The SGD update with discriminative finetuning is then:\r\n\r\n$$ \\theta\\_{t}^{l} = \\theta\\_{t-1}^{l} - \\eta^{l}\\cdot\\nabla\\_{\\theta^{l}}J\\left(\\theta\\right) $$\r\n\r\nThe authors find that empirically it worked well to first choose the learning rate $\\eta^{L}$ of the last layer by fine-tuning only the last layer and using $\\eta^{l-1}=\\eta^{l}/2.6$ as the learning rate for lower layers.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Universal Language Model Fine-tuning for Text Classification","paper":"/paper/universal-language-model-fine-tuning-for-text","first_author":"Jeremy Howard","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/universal-language-model-fine-tuning-for-text"},"source":{"url":"http://arxiv.org/abs/1801.06146v5","title":"Universal Language Model Fine-tuning for Text Classification","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/fastai/fastai/blob/43001e17ba469308e9688dfe99a891018bcf7ad4/courses/dl2/imdb_scripts/finetune_lm.py#L132","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Fine-Tuning","url":"/methods/category/fine-tuning","pwc_aliases":[]}],"n_papers_tagged":1990,"archive_num_papers":1990,"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":"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":"/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":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":"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":"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":"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":"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":"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":"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":"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":"/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":"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/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":"/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":"/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":"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/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":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":"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},{"paper":null,"slug":"no-query-no-access","title":"No Query, No Access","date":"2025-05-12","arxiv_id":"2505.07258","n_code_links":0,"syntology":null},{"paper":"/paper/evaluating-reasoning-llms-for-suicide","slug":"evaluating-reasoning-llms-for-suicide","title":"Evaluating Reasoning LLMs for Suicide Screening with the Columbia-Suicide Severity Rating Scale","date":"2025-05-11","arxiv_id":"2505.13480","n_code_links":1,"syntology":null},{"paper":null,"slug":"cellverse-do-large-language-models-really","title":"CellVerse: Do Large Language Models Really Understand Cell Biology?","date":"2025-05-09","arxiv_id":"2505.07865","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-agent-systems-for-robotic-autonomy-with","title":"Multi-Agent Systems for Robotic Autonomy with LLMs","date":"2025-05-09","arxiv_id":"2505.05762","n_code_links":0,"syntology":null},{"paper":null,"slug":"ai-approaches-to-qualitative-and-quantitative","title":"AI Approaches to Qualitative and Quantitative News Analytics on NATO Unity","date":"2025-05-08","arxiv_id":"2505.06313","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-empirical-study-of-openai-api-discussions","title":"An Empirical Study of OpenAI API Discussions on Stack Overflow","date":"2025-05-07","arxiv_id":"2505.04084","n_code_links":0,"syntology":null},{"paper":"/paper/llm-e-guess-can-llms-capabilities-advance","slug":"llm-e-guess-can-llms-capabilities-advance","title":"LLM-e Guess: Can LLMs Capabilities Advance Without Hardware Progress?","date":"2025-05-07","arxiv_id":"2505.04075","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-effectively-leveraging-execution","title":"Towards Effectively Leveraging Execution Traces for Program Repair with Code LLMs","date":"2025-05-07","arxiv_id":"2505.04441","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparative-analysis-of-ethical-and-safety","title":"A Comparative Analysis of Ethical and Safety Gaps in LLMs using Relative Danger Coefficient","date":"2025-05-06","arxiv_id":"2505.04654","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluation-of-llms-on-long-tail-entity","title":"Evaluation of LLMs on Long-tail Entity Linking in Historical Documents","date":"2025-05-06","arxiv_id":"2505.03473","n_code_links":0,"syntology":null},{"paper":null,"slug":"transformers-for-learning-on-noisy-and-task","title":"Transformers for Learning on Noisy and Task-Level Manifolds: Approximation and Generalization Insights","date":"2025-05-06","arxiv_id":"2505.03205","n_code_links":0,"syntology":null},{"paper":null,"slug":"memorization-or-interpolation-detecting-llm","title":"Memorization or Interpolation ? Detecting LLM Memorization through Input Perturbation Analysis","date":"2025-05-05","arxiv_id":"2505.03019","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-domain-adaptation-of-large-language-models","title":"A Domain Adaptation of Large Language Models for Classifying Mechanical Assembly Components","date":"2025-05-02","arxiv_id":"2505.01627","n_code_links":0,"syntology":null},{"paper":"/paper/unidetox-universal-detoxification-of-large","slug":"unidetox-universal-detoxification-of-large","title":"UniDetox: Universal Detoxification of Large Language Models via Dataset Distillation","date":"2025-04-29","arxiv_id":"2504.20500","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["EminLU/UniDetox"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"adversarial-attacks-on-llm-as-a-judge-systems","title":"Adversarial Attacks on LLM-as-a-Judge Systems: Insights from Prompt Injections","date":"2025-04-25","arxiv_id":"2504.18333","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimism-expectation-or-sarcasm-multi-class","title":"Optimism, Expectation, or Sarcasm? Multi-Class Hope Speech Detection in Spanish and English","date":"2025-04-24","arxiv_id":"2504.17974","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-survey-of-foundation-model-powered","title":"A Survey of Foundation Model-Powered Recommender Systems: From Feature-Based, Generative to Agentic Paradigms","date":"2025-04-23","arxiv_id":"2504.16420","n_code_links":0,"syntology":null},{"paper":null,"slug":"benchmarking-llm-for-code-smells-detection","title":"Benchmarking LLM for Code Smells Detection: OpenAI GPT-4.0 vs DeepSeek-V3","date":"2025-04-22","arxiv_id":"2504.16027","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-1st-erel-mir-workshop-on-efficient","title":"The 1st EReL@MIR Workshop on Efficient Representation Learning for Multimodal Information Retrieval","date":"2025-04-21","arxiv_id":"2504.14788","n_code_links":0,"syntology":null},{"paper":null,"slug":"ai-with-emotions-exploring-emotional","title":"AI with Emotions: Exploring Emotional Expressions in Large Language Models","date":"2025-04-20","arxiv_id":"2504.14706","n_code_links":0,"syntology":null},{"paper":null,"slug":"less-is-more-adaptive-coverage-for-synthetic","title":"Less is More: Adaptive Coverage for Synthetic Training Data","date":"2025-04-20","arxiv_id":"2504.14508","n_code_links":0,"syntology":null},{"paper":"/paper/zerosumeval-scaling-llm-evaluation-with-inter","slug":"zerosumeval-scaling-llm-evaluation-with-inter","title":"ZeroSumEval: Scaling LLM Evaluation with Inter-Model Competition","date":"2025-04-17","arxiv_id":"2504.12562","n_code_links":1,"syntology":null},{"paper":null,"slug":"using-customized-gpt-to-develop-prompting","title":"Using customized GPT to develop prompting proficiency in architectural AI-generated images","date":"2025-04-16","arxiv_id":"2504.13948","n_code_links":0,"syntology":null},{"paper":null,"slug":"hallucination-aware-generative-pretrained","title":"Hallucination-Aware Generative Pretrained Transformer for Cooperative Aerial Mobility Control","date":"2025-04-15","arxiv_id":"2504.10831","n_code_links":0,"syntology":null},{"paper":null,"slug":"vexp-a-low-cost-risc-v-isa-extension-for","title":"VEXP: A Low-Cost RISC-V ISA Extension for Accelerated Softmax Computation in Transformers","date":"2025-04-15","arxiv_id":"2504.11227","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":1990,"with_a_code_link":794,"where_syntology_ran_a_sample":271,"not_listed_spam_title":0,"listed":1990,"listed_where_code_ran":271,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":216,"every_run_a_failure_of_syntologys_instrument":55,"listed_with_a_run_with_no_instrument_failure":216,"listed_every_run_a_failure_of_syntologys_instrument":55,"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":271,"papers_where_code_ran_first_page":"/method/discriminative-fine-tuning/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":20,"url":"/method/discriminative-fine-tuning/papers/2","json":"/method/discriminative-fine-tuning/papers/2.json","rows":100},{"order":"archive","page":3,"of":20,"url":"/method/discriminative-fine-tuning/papers/3","json":"/method/discriminative-fine-tuning/papers/3.json","rows":100},{"order":"archive","page":4,"of":20,"url":"/method/discriminative-fine-tuning/papers/4","json":"/method/discriminative-fine-tuning/papers/4.json","rows":100},{"order":"archive","page":5,"of":20,"url":"/method/discriminative-fine-tuning/papers/5","json":"/method/discriminative-fine-tuning/papers/5.json","rows":100},{"order":"archive","page":6,"of":20,"url":"/method/discriminative-fine-tuning/papers/6","json":"/method/discriminative-fine-tuning/papers/6.json","rows":100},{"order":"archive","page":7,"of":20,"url":"/method/discriminative-fine-tuning/papers/7","json":"/method/discriminative-fine-tuning/papers/7.json","rows":100},{"order":"archive","page":8,"of":20,"url":"/method/discriminative-fine-tuning/papers/8","json":"/method/discriminative-fine-tuning/papers/8.json","rows":100},{"order":"archive","page":9,"of":20,"url":"/method/discriminative-fine-tuning/papers/9","json":"/method/discriminative-fine-tuning/papers/9.json","rows":100},{"order":"archive","page":10,"of":20,"url":"/method/discriminative-fine-tuning/papers/10","json":"/method/discriminative-fine-tuning/papers/10.json","rows":100},{"order":"archive","page":11,"of":20,"url":"/method/discriminative-fine-tuning/papers/11","json":"/method/discriminative-fine-tuning/papers/11.json","rows":100},{"order":"archive","page":12,"of":20,"url":"/method/discriminative-fine-tuning/papers/12","json":"/method/discriminative-fine-tuning/papers/12.json","rows":100},{"order":"archive","page":13,"of":20,"url":"/method/discriminative-fine-tuning/papers/13","json":"/method/discriminative-fine-tuning/papers/13.json","rows":100},{"order":"archive","page":14,"of":20,"url":"/method/discriminative-fine-tuning/papers/14","json":"/method/discriminative-fine-tuning/papers/14.json","rows":100},{"order":"archive","page":15,"of":20,"url":"/method/discriminative-fine-tuning/papers/15","json":"/method/discriminative-fine-tuning/papers/15.json","rows":100},{"order":"archive","page":16,"of":20,"url":"/method/discriminative-fine-tuning/papers/16","json":"/method/discriminative-fine-tuning/papers/16.json","rows":100},{"order":"archive","page":17,"of":20,"url":"/method/discriminative-fine-tuning/papers/17","json":"/method/discriminative-fine-tuning/papers/17.json","rows":100},{"order":"archive","page":18,"of":20,"url":"/method/discriminative-fine-tuning/papers/18","json":"/method/discriminative-fine-tuning/papers/18.json","rows":100},{"order":"archive","page":19,"of":20,"url":"/method/discriminative-fine-tuning/papers/19","json":"/method/discriminative-fine-tuning/papers/19.json","rows":100},{"order":"archive","page":20,"of":20,"url":"/method/discriminative-fine-tuning/papers/20","json":"/method/discriminative-fine-tuning/papers/20.json","rows":90},{"order":"ran","page":1,"of":3,"url":"/method/discriminative-fine-tuning/papers/ran/1","json":"/method/discriminative-fine-tuning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/method/discriminative-fine-tuning/papers/ran/2","json":"/method/discriminative-fine-tuning/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/method/discriminative-fine-tuning/papers/ran/3","json":"/method/discriminative-fine-tuning/papers/ran/3.json","rows":71}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":431},{"task":"/task/language-modeling","name":"Language Modeling","papers":323},{"task":"/task/text-generation","name":"Text Generation","papers":192},{"task":"/task/large-language-model","name":"Large Language Model","papers":123},{"task":"/task/question-answering","name":"Question Answering","papers":106},{"task":"/task/sentence","name":"Sentence","papers":99},{"task":"/task/decoder","name":"Decoder","papers":81},{"task":"/task/retrieval","name":"Retrieval","papers":78},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":65},{"task":"/task/text-classification","name":"Text Classification","papers":59},{"task":"/task/prompt-engineering","name":"Prompt Engineering","papers":57},{"task":"/task/text-classification-1","name":"text-classification","papers":54},{"task":"/task/decision-making","name":"Decision Making","papers":53},{"task":"/task/in-context-learning","name":"In-Context Learning","papers":53},{"task":"/task/translation","name":"Translation","papers":53},{"task":"/task/sentiment-analysis","name":"Sentiment Analysis","papers":52},{"task":null,"name":"GPU","papers":49},{"task":"/task/natural-language-understanding","name":"Natural Language Understanding","papers":40},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":39},{"task":"/task/machine-translation","name":"Machine Translation","papers":39}],"tasks_shown":20,"n_tasks":725,"usage_by_year":[{"year":"2018","papers":2},{"year":"2019","papers":68},{"year":"2020","papers":141},{"year":"2021","papers":173},{"year":"2022","papers":164},{"year":"2023","papers":491},{"year":"2024","papers":701},{"year":"2025","papers":250}],"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/discriminative-fine-tuning"},"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=Discriminative%20Fine-Tuning","read_at":"2026-10-05T00:55:08+00:00","query":"Discriminative Fine-Tuning","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":"Discriminative Finetuning","origin_arxiv_id":"2304.01662"},"resolution":"token_match","resolved_name_differs":true,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1801.06146","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2304.01662","citations":31},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'Discriminative Fine-Tuning'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"FiNE","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='FiNE')","origin_arxiv_id":"2503.01090"},{"name":"FINE","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='FINE')","origin_arxiv_id":"2102.11628"},{"name":"FINE-GRAINED RLHF","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='FINE-GRAINED RLHF')","origin_arxiv_id":"2306.01693"},{"name":"GFlowNet fine-tuning","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='GFlowNet fine-tuning')","origin_arxiv_id":"2405.18540"},{"name":"unsupervised fine-tuning","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":1,"retrieve_with":"get_reference_implementation(name='unsupervised fine-tuning')","origin_arxiv_id":"2504.02349"},{"name":"Feature Shift Tuning (FST)","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Feature Shift Tuning (FST)')","origin_arxiv_id":"2310.01875"}],"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":"2304.01662","page":"/paper/cross-domain-image-captioning-with","syntology_url":"https://syntology.ai/paper/2304.01662","in_graph_layer":true,"samples":2,"ran":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"for a different name, 'Discriminative Finetuning', about another paper, arXiv:2304.01662: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Discriminative Finetuning' (resolution: token_match); this answer is about that name. About another paper: this answer is about arXiv:2304.01662, while the archive credits arXiv:1801.06146.","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":"82bab531a2f7d024094824ee1187ed9902e104b8651a26833ecd74b452419e2e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}