{"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/adopt","slug":"adopt","name":"ADOPT","full_name":"ADaptive gradient method with the OPTimal convergence rate","full_name_withheld":false,"description_markdown":null,"description_state":"placeholder","introduced_year":null,"introduced_by":{"title":"ADOPT: Modified Adam Can Converge with Any $β_2$ with the Optimal Rate","paper":"/paper/adopt-modified-adam-can-converge-with-any-b-2","first_author":"Shohei Taniguchi","n_authors":10,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/adopt-modified-adam-can-converge-with-any-b-2"},"source":{"url":"https://arxiv.org/abs/2411.02853v3","title":"ADOPT: Modified Adam Can Converge with Any $β_2$ with the Optimal Rate","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":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]}],"n_papers_tagged":831,"archive_num_papers":832,"papers_newest_first":[{"paper":null,"slug":"regcl-continual-adaptation-of-segment","title":"RegCL: Continual Adaptation of Segment Anything Model via Model Merging","date":"2025-07-16","arxiv_id":"2507.12297","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-discovery-of-actual-causality-with","title":"Efficient Discovery of Actual Causality with Uncertainty","date":"2025-07-11","arxiv_id":"2507.09000","n_code_links":0,"syntology":null},{"paper":"/paper/fairness-is-not-enough-auditing-competence","slug":"fairness-is-not-enough-auditing-competence","title":"Fairness Is Not Enough: Auditing Competence and Intersectional Bias in AI-powered Resume Screening","date":"2025-07-11","arxiv_id":"2507.11548","n_code_links":1,"syntology":null},{"paper":null,"slug":"raps-3d-efficient-interactive-segmentation","title":"RAPS-3D: Efficient interactive segmentation for 3D radiological imaging","date":"2025-07-10","arxiv_id":"2507.07730","n_code_links":0,"syntology":null},{"paper":null,"slug":"integrated-structural-prompt-learning-for","title":"Integrated Structural Prompt Learning for Vision-Language Models","date":"2025-07-08","arxiv_id":"2507.05677","n_code_links":0,"syntology":null},{"paper":null,"slug":"unconditional-diffusion-for-generative","title":"Unconditional Diffusion for Generative Sequential Recommendation","date":"2025-07-08","arxiv_id":"2507.06121","n_code_links":0,"syntology":null},{"paper":null,"slug":"kalman-filter-aided-federated-koopman","title":"Kalman Filter Aided Federated Koopman Learning","date":"2025-07-07","arxiv_id":"2507.04808","n_code_links":0,"syntology":null},{"paper":null,"slug":"llama-nemoretriever-colembed-top-performing","title":"Llama Nemoretriever Colembed: Top-Performing Text-Image Retrieval Model","date":"2025-07-07","arxiv_id":"2507.05513","n_code_links":0,"syntology":null},{"paper":"/paper/vote-vision-language-action-optimization-with","slug":"vote-vision-language-action-optimization-with","title":"VOTE: Vision-Language-Action Optimization with Trajectory Ensemble Voting","date":"2025-07-07","arxiv_id":"2507.05116","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":3,"n_instrument":2,"unverified":0,"pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["LukeLIN-web/VOTE"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"advanced-financial-reasoning-at-scale-a","title":"Advanced Financial Reasoning at Scale: A Comprehensive Evaluation of Large Language Models on CFA Level III","date":"2025-06-29","arxiv_id":"2507.02954","n_code_links":0,"syntology":null},{"paper":null,"slug":"potential-customer-lifetime-value-in","title":"Potential Customer Lifetime Value in Financial Institutions: The Usage Of Open Banking Data to Improve CLV Estimation","date":"2025-06-28","arxiv_id":"2506.22711","n_code_links":0,"syntology":null},{"paper":"/paper/dbconformer-dual-branch-convolutional","slug":"dbconformer-dual-branch-convolutional","title":"DBConformer: Dual-Branch Convolutional Transformer for EEG Decoding","date":"2025-06-26","arxiv_id":"2506.21140","n_code_links":1,"syntology":null},{"paper":null,"slug":"enhancing-user-engagement-in-socially-driven","title":"Enhancing User Engagement in Socially-Driven Dialogue through Interactive LLM Alignments","date":"2025-06-26","arxiv_id":"2506.21497","n_code_links":0,"syntology":null},{"paper":"/paper/kalm-embedding-v2-superior-training","slug":"kalm-embedding-v2-superior-training","title":"KaLM-Embedding-V2: Superior Training Techniques and Data Inspire A Versatile Embedding Model","date":"2025-06-26","arxiv_id":"2506.20923","n_code_links":1,"syntology":null},{"paper":null,"slug":"point-cloud-environment-based-channel","title":"Point Cloud Environment-Based Channel Knowledge Map Construction","date":"2025-06-26","arxiv_id":"2506.21112","n_code_links":0,"syntology":null},{"paper":null,"slug":"yolo-fda-integrating-hierarchical-attention","title":"YOLO-FDA: Integrating Hierarchical Attention and Detail Enhancement for Surface Defect Detection","date":"2025-06-26","arxiv_id":"2506.21135","n_code_links":0,"syntology":null},{"paper":null,"slug":"define-ml-an-approach-to-ideate-machine","title":"Define-ML: An Approach to Ideate Machine Learning-Enabled Systems","date":"2025-06-25","arxiv_id":"2506.20621","n_code_links":0,"syntology":null},{"paper":null,"slug":"fusing-radiomic-features-with-deep","title":"Fusing Radiomic Features with Deep Representations for Gestational Age Estimation in Fetal Ultrasound Images","date":"2025-06-25","arxiv_id":"2506.20407","n_code_links":0,"syntology":null},{"paper":null,"slug":"hear-no-evil-detecting-gradient-leakage-by","title":"Hear No Evil: Detecting Gradient Leakage by Malicious Servers in Federated Learning","date":"2025-06-25","arxiv_id":"2506.20651","n_code_links":0,"syntology":null},{"paper":null,"slug":"diffusion-based-task-oriented-semantic","title":"Diffusion-based Task-oriented Semantic Communications with Model Inversion Attack","date":"2025-06-24","arxiv_id":"2506.19886","n_code_links":0,"syntology":null},{"paper":null,"slug":"finite-horizon-strategy-in-infinite-horizon","title":"Finite-Horizon Strategy in Infinite-Horizon Linear-Quadratic Discrete-Time Dynamic Games","date":"2025-06-24","arxiv_id":"2506.19565","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-efficacy-of-old-features-for-the","title":"On the efficacy of old features for the detection of new bots","date":"2025-06-24","arxiv_id":"2506.19635","n_code_links":0,"syntology":null},{"paper":"/paper/open-vocabulary-camouflaged-object-1","slug":"open-vocabulary-camouflaged-object-1","title":"Open-Vocabulary Camouflaged Object Segmentation with Cascaded Vision Language Models","date":"2025-06-24","arxiv_id":"2506.19300","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-multi-scale-spatial-attention-based-zero","title":"A Multi-Scale Spatial Attention-Based Zero-Shot Learning Framework for Low-Light Image Enhancement","date":"2025-06-23","arxiv_id":"2506.18323","n_code_links":0,"syntology":null},{"paper":"/paper/duetgen-music-driven-two-person-dance","slug":"duetgen-music-driven-two-person-dance","title":"DuetGen: Music Driven Two-Person Dance Generation via Hierarchical Masked Modeling","date":"2025-06-23","arxiv_id":"2506.18680","n_code_links":1,"syntology":null},{"paper":null,"slug":"let-your-video-listen-to-your-music","title":"Let Your Video Listen to Your Music!","date":"2025-06-23","arxiv_id":"2506.18881","n_code_links":0,"syntology":null},{"paper":null,"slug":"trajtok-technical-report-for-2025-waymo-open","title":"TrajTok: Technical Report for 2025 Waymo Open Sim Agents Challenge","date":"2025-06-23","arxiv_id":"2506.21618","n_code_links":0,"syntology":null},{"paper":null,"slug":"non-euclidean-enriched-contraction-theory-for","title":"Non-Euclidean Enriched Contraction Theory for Monotone Operators and Monotone Dynamical Systems","date":"2025-06-22","arxiv_id":"2506.17990","n_code_links":0,"syntology":null},{"paper":"/paper/taming-the-untamed-graph-based-knowledge","slug":"taming-the-untamed-graph-based-knowledge","title":"Taming the Untamed: Graph-Based Knowledge Retrieval and Reasoning for MLLMs to Conquer the Unknown","date":"2025-06-21","arxiv_id":"2506.17589","n_code_links":0,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":null,"slug":"bida-a-bi-level-interaction-decision-making","title":"BIDA: A Bi-level Interaction Decision-making Algorithm for Autonomous Vehicles in Dynamic Traffic Scenarios","date":"2025-06-19","arxiv_id":"2506.16546","n_code_links":0,"syntology":null},{"paper":"/paper/cloud-a-scalable-and-physics-informed","slug":"cloud-a-scalable-and-physics-informed","title":"CLOUD: A Scalable and Physics-Informed Foundation Model for Crystal Representation Learning","date":"2025-06-19","arxiv_id":"2506.17345","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-training-free-perceptual-image","title":"Fast Training-free Perceptual Image Compression","date":"2025-06-19","arxiv_id":"2506.16102","n_code_links":0,"syntology":null},{"paper":null,"slug":"unpacking-generative-ai-in-education","title":"Unpacking Generative AI in Education: Computational Modeling of Teacher and Student Perspectives in Social Media Discourse","date":"2025-06-19","arxiv_id":"2506.16412","n_code_links":0,"syntology":null},{"paper":null,"slug":"how-does-online-shopping-affect-offline-price","title":"How does online shopping affect offline price sensitivity?","date":"2025-06-18","arxiv_id":"2506.15103","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-multi-stage-augmented-multimodal","title":"A multi-stage augmented multimodal interaction network for fish feeding intensity quantification","date":"2025-06-17","arxiv_id":"2506.14170","n_code_links":0,"syntology":null},{"paper":null,"slug":"balancing-caregiving-and-self-care-exploring","title":"Balancing Caregiving and Self-Care: Exploring Mental Health Needs of Alzheimer's and Dementia Caregivers","date":"2025-06-17","arxiv_id":"2506.14196","n_code_links":0,"syntology":null},{"paper":"/paper/kdmos-knowledge-distillation-for-motion","slug":"kdmos-knowledge-distillation-for-motion","title":"KDMOS:Knowledge Distillation for Motion Segmentation","date":"2025-06-17","arxiv_id":"2506.14130","n_code_links":1,"syntology":null},{"paper":"/paper/multi-scale-finetuning-for-encoder-based-time","slug":"multi-scale-finetuning-for-encoder-based-time","title":"Multi-Scale Finetuning for Encoder-based Time Series Foundation Models","date":"2025-06-17","arxiv_id":"2506.14087","n_code_links":0,"syntology":{"ran":7,"of":13,"n_ran_checked":3,"n_instrument":4,"unverified":6,"pointer_only":13,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified","official":null}},{"paper":"/paper/discrete-diffusion-in-large-language-and","slug":"discrete-diffusion-in-large-language-and","title":"Discrete Diffusion in Large Language and Multimodal Models: A Survey","date":"2025-06-16","arxiv_id":"2506.13759","n_code_links":1,"syntology":null},{"paper":null,"slug":"surprise-calibration-for-better-in-context","title":"Surprise Calibration for Better In-Context Learning","date":"2025-06-15","arxiv_id":"2506.12796","n_code_links":0,"syntology":null},{"paper":null,"slug":"transforming-chatbot-text-a-sequence-to","title":"Transforming Chatbot Text: A Sequence-to-Sequence Approach","date":"2025-06-15","arxiv_id":"2506.12843","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-multi-resolution-hash-encoding","title":"Adaptive Multi-resolution Hash-Encoding Framework for INR-based Dental CBCT Reconstruction with Truncated FOV","date":"2025-06-14","arxiv_id":"2506.12471","n_code_links":0,"syntology":null},{"paper":null,"slug":"collaborative-interest-aware-graph-learning","title":"Collaborative Interest-aware Graph Learning for Group Identification","date":"2025-06-13","arxiv_id":"2506.14826","n_code_links":0,"syntology":null},{"paper":null,"slug":"dynamic-mixture-of-curriculum-lora-experts","title":"Dynamic Mixture of Curriculum LoRA Experts for Continual Multimodal Instruction Tuning","date":"2025-06-13","arxiv_id":"2506.11672","n_code_links":0,"syntology":null},{"paper":"/paper/prioritizing-alignment-paradigms-over-task","slug":"prioritizing-alignment-paradigms-over-task","title":"Prioritizing Alignment Paradigms over Task-Specific Model Customization in Time-Series LLMs","date":"2025-06-13","arxiv_id":"2506.11512","n_code_links":1,"syntology":null},{"paper":null,"slug":"2506-10251","title":"Energy Aware Camera Location Search Algorithm for Increasing Precision of Observation in Automated Manufacturing","date":"2025-06-12","arxiv_id":"2506.10251","n_code_links":0,"syntology":null},{"paper":null,"slug":"2506-10636","title":"Structure and asymptotic preserving deep neural surrogates for uncertainty quantification in multiscale kinetic equations","date":"2025-06-12","arxiv_id":"2506.10636","n_code_links":0,"syntology":null},{"paper":null,"slug":"closer-to-language-than-steam-ai-as-the","title":"Closer to Language than Steam: AI as the Cognitive Engine of a New Productivity Revolution","date":"2025-06-12","arxiv_id":"2506.10281","n_code_links":0,"syntology":null},{"paper":null,"slug":"mmmg-a-massive-multidisciplinary-multi-tier","title":"MMMG: A Massive, Multidisciplinary, Multi-Tier Generation Benchmark for Text-to-Image Reasoning","date":"2025-06-12","arxiv_id":"2506.10963","n_code_links":0,"syntology":null},{"paper":null,"slug":"motion-r1-chain-of-thought-reasoning-and","title":"Motion-R1: Chain-of-Thought Reasoning and Reinforcement Learning for Human Motion Generation","date":"2025-06-12","arxiv_id":"2506.10353","n_code_links":0,"syntology":null},{"paper":"/paper/mstar-box-free-multi-query-scene-text","slug":"mstar-box-free-multi-query-scene-text","title":"MSTAR: Box-free Multi-query Scene Text Retrieval with Attention Recycling","date":"2025-06-12","arxiv_id":"2506.10609","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yingift/mstar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/robustly-improving-llm-fairness-in-realistic","slug":"robustly-improving-llm-fairness-in-realistic","title":"Robustly Improving LLM Fairness in Realistic Settings via Interpretability","date":"2025-06-12","arxiv_id":"2506.10922","n_code_links":1,"syntology":null},{"paper":null,"slug":"sampling-based-planning-under-stl","title":"Sampling-Based Planning Under STL Specifications: A Forward Invariance Approach","date":"2025-06-12","arxiv_id":"2506.10739","n_code_links":0,"syntology":null},{"paper":null,"slug":"eigenvalue-based-detection-in-mimo-systems","title":"Eigenvalue-Based Detection in MIMO Systems for Integrated Sensing and Communication","date":"2025-06-11","arxiv_id":"2506.09439","n_code_links":0,"syntology":null},{"paper":null,"slug":"odg-occupancy-prediction-using-dual-gaussians","title":"ODG: Occupancy Prediction Using Dual Gaussians","date":"2025-06-11","arxiv_id":"2506.09417","n_code_links":0,"syntology":null},{"paper":null,"slug":"q2e-query-to-event-decomposition-for-zero","title":"Q2E: Query-to-Event Decomposition for Zero-Shot Multilingual Text-to-Video Retrieval","date":"2025-06-11","arxiv_id":"2506.10202","n_code_links":0,"syntology":null},{"paper":null,"slug":"s2st-omni-an-efficient-and-scalable","title":"S2ST-Omni: An Efficient and Scalable Multilingual Speech-to-Speech Translation Framework via Seamless Speech-Text Alignment and Streaming Speech Generation","date":"2025-06-11","arxiv_id":"2506.11160","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperbolic-dual-feature-augmentation-for-open","title":"Hyperbolic Dual Feature Augmentation for Open-Environment","date":"2025-06-10","arxiv_id":"2506.08906","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalablehd-scalable-and-high-throughput","title":"ScalableHD: Scalable and High-Throughput Hyperdimensional Computing Inference on Multi-Core CPUs","date":"2025-06-10","arxiv_id":"2506.09282","n_code_links":0,"syntology":null},{"paper":null,"slug":"computation-capacity-maximization-for","title":"Computation Capacity Maximization for Pinching Antennas-Assisted Wireless Powered MEC Systems","date":"2025-06-09","arxiv_id":"2506.07598","n_code_links":0,"syntology":null},{"paper":null,"slug":"diffusion-models-aided-uplink-channel","title":"Diffusion Models-Aided Uplink Channel Estimation for RIS-Assisted Systems","date":"2025-06-09","arxiv_id":"2506.07770","n_code_links":0,"syntology":null},{"paper":null,"slug":"fine-grained-motion-compression-and-selective","title":"Fine-Grained Motion Compression and Selective Temporal Fusion for Neural B-Frame Video Coding","date":"2025-06-09","arxiv_id":"2506.07709","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":"simulating-nationwide-coupled-disease-and","title":"Simulating nationwide coupled disease and fear spread in an agent-based model","date":"2025-06-09","arxiv_id":"2506.07842","n_code_links":0,"syntology":null},{"paper":"/paper/multi-step-visual-reasoning-with-visual","slug":"multi-step-visual-reasoning-with-visual","title":"Multi-Step Visual Reasoning with Visual Tokens Scaling and Verification","date":"2025-06-08","arxiv_id":"2506.07235","n_code_links":1,"syntology":null},{"paper":null,"slug":"quantile-optimal-policy-learning-under","title":"Quantile-Optimal Policy Learning under Unmeasured Confounding","date":"2025-06-08","arxiv_id":"2506.07140","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-ocr-quest-for-generalization-learning-to","title":"The OCR Quest for Generalization: Learning to recognize low-resource alphabets with model editing","date":"2025-06-07","arxiv_id":"2506.06761","n_code_links":0,"syntology":null},{"paper":null,"slug":"ai-peers-are-people-learning-from-the-same","title":"(AI peers) are people learning from the same standpoint: Perception of AI characters in a Collaborative Science Investigation","date":"2025-06-06","arxiv_id":"2506.06165","n_code_links":0,"syntology":null},{"paper":"/paper/generating-long-semantic-ids-in-parallel-for","slug":"generating-long-semantic-ids-in-parallel-for","title":"Generating Long Semantic IDs in Parallel for Recommendation","date":"2025-06-06","arxiv_id":"2506.05781","n_code_links":1,"syntology":null},{"paper":"/paper/information-bargaining-bilateral-commitment","slug":"information-bargaining-bilateral-commitment","title":"Information Bargaining: Bilateral Commitment in Bayesian Persuasion","date":"2025-06-06","arxiv_id":"2506.05876","n_code_links":1,"syntology":null},{"paper":null,"slug":"personaagent-when-large-language-model-agents","title":"PersonaAgent: When Large Language Model Agents Meet Personalization at Test Time","date":"2025-06-06","arxiv_id":"2506.06254","n_code_links":0,"syntology":null},{"paper":null,"slug":"demonstrations-of-integrity-attacks-in-multi","title":"Demonstrations of Integrity Attacks in Multi-Agent Systems","date":"2025-06-05","arxiv_id":"2506.04572","n_code_links":0,"syntology":null},{"paper":"/paper/diagonal-batching-unlocks-parallelism-in","slug":"diagonal-batching-unlocks-parallelism-in","title":"Diagonal Batching Unlocks Parallelism in Recurrent Memory Transformers for Long Contexts","date":"2025-06-05","arxiv_id":"2506.05229","n_code_links":1,"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/leanpo-lean-preference-optimization-for","slug":"leanpo-lean-preference-optimization-for","title":"LeanPO: Lean Preference Optimization for Likelihood Alignment in Video-LLMs","date":"2025-06-05","arxiv_id":"2506.05260","n_code_links":1,"syntology":null},{"paper":"/paper/mint-cot-enabling-interleaved-visual-tokens","slug":"mint-cot-enabling-interleaved-visual-tokens","title":"MINT-CoT: Enabling Interleaved Visual Tokens in Mathematical Chain-of-Thought Reasoning","date":"2025-06-05","arxiv_id":"2506.05331","n_code_links":1,"syntology":null},{"paper":null,"slug":"mitigating-degree-bias-adaptively-with-hard","title":"Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning","date":"2025-06-05","arxiv_id":"2506.05214","n_code_links":0,"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":"on-the-mechanism-of-reasoning-pattern","title":"On the Mechanism of Reasoning Pattern Selection in Reinforcement Learning for Language Models","date":"2025-06-05","arxiv_id":"2506.04695","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-in-context-learning-for-automatic","title":"Using In-Context Learning for Automatic Defect Labelling of Display Manufacturing Data","date":"2025-06-05","arxiv_id":"2506.04717","n_code_links":0,"syntology":null},{"paper":null,"slug":"building-a-few-shot-cross-domain-multilingual","title":"Building a Few-Shot Cross-Domain Multilingual NLU Model for Customer Care","date":"2025-06-04","arxiv_id":"2506.04389","n_code_links":0,"syntology":null},{"paper":null,"slug":"my-advisor-her-ai-and-me-evidence-from-a","title":"My Advisor, Her AI and Me: Evidence from a Field Experiment on Human-AI Collaboration and Investment Decisions","date":"2025-06-04","arxiv_id":"2506.03707","n_code_links":0,"syntology":null},{"paper":"/paper/osgnet-ego4d-episodic-memory-challenge-2025","slug":"osgnet-ego4d-episodic-memory-challenge-2025","title":"OSGNet @ Ego4D Episodic Memory Challenge 2025","date":"2025-06-04","arxiv_id":"2506.03710","n_code_links":1,"syntology":null},{"paper":"/paper/prompt-candidates-then-distill-a-teacher","slug":"prompt-candidates-then-distill-a-teacher","title":"Prompt Candidates, then Distill: A Teacher-Student Framework for LLM-driven Data Annotation","date":"2025-06-04","arxiv_id":"2506.03857","n_code_links":1,"syntology":null},{"paper":null,"slug":"viscoder-fine-tuning-llms-for-executable","title":"VisCoder: Fine-Tuning LLMs for Executable Python Visualization Code Generation","date":"2025-06-04","arxiv_id":"2506.03930","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-empirical-study-of-group-conformity-in","title":"An Empirical Study of Group Conformity in Multi-Agent Systems","date":"2025-06-02","arxiv_id":"2506.01332","n_code_links":0,"syntology":null},{"paper":null,"slug":"captivity-escape-games-as-a-means-for-safety","title":"Captivity-Escape Games as a Means for Safety in Online Motion Generation","date":"2025-06-02","arxiv_id":"2506.01399","n_code_links":0,"syntology":null},{"paper":null,"slug":"wctc-biasing-retraining-free-contextual","title":"WCTC-Biasing: Retraining-free Contextual Biasing ASR with Wildcard CTC-based Keyword Spotting and Inter-layer Biasing","date":"2025-06-02","arxiv_id":"2506.01263","n_code_links":0,"syntology":null},{"paper":"/paper/dpmm-differentially-private-marginal-models-a","slug":"dpmm-differentially-private-marginal-models-a","title":"dpmm: Differentially Private Marginal Models, a Library for Synthetic Tabular Data Generation","date":"2025-05-31","arxiv_id":"2506.00322","n_code_links":1,"syntology":null},{"paper":null,"slug":"organizational-adaptation-to-generative-ai-in","title":"Organizational Adaptation to Generative AI in Cybersecurity: A Systematic Review","date":"2025-05-31","arxiv_id":"2506.12060","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-mathematical-perspective-on-contrastive","title":"A Mathematical Perspective On Contrastive Learning","date":"2025-05-30","arxiv_id":"2505.24134","n_code_links":0,"syntology":null},{"paper":"/paper/period-llm-extending-the-periodic-capability","slug":"period-llm-extending-the-periodic-capability","title":"Period-LLM: Extending the Periodic Capability of Multimodal Large Language Model","date":"2025-05-30","arxiv_id":"2505.24476","n_code_links":1,"syntology":null},{"paper":"/paper/sale-low-bit-estimation-for-efficient-sparse","slug":"sale-low-bit-estimation-for-efficient-sparse","title":"SALE : Low-bit Estimation for Efficient Sparse Attention in Long-context LLM Prefilling","date":"2025-05-30","arxiv_id":"2505.24179","n_code_links":1,"syntology":null},{"paper":null,"slug":"semi-structured-llm-reasoners-can-be","title":"Semi-structured LLM Reasoners Can Be Rigorously Audited","date":"2025-05-30","arxiv_id":"2505.24217","n_code_links":0,"syntology":null},{"paper":null,"slug":"swifteval-developing-a-language-specific","title":"SwiftEval: Developing a Language-Specific Benchmark for LLM-generated Code Evaluation","date":"2025-05-30","arxiv_id":"2505.24324","n_code_links":0,"syntology":null},{"paper":null,"slug":"visual-embodied-brain-let-multimodal-large","title":"Visual Embodied Brain: Let Multimodal Large Language Models See, Think, and Control in Spaces","date":"2025-05-30","arxiv_id":"2506.00123","n_code_links":0,"syntology":null},{"paper":"/paper/adversarial-semantic-and-label-perturbation","slug":"adversarial-semantic-and-label-perturbation","title":"Adversarial Semantic and Label Perturbation Attack for Pedestrian Attribute Recognition","date":"2025-05-29","arxiv_id":"2505.23313","n_code_links":2,"syntology":null},{"paper":null,"slug":"beyond-optimal-transport-model-aligned","title":"Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching","date":"2025-05-29","arxiv_id":"2505.23346","n_code_links":0,"syntology":null},{"paper":null,"slug":"bridging-source-and-target-domains-via-link","title":"Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs","date":"2025-05-29","arxiv_id":"2505.24055","n_code_links":0,"syntology":null},{"paper":null,"slug":"detecting-switching-attacks-on-traffic-flow","title":"Detecting Switching Attacks On Traffic Flow Regulation For Changing Driving Patterns","date":"2025-05-29","arxiv_id":"2505.23033","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":831,"with_a_code_link":256,"where_syntology_ran_a_sample":52,"not_listed_spam_title":0,"listed":831,"listed_where_code_ran":52,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":46,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":46,"listed_every_run_a_failure_of_syntologys_instrument":6,"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":52,"papers_where_code_ran_first_page":"/method/adopt/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":9,"url":"/method/adopt/papers/2","json":"/method/adopt/papers/2.json","rows":100},{"order":"archive","page":3,"of":9,"url":"/method/adopt/papers/3","json":"/method/adopt/papers/3.json","rows":100},{"order":"archive","page":4,"of":9,"url":"/method/adopt/papers/4","json":"/method/adopt/papers/4.json","rows":100},{"order":"archive","page":5,"of":9,"url":"/method/adopt/papers/5","json":"/method/adopt/papers/5.json","rows":100},{"order":"archive","page":6,"of":9,"url":"/method/adopt/papers/6","json":"/method/adopt/papers/6.json","rows":100},{"order":"archive","page":7,"of":9,"url":"/method/adopt/papers/7","json":"/method/adopt/papers/7.json","rows":100},{"order":"archive","page":8,"of":9,"url":"/method/adopt/papers/8","json":"/method/adopt/papers/8.json","rows":100},{"order":"archive","page":9,"of":9,"url":"/method/adopt/papers/9","json":"/method/adopt/papers/9.json","rows":31},{"order":"ran","page":1,"of":1,"url":"/method/adopt/papers/ran/1","json":"/method/adopt/papers/ran/1.json","rows":52}],"tasks":[{"task":"/task/language-modeling","name":"Language Modeling","papers":31},{"task":"/task/language-modelling","name":"Language Modelling","papers":31},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":29},{"task":"/task/large-language-model","name":"Large Language Model","papers":26},{"task":"/task/retrieval","name":"Retrieval","papers":26},{"task":"/task/decision-making","name":"Decision Making","papers":24},{"task":"/task/denoising","name":"Denoising","papers":23},{"task":"/task/federated-learning","name":"Federated Learning","papers":23},{"task":"/task/image-generation","name":"Image Generation","papers":22},{"task":"/task/representation-learning","name":"Representation Learning","papers":21},{"task":"/task/decoder","name":"Decoder","papers":20},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":20},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":19},{"task":"/task/segmentation","name":"Segmentation","papers":18},{"task":"/task/diversity","name":"Diversity","papers":17},{"task":"/task/object","name":"Object","papers":17},{"task":"/task/question-answering","name":"Question Answering","papers":17},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":15},{"task":"/task/fairness","name":"Fairness","papers":15},{"task":"/task/image-segmentation","name":"Image Segmentation","papers":15}],"tasks_shown":20,"n_tasks":546,"usage_by_year":[{"year":"2024","papers":204},{"year":"2025","papers":627}],"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/adopt"},"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=ADOPT","read_at":"2026-10-05T00:51:39+00:00","query":"ADOPT","kind":"method","have":"verified_code","tier":null,"verified_implementation":true,"level":3,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"ADOPT","origin_arxiv_id":"2411.02853"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2411.02853","repositories":{"listed":null,"in_graph":5,"list_truncated":null,"strongest_link":null},"retrieve_with":"get_reference_implementation(name='ADOPT')","name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":4,"served":{"arxiv_id":"2411.02853","citations":30},"leading_other_bearer":{"arxiv_id":"2512.24933","title":"ADOPT: Adaptive Dependency-Guided Joint Prompt Optimization for Multi-Step LLM Pipelines","citations":null,"named_by":["title_prefix"],"bearer_name":"ADOPT: Adaptive Dependency-Guided Joint Prompt Optimization for Multi-Step LLM Pipelines","ask_with":"have('2512.24933')"},"n_other_bearers_listed":3,"note":"3 other thing(s) here are also called 'ADOPT', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2411.02853","page":"/paper/adopt-modified-adam-can-converge-with-any-b-2","syntology_url":"https://syntology.ai/paper/2411.02853","in_graph_layer":true,"samples":23,"ran":14,"n_ran_checked":4,"n_instrument":10,"unverified":9,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 10 where Syntology's instrument failed) · 9 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"verified reference implementation at level V3. This answer is about arXiv:2411.02853, the paper the archive credits with this method.","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":"d3bd804258cd610a51e26b8d446611bb2400fcc1f260507cf84e70a6556fbe12","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}